Struct IndexedPresence 

pub struct IndexedPresence { /* private fields */ }

Implementations

impl IndexedPresence

pub fn contains(&self, index: i64) -> bool

pub fn count(&self) -> usize

pub fn item_count(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn runs(&self) -> Runs

pub fn complement_runs(&self, horizon: Range<i64>) -> Runs

pub fn count_in(&self, range: Range<i64>) -> usize

pub fn any_in(&self, range: Range<i64>) -> bool

Trait Implementations

impl Accumulator<i64, IndexedPresence> for IndexedPresenceAccumulator

type Retraction = i64

fn accumulate(&mut self, value: i64) -> Self::Retraction

fn retract(&mut self, value: Self::Retraction)

fn with_result<T>(&self, f: impl FnOnce(&IndexedPresence) -> T) -> T

fn reset(&mut self)

fn finish(&self) -> R

where R: Clone,

impl Clone for IndexedPresence

fn clone(&self) -> IndexedPresence

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IndexedPresence

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

Formats the value using the given formatter.

impl Default for IndexedPresence

fn default() -> IndexedPresence

Returns the “default value” for a type.

impl PartialEq for IndexedPresence

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

impl StructuralPartialEq for IndexedPresence