Struct Path

pub struct Path<LABEL> { /* private fields */ }

Path (alternating sequence of scopes and labels) in a scope graph.

Implementations

impl<LABEL> Path<LABEL>

pub fn new(source: Scope) -> Self

Creates a new path that contains of a single scope.

pub fn target(&self) -> Scope

Returns the last scope in the path.

pub fn step(&self, label: LABEL, target: Scope) -> Option<Self>

Extends the path with a new edge.

Returns None if the resulting path would contain a cycle.

pub fn resolve<DATA>(self, data: &DATA) -> ResolvedPath<'_, LABEL, DATA>

Creates a resolved path from this path.

Trait Implementations

impl<LABEL: Clone> Clone for Path<LABEL>

fn clone(&self) -> Path<LABEL>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<LABEL> Debug for Path<LABEL>

where LABEL: Debug,

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

Formats the value using the given formatter.

impl<LABEL> Hash for Path<LABEL>

where Scope: Hash, LABEL: Hash,

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<LABEL> PartialEq for Path<LABEL>

where Scope: PartialEq, LABEL: PartialEq,

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<LABEL> Eq for Path<LABEL>

where Scope: Eq, LABEL: Eq,