28
28
//! assert_eq!(items, [(2, 20), (1, 10), (3, 30)]);
29
29
//! ```
30
30
31
+ #![ forbid( missing_docs) ]
31
32
#![ feature( hashmap_hasher) ]
32
33
#![ feature( box_raw) ]
33
34
#![ feature( iter_order) ]
@@ -718,13 +719,17 @@ impl<K, V, S> Drop for LinkedHashMap<K, V, S> {
718
719
}
719
720
}
720
721
722
+ /// An insertion-order iterator over a `LinkedHashMap`'s entries, with immutable references to the
723
+ /// values.
721
724
pub struct Iter < ' a , K : ' a , V : ' a > {
722
725
head : * const LinkedHashMapEntry < K , V > ,
723
726
tail : * const LinkedHashMapEntry < K , V > ,
724
727
remaining : usize ,
725
728
marker : marker:: PhantomData < ( & ' a K , & ' a V ) > ,
726
729
}
727
730
731
+ /// An insertion-order iterator over a `LinkedHashMap`'s entries, with mutable references to the
732
+ /// values.
728
733
pub struct IterMut < ' a , K : ' a , V : ' a > {
729
734
head : * mut LinkedHashMapEntry < K , V > ,
730
735
tail : * mut LinkedHashMapEntry < K , V > ,
@@ -817,6 +822,7 @@ impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V> {
817
822
}
818
823
819
824
825
+ /// An insertion-order iterator over a `LinkedHashMap`'s keys.
820
826
pub struct Keys < ' a , K : ' a , V : ' a > {
821
827
inner : iter:: Map < Iter < ' a , K , V > , fn ( ( & ' a K , & ' a V ) ) -> & ' a K >
822
828
}
@@ -841,6 +847,7 @@ impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V> {
841
847
}
842
848
843
849
850
+ /// An insertion-order iterator over a `LinkedHashMap`'s values.
844
851
pub struct Values < ' a , K : ' a , V : ' a > {
845
852
inner : iter:: Map < Iter < ' a , K , V > , fn ( ( & ' a K , & ' a V ) ) -> & ' a V >
846
853
}
0 commit comments