Document init of HashSet/HashMap from vector

2 files changed, 31 insertions, 0 deletions

diff --git a/src/libstd/collections/hash/map.rs b/src/libstd/collections/hash/map.rs
index eb1653f18cb..698ce8815bd 100644
--- a/src/libstd/collections/hash/map.rs
+++ b/src/libstd/collections/hash/map.rs
@@ -335,6 +335,23 @@ fn test_resize_policy() {
 ///     println!("{:?} has {} hp", viking, health);
 /// }
 /// ```
+/// A HashMap with fixed list of elements can be initialized from vector:
+/// ```
+/// use std::collections::HashMap;
+///
+/// fn main() {
+///     let timber_resources: HashMap<&str, i32> =
+///     [ ("Norway", 100),
+///       ("Denmark", 50),
+///       ("Iceland", 10) ]
+///       .iter().map(|&x| x).collect();
+///     // use the values store in map
+/// }
+/// ```
+/// This works for Copy types, if you want to cover non-copy types then you need to replace 
+/// the map(|&x| x) with map(|x| x.clone())
+
+
 #[derive(Clone)]
 #[stable(feature = "rust1", since = "1.0.0")]
 pub struct HashMap<K, V, S = RandomState> {
diff --git a/src/libstd/collections/hash/set.rs b/src/libstd/collections/hash/set.rs
index ff56747fee6..568163b77de 100644
--- a/src/libstd/collections/hash/set.rs
+++ b/src/libstd/collections/hash/set.rs
@@ -100,6 +100,20 @@ const INITIAL_CAPACITY: usize = 32;
 ///     println!("{:?}", x);
 /// }
 /// ```
+/// HashSet with fixed list of elements can be initialized from vector:
+/// ```
+/// use std::collections::HashSet;
+///
+/// fn main() {
+///     let viking_names: HashSet<&str> =
+///         [ "Einar", "Olaf", "Harald" ].iter().map(|&x| x).collect();
+///     // use the values store in the set
+/// }
+/// ```
+/// This works for Copy types, if you want to cover non-copy types then you need to replace 
+/// the map(|&x| x) with map(|x| x.clone())
+
+
 #[derive(Clone)]
 #[stable(feature = "rust1", since = "1.0.0")]
 pub struct HashSet<T, S = RandomState> {