Struct fixed_map::Set

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

A fixed set with storage specialized through the Key trait.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Part {
    One,
    Two,
}

#[derive(Clone, Copy, Key)]
enum Key {
    Simple,
    Composite(Part),
    String(&'static str),
    Number(u32),
    Singleton(()),
    Option(Option<Part>),
    Boolean(bool),
}

let mut set = Set::new();

set.insert(Key::Simple);
set.insert(Key::Composite(Part::One));
set.insert(Key::String("foo"));
set.insert(Key::Number(1));
set.insert(Key::Singleton(()));
set.insert(Key::Option(None));
set.insert(Key::Option(Some(Part::One)));
set.insert(Key::Boolean(true));

assert!(set.contains(Key::Simple));
assert!(set.contains(Key::Composite(Part::One)));
assert!(!set.contains(Key::Composite(Part::Two)));
assert!(set.contains(Key::String("foo")));
assert!(!set.contains(Key::String("bar")));
assert!(set.contains(Key::Number(1)));
assert!(!set.contains(Key::Number(2)));
assert!(set.contains(Key::Singleton(())));
assert!(set.contains(Key::Option(None)));
assert!(set.contains(Key::Option(Some(Part::One))));
assert!(!set.contains(Key::Option(Some(Part::Two))));
assert!(set.contains(Key::Boolean(true)));
assert!(!set.contains(Key::Boolean(false)));

Implementations

impl<T> Set<T>where
    T: Key,

A set implementation that uses fixed storage.

Examples

use fixed_map::{Key, Set};

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

let mut m = Set::new();
m.insert(Key::First);

assert_eq!(m.contains(Key::First), true);
assert_eq!(m.contains(Key::Second), false);

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Part {
    A,
    B,
}

#[derive(Clone, Copy, Key)]
enum Key {
    Simple,
    Composite(Part),
}

let mut m = Set::new();
m.insert(Key::Simple);
m.insert(Key::Composite(Part::A));

assert_eq!(m.contains(Key::Simple), true);
assert_eq!(m.contains(Key::Composite(Part::A)), true);
assert_eq!(m.contains(Key::Composite(Part::B)), false);

pub fn new() -> Set<T>

Creates an empty Set.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Key {
    One,
    Two,
}

let set: Set<Key> = Set::new();

pub fn iter(&self) -> Iter<'_, T>

An iterator visiting all values in arbitrary order. The iterator element type is T.

Examples

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, PartialEq, Eq, Key)]
enum Key {
    One,
    Two,
    Three,
}

let mut set = Set::new();
set.insert(Key::One);
set.insert(Key::Two);

assert_eq!(set.iter().collect::<Vec<_>>(), vec![Key::One, Key::Two]);

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

Returns true if the set currently contains the given value.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Key {
    One,
    Two,
}

let mut set = Set::new();
set.insert(Key::One);
assert_eq!(set.contains(Key::One), true);
assert_eq!(set.contains(Key::Two), false);

