diff options
| author | Bastien Orivel <eijebong@bananium.fr> | 2017-08-11 00:16:18 +0200 |
|---|---|---|
| committer | Bastien Orivel <eijebong@bananium.fr> | 2017-08-11 00:16:18 +0200 |
| commit | 47cb3c5bc28e1bb2ac2d2efb7796ceb17b4ab7de (patch) | |
| tree | d322ab0b4256ce1b79dc63e2fab5e70a774c93c6 /src/libcore | |
| parent | 2ac5f7d249e29ee48737359e0e6dd9e59701a568 (diff) | |
| download | rust-47cb3c5bc28e1bb2ac2d2efb7796ceb17b4ab7de.tar.gz rust-47cb3c5bc28e1bb2ac2d2efb7796ceb17b4ab7de.zip | |
Fix some typos
Diffstat (limited to 'src/libcore')
| -rw-r--r-- | src/libcore/iter/mod.rs | 2 | ||||
| -rw-r--r-- | src/libcore/iter/traits.rs | 2 | ||||
| -rw-r--r-- | src/libcore/num/dec2flt/algorithm.rs | 2 | ||||
| -rw-r--r-- | src/libcore/tests/num/mod.rs | 2 |
4 files changed, 4 insertions, 4 deletions
diff --git a/src/libcore/iter/mod.rs b/src/libcore/iter/mod.rs index 79e6b11beac..22b997a768e 100644 --- a/src/libcore/iter/mod.rs +++ b/src/libcore/iter/mod.rs @@ -1035,7 +1035,7 @@ unsafe impl<A, B> TrustedLen for Zip<A, B> /// Now consider this twist where we add a call to `rev`. This version will /// print `('c', 1), ('b', 2), ('a', 3)`. Note that the letters are reversed, /// but the values of the counter still go in order. This is because `map()` is -/// still being called lazilly on each item, but we are popping items off the +/// still being called lazily on each item, but we are popping items off the /// back of the vector now, instead of shifting them from the front. /// /// ```rust diff --git a/src/libcore/iter/traits.rs b/src/libcore/iter/traits.rs index ccfeb91aff1..19098f036ac 100644 --- a/src/libcore/iter/traits.rs +++ b/src/libcore/iter/traits.rs @@ -345,7 +345,7 @@ pub trait Extend<A> { /// In a similar fashion to the [`Iterator`] protocol, once a /// `DoubleEndedIterator` returns `None` from a `next_back()`, calling it again /// may or may not ever return `Some` again. `next()` and `next_back()` are -/// interchangable for this purpose. +/// interchangeable for this purpose. /// /// [`Iterator`]: trait.Iterator.html /// diff --git a/src/libcore/num/dec2flt/algorithm.rs b/src/libcore/num/dec2flt/algorithm.rs index 42bc46c0c68..ccf3950c2ba 100644 --- a/src/libcore/num/dec2flt/algorithm.rs +++ b/src/libcore/num/dec2flt/algorithm.rs @@ -336,7 +336,7 @@ pub fn algorithm_m<T: RawFloat>(f: &Big, e: i16) -> T { round_by_remainder(v, rem, q, z) } -/// Skip over most AlgorithmM iterations by checking the bit length. +/// Skip over most Algorithm M iterations by checking the bit length. fn quick_start<T: RawFloat>(u: &mut Big, v: &mut Big, k: &mut i16) { // The bit length is an estimate of the base two logarithm, and log(u / v) = log(u) - log(v). // The estimate is off by at most 1, but always an under-estimate, so the error on log(u) diff --git a/src/libcore/tests/num/mod.rs b/src/libcore/tests/num/mod.rs index 046b81e19f7..400d53ce51a 100644 --- a/src/libcore/tests/num/mod.rs +++ b/src/libcore/tests/num/mod.rs @@ -566,7 +566,7 @@ assume_usize_width! { ); } -/// Conversinos where neither the min nor the max of $source can be represented by +/// Conversions where neither the min nor the max of $source can be represented by /// $target, but max/min of the target can be represented by the source. macro_rules! test_impl_try_from_signed_to_unsigned_err { ($fn_name:ident, $source:ty, $target:ty) => { |
