Struct AdjacencyMap

pub struct AdjacencyMap<T> { /* private fields */ }

A graph traversal that builds an adjacency map

Implementations

impl<T> AdjacencyMap<T>

where T: Eq + Hash + Clone,

pub fn new() -> Self

Creates a new adjacency map

pub fn roots(&self) -> impl Iterator<Item = &T>

Returns an iterator over the root nodes of the graph

pub fn get(&self, node: &T) -> Option<impl Iterator<Item = &T>>

Returns an iterator over the children of the given node

impl<T> AdjacencyMap<T>

where T: Eq + Hash + Clone,

pub fn into_postorder_topological(self) -> IntoPostorderTopologicalIter<T>

Returns an owned iterator over the nodes in postorder topological order, starting from the roots.

pub fn into_breadth_first_edges(self) -> IntoBreadthFirstEdges<T>

Returns an owned iterator over all edges (node pairs) in reverse breadth first order, starting from the roots.

pub fn postorder_topological(&self) -> PostorderTopologicalIter<'_, T>

Returns an iterator over the nodes in postorder topological order, starting from the roots.

pub fn postorder_topological_from_node<'graph>( &'graph self, node: &'graph T, ) -> PostorderTopologicalIter<'graph, T>

Returns an iterator over the nodes in postorder topological order, starting from the given node.

Trait Implementations

impl<T: Clone> Clone for AdjacencyMap<T>

fn clone(&self) -> AdjacencyMap<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for AdjacencyMap<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Default for AdjacencyMap<T>

where T: Eq + Hash + Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for AdjacencyMap<T>

where T: Deserialize<'de> + Eq + Hash,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> GraphStore for AdjacencyMap<T>

where T: Eq + Hash + Clone + Send,

type Node = T

type Handle = T

fn insert( &mut self, from_handle: Option<T>, node: GraphNode<T>, ) -> Option<(Self::Handle, &T)>

Inserts a node into the graph store, and returns a handle to it.

impl<T> PartialEq for AdjacencyMap<T>

where T: Eq + Hash,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Serialize for AdjacencyMap<T>

where T: Serialize + Eq + Hash,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: TraceRawVcs> TraceRawVcs for AdjacencyMap<T>

fn trace_raw_vcs(&self, __context__: &mut TraceRawVcsContext)

fn get_raw_vcs(&self) -> Vec<RawVc>

impl<T: ValueDebugFormat + Debug + Send + Sync> ValueDebugFormat for AdjacencyMap<T>

fn value_debug_format<'a>(&'a self, depth: usize) -> ValueDebugFormatString<'a>

impl<T> Eq for AdjacencyMap<T>

where T: Eq + Hash,

impl<T> NonLocalValue for AdjacencyMap<T>

where T: NonLocalValue,