Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement RFC #2169 (Euclidean modulo). #49389

Merged
merged 5 commits into from
Apr 13, 2018
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Fix doctest (typo).
  • Loading branch information
fanzier committed Mar 28, 2018
commit c0870e2f55b8b160c8ad7af684831902b4979cfb
4 changes: 2 additions & 2 deletions src/libcore/num/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -3252,7 +3252,7 @@ Basic usage:

```
#![feature(euclidean_division)]
assert_eq(7", stringify!($SelfT), ".div_euc(4), 1); // or any other integer type
assert_eq!(7", stringify!($SelfT), ".div_euc(4), 1); // or any other integer type
```"),
#[unstable(feature = "euclidean_division", issue = "49048")]
#[inline]
Expand All @@ -3274,7 +3274,7 @@ Basic usage:

```
#![feature(euclidean_division)]
assert_eq(7", stringify!($SelfT), ".mod_euc(4), 3); // or any other integer type
assert_eq!(7", stringify!($SelfT), ".mod_euc(4), 3); // or any other integer type
```"),
#[unstable(feature = "euclidean_division", issue = "49048")]
#[inline]
Expand Down