Struct ProllyTree 

pub struct ProllyTree {
    pub root: ProllyNode,
    pub event_count: usize,
}

Content-addressed Prolly Tree over a set of events.

Fields

root: ProllyNode

event_count: usize

Implementations

impl ProllyTree

pub fn build(events: &[Event]) -> Self

Build a Prolly Tree from a set of events.

Events are sorted by (item_id, wall_ts_us, event_hash), then split into content-defined chunks using a Gear rolling hash. A balanced Merkle tree is constructed over the leaf chunks.

The root hash is deterministic for any permutation of the same event set.

pub fn diff(&self, other: &Self) -> Vec<String>

Compute the diff between self (local) and other (remote).

Returns event hashes that are in other but not in self. Runs in O(k log N) where k is the number of differing chunks.

pub fn event_hashes(&self) -> Vec<String>

All event hashes stored in this tree.

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

Serialize to bytes for wire transfer.

Panics

Panics if serde_json fails to serialize ProllyTree, which should never happen for well-formed trees.

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

Deserialize from bytes.

Errors

Returns a serde_json::Error if the bytes are not valid JSON or do not match the ProllyTree schema.

Trait Implementations

impl Clone for ProllyTree

fn clone(&self) -> ProllyTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProllyTree

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ProllyTree

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ProllyTree

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

where __S: Serializer,

Serialize this value into the given Serde serializer.