Struct OrderedSet

pub struct OrderedSet<T>
where
    T: Eq + PartialEq + Hash + Clone,
{ /* private fields */ }

Implementations

impl<T> OrderedSet<T>

where T: Eq + PartialEq + Hash + Clone,

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

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

pub fn try_insert_at_position(&mut self, index: usize, value: T) -> bool

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

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

pub fn is_empty(&self) -> bool

Trait Implementations

impl<T> Clone for OrderedSet<T>

where T: Clone + Eq + PartialEq + Hash,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for OrderedSet<T>

where T: Debug + Eq + PartialEq + Hash + Clone,

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

Formats the value using the given formatter.

impl<T> Default for OrderedSet<T>

where T: Default + Eq + PartialEq + Hash + Clone,

fn default() -> OrderedSet<T>

Returns the “default value” for a type.

impl<'a, T> IntoIterator for &'a OrderedSet<T>

where T: Eq + PartialEq + Hash + Clone,

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) -> <&'a OrderedSet<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> PartialEq for OrderedSet<T>

where T: Eq + PartialEq + Hash + Clone,

fn eq(&self, other: &OrderedSet<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.