Struct bao_tree::iter::NodeInfo

pub struct NodeInfo<'a> {
    pub node: TreeNode,
    pub is_root: bool,
    pub ranges: &'a ChunkRangesRef,
    pub l_ranges: &'a ChunkRangesRef,
    pub r_ranges: &'a ChunkRangesRef,
    pub full: bool,
    pub query_leaf: bool,
    pub is_half_leaf: bool,
}

Extended node info.

Some of the information is redundant, but it is convenient to have it all in one place.

Usually this is used within an iterator, so we hope that the compiler will optimize away the redundant information.

Fields

node: TreeNode

the node

is_root: bool

the node is the root node (needs special handling when computing hash)

ranges: &'a ChunkRangesRef

ranges of the node and it’s two children

l_ranges: &'a ChunkRangesRef

left child intersection with the query range

r_ranges: &'a ChunkRangesRef

right child intersection with the query range

full: bool

the node is fully included in the query range

query_leaf: bool

the node is a leaf for the purpose of this query

is_half_leaf: bool

true if this node is the last leaf, and it is <= half full

Trait Implementations

impl<'a> Debug for NodeInfo<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for NodeInfo<'a>

fn eq(&self, other: &NodeInfo<'a>) -> 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<'a> Eq for NodeInfo<'a>

impl<'a> StructuralEq for NodeInfo<'a>

impl<'a> StructuralPartialEq for NodeInfo<'a>