pub struct NodeGraphBuilder<ID: Eq + Hash + Clone, K: Eq + Hash + Clone> { /* private fields */ }Implementations§
Source§impl<ID, K> NodeGraphBuilder<ID, K>
impl<ID, K> NodeGraphBuilder<ID, K>
pub fn add_node( &mut self, id: ID, components: HashMap<K, Value>, ) -> Result<&mut Self, NodeGraphError>
pub fn add_edge( &mut self, from: ID, to: ID, ) -> Result<&mut Self, NodeGraphError>
pub fn remove_node(&mut self, id: &ID) -> &mut Self
pub fn build(self) -> NodeGraph<ID, K>
Trait Implementations§
Auto Trait Implementations§
impl<ID, K> Freeze for NodeGraphBuilder<ID, K>
impl<ID, K> RefUnwindSafe for NodeGraphBuilder<ID, K>where
ID: RefUnwindSafe,
K: RefUnwindSafe,
impl<ID, K> Send for NodeGraphBuilder<ID, K>
impl<ID, K> Sync for NodeGraphBuilder<ID, K>
impl<ID, K> Unpin for NodeGraphBuilder<ID, K>
impl<ID, K> UnwindSafe for NodeGraphBuilder<ID, K>where
ID: UnwindSafe,
K: UnwindSafe,
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