Struct linked_hash_map_rs::LinkedHashMap [−][src]
pub struct LinkedHashMap<K, V, S = RandomState> { /* fields omitted */ }
Implementations
like [push_front], but return the put element instead of the replaced element
like [push_back], but return the put element instead of the replaced element
pub fn move_to_front<Q: ?Sized>(&mut self, key: &Q) -> Option<(&K, &V)> where
K: Borrow<Q>,
Q: Hash + Eq,
pub fn move_to_back<Q: ?Sized>(&mut self, key: &Q) -> Option<(&K, &V)> where
K: Borrow<Q>,
Q: Hash + Eq,
Trait Implementations
Extends a collection with the contents of an iterator. Read more
🔬 This is a nightly-only experimental API. (
extend_one
)Extends a collection with exactly one element.
🔬 This is a nightly-only experimental API. (
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
impl<K, V> PartialEq<LinkedHashMap<K, V, RandomState>> for LinkedHashMap<K, V> where
K: Hash + Eq,
V: PartialEq,
impl<K, V> PartialEq<LinkedHashMap<K, V, RandomState>> for LinkedHashMap<K, V> where
K: Hash + Eq,
V: PartialEq,
Auto Trait Implementations
impl<K, V, S> RefUnwindSafe for LinkedHashMap<K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, S = RandomState> !Send for LinkedHashMap<K, V, S>
impl<K, V, S = RandomState> !Sync for LinkedHashMap<K, V, S>
impl<K, V, S> Unpin for LinkedHashMap<K, V, S> where
K: Unpin,
S: Unpin,
V: Unpin,
impl<K, V, S> UnwindSafe for LinkedHashMap<K, V, S> where
K: RefUnwindSafe + UnwindSafe,
S: UnwindSafe,
V: RefUnwindSafe + UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more