Struct im_rc::OrdSet

pub struct OrdSet<A> { /* private fields */ }

An ordered set.

An immutable ordered set implemented as a [B-tree] 1.

Most operations on this type of set are O(log n). A HashSet is usually a better choice for performance, but the OrdSet has the advantage of only requiring an Ord constraint on its values, and of being ordered, so values always come out from lowest to highest, where a HashSet has no guaranteed ordering.

Implementations

impl<A> OrdSet<A>

pub fn new() -> Self

Construct an empty set.

pub fn unit(a: A) -> Self

Construct a set with a single value.

Examples

let set = OrdSet::unit(123);
assert!(set.contains(&123));

pub fn is_empty(&self) -> bool

Test whether a set is empty.

Time: O(1)

Examples

assert!(
  !ordset![1, 2, 3].is_empty()
);
assert!(
  OrdSet::<i32>::new().is_empty()
);

pub fn len(&self) -> usize

Get the size of a set.

Time: O(1)

Examples

assert_eq!(3, ordset![1, 2, 3].len());

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

Test whether two sets refer to the same content in memory.

This is true if the two sides are references to the same set, or if the two sets refer to the same root node.

This would return true if you’re comparing a set to itself, or if you’re comparing a set to a fresh clone of itself.

Time: O(1)

pub fn clear(&mut self)

Discard all elements from the set.

This leaves you with an empty set, and all elements that were previously inside it are dropped.

Time: O(n)

Examples

let mut set = ordset![1, 2, 3];
set.clear();
assert!(set.is_empty());

impl<A> OrdSet<A> where
    A: Ord, 

pub fn get_min(&self) -> Option<&A>

Get the smallest value in a set.

If the set is empty, returns None.

Time: O(log n)

pub fn get_max(&self) -> Option<&A>

Get the largest value in a set.

If the set is empty, returns None.

Time: O(log n)

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

Create an iterator over the contents of the set.

pub fn range<R, BA>(&self, range: R) -> RangedIter<'_, A> where
    R: RangeBounds<BA>,
    A: Borrow<BA>,
    BA: Ord + ?Sized, 

Create an iterator over a range inside the set.

pub fn diff<'a>(&'a self, other: &'a Self) -> DiffIter<'_, A>

Get an iterator over the differences between this set and another, i.e. the set of entries to add or remove to this set in order to make it equal to the other set.

This function will avoid visiting nodes which are shared between the two sets, meaning that even very large sets can be compared quickly if most of their structure is shared.

Time: O(n) (where n is the number of unique elements across the two sets, minus the number of elements belonging to nodes shared between them)

pub fn contains<BA>(&self, a: &BA) -> bool where
    BA: Ord + ?Sized,
    A: Borrow<BA>, 

Test if a value is part of a set.

Time: O(log n)

Examples

let mut set = ordset!{1, 2, 3};
assert!(set.contains(&1));
assert!(!set.contains(&4));

pub fn get_prev(&self, key: &A) -> Option<&A>

Get the closest smaller value in a set to a given value.

If the set contains the given value, this is returned. Otherwise, the closest value in the set smaller than the given value is returned. If the smallest value in the set is larger than the given value, None is returned.

Examples

let set = ordset![1, 3, 5, 7, 9];
assert_eq!(Some(&5), set.get_prev(&6));

pub fn get_next(&self, key: &A) -> Option<&A>

Get the closest larger value in a set to a given value.

If the set contains the given value, this is returned. Otherwise, the closest value in the set larger than the given value is returned. If the largest value in the set is smaller than the given value, None is returned.

Examples

let set = ordset![1, 3, 5, 7, 9];
assert_eq!(Some(&5), set.get_next(&4));

pub fn is_subset<RS>(&self, other: RS) -> bool where
    RS: Borrow<Self>, 

Test whether a set is a subset of another set, meaning that all values in our set must also be in the other set.

Time: O(n log m) where m is the size of the other set

pub fn is_proper_subset<RS>(&self, other: RS) -> bool where
    RS: Borrow<Self>, 

Test whether a set is a proper subset of another set, meaning that all values in our set must also be in the other set. A proper subset must also be smaller than the other set.

Time: O(n log m) where m is the size of the other set

impl<A> OrdSet<A> where
    A: Ord + Clone, 

pub fn insert(&mut self, a: A) -> Option<A>

Insert a value into a set.

Time: O(log n)

Examples

