:: Int -> Integer -package:base

integerFromInt :: Int -> Integer

ghc-bignum GHC.Num.Integer, ihaskell IHaskellPrelude

Create an Integer from an Int

fromInt :: Int -> Integer

integer-types Integer.Integer

toId :: Coercible Id a => Int -> a

dejafu Test.DejaFu.SCT.Internal

Helper function for constructing IDs of any sort.

toEnum :: Enum a => Int -> a

hedgehog Hedgehog.Internal.Prelude, base-compat Prelude.Compat, protolude Protolude Protolude.Base, haskell-gi-base Data.GI.Base.ShortPrelude, relude Relude.Enum, rio RIO.Partial, base-prelude BasePrelude, classy-prelude ClassyPrelude, numeric-prelude NumericPrelude NumericPrelude.Base, Cabal-syntax Distribution.Compat.Prelude, basic-prelude CorePrelude, universum Universum.Base, ihaskell IHaskellPrelude, basement Basement.Compat.Base Basement.Imports, numhask NumHask.Prelude, clash-prelude Clash.HaskellPrelude, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, prelude-compat Prelude2010, ghc-internal GHC.Internal.Enum, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, copilot-language Copilot.Language.Prelude, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, vcr Imports, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude

Convert from an Int.

toEnum :: Enum a => Int -> a

ghc GHC.Prelude.Basic

toInteger :: Integral a => a -> Integer

hedgehog Hedgehog.Internal.Prelude, base-compat Prelude.Compat, protolude Protolude Protolude.Base, rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, basic-prelude CorePrelude, universum Universum.Base, ihaskell IHaskellPrelude, clash-prelude Clash.HaskellPrelude, fin Data.Fin, ghc-lib-parser GHC.Prelude.Basic, prelude-compat Prelude2010, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, xmonad-contrib XMonad.Config.Prime, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, copilot-language Copilot.Language.Prelude, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, vcr Imports, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude

conversion to Integer

toInteger :: Integral a => a -> Integer

ghc GHC.Prelude.Basic

toInteger :: Integral a => a -> Integer

relude Relude.Numeric, ghc-internal GHC.Internal.Real, verset Verset

Conversion to Integer.

radix :: C a => a -> Integer

numeric-prelude Algebra.FloatingPoint

toInteger :: C a => a -> Integer

numeric-prelude Algebra.ToInteger NumericPrelude NumericPrelude.Numeric

fibonacci :: Num a => Int -> a

arithmoi Math.NumberTheory.Recurrences.Linear

fibonacci k calculates the k-th Fibonacci number in O(log (abs k)) steps. The index may be negative. This is efficient for calculating single Fibonacci numbers (with large index), but for computing many Fibonacci numbers in close proximity, it is better to use the simple addition formula starting from an appropriate pair of successive Fibonacci numbers.

lucas :: Num a => Int -> a

arithmoi Math.NumberTheory.Recurrences.Linear

lucas k computes the k-th Lucas number. Very similar to fibonacci.

numDigitsInt :: Integral a => Int -> a

hledger-lib Hledger.Utils

Find the number of digits of an Int.

bellSeries :: (Floating a, Enum a) => Int -> a

combinatorial Combinatorics.BellNumbers

equalFuncList (\k -> round (Bell.bellSeries (fromInteger k) :: Double)) (Bell.bellRec :: [Integer]) 20

intSeedToRand :: Fractional a => Int -> a

tidal Sound.Tidal.Boot, tidal-core Sound.Tidal.UI

unsafeCoerce# :: forall (q :: RuntimeRep) (r :: RuntimeRep) (a :: TYPE q) (b :: TYPE r) . a -> b

base-prelude BasePrelude

Highly, terribly dangerous coercion from one representation type to another. Misuse of this function can invite the garbage collector to trounce upon your data and then laugh in your face. You don't want this function. Really.