diff options
| -rw-r--r-- | src/libcollections/btree/set.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libcollections/btree/set.rs b/src/libcollections/btree/set.rs index f472b593b67..f006ba95371 100644 --- a/src/libcollections/btree/set.rs +++ b/src/libcollections/btree/set.rs @@ -208,7 +208,7 @@ 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(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 |