Struct Set 

pub struct Set<K: Split> { /* private fields */ }

Non-concurrent set.

Implementations

impl<K> Set<K>

where K: Split,

pub const fn new() -> Self

Constructs a new empty set. Does not allocate.

pub fn contains(&self, key: &K::Borrowed) -> bool

Returns true if this set contains key.

Examples

use arctic::sequential;

let mut set = sequential::Set::<[u8; 4]>::new();
let key = [8, 2, 3, 255];
assert!(set.insert(&key), "Key is not present");
assert!(set.contains(&key), "Key is present");

pub fn insert(&mut self, key: K::Insert<'_>) -> bool

Insert key into this set.

Returns true if successful, i.e., the key was not present and was newly inserted.

Examples

use arctic::sequential;

let mut set = sequential::Set::<u128>::new();
assert!(set.insert(5), "Key is not present");
assert!(!set.insert(5), "Key is present");

Trait Implementations

impl<K> Default for Set<K>

where K: Split,

fn default() -> Self

Returns the “default value” for a type.