Struct PSyncNode 

pub struct PSyncNode { /* private fields */ }

Partial Sync (PSync) node.

Maintains a local set of content name hashes and an IBF over that set. To reconcile with a peer: compute local_ibf.subtract(peer_ibf) and call decode() to find which hashes each side is missing.

Implementations

impl PSyncNode

pub fn new(ibf_size: usize) -> Self

Create a node with an IBF of ibf_size cells and k=3 hash functions.

ibf_size should be significantly larger than the expected set difference; 80 cells handles differences up to ~40 elements with k=3.

pub fn insert(&mut self, hash: u64)

Insert a content hash into the local set.

pub fn remove(&mut self, hash: u64) -> bool

Remove a content hash from the local set. Returns true if present.

pub fn contains(&self, hash: u64) -> bool

Returns true if the local set contains hash.

pub fn len(&self) -> usize

Number of hashes in the local set.

pub fn is_empty(&self) -> bool

Returns true if the local set is empty.

pub fn build_ibf(&self) -> Ibf

Build an IBF over the current local set.

pub fn reconcile(&self, peer_ibf: &Ibf) -> Option<(HashSet<u64>, HashSet<u64>)>

Reconcile with a peer IBF.

Returns Some((hashes_we_have_that_peer_lacks, hashes_peer_has_that_we_lack)) or None if the difference is too large to decode.