Struct Node 

pub struct Node {
    pub keys: Vec<Vec<u8>>,
    pub vals: Vec<Vec<u8>>,
    pub child_counts: Vec<u64>,
    pub leaf: bool,
    pub level: u8,
    pub format: TreeFormat,
}

A node in the Prolly Tree

Fields

keys: Vec<Vec<u8>>

Keys (sorted, lexicographic byte order)

vals: Vec<Vec<u8>>

Values: raw bytes for leaves, CIDs for internal nodes

child_counts: Vec<u64>

Logical entry counts for internal children. Empty for leaf nodes.

leaf: bool

Leaf node (true) or internal node (false)

level: u8

Tree level (0 = leaf level)

format: TreeFormat

Persisted settings that determine tree shape and node bytes.

Implementations

impl Node

pub fn new_leaf() -> Self

Create a new leaf node with default settings

pub fn new_internal(level: u8) -> Self

Create a new internal node at the specified level

pub fn builder() -> NodeBuilder

Create a builder for constructing a Node

pub fn len(&self) -> usize

Get the number of keys in this node

pub fn is_empty(&self) -> bool

Check if this node is empty

pub fn search(&self, key: &[u8]) -> Result<usize, usize>

Binary search for key index Returns Ok(index) if found, Err(index) for insertion point

pub fn min_chunk_size(&self) -> usize

Minimum size before a content boundary may be selected.

pub fn max_chunk_size(&self) -> usize

Maximum soft chunk size.

pub fn chunking_factor(&self) -> u32

Compatibility accessor for threshold-based chunking.

pub fn hash_seed(&self) -> u64

Boundary hash seed.

pub fn encoding(&self) -> &Encoding

Value encoding.

pub fn validate(&self) -> Result<(), Error>

Validate structural invariants independent of storage.

pub fn to_bytes(&self) -> Vec<u8>

Serialize to compact, deterministic bytes.

pub fn try_to_bytes(&self) -> Result<Vec<u8>, Error>

Serialize to deterministic bytes, returning format errors to the caller.

pub fn encoded_len(&self) -> usize

Return the exact length of the serialized form.

pub fn from_bytes(data: &[u8]) -> Result<Self, Error>

Deserialize from current node bytes.

pub fn from_bytes_with_format( data: &[u8], expected: &TreeFormat, ) -> Result<Self, Error>

Deserialize and require an exact persisted tree format.

pub fn cid(&self) -> Cid

Compute CID of this node

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Default for Node

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Node

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Node

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Node

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Node