Struct BTreeIndexSet 

pub struct BTreeIndexSet<S = u64> { /* private fields */ }

Index set backed by a BTreeMap.

Implementations

impl<S> BTreeIndexSet<S>

pub const fn new() -> Self

Create a new BTreeIndexSet.

pub fn with_capacity(_capacity: usize) -> Self

Create a new BTreeIndexSet with the given capacity.

Warning

In the current implementation, this method is a stub. It doesn’t actually provide any benefit over calling BTreeIndexSet::new.

Trait Implementations

impl<S: Clone> Clone for BTreeIndexSet<S>

fn clone(&self) -> BTreeIndexSet<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for BTreeIndexSet<S>

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

Formats the value using the given formatter.

impl<S: Default> Default for BTreeIndexSet<S>

fn default() -> BTreeIndexSet<S>

Returns the “default value” for a type.

impl<S: Storage> Extend<usize> for BTreeIndexSet<S>

fn extend<T>(&mut self, iter: T)

where T: IntoIterator<Item = usize>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<S: Storage> From<&BTreeIndexSet<S>> for BTreeSet<usize>

fn from(index_set: &BTreeIndexSet<S>) -> Self

Converts to this type from the input type.

impl<S: Storage> From<&BTreeIndexSet<S>> for Vec<usize>

fn from(index_set: &BTreeIndexSet<S>) -> Self

Converts to this type from the input type.

impl<S: Storage> From<BTreeIndexSet<S>> for BTreeSet<usize>

fn from(index_set: BTreeIndexSet<S>) -> Self

Converts to this type from the input type.

impl<S: Storage> From<BTreeIndexSet<S>> for Vec<usize>

fn from(index_set: BTreeIndexSet<S>) -> Self

Converts to this type from the input type.

impl<I, S> From<I> for BTreeIndexSet<S>

where I: IntoIterator<Item = usize>, S: Storage,

fn from(iter: I) -> Self

Converts to this type from the input type.

impl<S: Storage> FromIterator<usize> for BTreeIndexSet<S>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = usize>,

Creates a value from an iterator.

impl<S: Hash> Hash for BTreeIndexSet<S>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<S: Storage> IndexSet for BTreeIndexSet<S>

fn len(&self) -> usize

Return the number of usize values present in this IndexSet.

fn is_empty(&self) -> bool

Checks if this IndexSet has no inner indexes stored within.

fn insert(&mut self, index: usize)

Add a new index to this IndexSet.

fn remove(&mut self, index: usize)

Remove an index from this IndexSet.

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

Check the presence of an index in this IndexSet.

fn iter(&self) -> impl Iterator<Item = usize> + '_

Return an iterator over the indices in this IndexSet, in ascending order.

fn union(&mut self, other: &BTreeIndexSet<S>)

Merge two IndexSet instances.

fn reserve(&mut self, _size: usize)

Attempt to reserve space for the specified number of additional usize elements.

impl<S: Ord> Ord for BTreeIndexSet<S>

fn cmp(&self, other: &BTreeIndexSet<S>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<S: PartialEq> PartialEq for BTreeIndexSet<S>

fn eq(&self, other: &BTreeIndexSet<S>) -> 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<S: PartialOrd> PartialOrd for BTreeIndexSet<S>

fn partial_cmp(&self, other: &BTreeIndexSet<S>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<S: Eq> Eq for BTreeIndexSet<S>

impl<S> StructuralPartialEq for BTreeIndexSet<S>