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

libcollections: btree/set: fix a typo

src/libcollections/btree/set.rs

@@ -208,7 +208,7 @@ pub fn iter(&self) -> Iter<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