Struct BTreeSet 

pub struct BTreeSet<'store, T> { /* private fields */ }

A copyable, immutable b-tree set, which doesn’t drop its contents.

Implementations

impl<'store, T> BTreeSet<'store, T>

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn first(&self) -> Option<&T>

The first value in the set, or None if empty.

pub fn last(&self) -> Option<&T>

The last value in the set, or None if empty.

pub fn contains<U: Ord>(&self, value: &U) -> bool

where T: Borrow<U>,

Returns true if the set contains a value.

pub fn get<U: Ord>(&self, value: &U) -> Option<&T>

where T: Borrow<U>,

Returns a reference to the equivalent value in the set, if any.

This is (only) useful when U is a different type than T.

pub fn validate(&self)

where T: Debug + Ord,

Validates the set, panicing if it is invalid. Specifically, we check that the number of entries in each node is within the b-tree invariant bounds, and that the elements are in order.

Ideally, this should always be a no-op.

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

where T: Debug,

Prints the b-tree in ascii

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

Returns an iterator over the set.

pub fn range<U: Ord>(&self, bounds: impl RangeBounds<U>) -> Range<'_, T>

where T: Borrow<U>,

Returns an iterator over the set within the given bounds

Trait Implementations

impl<'store, T> Clone for BTreeSet<'store, T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'store, T: Debug> Debug for BTreeSet<'store, T>

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

Formats the value using the given formatter.

impl<'store, T> From<BTreeSet<'store, T>> for BTreeSet<'store, T>

fn from(inner: BTreeSet<'store, T>) -> Self

Creates a copyable set from a non-copyable set. Afterwards, the set is no longer mutable and will no longer drop its contents.

impl<'store, T: Hash> Hash for BTreeSet<'store, T>

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<'a, 'store: 'a, T> IntoIterator for &'a BTreeSet<'store, T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'store, T: Ord> Ord for BTreeSet<'store, T>

fn cmp(&self, other: &Self) -> 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<'store, T: PartialEq> PartialEq for BTreeSet<'store, T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Self) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'store, T: PartialOrd> PartialOrd for BTreeSet<'store, T>

fn partial_cmp(&self, other: &Self) -> 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<'store, T> Copy for BTreeSet<'store, T>

impl<'store, T: Eq> Eq for BTreeSet<'store, T>