about summary refs log tree commit diff
path: root/src/libcollections
diff options
context:
space:
mode:
authorIvan Stankovic <istankovic@users.noreply.github.com>2017-01-16 21:26:43 +0100
committerGitHub <noreply@github.com>2017-01-16 21:26:43 +0100
commit2ac4fe12f3f232cd3ca8b33eb3f14bed4ca8510b (patch)
tree94044238f8f2c9fececb228551585703952685e9 /src/libcollections
parent2d0baa71b94e15ac43532987777959edbaee098d (diff)
downloadrust-2ac4fe12f3f232cd3ca8b33eb3f14bed4ca8510b.tar.gz
rust-2ac4fe12f3f232cd3ca8b33eb3f14bed4ca8510b.zip
libcollections: btree/set: fix a typo
Diffstat (limited to 'src/libcollections')
-rw-r--r--src/libcollections/btree/set.rs2
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