Struct StackCons

pub struct StackCons<'tail, Item>(ConsRepr<'tail, Item>);

Available on crate feature cons only.

Cons list-like implementation of StackedSet

On my machine, worst time to check for existence is about 2ns/item

Tuple Fields

0: ConsRepr<'tail, Item>

Trait Implementations

impl<Item: PartialEq + Debug> Debug for ConsSet<'_, Item>

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

Formats the value using the given formatter.

impl<Item: PartialEq> StackedSet for ConsSet<'_, Item>

type Item = Item

Item stored in the set

type Shorten<'new> = ConsSet<'new, Item> where Self: 'new

Intended to be the same type, but living for less time

type IntoIter<'i> = ConsIter<'i, Item> where Self: 'i

Iterator type for the set

fn empty() -> Self

Creates an empty set

fn contains_ref(&self, item: &Self::Item) -> bool

Checks if element is present in the set

fn extend(&mut self, new_item: Item) -> Self::Shorten<'_>

Adds an item to the stack, returning a new instance now “containing” the item

fn fork(&mut self) -> Self::Shorten<'_>

Same as StackedSet::extend, but does not actually extend the stackset

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

Returns iterator over the set, no specific order guaranteed

fn contains(&self, item: impl Borrow<Self::Item>) -> bool

Checks if element is present in the set