Struct DeleteSet 

pub struct DeleteSet(/* private fields */);

DeleteSet contains information about all blocks (described by clock ranges) that have been subjected to delete process.

Implementations

impl DeleteSet

pub fn new() -> DeleteSet

Creates a new empty delete set instance.

pub fn insert(&mut self, id: ID, len: u32)

Inserts an information about delete block (identified by id and having a specified length) inside of a current delete set.

pub fn len(&self) -> usize

Returns number of clients stored;

pub fn is_empty(&self) -> bool

Checks if delete set contains any clock ranges.

pub fn is_deleted(&self, id: &ID) -> bool

Checks if given block id is considered deleted from the perspective of current delete set.

pub fn iter(&self) -> Iter<'_, u64, IdRange>

Returns an iterator over all client-range pairs registered in this delete set.

pub fn merge(&mut self, other: DeleteSet)

Merges another delete set into a current one, combining their information about deleted clock ranges.

pub fn squash(&mut self)

Squashes the contents of a current delete set. This operation means, that in case when delete set contains any overlapping ranges within, they will be squashed together to optimize the space and make future encoding more compact.

pub fn range(&self, client_id: &u64) -> Option<&IdRange>

Trait Implementations

impl Clone for DeleteSet

fn clone(&self) -> DeleteSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DeleteSet

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

Formats the value using the given formatter.

impl Decode for DeleteSet

fn decode<D>(decoder: &mut D) -> Result<DeleteSet, Error>

where D: Decoder,

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

Helper function for decoding 1st version of lib0 encoding.

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

Helper function for decoding 2nd version of lib0 encoding.

impl Default for DeleteSet

fn default() -> DeleteSet

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for DeleteSet

fn deserialize<__D>( __deserializer: __D, ) -> Result<DeleteSet, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for DeleteSet

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

Formats the value using the given formatter.

impl Encode for DeleteSet

fn encode<E>(&self, encoder: &mut E)

where E: Encoder,

fn encode_v1(&self) -> Vec<u8>

Helper function for encoding 1st version of lib0 encoding.

fn encode_v2(&self) -> Vec<u8>

Helper function for encoding 2nd version of lib0 encoding.

impl<'a> From<&'a BlockStore> for DeleteSet

fn from(store: &'a BlockStore) -> DeleteSet

Creates a DeleteSet by reading all deleted blocks and including their clock ranges into the delete set itself.

impl From<IdSet> for DeleteSet

fn from(id_set: IdSet) -> DeleteSet

Converts to this type from the input type.

impl Hash for DeleteSet

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 DeleteSet

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

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 DeleteSet

impl StructuralPartialEq for DeleteSet