Struct ReactiveNodeIdV0 

pub struct ReactiveNodeIdV0 { /* private fields */ }

An append-only node index branded by the builder that minted it.

Ord is intentionally derived with index declared first, so iteration order within one graph remains insertion order. Builders expose no removal or recycling operation and build(self) consumes the builder, so node generations are deliberately not represented.

Implementations

impl ReactiveNodeIdV0

pub fn index(self) -> usize

Trait Implementations

impl Clone for ReactiveNodeIdV0

fn clone(&self) -> ReactiveNodeIdV0

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ReactiveNodeIdV0

impl Debug for ReactiveNodeIdV0

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

Formats the value using the given formatter.

impl Eq for ReactiveNodeIdV0

impl Hash for ReactiveNodeIdV0

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 ReactiveNodeIdV0

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

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for ReactiveNodeIdV0

fn partial_cmp(&self, other: &ReactiveNodeIdV0) -> 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 StructuralPartialEq for ReactiveNodeIdV0