Struct VecSet

pub struct VecSet<T>(/* private fields */);

An set of items stored in order in a Vec.

This is always efficient for small sizes of sets, and efficient for large sizes when insertion is not needed (i.e. items are placed into the set in bulk).

Implementations

impl<T: Eq + PartialEq + Ord + PartialOrd> VecSet<T>

pub fn new() -> Self

Create a new, empty instance.

pub fn from_sorted(v: Vec<T>) -> Result<Self, ()>

Create a new instance from a sorted Vec.

Returns Ok with an instance containing the same items as v, or Err if v is unsorted.

pub fn len(&self) -> usize

Return the number of items this set contains.

pub fn is_empty(&self) -> bool

Return true if this set is empty.

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

Compares the items in two sets.

Returns true iff every item in the set is not found in other.

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

Return an iterator over the items in this set in order.

pub fn map<U>(self, f: impl FnMut(T) -> U) -> Vec<U>

Consume this set and return a Vec of transformed items.

Returns the Vec of the resultant values of applying f to each item in the set in order.

pub fn map_ref<U>(&self, f: impl FnMut(&T) -> U) -> Vec<U>

Transform all items by reference and return a Vec with the results.

Returns the Vec of the resultant values of applying f to each item by reference in the set in order.

pub fn to_vec(&self) -> Vec<T>

where T: Clone,

Return a Vec of sorted items by cloning this set.

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

Return a Vec of sorted items by consuming this set.

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

Insert item into the set.

Inserts some item t into the set.

Returns true iff the item was not already in the set.

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

Insert multiple items from an iterator.

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

Check if a value is in the set.

Returns true iff the set contains a value equal to t.

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

Remove an item from the set.

Removes the item equal to t from the set.

Returns Some with the removed item if it was previously in the set.

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

Filter items from the set.

Removes all items from the set for which f returns false.

Trait Implementations

impl<T> AsMut<[T]> for VecSet<T>

fn as_mut(&mut self) -> &mut [T]

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsRef<[T]> for VecSet<T>

fn as_ref(&self) -> &[T]

Converts this type into a shared reference of the (usually inferred) input type.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<T: Decode + Eq + PartialEq + Ord + PartialOrd> Decode for VecSet<T>

fn decode<I: Input>(input: &mut I) -> Result<Self, DecodeError>

Attempt to deserialise the value from input.

fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self>, ) -> Result<DecodeFinished, Error>

where I: Input,

Attempt to deserialize the value from input into a pre-allocated piece of memory.

fn skip<I>(input: &mut I) -> Result<(), Error>

where I: Input,

Attempt to skip the encoded value from input.

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type.

impl<T: Default + Eq + PartialEq + Ord + PartialOrd> Default for VecSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Display> Display for VecSet<T>

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

Formats the value using the given formatter.

impl<T> Encode for VecSet<T>

where Vec<T>: Encode,

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding.

fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy, )

Convert self to a slice and append it to the destination.

fn encode(&self) -> Vec<u8>

Convert self to an owned vector.

fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback: FnOnce(&[u8]) -> __CodecOutputReturn>( &self, f: __CodecUsingEncodedCallback, ) -> __CodecOutputReturn

Convert self to a slice and then invoke the given closure with it.

fn encoded_size(&self) -> usize

Calculates the encoded size.

impl<T: Eq + PartialEq + Ord + PartialOrd> Extend<T> for VecSet<T>

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: Eq + PartialEq + Ord + PartialOrd> From<Vec<T>> for VecSet<T>

fn from(v: Vec<T>) -> Self

Converts to this type from the input type.

impl<T> From<VecSet<T>> for Vec<T>

fn from(s: VecSet<T>) -> Vec<T>

Converts to this type from the input type.

impl<T: Eq + PartialEq + Ord + PartialOrd> FromIterator<T> for VecSet<T>

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

Creates a value from an iterator.

impl<T: Eq + PartialEq + Ord + PartialOrd> IntoIterator for VecSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = <Vec<T> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> 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> 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> 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 + PartialEq + Ord + PartialOrd> SetLike<T> for VecSet<T>

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

Insert item into the set.

fn extend(&mut self, iter: impl Iterator<Item = T>)

Insert multiple items from an iterator.

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

Check if a value is in the set.

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

Remove an item from the set.

impl<T> EncodeLike for VecSet<T>

where Vec<T>: Encode,

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

impl<T> StructuralPartialEq for VecSet<T>