Struct Have 

pub struct Have {
    pub last_sync: Vec<ChangeHash>,
    pub bloom: BloomFilter,
}

A summary of the changes that the sender of the message already has. This is implicitly a request to the recipient to send all changes that the sender does not already have.

Fields

last_sync: Vec<ChangeHash>

The heads at the time of the last successful sync with this recipient.

bloom: BloomFilter

A bloom filter summarising all of the changes that the sender of the message has added since the last sync.

Trait Implementations

impl Clone for Have

fn clone(&self) -> Have

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Have

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

Formats the value using the given formatter.

impl Default for Have

fn default() -> Have

Returns the “default value” for a type.

impl Hash for Have

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Have

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Have

impl StructuralPartialEq for Have