Struct NodeId 

pub struct NodeId {
    index: u32,
    generation: u32,
}

The slot a node occupies in a Dag, with the generation it was in.

A handle is only valid while the node it names lives: once the node is removed and its slot is reused, the generation no longer matches and the handle stops resolving (see the module documentation).

Fields

index: u32

The slot the node occupies.

generation: u32

The generation the slot was in when the node was inserted. A reused slot carries a higher generation, so old handles do not resolve.

Implementations

impl NodeId

pub const fn index(self) -> usize

The slot this handle names.

Only meaningful while the node lives, but stable across the node’s lifetime, so callers can group or sort by it without holding a borrow. Two handles can share an index and still differ: the generation is what tells a live handle from a stale one.

pub const fn to_bits(self) -> u64

The handle as plain bits, for an API that stores handles but does not know the type — an inspector that reports one, or a transport that carries it.

The slot index is the low 32 bits and the generation the high 32, the same layout as unlit_ecs::Entity. Rebuild the handle with NodeId::from_bits.

pub const fn from_bits(bits: u64) -> Self

Rebuild a handle from the bits NodeId::to_bits produced.

The bits say nothing about whether the node still lives; resolving them through the graph is what decides that.

Trait Implementations

impl Clone for NodeId

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for NodeId

impl Debug for NodeId

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

Formats the value using the given formatter.

impl Eq for NodeId

impl Hash for NodeId

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 NodeId

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 NodeId

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for NodeId

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 StructuralPartialEq for NodeId