Copyright | (C) 2014 Herbert Valerio Riedel (C) 2011 Edward Kmett |
---|---|
License | see libraries/base/LICENSE |
Maintainer | libraries@haskell.org |
Stability | internal |
Portability | non-portable (GHC Extensions) |
Safe Haskell | None |
Language | Haskell2010 |
The arbitrary-precision Natural
number type.
Note: This is an internal GHC module with an API subject to
change. It's recommended use the Numeric.Natural module to import
the Natural
type.
Since: base-4.8.0.0
Synopsis
- data Natural
- mkNatural :: [Word] -> Natural
- isValidNatural :: Natural -> Bool
- plusNatural :: Natural -> Natural -> Natural
- minusNatural :: Natural -> Natural -> Natural
- minusNaturalMaybe :: Natural -> Natural -> Maybe Natural
- timesNatural :: Natural -> Natural -> Natural
- negateNatural :: Natural -> Natural
- signumNatural :: Natural -> Natural
- quotRemNatural :: Natural -> Natural -> (Natural, Natural)
- quotNatural :: Natural -> Natural -> Natural
- remNatural :: Natural -> Natural -> Natural
- gcdNatural :: Natural -> Natural -> Natural
- lcmNatural :: Natural -> Natural -> Natural
- andNatural :: Natural -> Natural -> Natural
- orNatural :: Natural -> Natural -> Natural
- xorNatural :: Natural -> Natural -> Natural
- bitNatural :: Int# -> Natural
- testBitNatural :: Natural -> Int -> Bool
- popCountNatural :: Natural -> Int
- shiftLNatural :: Natural -> Int -> Natural
- shiftRNatural :: Natural -> Int -> Natural
- naturalToInteger :: Natural -> Integer
- naturalToWord :: Natural -> Word
- naturalToInt :: Natural -> Int
- naturalFromInteger :: Integer -> Natural
- wordToNatural :: Word -> Natural
- intToNatural :: Int -> Natural
- naturalToWordMaybe :: Natural -> Maybe Word
- wordToNatural# :: Word# -> Natural
- wordToNaturalBase :: Word# -> Natural
- powModNatural :: Natural -> Natural -> Natural -> Natural
The Natural
number type
Warning: The internal implementation of Natural
(i.e. which constructors are available) depends on the
Integer
backend used!
Type representing arbitrary-precision non-negative integers.
>>>
2^100 :: Natural
1267650600228229401496703205376
Operations whose result would be negative
,throw
(Underflow
:: ArithException
)
>>>
-1 :: Natural
*** Exception: arithmetic underflow
Since: base-4.8.0.0
NatS# GmpLimb# | in |
NatJ# !BigNat | in Invariant: |
Instances
Enum Natural # | Since: base-4.8.0.0 |
Eq Natural # | Since: base-4.8.0.0 |
Integral Natural # | Since: base-4.8.0.0 |
Defined in GHC.Real | |
Data Natural # | Since: base-4.8.0.0 |
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Natural -> c Natural # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Natural # toConstr :: Natural -> Constr # dataTypeOf :: Natural -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Natural) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Natural) # gmapT :: (forall b. Data b => b -> b) -> Natural -> Natural # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQ :: (forall d. Data d => d -> u) -> Natural -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Natural -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural # | |
Num Natural # | Note that Since: base-4.8.0.0 |
Ord Natural # | Since: base-4.8.0.0 |
Read Natural # | Since: base-4.8.0.0 |
Real Natural # | Since: base-4.8.0.0 |
Defined in GHC.Real toRational :: Natural -> Rational # | |
Show Natural # | Since: base-4.8.0.0 |
Ix Natural # | Since: base-4.8.0.0 |
Bits Natural # | Since: base-4.8.0 |
Defined in Data.Bits (.&.) :: Natural -> Natural -> Natural # (.|.) :: Natural -> Natural -> Natural # xor :: Natural -> Natural -> Natural # complement :: Natural -> Natural # shift :: Natural -> Int -> Natural # rotate :: Natural -> Int -> Natural # setBit :: Natural -> Int -> Natural # clearBit :: Natural -> Int -> Natural # complementBit :: Natural -> Int -> Natural # testBit :: Natural -> Int -> Bool # bitSizeMaybe :: Natural -> Maybe Int # shiftL :: Natural -> Int -> Natural # unsafeShiftL :: Natural -> Int -> Natural # shiftR :: Natural -> Int -> Natural # unsafeShiftR :: Natural -> Int -> Natural # rotateL :: Natural -> Int -> Natural # | |
PrintfArg Natural # | Since: base-4.8.0.0 |
Defined in Text.Printf formatArg :: Natural -> FieldFormatter # parseFormat :: Natural -> ModifierParser # |
isValidNatural :: Natural -> Bool #
Arithmetic
negateNatural :: Natural -> Natural #
signumNatural :: Natural -> Natural #
quotNatural :: Natural -> Natural -> Natural #
remNatural :: Natural -> Natural -> Natural #
gcdNatural :: Natural -> Natural -> Natural #
Compute greatest common divisor.
lcmNatural :: Natural -> Natural -> Natural #
compute least common multiplier.
Bits
andNatural :: Natural -> Natural -> Natural #
xorNatural :: Natural -> Natural -> Natural #
bitNatural :: Int# -> Natural #
testBitNatural :: Natural -> Int -> Bool #
popCountNatural :: Natural -> Int #
shiftLNatural :: Natural -> Int -> Natural #
shiftRNatural :: Natural -> Int -> Natural #
Conversions
naturalToInteger :: Natural -> Integer #
@since 4.X.0.0
naturalToWord :: Natural -> Word #
naturalToInt :: Natural -> Int #
naturalFromInteger :: Integer -> Natural #
Since: base-4.10.0.0
intToNatural :: Int -> Natural #
naturalToWordMaybe :: Natural -> Maybe Word #
wordToNatural# :: Word# -> Natural #
Convert a Word# into a Natural
Built-in rule ensures that applications of this function to literal Word# are lifted into Natural literals.
wordToNaturalBase :: Word# -> Natural #
Convert a Word# into a Natural
In base we can't use wordToNatural# as built-in rules transform some of them into Natural literals. Use this function instead.
Modular arithmetic
powModNatural :: Natural -> Natural -> Natural -> Natural #
"
" computes base powModNatural
b e mb
raised to
exponent e
modulo m
.
Since: base-4.8.0.0