Permalink
Browse files

Rollup merge of #39105 - istankovic:patch-1, r=sfackler

libcollections: btree/map: fix typos
  • Loading branch information...
2 parents 630b9e1 + b50fb24 commit a9300ccdffa94c68422d7e54b1698e45213f94c3 @GuillaumeGomez GuillaumeGomez committed on GitHub Jan 16, 2017
Showing with 2 additions and 2 deletions.
  1. +2 −2 src/libcollections/btree/map.rs
@@ -656,7 +656,7 @@ 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(min..max)` will
+ /// The simplest way is to use the range syntax `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
@@ -748,7 +748,7 @@ 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(min..max)` will
+ /// The simplest way is to use the range syntax `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

0 comments on commit a9300cc

Please sign in to comment.