Enum TreeChunk 

pub enum TreeChunk {
    Leaf(Leaf),
    Internal(Internal),
}

A Prolly tree chunk on the wire - either a leaf or an internal node.

Variants

Leaf(Leaf)

A leaf chunk carrying (key, value) entries.

Internal(Internal)

An internal chunk carrying separator keys and child pointers.

Implementations

impl TreeChunk

pub const KIND: &'static str = "tree"

The _kind discriminator on the wire. "tree" for both variants.

pub const fn is_leaf(&self) -> bool

true iff this is a leaf chunk.

pub const fn len(&self) -> usize

Number of entries (leaf) or children (internal).

pub const fn is_empty(&self) -> bool

Whether the chunk carries zero entries/children.

Trait Implementations

impl Clone for TreeChunk

fn clone(&self) -> TreeChunk

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeChunk

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TreeChunk

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl PartialEq for TreeChunk

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

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl Eq for TreeChunk

impl StructuralPartialEq for TreeChunk