Struct NodeRefs 

pub struct NodeRefs<'a, N>(/* private fields */)
where
    N: Eq + Hash + Clone;

A set of node references.

Can be created from a single node reference or an iterable of node references.

use pathfinding::NodeRefs;

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
struct N(String);

let red = N("red".into());
let blue = N("blue".into());
let green = N("green".into());

let refs: NodeRefs<N> = NodeRefs::from(&red);
let refs: NodeRefs<N> = NodeRefs::from_iter([&red, &blue, &green]);

Trait Implementations

impl<'a, N> Clone for NodeRefs<'a, N>

where N: Eq + Hash + Clone + Clone,

fn clone(&self) -> NodeRefs<'a, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, N> Debug for NodeRefs<'a, N>

where N: Eq + Hash + Clone + Debug,

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

Formats the value using the given formatter.

impl<'a, N: Eq + Hash + Clone> Deref for NodeRefs<'a, N>

type Target = HashSet<&'a N, FxBuildHasher>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'a, N: Eq + Hash + Clone> From<&'a N> for NodeRefs<'a, N>

fn from(value: &'a N) -> Self

Converts to this type from the input type.

impl<'a, N: Eq + Hash + Clone> FromIterator<&'a N> for NodeRefs<'a, N>

fn from_iter<T: IntoIterator<Item = &'a N>>(iter: T) -> Self

Creates a value from an iterator.

impl<'a, N: Eq + Hash + Clone> IntoIterator for &'a NodeRefs<'a, N>

type Item = &'a N

The type of the elements being iterated over.

type IntoIter = Copied<Iter<'a, &'a N>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, N: Eq + Hash + Clone> IntoIterator for NodeRefs<'a, N>

type Item = &'a N

The type of the elements being iterated over.

type IntoIter = IntoIter<&'a N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, N> PartialEq for NodeRefs<'a, N>

where N: Eq + Hash + Clone + PartialEq,

fn eq(&self, other: &NodeRefs<'a, N>) -> 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<'a, N> Eq for NodeRefs<'a, N>

where N: Eq + Hash + Clone + Eq,

impl<'a, N> StructuralPartialEq for NodeRefs<'a, N>

where N: Eq + Hash + Clone,