Struct rustifact::OrderedSet

pub struct OrderedSet<T: 'static>(_);

An order-preserving immutable set with lookup via a perfect hash function.

Constructable at compile time with a BuildOrderedSet. Unlike a Set, iteration order is guaranteed to match the definition order.

Internally, this is a wrapper for phf::OrderedSet from the excellent phf crate.

This API requires the following crate feature to be activated: set

Implementations

impl<T> OrderedSet<T>

pub const fn len(&self) -> usize

pub const fn is_empty(&self) -> bool

pub fn contains<U>(&self, value: &U) -> boolwhere U: PhfHash + Eq + ?Sized, T: PhfBorrow<U>,

pub fn get_key<U>(&self, value: &U) -> Option<&T>where U: PhfHash + Eq + ?Sized, T: PhfBorrow<U>,

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

pub const fn init_raw(set: OrderedSet<T>) -> OrderedSet<T>

An implementation detail. You shouldn’t need to call this function.