Struct starlark::collections::SmallSet

source · [−]

pub struct SmallSet<T>(_);

Expand description

An memory-efficient set with determinstic order, based on SmallMap.

Implementations

source

impl<T> SmallSet<T>

source

pub const fn new() -> Self

Creates an empty SmallSet.

source

pub fn with_capacity(n: usize) -> Self

Empty small set with preallocated capacity.

source

pub fn capacity(&self) -> usize

Current capacity of the set.

source

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

Iterate the element references.

source

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

Convert the set into the iterator over the elements.

source

pub fn insert(&mut self, key: T) -> bool where
T: Hash + Eq,

Insert the element into the set.

Return true iff the element was inserted.

source

pub fn get<Q>(&self, value: &Q) -> Option<&T> where
Q: Hash + Equivalent<T> + ?Sized,
T: Eq,

Return a reference to the value stored in the set, if it is present, else None.

Computes in O(1) time (average).

source

pub fn get_index_of<Q>(&self, value: &Q) -> Option<usize> where
Q: Hash + Equivalent<T> + ?Sized,
T: Eq,

Return item index, if it exists in the set

source

pub fn remove<Q>(&mut self, key: &Q) where
Q: ?Sized + Hash + Equivalent<T>,
T: Eq,

Remove the element from the set if it is present.

source

pub fn take<Q>(&mut self, key: &Q) -> Option<T> where
Q: ?Sized + Hash + Equivalent<T>,
T: Eq,

Remove the element from the set if it is present,

and return the removed element.

source

pub fn pop(&mut self) -> Option<T> where
T: Eq,

Remove the last element from the set.

source

pub fn is_empty(&self) -> bool

Is the set empty?

source

pub fn len(&self) -> usize

Number of elements in the set.

source

pub fn contains<Q>(&self, key: &Q) -> bool where
Q: Hash + Equivalent<T> + ?Sized,
T: Eq,

Check if the set contains an element.

source

pub fn clear(&mut self)

Remove all elements from the set.

Retain the capacity.

Trait Implementations

source

impl<T: Clone> Clone for SmallSet<T>

source

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

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<T: Debug> Debug for SmallSet<T>

source

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

Formats the value using the given formatter. Read more

source

impl<T> Default for SmallSet<T>

source

fn default() -> Self

Returns the “default value” for a type. Read more

source

impl<T> FromIterator<T> for SmallSet<T> where
T: Hash + Eq,

source

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

Creates a value from an iterator. Read more

source

impl<T: Hash> Hash for SmallSet<T>

source

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

Feeds a slice of this type into the given Hasher. Read more

source

impl<T> Ord for SmallSet<T> where
T: Ord,

source

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 · source

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values. Read more

1.21.0 · source

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

source

impl<T> PartialEq<SmallSet<T>> for SmallSet<T> where
T: Eq,

source

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

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

1.0.0 · source

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

This method tests for !=.

source

impl<T> PartialOrd<SmallSet<T>> for SmallSet<T> where
T: PartialOrd + Eq,

source

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

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

1.0.0 · source

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

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

1.0.0 · source

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 more

1.0.0 · source

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

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

1.0.0 · source

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

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

source

impl<T> Eq for SmallSet<T> where
T: Eq,

Auto Trait Implementations

impl<T> RefUnwindSafe for SmallSet<T> where
T: RefUnwindSafe,

impl<T> Send for SmallSet<T> where
T: Send,

impl<T> Sync for SmallSet<T> where
T: Sync,

impl<T> Unpin for SmallSet<T> where
T: Unpin,

impl<T> UnwindSafe for SmallSet<T> where
T: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> AsARef<T> for T where
T: ?Sized,

source

fn as_aref(this: &T) -> ARef<'_, T>

Get an ARef pointing at this type.

source

fn try_as_aref(this: &T) -> Result<ARef<'_, T>, BorrowError>

Try and get an ARef pointing at this type. Returns an Err if the type Self is a RefCell which is already mutably borrowed. Read more

source

fn as_ref_cell(_this: &T) -> Option<&RefCell<T>>

Return the underlying RefCell if Self is one, otherwise None.

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> CallHasher for T where
T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where
H: Hash + ?Sized,
B: BuildHasher,

source

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> TEq<T> for T

source

fn teq(self) -> T

Convert between two equal types.

source

fn teq_ref(&self) -> &T

Convert between references to two equal types.

source

fn teq_mut(&mut self) -> &mut T

Convert between mutable references to two equal types.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct starlark::collections::SmallSet

Implementations

impl<T> SmallSet<T>

pub const fn new() -> Self

