@@ -656,11 +656,11 @@ impl<K: Ord, V> BTreeMap<K, V> {
656
656
}
657
657
658
658
/// Constructs a double-ended iterator over a sub-range of elements in the map.
659
- /// The simplest way is to use the range synax `min..max`, thus `range(.. )` will
660
- /// yield the whole collection .
659
+ /// The simplest way is to use the range synax `min..max`, thus `range(min..max )` will
660
+ /// yield elements from min (inclusive) to max (exclusive) .
661
661
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
662
662
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
663
- /// range.
663
+ /// range from 4 to 10 .
664
664
///
665
665
/// # Examples
666
666
///
@@ -748,11 +748,11 @@ impl<K: Ord, V> BTreeMap<K, V> {
748
748
}
749
749
750
750
/// Constructs a mutable double-ended iterator over a sub-range of elements in the map.
751
- /// The simplest way is to use the range synax `min..max`, thus `range(.. )` will
752
- /// yield the whole collection .
751
+ /// The simplest way is to use the range synax `min..max`, thus `range(min..max )` will
752
+ /// yield elements from min (inclusive) to max (exclusive) .
753
753
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
754
754
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
755
- /// range.
755
+ /// range from 4 to 10 .
756
756
///
757
757
/// # Examples
758
758
///
0 commit comments