BitSet::remove

pub fn remove(int i) -> bool

use collections::bitset::{BitSet};

Clear index i; returns true when a bit was unset.

Called on a BitSet value as value.remove(…).

Parameters#

Returns#

bool

Contracts#

Checked according to --contracts (see Contracts).

ensures !self.contains(i)
ensures !result || self.count == old(self.count) - 1
ensures result || self.count == old(self.count)

See also#

• BitSet: A set of non-negative ints stored as bits.
• BitSet::with_capacity: Empty set with storage for at least bits indices (0 → no words).
• BitSet::new: Empty set with no word storage (grows on insert).
• BitSet::size: Number of set bits (cardinality).
• BitSet::is_empty: Returns true when no bit is set.
• BitSet::capacity: Current bit capacity (words.len() * 63); grows when inserting past it.
• BitSet::insert: Insert index i; returns true when newly set.
• BitSet::contains: True when index i is set.