pub struct NamedKeys(/* private fields */);Expand description
A collection of named keys.
Implementations§
Source§impl NamedKeys
impl NamedKeys
Sourcepub fn into_inner(self) -> BTreeMap<String, Key>
pub fn into_inner(self) -> BTreeMap<String, Key>
Consumes self, returning the wrapped map.
Sourcepub fn insert(&mut self, name: String, key: Key) -> Option<Key>
pub fn insert(&mut self, name: String, key: Key) -> Option<Key>
Inserts a named key.
If the map did not have this name present, None is returned. If the map did have this
name present, the Key is updated, and the old Key is returned.
Sourcepub fn remove(&mut self, name: &str) -> Option<Key>
pub fn remove(&mut self, name: &str) -> Option<Key>
Removes a named Key, returning the Key if it existed in the collection.
Sourcepub fn get(&self, name: &str) -> Option<&Key>
pub fn get(&self, name: &str) -> Option<&Key>
Returns a reference to the Key under the given name if any.
Sourcepub fn contains(&self, name: &str) -> bool
pub fn contains(&self, name: &str) -> bool
Returns true if the named Key exists in the collection.
Sourcepub fn keys(&self) -> impl Iterator<Item = &Key>
pub fn keys(&self) -> impl Iterator<Item = &Key>
Returns an iterator over the Keys (i.e. the map’s values).
Sourcepub fn keys_mut(&mut self) -> impl Iterator<Item = &mut Key>
pub fn keys_mut(&mut self) -> impl Iterator<Item = &mut Key>
Returns a mutable iterator over the Keys (i.e. the map’s values).
Trait Implementations§
Source§impl DataSize for NamedKeys
impl DataSize for NamedKeys
Source§const IS_DYNAMIC: bool = true
const IS_DYNAMIC: bool = true
If
true, the type has a heap size that can vary at runtime, depending on the actual value.Source§const STATIC_HEAP_SIZE: usize = 0usize
const STATIC_HEAP_SIZE: usize = 0usize
The amount of space a value of the type always occupies. If
IS_DYNAMIC is false, this is
the total amount of heap memory occupied by the value. Otherwise this is a lower bound.Source§fn estimate_heap_size(&self) -> usize
fn estimate_heap_size(&self) -> usize
Estimates the size of heap memory taken up by this value. Read more
Source§impl<'de> Deserialize<'de> for NamedKeys
impl<'de> Deserialize<'de> for NamedKeys
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl JsonSchema for NamedKeys
impl JsonSchema for NamedKeys
Source§fn schema_name() -> String
fn schema_name() -> String
The name of the generated JSON Schema. Read more
Source§fn schema_id() -> Cow<'static, str>
fn schema_id() -> Cow<'static, str>
Returns a string that uniquely identifies the schema produced by this type. Read more
Source§fn json_schema(generator: &mut SchemaGenerator) -> Schema
fn json_schema(generator: &mut SchemaGenerator) -> Schema
Generates a JSON Schema for this type. Read more
Source§fn is_referenceable() -> bool
fn is_referenceable() -> bool
Whether JSON Schemas generated for this type should be re-used where possible using the
$ref keyword. Read moreSource§impl ToBytes for NamedKeys
impl ToBytes for NamedKeys
Source§fn write_bytes(&self, writer: &mut Vec<u8>) -> Result<(), Error>
fn write_bytes(&self, writer: &mut Vec<u8>) -> Result<(), Error>
Writes
&self into a mutable writer.Source§fn serialized_length(&self) -> usize
fn serialized_length(&self) -> usize
Returns the length of the
Vec<u8> which would be returned from a successful call to
to_bytes() or into_bytes(). The data is not actually serialized, so this call is
relatively cheap.impl Eq for NamedKeys
impl StructuralPartialEq for NamedKeys
Auto Trait Implementations§
impl Freeze for NamedKeys
impl RefUnwindSafe for NamedKeys
impl Send for NamedKeys
impl Sync for NamedKeys
impl Unpin for NamedKeys
impl UnwindSafe for NamedKeys
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more