pub fn with_capacity(n: usize) -> Self

pub fn capacity(&self) -> usize

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

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

pub fn insert(&mut self, key: T) -> bool where T: Hash + Eq,

pub fn get<Q>(&self, value: &Q) -> Option<&T> where Q: Hash + Equivalent<T> + ?Sized, T: Eq,

pub fn get_index_of<Q>(&self, value: &Q) -> Option<usize> where Q: Hash + Equivalent<T> + ?Sized, T: Eq,

pub fn remove<Q>(&mut self, key: &Q) where Q: ?Sized + Hash + Equivalent<T>, T: Eq,

pub fn take<Q>(&mut self, key: &Q) -> Option<T> where Q: ?Sized + Hash + Equivalent<T>, T: Eq,

pub fn pop(&mut self) -> Option<T> where T: Eq,

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn contains<Q>(&self, key: &Q) -> bool where Q: Hash + Equivalent<T> + ?Sized, T: Eq,

pub fn clear(&mut self)

Trait Implementations

impl<T: Clone> Clone for SmallSet<T>

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

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

impl<T: Debug> Debug for SmallSet<T>

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

impl<T> Default for SmallSet<T>

fn default() -> Self

impl<T> FromIterator<T> for SmallSet<T> where T: Hash + Eq,

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

impl<T: Hash> Hash for SmallSet<T>

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,

impl<T> Ord for SmallSet<T> where T: Ord,

fn cmp(&self, other: &Self) -> Ordering

fn max(self, other: Self) -> Self

fn min(self, other: Self) -> Self

fn clamp(self, min: Self, max: Self) -> Self

impl<T> PartialEq<SmallSet<T>> for SmallSet<T> where T: Eq,

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

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

impl<T> PartialOrd<SmallSet<T>> for SmallSet<T> where T: PartialOrd + Eq,

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

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

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

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

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

impl<T> Eq for SmallSet<T> where T: Eq,

Auto Trait Implementations

impl<T> RefUnwindSafe for SmallSet<T> where T: RefUnwindSafe,

impl<T> Send for SmallSet<T> where T: Send,

impl<T> Sync for SmallSet<T> where T: Sync,

impl<T> Unpin for SmallSet<T> where T: Unpin,

impl<T> UnwindSafe for SmallSet<T> where T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> AsARef<T> for T where T: ?Sized,

fn as_aref(this: &T) -> ARef<'_, T>

fn try_as_aref(this: &T) -> Result<ARef<'_, T>, BorrowError>

fn as_ref_cell(_this: &T) -> Option<&RefCell<T>>

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CallHasher for T where T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where H: Hash + ?Sized, B: BuildHasher,

impl<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T> TEq<T> for T

fn teq(self) -> T

fn teq_ref(&self) -> &T

fn teq_mut(&mut self) -> &mut T

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

pub fn insert(&mut self, key: T) -> bool where
T: Hash + Eq,

pub fn get<Q>(&self, value: &Q) -> Option<&T> where
Q: Hash + Equivalent<T> + ?Sized,
T: Eq,

pub fn get_index_of<Q>(&self, value: &Q) -> Option<usize> where
Q: Hash + Equivalent<T> + ?Sized,
T: Eq,

pub fn remove<Q>(&mut self, key: &Q) where
Q: ?Sized + Hash + Equivalent<T>,
T: Eq,

pub fn take<Q>(&mut self, key: &Q) -> Option<T> where
Q: ?Sized + Hash + Equivalent<T>,
T: Eq,

pub fn pop(&mut self) -> Option<T> where
T: Eq,

pub fn contains<Q>(&self, key: &Q) -> bool where
Q: Hash + Equivalent<T> + ?Sized,
T: Eq,

impl<T> FromIterator<T> for SmallSet<T> where
T: Hash + Eq,

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

impl<T> Ord for SmallSet<T> where
T: Ord,

impl<T> PartialEq<SmallSet<T>> for SmallSet<T> where
T: Eq,

impl<T> PartialOrd<SmallSet<T>> for SmallSet<T> where
T: PartialOrd + Eq,

impl<T> Eq for SmallSet<T> where
T: Eq,

impl<T> RefUnwindSafe for SmallSet<T> where
T: RefUnwindSafe,

impl<T> Send for SmallSet<T> where
T: Send,

impl<T> Sync for SmallSet<T> where
T: Sync,

impl<T> Unpin for SmallSet<T> where
T: Unpin,

impl<T> UnwindSafe for SmallSet<T> where
T: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> AsARef<T> for T where
T: ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T> CallHasher for T where
T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where
H: Hash + ?Sized,
B: BuildHasher,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,