Struct TreePathMap

pub struct TreePathMap<U>(/* private fields */)
where
    U: Eq + Hash;

This is a mapping of items in Tree to their Paths. A single item in the Tree can have multiple Paths to it if it is in the Tree multiple times.

Implementations

impl<U> TreePathMap<U>

where U: Eq + Hash,

pub fn new() -> TreePathMap<U>

pub fn insert(&mut self, k: U, path: Path)

Insert a mapping from U to Path.

pub fn lookup_first(&self, k: &U) -> Option<&Path>

Lookup the first Path for a given item.

Trait Implementations

impl<U> Clone for TreePathMap<U>

where U: Eq + Hash + Clone,

fn clone(&self) -> TreePathMap<U>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<U> Debug for TreePathMap<U>

where U: Eq + Hash + Debug,

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

Formats the value using the given formatter.

impl<U> Default for TreePathMap<U>

where U: Eq + Hash + Default,

fn default() -> TreePathMap<U>

Returns the “default value” for a type.

impl<U> PartialEq for TreePathMap<U>

where U: Eq + Hash + PartialEq,

fn eq(&self, other: &TreePathMap<U>) -> 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<U> Eq for TreePathMap<U>

where U: Eq + Hash + Eq,

impl<U> StructuralPartialEq for TreePathMap<U>

where U: Eq + Hash,