Enum TreeCompareResult 

pub enum TreeCompareResult {
    Equal,
    Different {
        remote_only_children: Vec<[u8; 32]>,
        local_only_children: Vec<[u8; 32]>,
        common_children: Vec<[u8; 32]>,
    },
    LocalMissing,
    RemoteMissing,
}

Result of comparing two tree nodes.

Used for Merkle tree traversal during HashComparison sync. Identifies which children need further traversal in both directions.

Note: Borsh derives are included for consistency with other sync types and potential future use in batched comparison responses over the wire.

Variants

Equal

Hashes match - no sync needed for this subtree.

Different

Hashes differ - need to recurse or fetch leaf.

For internal nodes: lists children to recurse into. For leaf nodes: all vecs will be empty, but Different still indicates that the leaf data needs to be fetched and merged bidirectionally.

Fields

remote_only_children: Vec<[u8; 32]>

IDs of children in remote but not in local (need to fetch).

local_only_children: Vec<[u8; 32]>

IDs of children in local but not in remote (for bidirectional sync).

common_children: Vec<[u8; 32]>

IDs of children present on both sides that need recursive comparison. These are the primary candidates for recursion when parent hashes differ.

LocalMissing

Local node missing - need to fetch from remote.

RemoteMissing

Remote node missing - local has data that remote doesn’t. For bidirectional sync, this means we may need to push to remote.

Implementations

impl TreeCompareResult

pub fn needs_sync(&self) -> bool

Check if sync (pull from remote) is needed.

Returns true if local needs data from remote.

pub fn needs_push(&self) -> bool

Check if push (send to remote) is needed for bidirectional sync.

Returns true if local has data that remote doesn’t:

• RemoteMissing: entire local subtree needs pushing
• Different with local_only_children: those children need pushing
• Different with all empty vecs: this is a leaf node comparison where hashes differ, meaning local leaf data needs pushing for CRDT merge

Trait Implementations

impl BorshDeserialize for TreeCompareResult

fn deserialize_reader<__R: Read>(reader: &mut __R) -> Result<Self, Error>

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl BorshSerialize for TreeCompareResult

fn serialize<__W: Write>(&self, writer: &mut __W) -> Result<(), Error>

impl Clone for TreeCompareResult

fn clone(&self) -> TreeCompareResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeCompareResult

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

Formats the value using the given formatter.

impl EnumExt for TreeCompareResult

fn deserialize_variant<__R: Read>( reader: &mut __R, variant_tag: u8, ) -> Result<Self, Error>

Deserialises given variant of an enum from the reader.

impl PartialEq for TreeCompareResult

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