Struct LabelId 

pub struct LabelId(/* private fields */);

Interned identifier for a tensor-leg label: a cheap Copy handle backed by a process-global string interner.

Implementations

impl LabelId

pub fn intern(name: &str) -> Self

Return the id for name, interning it on first use; idempotent for equal names.

pub fn name(&self) -> String

Resolve this id back to its interned name.

pub fn fresh() -> Self

Mint a fresh, unique label with an internal temporary name.

pub fn prime(&self) -> Self

Return the label with one prime (') appended.

pub fn primes(&self, n: usize) -> Self

Return the label with n primes (') appended.

pub fn unprime(&self) -> Self

Remove a single trailing prime, if present; otherwise return the label unchanged.

pub fn base(&self) -> Self

Strip all trailing primes, returning the base (unprimed) label.

Trait Implementations

impl Clone for LabelId

fn clone(&self) -> LabelId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for LabelId

impl Debug for LabelId

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

Formats the value using the given formatter.

impl Eq for LabelId

impl Hash for LabelId

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 PartialEq for LabelId

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