2014-11-24 05:49:13 +00:00
|
|
|
// This is a part of rust-chrono.
|
|
|
|
// Copyright (c) 2014, Kang Seonghoon.
|
|
|
|
// Copyright 2013-2014 The Rust Project Developers.
|
|
|
|
// See README.md and LICENSE.txt for details.
|
|
|
|
|
|
|
|
//! Integer division utilities. (Shamelessly copied from [num](https://github.com/rust-lang/num/))
|
|
|
|
|
|
|
|
// Algorithm from [Daan Leijen. _Division and Modulus for Computer Scientists_,
|
|
|
|
// December 2001](http://research.microsoft.com/pubs/151917/divmodnote-letter.pdf)
|
|
|
|
|
2015-04-03 08:53:44 +00:00
|
|
|
use std::ops::{Add, Sub, Div, Rem};
|
|
|
|
use std::num::{Zero, One};
|
2014-11-24 05:49:13 +00:00
|
|
|
|
|
|
|
/// Same as `(a / b, a % b)`.
|
|
|
|
#[inline]
|
2015-04-03 08:53:44 +00:00
|
|
|
pub fn div_rem<T>(a: T, b: T) -> (T, T)
|
|
|
|
where T: Copy + Div<T,Output=T> + Rem<T,Output=T> {
|
2014-11-24 05:49:13 +00:00
|
|
|
(a / b, a % b)
|
|
|
|
}
|
|
|
|
|
2015-01-26 12:14:50 +00:00
|
|
|
/// Calculates a floored integer quotient.
|
|
|
|
#[inline]
|
2015-04-03 08:53:44 +00:00
|
|
|
pub fn div_floor<T>(a: T, b: T) -> T
|
|
|
|
where T: Copy + Ord + Zero + One +
|
|
|
|
Add<T,Output=T> + Sub<T,Output=T> + Div<T,Output=T> + Rem<T,Output=T> {
|
2015-01-26 12:14:50 +00:00
|
|
|
div_mod_floor(a, b).0
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Calculates a floored modulo.
|
2014-11-24 05:49:13 +00:00
|
|
|
#[inline]
|
2015-04-03 08:53:44 +00:00
|
|
|
pub fn mod_floor<T>(a: T, b: T) -> T
|
|
|
|
where T: Copy + Ord + Zero + One +
|
|
|
|
Add<T,Output=T> + Sub<T,Output=T> + Div<T,Output=T> + Rem<T,Output=T> {
|
2015-01-26 12:14:50 +00:00
|
|
|
div_mod_floor(a, b).1
|
2014-11-24 05:49:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Calculates a floored integer quotient and modulo.
|
|
|
|
#[inline]
|
2015-04-03 08:53:44 +00:00
|
|
|
pub fn div_mod_floor<T>(a: T, b: T) -> (T, T)
|
|
|
|
where T: Copy + Ord + Zero + One +
|
|
|
|
Add<T,Output=T> + Sub<T,Output=T> + Div<T,Output=T> + Rem<T,Output=T> {
|
|
|
|
let zero = Zero::zero();
|
|
|
|
let one = One::one();
|
2014-11-24 05:49:13 +00:00
|
|
|
match (a / b, a % b) {
|
|
|
|
(d, r) if (r > zero && b < zero) || (r < zero && b > zero) => (d - one, r + b),
|
|
|
|
(d, r) => (d, r),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
|
|
|
use super::{mod_floor, div_mod_floor};
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_mod_floor() {
|
2015-01-09 18:27:24 +00:00
|
|
|
assert_eq!(mod_floor( 8, 3), 2);
|
|
|
|
assert_eq!(mod_floor( 8, -3), -1);
|
|
|
|
assert_eq!(mod_floor(-8, 3), 1);
|
|
|
|
assert_eq!(mod_floor(-8, -3), -2);
|
2014-11-24 05:49:13 +00:00
|
|
|
|
2015-01-09 18:27:24 +00:00
|
|
|
assert_eq!(mod_floor( 1, 2), 1);
|
|
|
|
assert_eq!(mod_floor( 1, -2), -1);
|
|
|
|
assert_eq!(mod_floor(-1, 2), 1);
|
|
|
|
assert_eq!(mod_floor(-1, -2), -1);
|
2014-11-24 05:49:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_div_mod_floor() {
|
2015-01-09 18:27:24 +00:00
|
|
|
assert_eq!(div_mod_floor( 8, 3), ( 2, 2));
|
|
|
|
assert_eq!(div_mod_floor( 8, -3), (-3, -1));
|
|
|
|
assert_eq!(div_mod_floor(-8, 3), (-3, 1));
|
|
|
|
assert_eq!(div_mod_floor(-8, -3), ( 2, -2));
|
2014-11-24 05:49:13 +00:00
|
|
|
|
2015-01-09 18:27:24 +00:00
|
|
|
assert_eq!(div_mod_floor( 1, 2), ( 0, 1));
|
|
|
|
assert_eq!(div_mod_floor( 1, -2), (-1, -1));
|
|
|
|
assert_eq!(div_mod_floor(-1, 2), (-1, 1));
|
|
|
|
assert_eq!(div_mod_floor(-1, -2), ( 0, -1));
|
2014-11-24 05:49:13 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|