Lines Matching full:linkedhashmap
16 //! use linked_hash_map::LinkedHashMap;
18 //! let mut map = LinkedHashMap::new();
65 pub struct LinkedHashMap<K, V, S = hash_map::RandomState> { struct
129 impl<K: Hash + Eq, V> LinkedHashMap<K, V> { impl
141 impl<K, V, S> LinkedHashMap<K, V, S> { impl
195 impl<K: Hash + Eq, V, S: BuildHasher> LinkedHashMap<K, V, S> { implementation
197 LinkedHashMap { in with_map()
237 /// use linked_hash_map::LinkedHashMap;
239 /// let mut letters = LinkedHashMap::new();
271 /// use linked_hash_map::LinkedHashMap;
273 /// let mut map = LinkedHashMap::new();
307 /// use linked_hash_map::LinkedHashMap;
308 /// let mut map = LinkedHashMap::new();
367 /// use linked_hash_map::LinkedHashMap;
368 /// let mut map = LinkedHashMap::new();
393 /// use linked_hash_map::LinkedHashMap;
394 /// let mut map = LinkedHashMap::new();
420 /// use linked_hash_map::LinkedHashMap;
421 /// let mut map = LinkedHashMap::new();
452 /// use linked_hash_map::LinkedHashMap;
453 /// let mut map = LinkedHashMap::new();
486 /// use linked_hash_map::LinkedHashMap;
487 /// let mut map: LinkedHashMap<i32, &str> = LinkedHashMap::new();
501 /// use linked_hash_map::LinkedHashMap;
502 /// let mut map = LinkedHashMap::new();
531 /// use linked_hash_map::LinkedHashMap;
532 /// let mut map = LinkedHashMap::new();
555 /// use linked_hash_map::LinkedHashMap;
556 /// let mut map = LinkedHashMap::new();
585 /// use linked_hash_map::LinkedHashMap;
586 /// let mut map = LinkedHashMap::new();
637 /// use linked_hash_map::LinkedHashMap;
639 /// let mut map = LinkedHashMap::new();
668 /// use linked_hash_map::LinkedHashMap;
670 /// let mut map = LinkedHashMap::new();
756 /// use linked_hash_map::LinkedHashMap;
758 /// let mut map = LinkedHashMap::new();
777 /// use linked_hash_map::LinkedHashMap;
779 /// let mut map = LinkedHashMap::new();
795 impl<'a, K, V, S, Q: ?Sized> Index<&'a Q> for LinkedHashMap<K, V, S> implementation
808 impl<'a, K, V, S, Q: ?Sized> IndexMut<&'a Q> for LinkedHashMap<K, V, S> implementation
819 impl<K: Hash + Eq + Clone, V: Clone, S: BuildHasher + Clone> Clone for LinkedHashMap<K, V, S> { implementation
827 impl<K: Hash + Eq, V, S: BuildHasher + Default> Default for LinkedHashMap<K, V, S> { implementation
833 impl<K: Hash + Eq, V, S: BuildHasher> Extend<(K, V)> for LinkedHashMap<K, V, S> { implementation
841 impl<'a, K, V, S> Extend<(&'a K, &'a V)> for LinkedHashMap<K, V, S> implementation
855 for LinkedHashMap<K, V, S>
866 for LinkedHashMap<A, B, S>
874 impl<K: Hash + Eq, V: PartialEq, S: BuildHasher> PartialEq for LinkedHashMap<K, V, S> { implementation
880 impl<K: Hash + Eq, V: Eq, S: BuildHasher> Eq for LinkedHashMap<K, V, S> {} implementation
883 for LinkedHashMap<K, V, S>
906 impl<K: Hash + Eq + Ord, V: Ord, S: BuildHasher> Ord for LinkedHashMap<K, V, S> { implementation
912 impl<K: Hash + Eq, V: Hash, S: BuildHasher> Hash for LinkedHashMap<K, V, S> { implementation
920 unsafe impl<K: Send, V: Send, S: Send> Send for LinkedHashMap<K, V, S> {} implementation
922 unsafe impl<K: Sync, V: Sync, S: Sync> Sync for LinkedHashMap<K, V, S> {} implementation
924 impl<K, V, S> Drop for LinkedHashMap<K, V, S> { implementation
936 /// An insertion-order iterator over a `LinkedHashMap`'s entries, with immutable references to the
945 /// An insertion-order iterator over a `LinkedHashMap`'s entries, with mutable references to the
954 /// A consuming insertion-order iterator over a `LinkedHashMap`'s entries.
962 /// A draining insertion-order iterator over a `LinkedHashMap`'s entries.
970 /// An insertion-order iterator over a `LinkedHashMap`'s entries represented as
973 map: *mut LinkedHashMap<K, V, S>,
1313 /// An insertion-order iterator over a `LinkedHashMap`'s keys.
1352 /// An insertion-order iterator over a `LinkedHashMap`'s values.
1391 impl<'a, K: Hash + Eq, V, S: BuildHasher> IntoIterator for &'a LinkedHashMap<K, V, S> { implementation
1399 impl<'a, K: Hash + Eq, V, S: BuildHasher> IntoIterator for &'a mut LinkedHashMap<K, V, S> { implementation
1407 impl<K: Hash + Eq, V, S: BuildHasher> IntoIterator for LinkedHashMap<K, V, S> { implementation
1422 // drop the HashMap but not the LinkedHashMap in into_iter()
1445 /// A view into a single occupied location in a `LinkedHashMap`.
1448 map: *mut LinkedHashMap<K, V, S>,
1452 /// A view into a single empty location in a `LinkedHashMap`.
1455 map: &'a mut LinkedHashMap<K, V, S>,
1464 /// use linked_hash_map::LinkedHashMap;
1466 /// let mut map = LinkedHashMap::<String, u32>::new();
1529 /// use linked_hash_map::LinkedHashMap;
1531 /// let mut map = LinkedHashMap::new();
1584 /// use linked_hash_map::LinkedHashMap;
1586 /// let mut map = LinkedHashMap::<String, u32>::new();