Enum OrderedSet 

pub enum OrderedSet<T: Ord> {
    Simple(List<T>),
    SkipList(SkipList<T, ()>),
}

A concurrent ordered set that automatically chooses the best implementation.

Variants

Simple(List<T>)

For small collections (<100 items)

SkipList(SkipList<T, ()>)

For large collections (≥100 items)

Implementations

impl<T: Ord + Default + Clone> OrderedSet<T>

pub fn new() -> Self

Creates a new ordered set.

Examples

let set = OrderedSet::new();
set.insert(42);
assert!(set.contains(&42));

pub fn with_expected_size(size: usize) -> Self

Creates a set optimized for the expected size.

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

Inserts a value into the set.

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

Returns true if the set contains the value.