-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Fast number-theoretic functions.
--   
--   Fast number-theoretic code with a high level of safety guaranteed by
--   ATS.
@package fast-arithmetic
@version 0.1.1.1


-- | This provides a few facilities for working with common combinatorial
--   functions.
module Numeric.Combinatorics
factorial :: Int -> IO Integer

-- | See <a>here</a>.
choose :: Int -> Int -> IO Integer
instance Foreign.Storable.Storable Numeric.Combinatorics.GMPInt


module Numeric.Integer

-- | O(√n)
isPrime :: Int -> Bool


module Numeric.NumberTheory

-- | Euler totient function.
totient :: Int -> Int

-- | Number of distinct divisors.
tau :: Int -> Int
littleOmega :: Int -> Int

-- | See <a>here</a>
isPerfect :: Int -> Bool


-- | Pure Haskell functions for testing and benchmarking. Specialized for
--   <a>Int</a>s.
module Numeric.Pure
hsIsPrime :: (Integral a) => a -> Bool
hsFactorial :: (Integral a) => a -> a
hsDoubleFactorial :: (Integral a) => a -> a
hsChoose :: (Integral a) => a -> a -> a
hsTotient :: (Integral a) => a -> a
hsTau :: (Integral a) => a -> Int
hsTotientSum :: (Integral a) => a -> a
hsLittleOmega :: (Integral a) => a -> Int
hsIsPerfect :: (Integral a) => a -> Bool