Struct starlark_map::sorted_set::SortedSet

pub struct SortedSet<T: Eq + Hash> { /* private fields */ }

An immutable SmallSet with values guaranteed to be sorted.

Implementations

impl<T> SortedSet<T>

where T: Eq + Ord + Hash,

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

Construct an empty SortedSet.

pub fn new_unchecked(inner: OrderedSet<T>) -> Self

Construct without checking that the elements are sorted.

pub fn len(&self) -> usize

Return the number of elements in the set.

pub fn is_empty(&self) -> bool

Check if the set is empty.

pub fn iter(&self) -> impl ExactSizeIterator<Item = &T>

Iterate over the elements.

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

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

Get the element in the set.

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

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

Check if the set contains the given value.

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

Get the element at the given index.

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

Iterate over the union of two sets.

Trait Implementations

impl<T: Eq + Hash + Allocative> Allocative for SortedSet<T>

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

impl<T: Clone + Eq + Hash> Clone for SortedSet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Eq + Hash> Debug for SortedSet<T>

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

Formats the value using the given formatter.

impl<T> Default for SortedSet<T>

where T: Eq + Ord + Hash,

fn default() -> Self

Returns the “default value” for a type.

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 SortedSet<T>

where T: Eq + Ord + Hash,

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

Converts to this type from the input type.

impl<T> From<SortedVec<T>> for SortedSet<T>

where T: Eq + Ord + Hash,

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

Converts to this type from the input type.

impl<T> FromIterator<T> for SortedSet<T>

where T: Eq + Ord + Hash,

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

Creates a value from an iterator.

impl<T: Hash + Eq + Hash> Hash for SortedSet<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 SortedSet<T>

where T: Eq + Ord + Hash,

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 SortedSet<T>

where T: Eq + Ord + Hash,

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: Ord + Eq + Hash> Ord for SortedSet<T>

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

Restrict a value to a certain interval.

impl<T: PartialEq + Eq + Hash> PartialEq for SortedSet<T>

fn eq(&self, other: &SortedSet<T>) -> 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: PartialOrd + Eq + Hash> PartialOrd for SortedSet<T>

fn partial_cmp(&self, other: &SortedSet<T>) -> 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 + Hash> Eq for SortedSet<T>

impl<T: Eq + Hash> StructuralPartialEq for SortedSet<T>