Struct CollectionSet

pub struct CollectionSet<'l, Collection: SetCollection>(CollectionRepr<'l, Collection>);

Available on crate feature collection only.

SetCollection-based implementation.

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

Tuple Fields

0: CollectionRepr<'l, Collection>

Implementations

impl<Collection: SetCollection> CollectionSet<'_, Collection>

fn c_mut(&mut self) -> &mut Collection

A private method for convenient collection mutation

Trait Implementations

impl<Collection: SetCollection> AsRef<Collection> for CollectionSet<'_, Collection>

fn as_ref(&self) -> &Collection

Converts this type into a shared reference of the (usually inferred) input type.

impl<Collection: SetCollection> Borrow<Collection> for CollectionSet<'_, Collection>

fn borrow(&self) -> &Collection

Immutably borrows from an owned value.

impl<Collection: SetCollection + Debug> Debug for CollectionSet<'_, Collection>

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

Formats the value using the given formatter.

impl<Collection: SetCollection> Deref for CollectionSet<'_, Collection>

type Target = Collection

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<Collection: SetCollection> Drop for CollectionSet<'_, Collection>

fn drop(&mut self)

Executes the destructor for this type.

impl<Collection: SetCollection> StackedSet for CollectionSet<'_, Collection>

type Item = <Collection as SetCollection>::Item

Item stored in the set

type Shorten<'new> = CollectionSet<'new, Collection> where Self: 'new

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

type IntoIter<'i> = <Collection as SetCollection>::IntoIter<'i> 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: Self::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