Struct ssb_legacy_msg_data::value::RidiculousStringMap [−][src]
pub struct RidiculousStringMap<V> { /* fields omitted */ }Expand description
A map with string keys that sorts strings according to object entry order, using insertion order for non-int keys.
Implementations
Create a new map with capacity for n key-value pairs. (Does not
allocate if n is zero.)
This only preallocates capacity for non-numeric strings.
Inserts a key-value pair into the map.
If the map did not have this key present, None is returned.
If the map did have this key present, the value is updated, and the old
value is returned. The key is not updated, though; this matters for
types that can be == without being identical.
Gets an iterator over the entries of the map. It first yields all entries with numeric keys in ascending order, and then the remaining entries in the same order in which they were inserted.
Returns a reference to the value corresponding to the key.
Trait Implementations
Returns the “default value” for a type. Read more
This method tests for self and other values to be equal, and is used
by ==. Read more
This method tests for !=.
Auto Trait Implementations
impl<V> RefUnwindSafe for RidiculousStringMap<V> where
V: RefUnwindSafe, impl<V> Send for RidiculousStringMap<V> where
V: Send, impl<V> Sync for RidiculousStringMap<V> where
V: Sync, impl<V> Unpin for RidiculousStringMap<V> where
V: Unpin, impl<V> UnwindSafe for RidiculousStringMap<V> where
V: RefUnwindSafe + UnwindSafe, Blanket Implementations
Mutably borrows from an owned value. Read more
Compare self to key and return true if they are equal.