user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix nits

Browse source
This commit is contained in:
Nicole Mazzuca 2018-12-20 01:37:20 -08:00
parent 66bb34c3ab
commit 455bc95317
1 changed files with 4 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

6
src/libcore/num/mod.rs
View file

@ -1740,7 +1740,7 @@ $EndFeature, "
concat!("Calculates the quotient of Euclidean division of `self` by `rhs`.
This computes the integer `n` such that `self = n * rhs + self.rem_euclid(rhs)`,
with the `0 <= self.rem_euclid(rhs) < rhs`.
with `0 <= self.rem_euclid(rhs) < rhs`.
In other words, the result is `self / rhs` rounded to the integer `n`
such that `self >= n * rhs`.
@ -1781,7 +1781,9 @@ assert_eq!((-a).div_euclid(-b), 2); // -7 >= -4 * 2
doc_comment! {
concat!("Calculates the least nonnegative remainder of `self (mod rhs)`.
This is done as if by the Euclidean division algorithm.
This is done as if by the Euclidean division algorithm -- given
`r = self.rem_euclid(rhs)`, `self = rhs * self.div_euclid(rhs) + r`, and
`0 <= r < abs(rhs)`.
# Panics