Struct NodeId 

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

A versioned identifier for a node in a Blitz DOM tree.

A NodeId packs a 32-bit slot index (low bits) and a 32-bit version (high bits). Node storage bumps a slot’s version when the slot is reused, so ids referring to a dropped node no longer resolve (lookups return None rather than aliasing the new node occupying the slot).

The Default value is a null id which never resolves to a node.

Implementations

impl NodeId

pub fn as_u64(self) -> u64

Convert this id to its raw u64 representation (index + version).

The value round-trips through NodeId::from_u64. This is useful for interop with APIs which use integer ids (e.g. Taffy or AccessKit).

pub fn from_u64(raw: u64) -> Self

Reconstruct a NodeId from the raw u64 representation produced by NodeId::as_u64.

Passing a value that did not come from as_u64 will produce an id which fails to resolve (it will not alias an unrelated live node).

Trait Implementations

impl Clone for NodeId

fn clone(&self) -> NodeId

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

fn default() -> NodeId

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for NodeId

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl Display 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

Ordered by slot index first, then by version, so that ordering roughly matches node creation order (as with the previous Slab-backed storage) rather than being dominated by the version bits.

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.

impl PartialEq for NodeId

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

Serialized as the raw u64, so it round-trips through NodeId::from_u64 and stays an integer on the wire.

It is deliberately not the slot index: a reference handed to an out-of- process client and echoed back later has to fail rather than resolve to whatever node took over the slot, and the version bits are what make that possible.

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for NodeId