pub enum GraphEdit {
AddNode {
node: WorkNode,
},
ReplaceNode {
node: WorkNode,
},
RetireNode {
node_id: String,
reason: String,
},
AddEdge {
edge: WorkEdge,
},
RemoveEdge {
edge: WorkEdge,
},
}Expand description
One deterministic edit applied to an immutable graph revision. Coding work is represented by an evolving sequence of acyclic snapshots, not by the fiction that the initial DAG is complete.
Variants§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for GraphEdit
impl<'de> Deserialize<'de> for GraphEdit
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl StructuralPartialEq for GraphEdit
Auto Trait Implementations§
impl Freeze for GraphEdit
impl RefUnwindSafe for GraphEdit
impl Send for GraphEdit
impl Sync for GraphEdit
impl Unpin for GraphEdit
impl UnsafeUnpin for GraphEdit
impl UnwindSafe for GraphEdit
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.