libcollections: btree/set: fix a typo
This commit is contained in:
parent
2d0baa71b9
commit
2ac4fe12f3
@ -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
|
||||
|
Loading…
Reference in New Issue
Block a user