mirror of
https://github.com/GraphiteEditor/Graphite.git
synced 2026-09-16 23:08:05 +08:00
5eb80721dd
The fold already holds the name and the read input's finished layout, so the offset falls out there rather than at construction: `RecordLayout` carries the resolved numbers and `set_layout` copies them into the read slots. Constructors are untouched, and census-marker reads keep their current installation. A read meets the value type the name was written at, so a disagreement between a read here and a write upstream is the same graph error as two writes disagreeing; the one-name-one-type check now spans reads and writes together. An absent attribute stays absent and the read serves the forced default rather than reporting it. `read_attribute` is the catalog's get half, typed and never `Option` at the kernel boundary, with the name declared exactly as the write side declares it. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
42 lines
1.4 KiB
Rust
42 lines
1.4 KiB
Rust
use crate::document::NodeNetwork;
|
|
use crate::proto::{ProtoNetwork, Registry};
|
|
use std::error::Error;
|
|
|
|
pub struct Compiler {}
|
|
|
|
impl Compiler {
|
|
pub fn compile<'r>(&self, mut network: NodeNetwork, registry: &'r Registry) -> impl Iterator<Item = Result<ProtoNetwork, String>> + 'r {
|
|
network.resolve_scope_inputs();
|
|
network.generate_node_paths(&[]);
|
|
let node_ids = network.nodes.keys().copied().collect::<Vec<_>>();
|
|
network.populate_dependants();
|
|
for id in node_ids {
|
|
network.flatten(id);
|
|
}
|
|
network.remove_redundant_passthrough_nodes();
|
|
// network.remove_dead_nodes(0);
|
|
let proto_networks = network.into_proto_networks();
|
|
|
|
proto_networks.map(move |mut proto_network| {
|
|
proto_network.insert_context_nullification_nodes()?;
|
|
let _ = proto_network.resolve_types(registry);
|
|
proto_network
|
|
.compute_layouts()
|
|
.map_err(|errors| errors.iter().map(|error| format!("{:?}", error.error)).collect::<Vec<_>>().join("\n"))?;
|
|
proto_network.generate_stable_node_ids();
|
|
Ok(proto_network)
|
|
})
|
|
}
|
|
pub fn compile_single(&self, network: NodeNetwork, registry: &Registry) -> Result<ProtoNetwork, String> {
|
|
assert_eq!(network.exports.len(), 1, "Graph with multiple outputs not yet handled");
|
|
let Some(proto_network) = self.compile(network, registry).next() else {
|
|
return Err("Failed to convert graph into proto graph".to_string());
|
|
};
|
|
proto_network
|
|
}
|
|
}
|
|
|
|
pub trait Executor<I, O> {
|
|
fn execute(&self, input: I) -> Result<O, Box<dyn Error>>;
|
|
}
|