Struct starlark_map::unordered_map::UnorderedMap

pub struct UnorderedMap<K, V>(/* private fields */);

Hash map which does not expose any insertion order-specific behavior (except Debug).

Implementations

impl<K, V> UnorderedMap<K, V>

pub const fn new() -> UnorderedMap<K, V>

Create a new empty map.

pub fn with_capacity(n: usize) -> UnorderedMap<K, V>

Create a new empty map with the specified capacity.

pub fn len(&self) -> usize

Get the number of elements in the map.

pub fn is_empty(&self) -> bool

Is the map empty?

pub fn get<Q>(&self, k: &Q) -> Option<&V>

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

Get a reference to the value associated with the given key.

pub fn get_hashed<Q>(&self, key: Hashed<&Q>) -> Option<&V>

where Q: Equivalent<K> + ?Sized,

Get a reference to the value associated with the given key.

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>

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

Get a mutable reference to the value associated with the given key.

pub fn contains_key<Q>(&self, k: &Q) -> bool

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

Does the map contain the specified key?

pub fn contains_key_hashed<Q>(&self, key: Hashed<&Q>) -> bool

where Q: Equivalent<K> + ?Sized,

Does the map contain the specified key?

pub fn insert(&mut self, k: K, v: V) -> Option<V>

where K: Hash + Eq,

Insert an entry into the map.

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>

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

Remove an entry from the map.

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&K, &mut V) -> bool,

Preserve only the elements specified by the predicate.

pub fn entry(&mut self, k: K) -> Entry<'_, K, V>

where K: Hash + Eq,

Get an entry in the map for in-place manipulation.

pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V>

Lower-level access to the entry API.

pub fn clear(&mut self)

Clear the map, removing all entries.

pub fn entries_unordered(&self) -> impl ExactSizeIterator<Item = (&K, &V)>

Entries in the map, in arbitrary order.

pub fn entries_unordered_mut( &mut self ) -> impl ExactSizeIterator<Item = (&K, &mut V)>

Entries in the map, in arbitrary order.

pub fn keys_unordered(&self) -> impl ExactSizeIterator<Item = &K>

Keys in the map, in arbitrary order.

pub fn values_unordered(&self) -> impl ExactSizeIterator<Item = &V>

Values in the map, in arbitrary order.

pub fn values_unordered_mut(&mut self) -> impl ExactSizeIterator<Item = &mut V>

Values in the map, in arbitrary order.

pub fn entries_sorted(&self) -> Vec<(&K, &V)>

where K: Ord,

Get the entries in the map, sorted by key.

pub fn into_hash_map(self) -> HashMap<K, V>

where K: Hash + Eq,

Convert into HashMap.

pub fn map_values<W>(self, f: impl FnMut(V) -> W) -> UnorderedMap<K, W>

where K: Hash + Eq,

Apply the function to value.

Trait Implementations

impl<K: Allocative, V: Allocative> Allocative for UnorderedMap<K, V>

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

impl<K: Clone, V: Clone> Clone for UnorderedMap<K, V>

fn clone(&self) -> UnorderedMap<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for UnorderedMap<K, V>

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

Formats the value using the given formatter.

impl<K, V> Default for UnorderedMap<K, V>

fn default() -> UnorderedMap<K, V>

Returns the “default value” for a type.

impl<K: Eq + Hash, V> FromIterator<(K, V)> for UnorderedMap<K, V>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> UnorderedMap<K, V>

Creates a value from an iterator.

impl<K: Hash, V: Hash> Hash for UnorderedMap<K, V>

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<K, V, Q: Equivalent<K> + Hash> Index<&Q> for UnorderedMap<K, V>

type Output = V

The returned type after indexing.

fn index(&self, k: &Q) -> &V

Performs the indexing (container[index]) operation.

impl<K: Eq + Hash, V: Eq> PartialEq for UnorderedMap<K, V>

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<K: Eq + Hash, V: Eq> Eq for UnorderedMap<K, V>