Struct taffy::tree::NodeId

pub struct NodeId(u64);

A type representing the id of a single node in a tree of nodes

Internally it is a wrapper around a u64 and a NodeId can be converted to and from and u64 if needed.

Tuple Fields

0: u64

Implementations

impl NodeId

pub const fn new(val: u64) -> Self

Create a new NodeId from a u64 value

Trait Implementations

impl Clone for NodeId

fn clone(&self) -> NodeId

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeId

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

Formats the value using the given formatter.

impl From<NodeId> for u64

fn from(id: NodeId) -> Self

Converts to this type from the input type.

impl From<NodeId> for usize

fn from(id: NodeId) -> Self

Converts to this type from the input type.

impl From<u64> for NodeId

fn from(raw: u64) -> Self

Converts to this type from the input type.

impl From<usize> for NodeId

fn from(raw: usize) -> Self

Converts to this type from the input type.

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

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

impl Eq for NodeId

impl StructuralPartialEq for NodeId