nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2024-11-27 01:04:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Rollup merge of #39106 - istankovic:patch-2, r=GuillaumeGomez

Browse Source 
libcollections: btree/set: fix a typo
This commit is contained in:
Guillaume Gomez 2017-01-16 22:48:26 +01:00 committed by GitHub
commit 04e74cefee
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/libcollections/btree/set.rs
View File

@ -208,7 +208,7 @@ impl<T> BTreeSet<T> {
impl<T: Ord> BTreeSet<T> { impl<T: Ord> BTreeSet<T> {
/// Constructs a double-ended iterator over a sub-range of elements in the set. /// 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). /// yield elements from min (inclusive) to max (exclusive).
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example /// 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((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive