Trait Edges

pub trait Edges<I, D>
where
    I: Identity,
{
    // Required method
    fn next_edge(
        &self,
        previous_edge_index: Option<usize>,
    ) -> Option<Edge<I, D>>;

    // Provided method
    fn edges(&self) -> EdgeIterator<'_, I, D, Self> 
       where Self: Sized { ... }
}

Be able to derive a set of identifiers from a given item. Semantically this is Get “children” but not all graph operations are parent-child.

Given a type, find the next set of identities I that I need to traverse Metadata may also be optionally returned via the E value

Required Methods

fn next_edge(&self, previous_edge_index: Option<usize>) -> Option<Edge<I, D>>

Provided Methods

fn edges(&self) -> EdgeIterator<'_, I, D, Self>

where Self: Sized,

Implementations on Foreign Types

impl<'a> Edges<ChunkId, ChunkChild> for Chunk<'a>

fn next_edge( &self, previous_edge_index: Option<usize>, ) -> Option<Edge<ChunkId, ChunkChild>>

impl<'a> Edges<ChunkId, ChunkParentOrSibling> for Chunk<'a>

fn next_edge( &self, previous_edge_index: Option<usize>, ) -> Option<Edge<ChunkId, ChunkParentOrSibling>>

impl<'a> Edges<ModuleIdentifier, (ImportType, ResolvedModule)> for Module<'a>

fn next_edge( &self, previous_edge_index: Option<usize>, ) -> Option<Edge<ModuleIdentifier, (ImportType, ResolvedModule)>>

Implementors