Struct starlark_map::ordered_set::OrderedSet

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

SmallSet wrapper, but equality and hash of self depends on iteration order.

Implementations

impl<T> OrderedSet<T>

pub const fn new() -> OrderedSet<T>

Create a new empty set.

pub fn with_capacity(capacity: usize) -> OrderedSet<T>

Create a new empty set with the specified capacity.

pub fn len(&self) -> usize

Get the number of elements in the set.

pub fn is_empty(&self) -> bool

Check if the set is empty.

pub fn get<Q>(&self, value: &Q) -> Option<&T>

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

Get an element from the set.

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

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

Check if the set contains an element.

pub fn get_index(&self, index: usize) -> Option<&T>

Get an element by index.

pub fn get_index_of<Q>(&self, value: &Q) -> Option<usize>

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

Get the index of an element in the set.

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

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

Remove an element from the set.

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

Iterate over the elements.

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

Get the first element.

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

Get the last element.

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

where T: Hash + Eq,

Insert an element into the set.

pub fn insert_unique_unchecked(&mut self, value: T)

where T: Hash,

Insert an element into the set assuming it is not already present.

pub fn try_insert<'a>( &'a mut self, value: T ) -> Result<(), OccupiedError<'a, T>>

where T: Hash + Eq,

Insert an element if element is not present in the set, otherwise return the element.

pub fn clear(&mut self)

Clear the set.

pub fn sort(&mut self)

where T: Ord,

Sort the set.

pub fn union<'a>(&'a self, other: &'a Self) -> impl Iterator<Item = &'a T>

where T: Eq + Hash,

Iterate over the union of two sets.

pub fn reverse(&mut self)

Reverse the iteration order of the set.

Trait Implementations

impl<T: Allocative> Allocative for OrderedSet<T>

fn visit<'allocative_a, 'allocative_b: 'allocative_a>( &self, visitor: &'allocative_a mut Visitor<'allocative_b> )

impl<T: Clone> Clone for OrderedSet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for OrderedSet<T>

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

Formats the value using the given formatter.

impl<T> Default for OrderedSet<T>

fn default() -> OrderedSet<T>

Returns the “default value” for a type.

impl<T> Extend<T> for OrderedSet<T>

where T: Eq + Hash,

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> From<OrderedSet<T>> for SortedSet<T>

where T: Eq + Ord + Hash,

fn from(inner: OrderedSet<T>) -> SortedSet<T>

Converts to this type from the input type.

impl<T> From<SmallSet<T>> for OrderedSet<T>

fn from(set: SmallSet<T>) -> OrderedSet<T>

Converts to this type from the input type.

impl<T> FromIterator<T> for OrderedSet<T>

where T: Eq + Hash,

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

Creates a value from an iterator.

impl<T: Hash> Hash for OrderedSet<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<'a, T> IntoIterator for &'a OrderedSet<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> IntoIterator for OrderedSet<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: Eq + Ord> Ord for OrderedSet<T>

fn cmp(&self, other: &Self) -> 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 + PartialOrd,

Restrict a value to a certain interval.

impl<T: Eq> PartialEq for OrderedSet<T>

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq + PartialOrd> PartialOrd for OrderedSet<T>

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

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: Eq> Eq for OrderedSet<T>