Struct OrdHashSet

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

A std::collections::HashSet ordered using a Vec.

Implementations

impl<T> OrdHashSet<T>

pub fn new() -> Self

Construct a new OrdHashSet.

pub fn with_capacity(capacity: usize) -> Self

Construct a new OrdHashSet with the given capacity.

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

Construct an iterator over the items in this OrdHashSet.

pub fn is_empty(&self) -> bool

Return true if this OrdHashSet is empty.

pub fn len(&self) -> usize

Return the number of items in this OrdHashSet.

impl<T: Eq + Hash + Ord> OrdHashSet<T>

pub fn bisect<Cmp>(&self, cmp: Cmp) -> Option<&T>

where Cmp: Fn(&T) -> Option<Ordering> + Copy,

Bisect this set to match an item using the provided comparison, and return it (if present).

The first item for which the comparison returns Some(Ordering::Equal) will be returned. This method assumes that any partially-ordered items (where cmp(item).is_none()) are ordered at the beginning or end of the set.

pub fn bisect_and_remove<Cmp>(&mut self, cmp: Cmp) -> Option<T>

where Cmp: Fn(&T) -> Option<Ordering> + Copy, T: Debug,

Bisect this set to match and remove an item using the provided comparison.

The first item for which the comparison returns Some(Ordering::Equal) will be returned. This method assumes that any partially-ordered items (where cmp(item).is_none()) are ordered at the beginning and/or end of the set.

pub fn clear(&mut self)

Remove all items from this OrdHashSet.

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

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

Return true if the given item is present in this OrdHashSet.

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

Drain all items from this OrdHashSet.

pub fn drain_while<Cond>(&mut self, cond: Cond) -> DrainWhile<'_, T, Cond>

where Cond: Fn(&T) -> bool,

Drain items from this OrdHashSet while they match the given condition.

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

Consume the given iter and insert all its items into this OrdHashSet

pub fn first(&self) -> Option<&T>

Borrow the first item in this OrdHashSet.

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

Insert an item into this OrdHashSet and return false if it was already present.

pub fn last(&self) -> Option<&T>

Borrow the last item in this OrdHashSet.

pub fn pop_first(&mut self) -> Option<T>

where T: Debug,

Remove and return the first item in this OrdHashSet.

pub fn pop_last(&mut self) -> Option<T>

where T: Debug,

Remove and return the last item in this OrdHashSet.

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

where Arc<T>: Borrow<Q>, Q: Eq + Hash + Ord,

Remove the given item from this OrdHashSet and return true if it was present.

The item may be any borrowed form of T, but the ordering on the borrowed form must match the ordering of T.

pub fn starts_with<'a, I: IntoIterator<Item = &'a T>>( &'a self, other: I, ) -> bool

where T: PartialEq,

Return true if the first elements in this set are equal to those in the given iter.

Trait Implementations

impl<T: Clone + Eq + Hash + Ord + Debug> Clone for OrdHashSet<T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Eq + Hash + Ord + Debug> Debug for OrdHashSet<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash + Ord + Debug> FromIterator<T> for OrdHashSet<T>

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

Creates a value from an iterator.

impl<T: GetSize> GetSize for OrdHashSet<T>

fn get_heap_size(&self) -> usize

Determines how many bytes this object occupies inside the heap.

fn get_stack_size() -> usize

Determines how may bytes this object occupies inside the stack.

fn get_size(&self) -> usize

Determines the total size of the object.

impl<'a, T> IntoIterator for &'a OrdHashSet<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: Debug> IntoIterator for OrdHashSet<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 + Debug> PartialEq for OrdHashSet<T>

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: Eq + Debug> Eq for OrdHashSet<T>