Safe Haskell	Safe-Inferred
Language	Haskell98

Algebra.RealIntegral

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, Ord a, C a) => C a where
- quot, rem :: a -> a -> a
- quotRem :: a -> a -> (a, a)

Documentation

class (C a, C a, Ord a, C a) => C a where Source #

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 div b will round towards minus infinity.

Minimal definition: nothing required

Minimal complete definition

Nothing

Methods

quot :: a -> a -> a infixl 7 Source #

rem :: a -> a -> a infixl 7 Source #

quotRem :: a -> a -> (a, a) Source #

Instances

Instances details

C Int Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Int -> Int -> Int Source # rem :: Int -> Int -> Int Source # quotRem :: Int -> Int -> (Int, Int) Source #
C Int8 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Int8 -> Int8 -> Int8 Source # rem :: Int8 -> Int8 -> Int8 Source # quotRem :: Int8 -> Int8 -> (Int8, Int8) Source #
C Int16 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Int16 -> Int16 -> Int16 Source # rem :: Int16 -> Int16 -> Int16 Source # quotRem :: Int16 -> Int16 -> (Int16, Int16) Source #
C Int32 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Int32 -> Int32 -> Int32 Source # rem :: Int32 -> Int32 -> Int32 Source # quotRem :: Int32 -> Int32 -> (Int32, Int32) Source #
C Int64 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Int64 -> Int64 -> Int64 Source # rem :: Int64 -> Int64 -> Int64 Source # quotRem :: Int64 -> Int64 -> (Int64, Int64) Source #
C Integer Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Integer -> Integer -> Integer Source # rem :: Integer -> Integer -> Integer Source # quotRem :: Integer -> Integer -> (Integer, Integer) Source #
C Word Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Word -> Word -> Word Source # rem :: Word -> Word -> Word Source # quotRem :: Word -> Word -> (Word, Word) Source #
C Word8 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Word8 -> Word8 -> Word8 Source # rem :: Word8 -> Word8 -> Word8 Source # quotRem :: Word8 -> Word8 -> (Word8, Word8) Source #
C Word16 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Word16 -> Word16 -> Word16 Source # rem :: Word16 -> Word16 -> Word16 Source # quotRem :: Word16 -> Word16 -> (Word16, Word16) Source #
C Word32 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Word32 -> Word32 -> Word32 Source # rem :: Word32 -> Word32 -> Word32 Source # quotRem :: Word32 -> Word32 -> (Word32, Word32) Source #
C Word64 Source #
Instance details Defined in Algebra.RealIntegral Methods quot :: Word64 -> Word64 -> Word64 Source # rem :: Word64 -> Word64 -> Word64 Source # quotRem :: Word64 -> Word64 -> (Word64, Word64) Source #
C T Source #
Instance details Defined in Number.Peano Methods quot :: T -> T -> T Source # rem :: T -> T -> T Source # quotRem :: T -> T -> (T, T) Source #
C a => C (T a) Source #
Instance details Defined in Number.NonNegative Methods quot :: T a -> T a -> T a Source # rem :: T a -> T a -> T a Source # quotRem :: T a -> T a -> (T a, T a) Source #
Integral a => C (T a) Source #
Instance details Defined in MathObj.Wrapper.Haskell98 Methods quot :: T a -> T a -> T a Source # rem :: T a -> T a -> T a Source # quotRem :: T a -> T a -> (T a, T a) Source #
(C a, C a) => C (T a) Source #
Instance details Defined in Number.NonNegativeChunky Methods quot :: T a -> T a -> T a Source # rem :: T a -> T a -> T a Source # quotRem :: T a -> T a -> (T a, T a) Source #
C a => C (T a) Source #
Instance details Defined in MathObj.Wrapper.NumericPrelude Methods quot :: T a -> T a -> T a Source # rem :: T a -> T a -> T a Source # quotRem :: T a -> T a -> (T a, T a) Source #