mirror of
https://github.com/GraphiteEditor/Graphite.git
synced 2025-08-02 20:42:16 +00:00

* Decrease compilation time significantly * Refactor reorder_ids method to improve performance
38 lines
1.1 KiB
Rust
38 lines
1.1 KiB
Rust
use std::error::Error;
|
|
|
|
use dyn_any::DynAny;
|
|
|
|
use crate::document::NodeNetwork;
|
|
use crate::proto::{LocalFuture, ProtoNetwork};
|
|
|
|
pub struct Compiler {}
|
|
|
|
impl Compiler {
|
|
pub fn compile(&self, mut network: NodeNetwork) -> impl Iterator<Item = ProtoNetwork> {
|
|
println!("flattening");
|
|
let node_ids = network.nodes.keys().copied().collect::<Vec<_>>();
|
|
for id in node_ids {
|
|
network.flatten(id);
|
|
}
|
|
network.remove_redundant_id_nodes();
|
|
network.remove_dead_nodes();
|
|
let proto_networks = network.into_proto_networks();
|
|
proto_networks.map(move |mut proto_network| {
|
|
proto_network.resolve_inputs();
|
|
proto_network.generate_stable_node_ids();
|
|
proto_network
|
|
})
|
|
}
|
|
pub fn compile_single(&self, network: NodeNetwork) -> Result<ProtoNetwork, String> {
|
|
assert_eq!(network.outputs.len(), 1, "Graph with multiple outputs not yet handled");
|
|
let Some(proto_network) = self.compile(network).next() else {
|
|
return Err("Failed to convert graph into proto graph".to_string());
|
|
};
|
|
Ok(proto_network)
|
|
}
|
|
}
|
|
pub type Any<'a> = Box<dyn DynAny<'a> + 'a>;
|
|
|
|
pub trait Executor<I, O> {
|
|
fn execute(&self, input: I) -> LocalFuture<Result<O, Box<dyn Error>>>;
|
|
}
|