Struct HierName 

pub struct HierName(pub Vec<CompactString>);

Hierarchical name.

Unlike the NetlistDB’s tree-like structure, this one adopts a simple Vec.

Tuple Fields

0: Vec<CompactString>

Implementations

impl HierName

pub fn iter(&self) -> Rev<Iter<'_, CompactString>>

Trait Implementations

impl Clone for HierName

fn clone(&self) -> HierName

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HierName

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

Formats the value using the given formatter.

impl Hash for HierName

Hashing a HierName.

Our guarantee here is that Hash(HierName[a/b/c]) :== Hash(c, b, a).

This is essential for different HierName implementations to agree with each other on hash values. Especially, to conform with NetlistDB’s implementation.

For example, we have a Vec here in SPEF parser’s HierName implementation, but we cannot use derived Hash on it. – because hash of a Vec is the same as a slice, which not only prefixes the hash with a length parameter, but also hashes it forward instead of backward.

Thus we implement it by ourselves.

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<'i> IntoIterator for &'i HierName

type Item = &'i CompactString

The type of the elements being iterated over.

type IntoIter = Rev<Iter<'i, CompactString>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Rev<Iter<'i, CompactString>>

Creates an iterator from a value.

impl PartialEq for HierName

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

impl StructuralPartialEq for HierName