let mut set = ordset!{};
set.insert(123);
set.insert(456);
assert_eq!(
  set,
  ordset![123, 456]
);

pub fn remove<BA>(&mut self, a: &BA) -> Option<A> where
    BA: Ord + ?Sized,
    A: Borrow<BA>, 

Remove a value from a set.

Time: O(log n)

pub fn remove_min(&mut self) -> Option<A>

Remove the smallest value from a set.

Time: O(log n)

pub fn remove_max(&mut self) -> Option<A>

Remove the largest value from a set.

Time: O(log n)

pub fn update(&self, a: A) -> Self

Construct a new set from the current set with the given value added.

Time: O(log n)

Examples

let set = ordset![456];
assert_eq!(
  set.update(123),
  ordset![123, 456]
);

pub fn without<BA>(&self, a: &BA) -> Self where
    BA: Ord + ?Sized,
    A: Borrow<BA>, 

Construct a new set with the given value removed if it’s in the set.

Time: O(log n)

pub fn without_min(&self) -> (Option<A>, Self)

Remove the smallest value from a set, and return that value as well as the updated set.

Time: O(log n)

pub fn without_max(&self) -> (Option<A>, Self)

Remove the largest value from a set, and return that value as well as the updated set.

Time: O(log n)

pub fn union(self, other: Self) -> Self

Construct the union of two sets.

Time: O(n log n)

Examples

let set1 = ordset!{1, 2};
let set2 = ordset!{2, 3};
let expected = ordset!{1, 2, 3};
assert_eq!(expected, set1.union(set2));

pub fn unions<I>(i: I) -> Self where
    I: IntoIterator<Item = Self>, 

Construct the union of multiple sets.

Time: O(n log n)

pub fn difference(self, other: Self) -> Self

Construct the symmetric difference between two sets.

This is an alias for the symmetric_difference method.

Time: O(n log n)

Examples

let set1 = ordset!{1, 2};
let set2 = ordset!{2, 3};
let expected = ordset!{1, 3};
assert_eq!(expected, set1.difference(set2));

pub fn symmetric_difference(self, other: Self) -> Self

Construct the symmetric difference between two sets.

Time: O(n log n)

Examples

let set1 = ordset!{1, 2};
let set2 = ordset!{2, 3};
let expected = ordset!{1, 3};
assert_eq!(expected, set1.symmetric_difference(set2));

pub fn relative_complement(self, other: Self) -> Self

Construct the relative complement between two sets, that is the set of values in self that do not occur in other.

Time: O(m log n) where m is the size of the other set

Examples

let set1 = ordset!{1, 2};
let set2 = ordset!{2, 3};
let expected = ordset!{1};
assert_eq!(expected, set1.relative_complement(set2));

pub fn intersection(self, other: Self) -> Self

Construct the intersection of two sets.

Time: O(n log n)

Examples

let set1 = ordset!{1, 2};
let set2 = ordset!{2, 3};
let expected = ordset!{2};
assert_eq!(expected, set1.intersection(set2));

pub fn split<BA>(self, split: &BA) -> (Self, Self) where
    BA: Ord + ?Sized,
    A: Borrow<BA>, 

Split a set into two, with the left hand set containing values which are smaller than split, and the right hand set containing values which are larger than split.

The split value itself is discarded.

Time: O(n)

pub fn split_member<BA>(self, split: &BA) -> (Self, bool, Self) where
    BA: Ord + ?Sized,
    A: Borrow<BA>, 

Split a set into two, with the left hand set containing values which are smaller than split, and the right hand set containing values which are larger than split.

Returns a tuple of the two sets and a boolean which is true if the split value existed in the original set, and false otherwise.

Time: O(n)

pub fn take(&self, n: usize) -> Self

Construct a set with only the n smallest values from a given set.

Time: O(n)

pub fn skip(&self, n: usize) -> Self

Construct a set with the n smallest values removed from a given set.

Time: O(n)

Trait Implementations

impl<'a, A: Ord + Clone> Add<&'a OrdSet<A>> for &'a OrdSet<A>

type Output = OrdSet<A>

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self::Output

Performs the + operation.

impl<A: Ord + Clone> Add<OrdSet<A>> for OrdSet<A>

type Output = OrdSet<A>

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self::Output

Performs the + operation.

impl<A> Clone for OrdSet<A>

fn clone(&self) -> Self

Clone a set.

Time: O(1)

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

Performs copy-assignment from source.

impl<A: Ord + Debug> Debug for OrdSet<A>

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

