Struct starlark_map::ordered_set::OrderedSet
source · pub struct OrderedSet<T>(/* private fields */);
Expand description
SmallSet
wrapper, but equality and hash of self depends on iteration order.
Implementations§
source§impl<T> OrderedSet<T>
impl<T> OrderedSet<T>
sourcepub const fn new() -> OrderedSet<T>
pub const fn new() -> OrderedSet<T>
Create a new empty set.
sourcepub fn with_capacity(capacity: usize) -> OrderedSet<T>
pub fn with_capacity(capacity: usize) -> OrderedSet<T>
Create a new empty set with the specified capacity.
sourcepub fn get_index_of<Q>(&self, value: &Q) -> Option<usize>
pub fn get_index_of<Q>(&self, value: &Q) -> Option<usize>
Get the index of an element in the set.
sourcepub fn insert_unique_unchecked(&mut self, value: T)where
T: Hash,
pub fn insert_unique_unchecked(&mut self, value: T)where
T: Hash,
Insert an element into the set assuming it is not already present.
sourcepub fn try_insert<'a>(
&'a mut self,
value: T
) -> Result<(), OccupiedError<'a, T>>
pub fn try_insert<'a>( &'a mut self, value: T ) -> Result<(), OccupiedError<'a, T>>
Insert an element if element is not present in the set, otherwise return the element.
Trait Implementations§
source§impl<T: Allocative> Allocative for OrderedSet<T>
impl<T: Allocative> Allocative for OrderedSet<T>
source§impl<T: Clone> Clone for OrderedSet<T>
impl<T: Clone> Clone for OrderedSet<T>
source§fn clone(&self) -> OrderedSet<T>
fn clone(&self) -> OrderedSet<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<T: Debug> Debug for OrderedSet<T>
impl<T: Debug> Debug for OrderedSet<T>
source§impl<T> Default for OrderedSet<T>
impl<T> Default for OrderedSet<T>
source§fn default() -> OrderedSet<T>
fn default() -> OrderedSet<T>
Returns the “default value” for a type. Read more
source§impl<T> Extend<T> for OrderedSet<T>
impl<T> Extend<T> for OrderedSet<T>
source§fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
Extends a collection with the contents of an iterator. Read more
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
🔬This is a nightly-only experimental API. (
extend_one
)Extends a collection with exactly one element.
source§fn extend_reserve(&mut self, additional: usize)
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. Read more
source§impl<T> From<OrderedSet<T>> for SortedSet<T>
impl<T> From<OrderedSet<T>> for SortedSet<T>
source§fn from(inner: OrderedSet<T>) -> SortedSet<T>
fn from(inner: OrderedSet<T>) -> SortedSet<T>
Converts to this type from the input type.
source§impl<T> From<SmallSet<T>> for OrderedSet<T>
impl<T> From<SmallSet<T>> for OrderedSet<T>
source§fn from(set: SmallSet<T>) -> OrderedSet<T>
fn from(set: SmallSet<T>) -> OrderedSet<T>
Converts to this type from the input type.
source§impl<T> FromIterator<T> for OrderedSet<T>
impl<T> FromIterator<T> for OrderedSet<T>
source§fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
Creates a value from an iterator. Read more
source§impl<T: Hash> Hash for OrderedSet<T>
impl<T: Hash> Hash for OrderedSet<T>
source§impl<'a, T> IntoIterator for &'a OrderedSet<T>
impl<'a, T> IntoIterator for &'a OrderedSet<T>
source§impl<T> IntoIterator for OrderedSet<T>
impl<T> IntoIterator for OrderedSet<T>
source§impl<T: Eq + Ord> Ord for OrderedSet<T>
impl<T: Eq + Ord> Ord for OrderedSet<T>
source§impl<T: Eq> PartialEq for OrderedSet<T>
impl<T: Eq> PartialEq for OrderedSet<T>
source§impl<T: Eq + PartialOrd> PartialOrd for OrderedSet<T>
impl<T: Eq + PartialOrd> PartialOrd for OrderedSet<T>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<T: Eq> Eq for OrderedSet<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for OrderedSet<T>where
T: RefUnwindSafe,
impl<T> Send for OrderedSet<T>where
T: Send,
impl<T> Sync for OrderedSet<T>where
T: Sync,
impl<T> Unpin for OrderedSet<T>where
T: Unpin,
impl<T> UnwindSafe for OrderedSet<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.