pub struct CREDITS_VERIFYING_KEYS { /* private fields */ }Methods from Deref<Target = IndexMap<String, Arc<CircuitVerifyingKey<<Console as Environment>::PairingCurve>>>>§
sourcepub fn capacity(&self) -> usize
pub fn capacity(&self) -> usize
Return the number of elements the map can hold without reallocating.
This number is a lower bound; the map might be able to hold more, but is guaranteed to be able to hold at least this many.
Computes in O(1) time.
sourcepub fn len(&self) -> usize
pub fn len(&self) -> usize
Return the number of key-value pairs in the map.
Computes in O(1) time.
sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Returns true if the map contains no elements.
Computes in O(1) time.
sourcepub fn iter(&self) -> Iter<'_, K, V>
pub fn iter(&self) -> Iter<'_, K, V>
Return an iterator over the key-value pairs of the map, in their order
sourcepub fn keys(&self) -> Keys<'_, K, V>
pub fn keys(&self) -> Keys<'_, K, V>
Return an iterator over the keys of the map, in their order
sourcepub fn values(&self) -> Values<'_, K, V>
pub fn values(&self) -> Values<'_, K, V>
Return an iterator over the values of the map, in their order
sourcepub fn contains_key<Q>(&self, key: &Q) -> boolwhere
Q: Hash + Equivalent<K> + ?Sized,
pub fn contains_key<Q>(&self, key: &Q) -> boolwhere Q: Hash + Equivalent<K> + ?Sized,
Return true if an equivalent to key exists in the map.
Computes in O(1) time (average).
sourcepub fn get<Q>(&self, key: &Q) -> Option<&V>where
Q: Hash + Equivalent<K> + ?Sized,
pub fn get<Q>(&self, key: &Q) -> Option<&V>where Q: Hash + Equivalent<K> + ?Sized,
Return a reference to the value stored for key, if it is present,
else None.
Computes in O(1) time (average).
sourcepub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)>where
Q: Hash + Equivalent<K> + ?Sized,
pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)>where Q: Hash + Equivalent<K> + ?Sized,
Return references to the key-value pair stored for key,
if it is present, else None.
Computes in O(1) time (average).
sourcepub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)>where
Q: Hash + Equivalent<K> + ?Sized,
pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)>where Q: Hash + Equivalent<K> + ?Sized,
Return item index, key and value
sourcepub fn get_index_of<Q>(&self, key: &Q) -> Option<usize>where
Q: Hash + Equivalent<K> + ?Sized,
pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize>where Q: Hash + Equivalent<K> + ?Sized,
Return item index, if it exists in the map
Computes in O(1) time (average).
sourcepub fn as_slice(&self) -> &Slice<K, V>
pub fn as_slice(&self) -> &Slice<K, V>
Returns a slice of all the key-value pairs in the map.
Computes in O(1) time.
sourcepub fn get_index(&self, index: usize) -> Option<(&K, &V)>
pub fn get_index(&self, index: usize) -> Option<(&K, &V)>
Get a key-value pair by index
Valid indices are 0 <= index < self.len()
Computes in O(1) time.