pub fn insert(&mut 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

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Key {
    One,
    Two,
}

let mut set = Set::new();
assert!(set.insert(Key::One));
assert!(!set.is_empty());

set.insert(Key::Two);
assert!(!set.insert(Key::Two));
assert!(set.contains(Key::Two));

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

Removes a value from the set. Returns true if the value was present in the set.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Key {
    One,
    Two,
}

let mut set = Set::new();
set.insert(Key::One);
assert_eq!(set.remove(Key::One), true);
assert_eq!(set.remove(Key::One), false);

pub fn retain<F>(&mut self, f: F)where
    F: FnMut(T) -> bool,

Retains only the elements specified by the predicate.

In other words, remove all elements e for which f(e) returns false. The elements are visited in unsorted (and unspecified) order.

Examples

use fixed_map::{Key, Set};

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

let mut set = Set::new();

set.insert(Key::First);
set.insert(Key::Second);

set.retain(|k| matches!(k, Key::First));

assert_eq!(set.len(), 1);
assert_eq!(set.contains(Key::First), true);
assert_eq!(set.contains(Key::Second), false);

Using a composite key:

use fixed_map::{Key, Set};

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

let mut set = Set::new();

set.insert(Key::First(true));
set.insert(Key::First(false));
set.insert(Key::Second(true));
set.insert(Key::Second(false));

let mut other = set.clone();
assert_eq!(set.len(), 4);

set.retain(|k| matches!(k, Key::First(true) | Key::Second(true)));

assert_eq!(set.len(), 2);
assert_eq!(set.contains(Key::First(true)), true);
assert_eq!(set.contains(Key::First(false)), false);
assert_eq!(set.contains(Key::Second(true)), true);
assert_eq!(set.contains(Key::Second(false)), false);

other.retain(|k| matches!(k, Key::First(_)));

assert_eq!(other.len(), 2);
assert_eq!(other.contains(Key::First(true)), true);
assert_eq!(other.contains(Key::First(false)), true);
assert_eq!(other.contains(Key::Second(true)), false);
assert_eq!(other.contains(Key::Second(false)), false);

pub fn clear(&mut self)

Clears the set, removing all values.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Key {
    One,
    Two,
}

let mut set = Set::new();
set.insert(Key::One);
set.clear();
assert!(set.is_empty());

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

Examples

use fixed_map::{Key, Set};

#[derive(Clone, Copy, Key)]
enum Key {
    One,
    Two,
}

let mut set = Set::new();
assert!(set.is_empty());
set.insert(Key::One);
assert!(!set.is_empty());

pub fn len(&self) -> usize

Returns the number of elements in the set.

Examples

use fixed_map::{Key, Set};

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

let mut set = Set::new();
assert_eq!(set.len(), 0);
set.insert(Key::First);
assert_eq!(set.len(), 1);

Trait Implementations

impl<T> Clone for Set<T>where
    T: Key,
    T::SetStorage: Clone,

Clone implementation for a Set.

Examples

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Key)]
enum Key {
    First(bool),
    Second,
}

let mut a = Set::new();
a.insert(Key::First(true));
let mut b = a.clone();
b.insert(Key::Second);

assert_ne!(a, b);

assert!(a.contains(Key::First(true)));
assert!(!a.contains(Key::Second));

assert!(b.contains(Key::First(true)));
assert!(b.contains(Key::Second));

fn clone(&self) -> Set<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Set<T>where
    T: Key + Debug,

The Debug implementation for a Set.

Examples

use fixed_map::{Key, Set};

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

let mut a = Set::new();
a.insert(Key::First);

assert_eq!("{First}", format!("{:?}", a));

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Default for Set<T>where
    T: Key,

The Default implementation for a Set produces an empty set.

Examples

use fixed_map::{Key, Set};

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

let a = Set::<Key>::default();
let b = Set::<Key>::new();

assert_eq!(a, b);

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for Set<T>where
    T: Key + Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
    D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> FromIterator<T> for Set<T>where
    T: Key,

fn from_iter<I>(iter: I) -> Selfwhere
    I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T> Hash for Set<T>where
    T: Key,
    T::SetStorage: Hash,

Hash implementation for a Set.

Examples

use std::collections::HashSet;

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Hash, Key)]
enum Key {
    First,
    Second,
}

let mut a = Set::new();
a.insert(Key::First);

let mut set = HashSet::new();
set.insert(a);

Using a composite key:

use std::collections::HashSet;

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Hash, Key)]
enum Key {
    First(bool),
    Second,
}

let mut a = Set::new();
a.insert(Key::First(true));

// TODO: support this
// let mut set = HashSet::new();
// set.insert(a);

fn hash<H>(&self, state: &mut H)where
    H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T> IntoIterator for &'a Set<T>where
    T: Key,

type Item = T

The type of the elements being iterated over.

type IntoIter = <<T as Key>::SetStorage as SetStorage<T>>::Iter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Set<T>where
    T: Key,

