Struct Set

pub struct Set<T>
where
    T: Hash,
{ /* private fields */ }

Implementations

impl<T> Set<T>

where T: Hash + Eq,

pub fn new() -> Self

Create an empty Set. Uses a HashSet internally.

Examples found in repository

examples/simple.rs (line 5)

fn main() {
    // Our set doesn't need to be mutable.
    let set = Set::new();
    // Insert some data.
    set.insert("hello");
    // We now have a refefence to the data we previously inserted.
    let hello = set.get(&"hello").unwrap();
    // We can insert more data despite holding a reference to it.
    set.insert("world");
    assert_eq!(hello, set.get(&"hello").unwrap());
}

pub fn len(&self) -> usize

Returns the number of elements in the set.

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

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

Examples found in repository

examples/simple.rs (line 9)

fn main() {
    // Our set doesn't need to be mutable.
    let set = Set::new();
    // Insert some data.
    set.insert("hello");
    // We now have a refefence to the data we previously inserted.
    let hello = set.get(&"hello").unwrap();
    // We can insert more data despite holding a reference to it.
    set.insert("world");
    assert_eq!(hello, set.get(&"hello").unwrap());
}

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

Adds a value to the set. If the set did not have this value present, true is returned. If the set did have this value present, false is returned.

Examples found in repository

examples/simple.rs (line 7)

fn main() {
    // Our set doesn't need to be mutable.
    let set = Set::new();
    // Insert some data.
    set.insert("hello");
    // We now have a refefence to the data we previously inserted.
    let hello = set.get(&"hello").unwrap();
    // We can insert more data despite holding a reference to it.
    set.insert("world");
    assert_eq!(hello, set.get(&"hello").unwrap());
}

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

where T: Clone,

Inserts the given value into the set if it is not present, then returns a reference to the value in the set. Currently, this implementation uses requires T: Clone, because the feature hash_set_entry isn’t stabilized yet.

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

Returns true if the set contains a value.