Formats the value using the given formatter.

impl<A> Default for OrdSet<A>

fn default() -> Self

Returns the “default value” for a type.

impl<A, R> Extend<R> for OrdSet<A> where
    A: Ord + Clone + From<R>, 

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

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<'a, A> From<&'a [A]> for OrdSet<A> where
    A: Ord + Clone, 

fn from(slice: &'a [A]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + Clone> From<&'a BTreeSet<A, Global>> for OrdSet<A>

fn from(btree_set: &BTreeSet<A>) -> Self

Converts to this type from the input type.

impl<'a, A: Eq + Hash + Ord + Clone> From<&'a HashSet<A, RandomState>> for OrdSet<A>

fn from(hash_set: &HashSet<A>) -> Self

Converts to this type from the input type.

impl<'a, A: Hash + Eq + Ord + Clone, S: BuildHasher> From<&'a HashSet<A, S>> for OrdSet<A>

fn from(hashset: &HashSet<A, S>) -> Self

Converts to this type from the input type.

impl<'a, A, S> From<&'a OrdSet<A>> for HashSet<A, S> where
    A: Ord + Hash + Eq + Clone,
    S: BuildHasher + Default, 

fn from(ordset: &OrdSet<A>) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + Clone> From<&'a Vec<A, Global>> for OrdSet<A>

fn from(vec: &Vec<A>) -> Self

Converts to this type from the input type.

impl<'s, 'a, A, OA> From<&'s OrdSet<&'a A>> for OrdSet<OA> where
    A: ToOwned<Owned = OA> + Ord + ?Sized,
    OA: Borrow<A> + Ord + Clone, 

fn from(set: &OrdSet<&A>) -> Self

Converts to this type from the input type.

impl<A: Ord + Clone> From<BTreeSet<A, Global>> for OrdSet<A>

fn from(btree_set: BTreeSet<A>) -> Self

Converts to this type from the input type.

impl<A: Eq + Hash + Ord + Clone> From<HashSet<A, RandomState>> for OrdSet<A>

fn from(hash_set: HashSet<A>) -> Self

Converts to this type from the input type.

impl<A: Hash + Eq + Ord + Clone, S: BuildHasher> From<HashSet<A, S>> for OrdSet<A>

fn from(hashset: HashSet<A, S>) -> Self

Converts to this type from the input type.

impl<A, S> From<OrdSet<A>> for HashSet<A, S> where
    A: Ord + Hash + Eq + Clone,
    S: BuildHasher + Default, 

fn from(ordset: OrdSet<A>) -> Self

Converts to this type from the input type.

impl<A: Ord + Clone> From<Vec<A, Global>> for OrdSet<A>

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

Converts to this type from the input type.

impl<A, R> FromIterator<R> for OrdSet<A> where
    A: Ord + Clone + From<R>, 

fn from_iter<T>(i: T) -> Self where
    T: IntoIterator<Item = R>, 

Creates a value from an iterator.

impl<A: Ord + Hash> Hash for OrdSet<A>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'a, A> IntoIterator for &'a OrdSet<A> where
    A: 'a + Ord, 

type Item = &'a A

The type of the elements being iterated over.

type IntoIter = Iter<'a, A>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<A> IntoIterator for OrdSet<A> where
    A: Ord + Clone, 

type Item = A

The type of the elements being iterated over.

type IntoIter = ConsumingIter<A>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, A: Ord + Clone> Mul<&'a OrdSet<A>> for &'a OrdSet<A>

type Output = OrdSet<A>

The resulting type after applying the * operator.

fn mul(self, other: Self) -> Self::Output

Performs the * operation.

impl<A: Ord + Clone> Mul<OrdSet<A>> for OrdSet<A>

type Output = OrdSet<A>

The resulting type after applying the * operator.

fn mul(self, other: Self) -> Self::Output

Performs the * operation.

impl<A: Ord> Ord for OrdSet<A>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

Restrict a value to a certain interval.

impl<A: Ord> PartialEq<OrdSet<A>> for OrdSet<A>

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl<A: Ord> PartialOrd<OrdSet<A>> for OrdSet<A>

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<A: Ord + Clone> Sum<OrdSet<A>> for OrdSet<A>

fn sum<I>(it: I) -> Self where
    I: Iterator<Item = Self>, 

Method which takes an iterator and generates Self from the elements by “summing up” the items.

impl<A: Ord + Eq> Eq for OrdSet<A>