Struct wrappinghashset::WrappingHashSet

pub struct WrappingHashSet<T>
where
    T: Eq + Hash,
{ /* private fields */ }

A hash set that remembers the last key it returned with its iterator it will wrap around and only return all of the keys once per iterator

Important: Prior to version 0.5 all iterators shared the count, so if you only partilaly read one iterator, it would affect the next one. As of 0.5 and forward, the position is remembered, but the count is forgotten. This may break your app if you are depending on the old behavior.

Implementations

impl<T> WrappingHashSet<T>

where T: Eq + Hash + Clone,

pub fn new() -> WrappingHashSet<T>

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

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

pub fn remove<'b>(&mut self, key: &'b T) -> bool

Trait Implementations

impl<T> Debug for WrappingHashSet<T>

where T: Eq + Hash + Debug,

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

Formats the value using the given formatter.