Struct bao_tree::TreeNode

pub struct TreeNode(_);

An u64 that defines a node in a bao tree.

You typically don’t have to use this, but it can be useful for debugging and error handling. Hash validation errors contain a TreeNode that allows you to find the position where validation failed.

Implementations

impl TreeNode

pub const fn mid(&self) -> BlockNum

pub const fn level(&self) -> u32

pub const fn is_leaf(&self) -> bool

pub fn byte_range(&self, block_size: BlockSize) -> Range<ByteNum>

pub const fn as_leaf(&self) -> Option<LeafNode>

pub const fn count_below(&self) -> u64

pub fn next_left_ancestor(&self) -> Option<Self>

Get the next left ancestor of this node, or None if there is none.

pub fn left_child(&self) -> Option<Self>

pub fn right_child(&self) -> Option<Self>

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

Unrestricted parent, can only be None if we are at the top

pub fn restricted_parent(&self, len: Self) -> Option<Self>

Restricted parent, will be None if we call parent on the root

pub const fn node_range(&self) -> Range<Self>

pub fn block_range(&self) -> Range<BlockNum>

pub fn post_order_offset(&self) -> u64

pub fn right_count(&self) -> u32

the number of times you have to go right from the root to get to this node

0 for a root node

pub fn post_order_range(&self) -> Range<u64>

Trait Implementations

impl Clone for TreeNode

fn clone(&self) -> TreeNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TreeNode

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

Formats the value using the given formatter.

impl From<LeafNode> for TreeNode

fn from(leaf: LeafNode) -> TreeNode

Converts to this type from the input type.

impl Ord for TreeNode

fn cmp(&self, other: &TreeNode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<TreeNode> for TreeNode

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd<TreeNode> for TreeNode

fn partial_cmp(&self, other: &TreeNode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for TreeNode

impl Eq for TreeNode

impl StructuralEq for TreeNode

impl StructuralPartialEq for TreeNode