@@ -1428,7 +1428,7 @@ pub trait Iterator {
1428
1428
/// assert_eq!(6, doubled[2]);
1429
1429
/// ```
1430
1430
///
1431
- /// Using the 'turbofish' instead of annotationg `doubled`:
1431
+ /// Using the 'turbofish' instead of annotating `doubled`:
1432
1432
///
1433
1433
/// ```
1434
1434
/// let a = [1, 2, 3];
@@ -1610,7 +1610,7 @@ pub trait Iterator {
1610
1610
/// `true`, then so does `all()`. If any of them return `false`, it
1611
1611
/// returns `false`.
1612
1612
///
1613
- /// `all()` is short-circuting ; in other words, it will stop processing
1613
+ /// `all()` is short-circuiting ; in other words, it will stop processing
1614
1614
/// as soon as it finds a `false`, given that no matter what else happens,
1615
1615
/// the result will also be `false`.
1616
1616
///
@@ -1660,7 +1660,7 @@ pub trait Iterator {
1660
1660
/// `true`, then so does `any()`. If they all return `false`, it
1661
1661
/// returns `false`.
1662
1662
///
1663
- /// `any()` is short-circuting ; in other words, it will stop processing
1663
+ /// `any()` is short-circuiting ; in other words, it will stop processing
1664
1664
/// as soon as it finds a `true`, given that no matter what else happens,
1665
1665
/// the result will also be `true`.
1666
1666
///
@@ -1711,7 +1711,7 @@ pub trait Iterator {
1711
1711
/// `true`, then `find()` returns `Some(element)`. If they all return
1712
1712
/// `false`, it returns `None`.
1713
1713
///
1714
- /// `find()` is short-circuting ; in other words, it will stop processing
1714
+ /// `find()` is short-circuiting ; in other words, it will stop processing
1715
1715
/// as soon as the closure returns `true`.
1716
1716
///
1717
1717
/// Because `find()` takes a reference, and many iterators iterate over
@@ -1762,7 +1762,7 @@ pub trait Iterator {
1762
1762
/// returns `true`, then `position()` returns `Some(index)`. If all of
1763
1763
/// them return `false`, it returns `None`.
1764
1764
///
1765
- /// `position()` is short-circuting ; in other words, it will stop
1765
+ /// `position()` is short-circuiting ; in other words, it will stop
1766
1766
/// processing as soon as it finds a `true`.
1767
1767
///
1768
1768
/// # Overflow Behavior
@@ -1824,7 +1824,7 @@ pub trait Iterator {
1824
1824
/// and if one of them returns `true`, then `rposition()` returns
1825
1825
/// `Some(index)`. If all of them return `false`, it returns `None`.
1826
1826
///
1827
- /// `rposition()` is short-circuting ; in other words, it will stop
1827
+ /// `rposition()` is short-circuiting ; in other words, it will stop
1828
1828
/// processing as soon as it finds a `true`.
1829
1829
///
1830
1830
/// # Examples
@@ -2079,7 +2079,7 @@ pub trait Iterator {
2079
2079
( ts, us)
2080
2080
}
2081
2081
2082
- /// Creates an iterator which clone()s all of its elements.
2082
+ /// Creates an iterator which ` clone()` s all of its elements.
2083
2083
///
2084
2084
/// This is useful when you have an iterator over `&T`, but you need an
2085
2085
/// iterator over `T`.
0 commit comments