Struct UnorderedSet 

pub struct UnorderedSet<T: Hash + Eq> { /* private fields */ }

O(1) Unordered set using hash table

• Insert: O(1) average
• Remove: O(1) average
• Contains: O(1) average

Implementations

impl<T: Hash + Eq> UnorderedSet<T>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

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

Insert item - O(1) average

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

Check if contains - O(1) average

pub fn remove(&self, item: &T) -> bool

Remove item - O(1) average

pub fn len(&self) -> usize

Trait Implementations

impl<T: Hash + Eq> Drop for UnorderedSet<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send + Hash + Eq> Send for UnorderedSet<T>

impl<T: Send + Sync + Hash + Eq> Sync for UnorderedSet<T>