Struct CompactSet 

pub struct CompactSet { /* private fields */ }

A compact, sorted set of u32 values.

Implementations

impl CompactSet

pub fn new() -> Self

pub fn insert(&mut self, value: u32) -> bool

pub fn remove(&mut self, value: u32) -> bool

pub fn contains(&self, value: u32) -> bool

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn min(&self) -> Option<u32>

pub fn max(&self) -> Option<u32>

pub fn clear(&mut self)

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

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

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

pub fn to_vec(&self) -> Vec<u32>

Trait Implementations

impl Clone for CompactSet

fn clone(&self) -> CompactSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompactSet

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

Formats the value using the given formatter.

impl Default for CompactSet

fn default() -> CompactSet

Returns the “default value” for a type.

impl PartialEq for CompactSet

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

impl StructuralPartialEq for CompactSet