Struct BinTrieNode 

pub struct BinTrieNode {
    pub hash: Hash,
    pub bit_idx: u8,
    pub left: Option<Box<BinTrieElement>>,
    pub right: Option<Box<BinTrieElement>>,
}

Internal node in the binary trie

Fields

hash: Hash

bit_idx: u8

left: Option<Box<BinTrieElement>>

right: Option<Box<BinTrieElement>>

Implementations

impl BinTrieNode

pub fn new(bit_idx: u8) -> Self

pub fn compute_hash(&mut self)

Compute the hash of this node according to the C implementation

Trait Implementations

impl Clone for BinTrieNode

fn clone(&self) -> BinTrieNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BinTrieNode

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

Formats the value using the given formatter.

impl PartialEq for BinTrieNode

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