|
|
|
| Description |
Generally before using quot and rem, think twice.
In most cases divMod and friends are the right choice,
because they fulfill more of the wanted properties.
On some systems quot and rem are more efficient
and if you only use positive numbers, you may be happy with them.
But we cannot warrant the efficiency advantage.
See also:
Daan Leijen: Division and Modulus for Computer Scientists
http://www.cs.uu.nl/%7Edaan/download/papers/divmodnote-letter.pdf,
http://www.haskell.org/pipermail/haskell-cafe/2007-August/030394.html
|
|
| Synopsis |
|
| class (C a, C a) => C a where | |
|
|
| Documentation |
|
|
Remember that divMod does not specify exactly what a quot b should be,
mainly because there is no sensible way to define it in general.
For an instance of Algebra.RealIntegral.C a,
it is expected that a quot b will round towards 0 and
a Prelude.div b will round towards minus infinity.
Minimal definition: nothing required
| | | Methods | | | | | | quotRem :: a -> a -> (a, a) | Source |
|
| |  Instances | |
|
|
| Produced by Haddock version 2.4.2 |
