Struct map_vec::set::Set

pub struct Set<T> { /* fields omitted */ }

map_vec::Set is a data structure with a Set-like API but based on a Vec. It's primarily useful when you care about constant factors or prefer determinism to speed. Please refer to the docs for Set for details and examples of the Set API.

Example

fn main() {
  let mut set1 = map_vec::Set::new();
  let mut set2 = map_vec::Set::new();
  set1.insert(1);
  set1.insert(2);
  set2.insert(2);
  set2.insert(3);
  let mut set3 = map_vec::Set::with_capacity(1);
  assert!(set3.insert(3));
  assert_eq!(&set2 - &set1, set3);
}

Methods

impl<T: Eq> Set<T>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn capacity(&self) -> usize

pub fn clear(&mut self)

pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool where
    T: Borrow<Q>,
    Q: Eq, 

pub fn difference<'a>(
    &'a self,
    other: &'a Self
) -> impl Iterator<Item = &'a T> + DoubleEndedIterator

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

pub fn get<Q: ?Sized>(&self, value: &Q) -> Option<&T> where
    T: Borrow<Q>,
    Q: Eq, 

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

pub fn get_or_insert_with<Q: ?Sized>(
    &mut self,
    value: &Q,
    f: impl FnOnce(&Q) -> T
) -> &T where
    T: Borrow<Q>,
    Q: Eq, 

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

pub fn intersection<'a>(
    &'a self,
    other: &'a Self
) -> impl Iterator<Item = &'a T> + DoubleEndedIterator<Item = &'a T>

pub fn is_disjoint<'a>(&'a self, other: &'a Self) -> bool

pub fn is_empty(&self) -> bool

pub fn is_subset(&self, other: &Self) -> bool

pub fn is_superset(&self, other: &Self) -> bool

pub fn iter(
    &self
) -> impl Iterator<Item = &T> + DoubleEndedIterator + ExactSizeIterator

pub fn len(&self) -> usize

pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool where
    T: Borrow<Q>,
    Q: Eq, 

pub fn replace(&mut self, value: T) -> Option<T>

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

pub fn retain(&mut self, f: impl FnMut(&T) -> bool)

pub fn shrink_to(&mut self, min_capacity: usize)

pub fn shrink_to_fit(&mut self)

pub fn symmetric_difference<'a>(
    &'a self,
    other: &'a Self
) -> impl Iterator<Item = &'a T> + DoubleEndedIterator

pub fn take<Q: ?Sized>(&mut self, value: &Q) -> Option<T> where
    T: Borrow<Q>,
    Q: Eq, 

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

pub fn union<'a>(
    &'a self,
    other: &'a Self
) -> impl Iterator<Item = &'a T> + DoubleEndedIterator

Trait Implementations

impl<T: Debug> Debug for Set<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq<Set<T>> for Set<T>

fn eq(&self, other: &Set<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Set<T>) -> bool

This method tests for !=.

impl<T: Eq> Eq for Set<T>

impl<'_, '_, T: Clone + Eq> Sub<&'_ Set<T>> for &'_ Set<T>

type Output = Set<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &Set<T>) -> Set<T>

Performs the - operation.

impl<'_, '_, T: Clone + Eq> BitAnd<&'_ Set<T>> for &'_ Set<T>

type Output = Set<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: &Set<T>) -> Set<T>

Performs the & operation.

impl<'_, '_, T: Clone + Eq> BitOr<&'_ Set<T>> for &'_ Set<T>

type Output = Set<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &Set<T>) -> Set<T>

Performs the | operation.

impl<'_, '_, T: Clone + Eq> BitXor<&'_ Set<T>> for &'_ Set<T>

type Output = Set<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &Set<T>) -> Set<T>

Performs the ^ operation.

impl<'a, T> IntoIterator for &'a Set<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?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Set<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Eq> FromIterator<T> for Set<T>

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

Creates a value from an iterator.

impl<T: Eq> Extend<T> for Set<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

impl<'a, T: 'a + Copy + Eq> Extend<&'a T> for Set<T>

fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

impl<T: Clone> Clone for Set<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Default> Default for Set<T>

fn default() -> Set<T>

Returns the "default value" for a type.

impl<T> Serialize for Set<T> where
    T: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<'de, T> Deserialize<'de> for Set<T> where
    T: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.