Struct json_ld_core::flattening::NodeMapGraph  
source · pub struct NodeMapGraph<T, B> { /* private fields */ }Implementations§
source§impl<T, B> NodeMapGraph<T, B>
 
impl<T, B> NodeMapGraph<T, B>
source§impl<T: Eq + Hash, B: Eq + Hash> NodeMapGraph<T, B>
 
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>
sourcepub fn merge_with(&mut self, other: Self)
 
pub fn merge_with(&mut self, other: Self)
Merge this graph with other.
This calls merge_node with every node of other.
sourcepub fn merge_node(&mut self, node: IndexedNode<T, B>)
 
pub fn merge_node(&mut self, node: IndexedNode<T, B>)
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 
nodetypes 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§
source§impl<T, B> Default for NodeMapGraph<T, B>
 
impl<T, B> Default for NodeMapGraph<T, B>
source§impl<'a, T, B> IntoIterator for &'a NodeMapGraph<T, B>
 
impl<'a, T, B> IntoIterator for &'a NodeMapGraph<T, B>
source§impl<T, B> IntoIterator for NodeMapGraph<T, B>
 
impl<T, B> IntoIterator for NodeMapGraph<T, B>
Auto Trait Implementations§
impl<T, B> Freeze for NodeMapGraph<T, B>
impl<T, B> RefUnwindSafe for NodeMapGraph<T, B>where
    B: RefUnwindSafe,
    T: RefUnwindSafe,
impl<T, B> Send for NodeMapGraph<T, B>
impl<T, B> Sync for NodeMapGraph<T, B>
impl<T, B> Unpin for NodeMapGraph<T, B>
impl<T, B> UnwindSafe for NodeMapGraph<T, B>where
    B: UnwindSafe,
    T: 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