Incremental compilation and stable node IDs (#977)

* Generate stable node ids

* checkpoint

* Implement borrow tree

* Add eval function on borrow tree

* Refactor Node trait to fix lifetime issues

* Compiler infinite loop

* Impl compose pair

* Transition to double lifetime on trait

* Change node trait to use a generic arg for the input

* Start adapting node_macro

* Migrate more nodes to new macro

* Fix raster tests

* Port vector nodes

* Make Node trait object safe

* Fix FlatMapResultNode

* Translate most of gstd

* Fix DowncastBothNode

* Refactor node trait once again to allow for HRTB for type erased nodes

* Start working on type erased nodes

* Try getting DowncastBothNode to work

* Introduce Upcasting node + work on BorrowTree

* Make enough 'static to get the code to compile

* Transition DynamicExecutor to use borrow tree

* Make Compose Node use HRTB's

* Fix MapResultNode

* Disable blur test

* Add workaround for Composing type erased nodes

* Convert more nodes in the node_registry

* Convert more of the node_registry

* Add update tree fn and hook up to frontend

* Fix blur node

* Implement CacheNode

* Make frontend use graph compiler

* Fix document_node_types type declaration for most nodes

* Remove unused imports

* Move comment down

* Reuse nodes via borrow tree

* Deprecate trait based value in favor of TaggedValue

* Remove unsafe code in buffer creation

* Fix blur node

* Fix stable node id generation

* Fix types for Image adjustment document nodes

* Fix Imaginate Node

* Remove unused imports

* Remove log

* Fix off by one error

* Remove macro generated imaginate node entry

* Create parameterized add node

* Fix test case

* Remove link from layer_panel.rs

* Fix formatting

node-graph/gcore/src/vector/consts.rs

@@ -3,7 +3,7 @@ use core::ops::{Index, IndexMut};
 use serde::{Deserialize, Serialize};
 
 #[repr(usize)]
-#[derive(PartialEq, Eq, Clone, Debug, Copy, Serialize, Deserialize, specta::Type)]
+#[derive(PartialEq, Eq, Clone, Debug, Copy, Serialize, Deserialize, specta::Type, Hash)]
 pub enum ManipulatorType {
 	Anchor,
 	InHandle,

node-graph/gcore/src/vector/generator_nodes.rs

@@ -35,7 +35,7 @@ fn generate_path(_input: (), path_data: Subpath) -> VectorData {
 use crate::raster::Image;
 
 #[derive(Debug, Clone, Copy)]
-pub struct BlitSubpath<P: Node<(), Output = Subpath>> {
+pub struct BlitSubpath<P> {
 	path_data: P,
 }
 
@@ -68,9 +68,10 @@ pub struct TransformSubpathNode<Translation, Rotation, Scale, Shear> {
 }
 
 #[node_macro::node_fn(TransformSubpathNode)]
-fn transform_subpath(mut subpath: Subpath, translate: DVec2, rotate: f64, scale: DVec2, shear: DVec2) -> VectorData {
+fn transform_subpath(subpath: Subpath, translate: DVec2, rotate: f64, scale: DVec2, shear: DVec2) -> VectorData {
 	let (sin, cos) = rotate.sin_cos();
 
+	let mut subpath = subpath;
 	subpath.apply_affine(DAffine2::from_cols_array(&[scale.x + cos, shear.y + sin, shear.x - sin, scale.y + cos, translate.x, translate.y]));
 	subpath
 }

node-graph/gcore/src/vector/id_vec.rs

@@ -17,7 +17,7 @@ use alloc::vec::Vec;
 /// The downside is that currently it requires a lot of iteration.
 
 type ElementId = u64;
-#[derive(Debug, Clone, PartialEq, Eq, Deserialize, Serialize, specta::Type)]
+#[derive(Debug, Clone, PartialEq, Eq, Deserialize, Serialize, specta::Type, Hash)]
 pub struct IdBackedVec<T> {
 	/// Contained elements
 	elements: Vec<T>,

node-graph/gcore/src/vector/manipulator_group.rs

@@ -16,7 +16,7 @@ use serde::{Deserialize, Serialize};
 ///     /            |            \
 /// "Anchor"    "InHandle"    "OutHandle"    <- These are ManipulatorPoints and the only editable "primitive"
 /// ```
-#[derive(PartialEq, Clone, Debug, Serialize, Deserialize, Default, specta::Type)]
+#[derive(PartialEq, Clone, Debug, Serialize, Deserialize, Default, specta::Type, Hash)]
 pub struct ManipulatorGroup {
 	/// Editable points for the anchor and handles.
 	pub points: [Option<ManipulatorPoint>; 3],
@@ -293,7 +293,7 @@ impl ManipulatorGroup {
 	}
 }
 
-#[derive(Debug, Clone, PartialEq, Eq)]
+#[derive(Debug, Clone, PartialEq, Eq, Hash)]
 pub struct ManipulatorGroupEditorState {
 	// Whether the angle between the handles should be maintained
 	pub mirror_angle_between_handles: bool,

node-graph/gcore/src/vector/manipulator_point.rs

@@ -1,3 +1,5 @@
+use core::hash::Hash;
+
 use super::consts::ManipulatorType;
 use glam::{DAffine2, DVec2};
 use serde::{Deserialize, Serialize};
@@ -26,6 +28,16 @@ impl Default for ManipulatorPoint {
 	}
 }
 
+#[allow(clippy::derive_hash_xor_eq)]
+impl Hash for ManipulatorPoint {
+	fn hash<H: core::hash::Hasher>(&self, state: &mut H) {
+		self.position.to_array().iter().for_each(|x| x.to_bits().hash(state));
+		self.manipulator_type.hash(state);
+
+		self.editor_state.hash(state);
+	}
+}
+
 impl ManipulatorPoint {
 	/// Initialize a new [ManipulatorPoint].
 	pub fn new(position: glam::DVec2, manipulator_type: ManipulatorType) -> Self {
@@ -60,7 +72,7 @@ impl ManipulatorPoint {
 	}
 }
 
-#[derive(PartialEq, Eq, Clone, Debug, specta::Type)]
+#[derive(PartialEq, Eq, Clone, Debug, specta::Type, Hash)]
 pub struct ManipulatorPointEditorState {
 	/// Whether or not this manipulator point can be selected.
 	pub can_be_selected: bool,

node-graph/gcore/src/vector/subpath.rs

@@ -14,7 +14,7 @@ use serde::{Deserialize, Serialize};
 /// [Subpath] represents a single vector path, containing many [ManipulatorGroups].
 /// For each closed shape we keep a [Subpath] which contains the [ManipulatorGroup]s (handles and anchors) that define that shape.
 // TODO Add "closed" bool to subpath
-#[derive(PartialEq, Clone, Debug, Default, Serialize, Deserialize, DynAny, specta::Type)]
+#[derive(PartialEq, Clone, Debug, Default, Serialize, Deserialize, DynAny, specta::Type, Hash)]
 pub struct Subpath(IdBackedVec<ManipulatorGroup>);
 
 impl Subpath {