Struct SortedVecSet 

pub struct SortedVecSet<T> { /* private fields */ }

An ordered set built on a SortedVecMap.

SortedVecSet provides a memory-efficient alternative to BTreeSet by wrapping SortedVecMap<T, ()>.

Complexity

Operation	Time Complexity	Space Complexity
new / with_capacity	O(1)	O(1)
contains / get	O(log N)	O(1)
insert	O(N)	O(1) amortized
remove	O(N)	O(1)
union / difference	O(N + M)	O(1)

When to use

• Similar to SortedVecMap, it is ideal for read-heavy, memory-constrained sets.

Implementations

impl<T> SortedVecSet<T>

pub fn builder() -> SortedVecSetBuilder<T>

Returns a new builder for SortedVecSet.

pub fn builder_with_capacity(capacity: usize) -> SortedVecSetBuilder<T>

Returns a new builder for SortedVecSet with at least the specified capacity.

pub fn new() -> Self

Constructs a new, empty SortedVecSet.

pub fn capacity(&self) -> usize

Returns the number of elements the set can hold without reallocating.

pub fn with_capacity(capacity: usize) -> Self

Constructs a new, empty SortedVecSet with at least the specified capacity.

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements in the SortedVecSet.

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the set as much as possible.

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn is_empty(&self) -> bool

Returns true if there are no elements in the set.

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

where T: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns true if the set contains the given value.

Complexity: O(log n) time.

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

where T: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns a reference to the value in the set, if any, that is equal to the given value.

Complexity: O(log n) time.

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

where T: Ord,

Inserts a value into the set. Returns true if the value was not already present.

Complexity: O(log n) search time, plus O(n) time to insert the element if it is not present.

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

where T: Borrow<Q> + Ord, Q: Ord + ?Sized,

Removes a value from the set. Returns true if the value was present.

Complexity: O(log n) search time, plus O(n) time to remove the element if it is present.

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

Returns an iterator over the elements of the set, in sorted order.

pub fn range<Q, R>(&self, range: R) -> Range<'_, T>

where T: Borrow<Q> + Ord, Q: Ord + ?Sized, R: RangeBounds<Q>,

Constructs a double-ended iterator over a sub-range of elements in the set.

Complexity: O(log n) to find the start and end of the range.

pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, T>

where T: Ord,

Returns an iterator yielding elements from both sets in sorted order, without duplicates.

Complexity: O(N + M) where N is the number of elements in self and M is the number of elements in other.

pub fn difference<'a>(&'a self, other: &'a Self) -> Difference<'a, T>

where T: Ord,

Returns an iterator yielding elements in self that are not in other.

Complexity: O(N + M) where N is the number of elements in self and M is the number of elements in other.

Trait Implementations

impl<T: Clone> Clone for SortedVecSet<T>

fn clone(&self) -> SortedVecSet<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for SortedVecSet<T>

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

Formats the value using the given formatter.

impl<T> Default for SortedVecSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for SortedVecSet<T>

where T: Ord + Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Ord> Extend<T> for SortedVecSet<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends the set with the contents of an iterator.

Complexity: O(n log n) where n is the total number of elements, or O(n) if the iterator yields elements in sorted order and they are all greater than the existing elements.

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<T: Ord, const N: usize> From<[T; N]> for SortedVecSet<T>

fn from(arr: [T; N]) -> Self

Converts to this type from the input type.

impl<T: Ord> From<BTreeSet<T>> for SortedVecSet<T>

fn from(set: BTreeSet<T>) -> Self

Converts to this type from the input type.

impl<T> From<SortedVecSet<T>> for Vec<T>

fn from(set: SortedVecSet<T>) -> Self

Converts to this type from the input type.

impl<T: Ord> From<Vec<T>> for SortedVecSet<T>

fn from(vec: Vec<T>) -> Self

Converts to this type from the input type.

impl<T: Ord> FromIterator<T> for SortedVecSet<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Constructs a SortedVecSet from an iterator.

Complexity: O(n log n) where n is the number of elements in the iterator, or O(n) if the elements are already sorted.

impl<T: Hash> Hash for SortedVecSet<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, T> IntoIterator for &'a SortedVecSet<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<T> IntoIterator for SortedVecSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> Ord for SortedVecSet<T>

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

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

fn partial_cmp(&self, other: &SortedVecSet<T>) -> 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<T: Serialize> Serialize for SortedVecSet<T>

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq> Eq for SortedVecSet<T>

impl<T> StructuralPartialEq for SortedVecSet<T>