Struct HashbrownSetStorage

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

SetStorage for dynamically stored types, using hashbrown::HashSet.

This allows for dynamic types such as &'static str or u32 to be used as a Key.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum MyKey {
    First(u32),
    Second,
}

let mut map = Set::new();
map.insert(MyKey::First(1));
assert_eq!(map.contains(MyKey::First(1)), true);
assert_eq!(map.contains(MyKey::First(2)), false);
assert_eq!(map.contains(MyKey::Second), false);

Trait Implementations

impl<T> Clone for HashbrownSetStorage<T>

where T: Clone,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> PartialEq for HashbrownSetStorage<T>

where T: Eq + Hash,

fn eq(&self, other: &Self) -> 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> SetStorage<T> for HashbrownSetStorage<T>

where T: Copy + Eq + Hash,

type Iter<'this> = Copied<Iter<'this, T>> where T: 'this

Immutable iterator over storage.

type IntoIter = IntoIter<T>

Owning iterator over the storage.

fn empty() -> Self

Construct empty storage.

fn len(&self) -> usize

Get the length of storage.

fn is_empty(&self) -> bool

Check if storage is empty.

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

This is the storage abstraction for Set::insert.

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

This is the storage abstraction for Set::contains.

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

This is the storage abstraction for Set::remove.

fn retain<F>(&mut self, func: F)

where F: FnMut(T) -> bool,

This is the storage abstraction for Set::retain.

fn clear(&mut self)

This is the storage abstraction for Set::clear.

fn iter(&self) -> Self::Iter<'_>

This is the storage abstraction for Set::iter.

fn into_iter(self) -> Self::IntoIter

This is the storage abstraction for Set::into_iter.

impl<T> Eq for HashbrownSetStorage<T>

where T: Eq + Hash,