Struct tinyset::tinyset::TinySet

pub struct TinySet<T: HasInvalid> { /* fields omitted */ }

A set implemented for types that have an invalid value and can be quickly hashed to a u32.

This set stores two elements without heap allocation, and otherwise will store the set using a Robin Hood hash table, but with the hashes not being stored to save space.

Methods

impl<T: HasInvalid> TinySet<T>

pub fn default() -> TinySet<T>

Creates an empty set..

pub fn new() -> TinySet<T>

Creates an empty set..

pub fn with_capacity(cap: usize) -> TinySet<T>

Creates an empty set with the specified capacity.

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted in the set. The collection may reserve more space to avoid frequent reallocations.

pub fn insert(&mut self, elem: 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.

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

Returns true if the set contains a value.

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

Removes an element, and returns true if that element was present.

Important traits for Iter<'a, T>

impl<'a, T: 'a + HasInvalid> Iterator for Iter<'a, T> type Item = &'a T;

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

Returns an iterator over the set.

Important traits for IntoIter<T>

impl<T: HasInvalid> Iterator for IntoIter<T> type Item = T;

pub fn drain(&mut self) -> IntoIter<T>

Clears the set, returning all elements in an iterator.

Trait Implementations

impl<T: Clone + HasInvalid> Clone for TinySet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, T: HasInvalid> IntoIterator for &'a TinySet<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

Important traits for Iter<'a, T>

impl<'a, T: 'a + HasInvalid> Iterator for Iter<'a, T> type Item = &'a T;

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value.

impl<T: Debug + HasInvalid> Debug for TinySet<T>

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

Formats the value using the given formatter.

impl<T: HasInvalid> FromIterator<T> for TinySet<T>

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

Creates a value from an iterator.