Produce an owning iterator which iterates over all elements in the set in order.

Examples

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, PartialEq, Eq, Key)]
enum Key {
    First,
    Second,
    Third,
}

let mut set = Set::new();
set.insert(Key::First);
set.insert(Key::Second);

assert_eq!(set.into_iter().collect::<Vec<_>>(), vec![Key::First, Key::Second]);

fn into_iter(self) -> Self::IntoIter

An iterator visiting all values in arbitrary order. The iterator element type is T.

Examples

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, PartialEq, Eq, Key)]
enum Key {
    One,
    Two,
    Three,
}

let mut set = Set::new();
set.insert(Key::One);
set.insert(Key::Two);

assert_eq!(set.into_iter().collect::<Vec<_>>(), vec![Key::One, Key::Two]);

type Item = T

The type of the elements being iterated over.

type IntoIter = <<T as Key>::SetStorage as SetStorage<T>>::IntoIter

Which kind of iterator are we turning this into?

impl<T> Ord for Set<T>where
    T: Key,
    T::SetStorage: Ord,

Ord implementation for a Set.

For more details on ordering, see the Key documentation.

Examples

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Hash, Key)]
enum Key {
    First,
    Second,
}

let mut a = Set::new();
a.insert(Key::First);

let mut b = Set::new();
b.insert(Key::Second);

let mut list = vec![b, a];
list.sort();

assert_eq!(list, [a, b]);

Using a composite key:

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Hash, Key)]
enum Key {
    First(bool),
    Second,
}

let mut a = Set::new();
a.insert(Key::First(true));

let mut b = Set::new();
b.insert(Key::Second);

// TODO: support this
// let mut list = vec![a, b];
// list.sort();

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<T> PartialEq<Set<T>> for Set<T>where
    T: Key,
    T::SetStorage: PartialEq,

PartialEq implementation for a Set.

Examples

use fixed_map::{Key, Set};

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

let mut a = Set::new();
a.insert(Key::First);
// Note: `a` is Copy since it's using a simple key.
let mut b = a;

assert_eq!(a, b);

b.insert(Key::Second);
assert_ne!(a, b);

Using a composite key:

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Key)]
enum Key {
    First(bool),
    Second,
}

let mut a = Set::new();
a.insert(Key::First(true));
let mut b = a.clone();

assert_eq!(a, b);

b.insert(Key::Second);
assert_ne!(a, b);

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> PartialOrd<Set<T>> for Set<T>where
    T: Key,
    T::SetStorage: PartialOrd,

PartialOrd implementation for a Set.

For more details on ordering, see the Key documentation.

Examples

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Hash, Key)]
enum Key {
    First,
    Second,
    Third,
}

let mut a = Set::new();
a.insert(Key::First);

let mut b = Set::new();
b.insert(Key::Third);

assert!(a < b);

let mut empty = Set::new();
assert!(empty < a);
assert!(empty < b);

Using a composite key:

use fixed_map::{Key, Set};

#[derive(Debug, Clone, Copy, Hash, Key)]
enum Key {
    First(bool),
    Second,
}

let mut a = Set::new();
a.insert(Key::First(true));

let mut b = Set::new();
b.insert(Key::Second);

// TODO: support this
// assert!(a < b);

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Self) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Self) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Self) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Self) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Serialize for Set<T>where
    T: Key + Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>where
    S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> Copy for Set<T>where
    T: Key,
    T::SetStorage: Copy,

The Copy implementation for a Set depends on its Key. If the derived key only consists of unit variants the corresponding Set will be Copy as well.

Examples

use fixed_map::{Key, Set};

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

let mut a = Set::new();
a.insert(Key::First);
let mut b = a;
b.insert(Key::Second);

assert_ne!(a, b);

assert!(a.contains(Key::First));
assert!(!a.contains(Key::Second));

assert!(b.contains(Key::First));
assert!(b.contains(Key::Second));

impl<T> Eq for Set<T>where
    T: Key,
    T::SetStorage: Eq,