update docs with new syntax

rust-lang · Jan 14, 2017 · 4920721 · 4920721
1 parent 60bab56
commit 4920721
Show file tree

Hide file tree

Showing 2 changed files with 9 additions and 9 deletions.
diff --git a/src/libcollections/btree/map.rs b/src/libcollections/btree/map.rs
@@ -656,11 +656,11 @@ impl<K: Ord, V> BTreeMap<K, V> {
     }
 
     /// Constructs a double-ended iterator over a sub-range of elements in the map.
-    /// The simplest way is to use the range synax `min..max`, thus `range(..)` will
-    /// yield the whole collection.
+    /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
+    /// yield elements from min (inclusive) to max (exclusive).
     /// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
     /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
-    /// range.
+    /// range from 4 to 10.
     ///
     /// # Examples
     ///
@@ -748,11 +748,11 @@ impl<K: Ord, V> BTreeMap<K, V> {
     }
 
     /// Constructs a mutable double-ended iterator over a sub-range of elements in the map.
-    /// The simplest way is to use the range synax `min..max`, thus `range(..)` will
-    /// yield the whole collection.
+    /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
+    /// yield elements from min (inclusive) to max (exclusive).
     /// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
     /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
-    /// range.
+    /// range from 4 to 10.
     ///
     /// # Examples
     ///

diff --git a/src/libcollections/btree/set.rs b/src/libcollections/btree/set.rs
@@ -208,11 +208,11 @@ impl<T> BTreeSet<T> {
 
 impl<T: Ord> BTreeSet<T> {
     /// Constructs a double-ended iterator over a sub-range of elements in the set.
-    /// The simplest way is to use the range synax `min..max`, thus `range(..)` will
-    /// yield the whole collection.
+    /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
+    /// yield elements from min (inclusive) to max (exclusive).
     /// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
     /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
-    /// range.
+    /// range from 4 to 10.
     ///
     /// # Examples
     ///