Struct NodeMapGraph

pub struct NodeMapGraph<T, B> { /* private fields */ }

Implementations

impl<T, B> NodeMapGraph<T, B>

pub fn new() -> Self

impl<T: Eq + Hash, B: Eq + Hash> NodeMapGraph<T, B>

pub fn contains(&self, id: &Id<T, B>) -> bool

pub fn get(&self, id: &Id<T, B>) -> Option<&IndexedNode<T, B>>

pub fn get_mut(&mut self, id: &Id<T, B>) -> Option<&mut IndexedNode<T, B>>

pub fn declare_node( &mut self, id: Id<T, B>, index: Option<&str>, ) -> DeclareNodeResult<'_, T, B>

where T: Clone, B: Clone,

pub fn merge_with(&mut self, other: Self)

where T: Clone, B: Clone,

Merge this graph with other.

This calls merge_node with every node of other.

pub fn merge_node(&mut self, node: IndexedNode<T, B>)

where T: Clone, B: Clone,

Merge the given node into the graph.

The node must has an identifier, or this function will have no effect. If there is already a node with the same identifier:

• The index of node, if any, overrides the previously existing index.
• The list of node types is concatenated after the preexisting types.
• The graph and imported values are overridden.
• Properties and reverse properties are merged.

pub fn nodes(&self) -> NodeMapGraphNodes<'_, T, B>

pub fn into_nodes(self) -> IntoNodeMapGraphNodes<T, B>

Trait Implementations

impl<T, B> Default for NodeMapGraph<T, B>

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T, B> IntoIterator for &'a NodeMapGraph<T, B>

type Item = (&'a Id<T, B>, &'a Indexed<Node<T, B>>)

The type of the elements being iterated over.

type IntoIter = Iter<'a, Id<T, B>, Indexed<Node<T, B>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, B> IntoIterator for NodeMapGraph<T, B>

type Item = (Id<T, B>, Indexed<Node<T, B>>)

The type of the elements being iterated over.

type IntoIter = IntoIter<Id<T, B>, Indexed<Node<T, B>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.