Struct NodeId 

pub struct NodeId {
    pub level: usize,
    pub position: usize,
}

Node identifier in the WPT tree

Fields

level: usize

position: usize

Implementations

impl NodeId

pub fn new(level: usize, position: usize) -> Self

Create a new NodeId

pub fn left_child(&self) -> NodeId

Get the left child node ID

pub fn right_child(&self) -> NodeId

Get the right child node ID

pub fn parent(&self) -> Option<NodeId>

Get the parent node ID

pub fn is_left_child(&self) -> bool

Check if this node is a left child

pub fn is_right_child(&self) -> bool

Check if this node is a right child

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

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

Formats the value using the given formatter.

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