Struct dogs::data_structures::sparse_set::SparseSet

pub struct SparseSet { /* fields omitted */ }

implements a sparse set data-structure. this structure is efficient to remove all but one values, but is costly in memory. if n is the number elements and m the number of subsets in the set this data-structure has the following complexities:

• memory: O(n+m)
• insertion: O(1)
• remove: O(1)
• contains: O(1)
• remove all but one: O(1)

Implementations

impl SparseSet

pub fn new(nb_max: usize) -> Self

creates a new sparse set from its maximum size (nb_max)

pub fn is_empty(&self) -> bool

returns true iff the set is empty

pub fn len(&self) -> usize

returns the number of elements in the set

pub fn nth(&self, i: usize) -> usize

returns the nth element of the set

pub fn contains(&self, e: usize) -> bool

true iff e ∈ Set

pub fn insert(&mut self, e: usize)

inserts e into the set

pub fn remove(&mut self, e: usize)

removes e from the set

pub fn remove_all_but_one(&mut self, e: usize)

removes everything except e from the set

Trait Implementations

impl Debug for SparseSet

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

Formats the value using the given formatter.