Struct VecSet 

pub struct VecSet<K: PartialEq> {
    pub inner: Vec<K>,
}

Fields

inner: Vec<K>

Implementations

impl<K: PartialEq> VecSet<K>

pub fn contains(&self, key: &K) -> bool

pub fn insert(&mut self, key: K)

Trait Implementations

impl<K: Clone + PartialEq> Clone for VecSet<K>

fn clone(&self) -> VecSet<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + PartialEq> Debug for VecSet<K>

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

Formats the value using the given formatter.

impl<K: PartialEq> Default for VecSet<K>

fn default() -> Self

Returns the “default value” for a type.

impl<K: PartialEq> FromIterator<K> for VecSet<K>

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

Creates a value from an iterator.

impl<K: PartialEq> IntoIterator for VecSet<K>

type Item = K

The type of the elements being iterated over.

type IntoIter = IntoIter<K>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: PartialEq + PartialEq> PartialEq for VecSet<K>

fn eq(&self, other: &VecSet<K>) -> 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<K: PartialEq> StructuralPartialEq for VecSet<K>