Struct DependencyList 

pub struct DependencyList { /* private fields */ }

Deterministic list of explicit node dependencies.

Implementations

impl DependencyList

pub fn new(nodes: impl IntoIterator<Item = NodeId>) -> GraphResult<Self>

Creates a dependency list, rejecting duplicate node ids.

pub fn empty() -> Self

Creates an empty dependency list.

pub fn as_slice(&self) -> &[NodeId]

Returns dependencies in declared order.

pub fn is_empty(&self) -> bool

Returns true when the list contains no dependencies.

Trait Implementations

impl Clone for DependencyList

fn clone(&self) -> DependencyList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyList

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

Formats the value using the given formatter.

impl Default for DependencyList

fn default() -> DependencyList

Returns the “default value” for a type.

impl Eq for DependencyList

impl IntoIterator for DependencyList

type Item = NodeId

The type of the elements being iterated over.

type IntoIter = IntoIter<NodeId>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for DependencyList

fn eq(&self, other: &DependencyList) -> 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 StructuralPartialEq for DependencyList