Struct SeqSet 

pub struct SeqSet { /* private fields */ }

A set of u64 sequence numbers, held as sorted, disjoint, half-open runs.

Adjacent runs are always merged, so two sets with the same members have the same runs and compare equal. The JSON form is the run list itself: [[0, 10], [12, 13]] is {0, ..., 9, 12}.

Implementations

impl SeqSet

pub fn new() -> Self

The empty set.

pub fn range(start: u64, end: u64) -> Self

The set start..end.

pub fn insert(&mut self, seq: u64) -> bool

Add seq, and say whether it was new.

A reader uses the answer to spot a record it has already seen.

pub fn insert_range(&mut self, start: u64, end: u64) -> u64

Add every member of start..end, and return how many were new.

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

Remove seq, and say whether it was a member.

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

Whether seq is a member.

pub fn len(&self) -> u64

How many members the set has.

pub fn is_empty(&self) -> bool

Whether the set has no members.

pub fn last(&self) -> Option<u64>

The largest member.

pub fn iter(&self) -> impl DoubleEndedIterator<Item = u64> + '_

Every member, in ascending order. Reverse it to walk down from the largest member.

pub fn union(&self, other: &Self) -> Self

Every member of self or other.

One merge over the two run lists, so the cost is linear in their runs.

pub fn union_all<'a>(sets: impl IntoIterator<Item = &'a Self>) -> Self

Every member of any of sets.

It collects every run, sorts them once and merges them, so it costs O(R log R) in the total run count R. Folding Self::union over many sets costs a merge per set instead.

pub fn difference(&self, other: &Self) -> Self

Every member of self that is not a member of other.

One merge over the two run lists, so the cost is linear in their runs.

pub fn intersection(&self, other: &Self) -> Self

Every member of both self and other.

One merge over the two run lists, with at most one binary search per run.

pub fn sample(&self, count: usize) -> Vec<u64>

The first count members, for a failure message that names examples without printing a whole ledger.

Trait Implementations

impl Clone for SeqSet

fn clone(&self) -> SeqSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SeqSet

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

Formats the value using the given formatter.

impl Default for SeqSet

fn default() -> SeqSet

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SeqSet

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for SeqSet

impl From<SeqSet> for Vec<[u64; 2]>

fn from(set: SeqSet) -> Self

Converts to this type from the input type.

impl From<Vec<[u64; 2]>> for SeqSet

Reading a run list back canonicalizes it: overlapping, touching or unsorted runs merge exactly as inserting them would.

fn from(runs: Vec<[u64; 2]>) -> Self

Converts to this type from the input type.

impl FromIterator<u64> for SeqSet

fn from_iter<I: IntoIterator<Item = u64>>(iter: I) -> Self

Creates a value from an iterator.

impl PartialEq for SeqSet

fn eq(&self, other: &SeqSet) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for SeqSet

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SeqSet