Struct NodeName 

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

A node’s name within its graph, which is also its identity.

Nodes deliberately have no hidden ids: a readable DSL requires referring to a node by name. The price is that renaming becomes a refactor that rewrites every reference, exactly as in any programming language.

Implementations

impl NodeName

pub fn new(name: impl Into<String>) -> Self

Normalizes to NFC, as Rust does for its own identifiers.

é typed directly and e followed by a combining acute are the same name to a reader and different byte strings to a BTreeMap. macOS filesystems and several input methods emit the decomposed form, so without this two people on different machines can write what looks like the same node name and get two nodes — in a format whose entire job is surviving merges between exactly those machines.

pub fn as_str(&self) -> &str

Trait Implementations

impl Borrow<str> for NodeName

Lets a BTreeMap<NodeName, _> be probed with a plain &str.

Sound because NodeName’s Ord and Eq are the wrapped String’s. Callers that may hold a denormalized name still have to go through NodeName::new; see [Graph::node] for how that is kept cheap.

fn borrow(&self) -> &str

Immutably borrows from an owned value.

impl Clone for NodeName

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeName

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for NodeName

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for NodeName

impl Hash for NodeName

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 Ord for NodeName

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for NodeName

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for NodeName

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for NodeName

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for NodeName