Struct DerivationGraph 

pub struct DerivationGraph<T: Eq + Clone + 'static> { /* private fields */ }

Implementations

impl<T: Eq + Clone + 'static> DerivationGraph<T>

pub fn new() -> Self

pub fn set_node_label( &mut self, id: impl AsRef<NodeID>, label: impl Into<String>, ) -> Result<()>

pub fn node_label(&self, id: impl AsRef<NodeID>) -> Result<String>

pub fn set_edge_label( &mut self, id: impl AsRef<EdgeID>, label: impl Into<String>, ) -> Result<()>

pub fn edge_label(&self, id: impl AsRef<EdgeID>) -> Result<String>

pub fn add_node( &mut self, id: impl AsRef<NodeID>, label: impl Into<String>, ) -> Result<()>

pub fn add_node_with_value( &mut self, id: impl AsRef<NodeID>, label: impl Into<String>, value: impl Into<T>, ) -> Result<()>

pub fn add_node_with_operation( &mut self, id: impl AsRef<NodeID>, label: impl Into<String>, op: Operation<T>, ) -> Result<()>

pub fn set_operation( &mut self, node: impl AsRef<NodeID>, op: Operation<T>, ) -> Result<()>

pub fn add_edge( &mut self, id: impl AsRef<EdgeID>, source: impl AsRef<NodeID>, target: impl AsRef<NodeID>, label: impl Into<String>, ) -> Result<()>

pub fn node_value(&self, id: impl AsRef<NodeID>) -> Result<Option<T>>

pub fn has_node_value(&self, id: impl AsRef<NodeID>) -> Result<bool>

pub fn set_node_value( &self, id: impl AsRef<NodeID>, value: impl Into<T>, ) -> Result<()>

pub fn source(&self, id: impl AsRef<EdgeID>) -> Result<NodeID>

pub fn target(&self, id: impl AsRef<EdgeID>) -> Result<NodeID>

pub fn derived_node_value(&self, id: impl AsRef<NodeID>) -> Result<T>

pub fn clear_all_node_values(&self)

Trait Implementations

impl<T: Eq + Clone + 'static> Default for DerivationGraph<T>

fn default() -> Self

Returns the “default value” for a type.