Struct VecSet 

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

A set backed by a VecMap where the value for each key is ().

Implementations

impl<T: Eq> VecSet<T>

pub fn new() -> Self

Creates a new, empty VecSet

pub fn with_capacity(capacity: usize) -> Self

Creates a VecSet that can hold capacity elements without reallocating

pub const unsafe fn from_map_unchecked(map: VecMap<T, ()>) -> VecSet<T>

Please only use this method to create set literals if the “macros” feature is unavailable to you “macros” provides safe, checked alternatives to initialize linear maps with compile time checking of the invariants of each type.

Creates a new VecSet from the supplied VecMap.

SAFETY: improper use of this method - initializing with duplicate values - will NOT create memory unsafety, but will result in every identical value beyond the first never getting accessed as LinearMaps short circuit on the first match.

pub fn len(&self) -> usize

Returns the number of items in of the set

pub fn is_empty(&self) -> bool

Returns true if the store is empty, false otherwise.

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

Adds a value to the set. If the set did not previously contain this value, true is returned. If the set already contained this value, false is returned, and the set is not modified: original value is not replaced, and the value passed as argument is dropped.

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

Attempts to remove the referenced value from the set, returning None if it is not present.

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

Returns true if the referenced value is in the set, false otherwise.

pub fn into_vec(self) -> Vec<T>

Returns a vector with all the elements in the set.

Trait Implementations

impl<T: Clone + Eq> Clone for VecSet<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Eq> Debug for VecSet<T>

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

Formats the value using the given formatter.

impl<T: Default + Eq> Default for VecSet<T>

fn default() -> VecSet<T>

Returns the “default value” for a type.

impl<T: Hash + Eq> Hash for VecSet<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Ord + Eq> Ord for VecSet<T>

fn cmp(&self, other: &VecSet<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq + Eq> PartialEq for VecSet<T>

fn eq(&self, other: &VecSet<T>) -> 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: PartialOrd + Eq> PartialOrd for VecSet<T>

fn partial_cmp(&self, other: &VecSet<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Eq + Eq> Eq for VecSet<T>

impl<T: Eq> StructuralPartialEq for VecSet<T>