Struct VecSet 

pub struct VecSet<T> { /* private fields */ }

Implementations

impl<T> VecSet<T>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn capacity(&self) -> usize

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&T) -> bool,

pub fn clear(&mut self)

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

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

pub fn shrink_to_fit(&mut self)

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

impl<T> VecSet<T>

where T: Eq,

pub fn difference<'a>(&'a self, other: &'a Self) -> Difference<'a, T>

pub fn symmetric_difference<'a>( &'a self, other: &'a VecSet<T>, ) -> SymmetricDifference<'a, T>

pub fn intersection<'a>(&'a self, other: &'a Self) -> Intersection<'a, T>

pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, T>

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

where T: Borrow<Q>, Q: Eq + ?Sized,

pub fn get<Q>(&self, value: &Q) -> Option<&T>

where T: Borrow<Q>, Q: Eq + ?Sized,

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

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

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

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

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

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

where T: Borrow<Q>, Q: Eq + ?Sized,

Trait Implementations

impl<T> BitAnd<&VecSet<T>> for &VecSet<T>

where T: Eq + Clone,

type Output = VecSet<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: &VecSet<T>) -> Self::Output

Performs the & operation.

impl<T> BitOr<&VecSet<T>> for &VecSet<T>

where T: Eq + Clone,

type Output = VecSet<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &VecSet<T>) -> Self::Output

Performs the | operation.

impl<T> BitXor<&VecSet<T>> for &VecSet<T>

where T: Eq + Clone,

type Output = VecSet<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &VecSet<T>) -> Self::Output

Performs the ^ operation.

impl<T> Clone for VecSet<T>

where T: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for VecSet<T>

where T: Debug + Eq,

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

Formats the value using the given formatter.

impl<T> Default for VecSet<T>

where T: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T> Extend<&'a T> for VecSet<T>

where T: 'a + Eq + Copy,

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for VecSet<T>

where T: Eq,

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, const N: usize> From<[T; N]> for VecSet<T>

where T: Eq,

fn from(value: [T; N]) -> Self

Converts to this type from the input type.

impl<T> FromIterator<T> for VecSet<T>

where T: Eq,

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

Creates a value from an iterator.

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

where T: Eq,

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Sub<&VecSet<T>> for &VecSet<T>

where T: Eq + Clone,

type Output = VecSet<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &VecSet<T>) -> Self::Output

Performs the - operation.

impl<T> Eq for VecSet<T>

where T: Eq,