Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. calcTreeWidth :: Int -> Int -> Int

    haskoin-core Haskoin.Block.Merkle

    Computes the width of a Merkle tree at a specific height. The transactions are at height 0.

  2. quotInt :: Int -> Int -> Int

    ihaskell IHaskellPrelude

    Used to implement quot for the Integral typeclass. This performs integer division on its two parameters, truncated towards zero.

    Example

    >>> quotInt 10 2
5

    >>> quot 10 2
5

  3. remInt :: Int -> Int -> Int

    ihaskell IHaskellPrelude

    Used to implement rem for the Integral typeclass. This gives the remainder after integer division of its two parameters, satisfying 

    ((x `quot` y) * y) + (x `rem` y) == x

    Example

    >>> remInt 3 2
1

    >>> rem 3 2
1

  4. divInt :: Int -> Int -> Int

    ihaskell IHaskellPrelude

    Used to implement div for the Integral typeclass. This performs integer division on its two parameters, truncated towards negative infinity.

    Example

    >>> 10 `divInt` 2
5

    >>> 10 `div` 2
5

  5. modInt :: Int -> Int -> Int

    ihaskell IHaskellPrelude

    Used to implement mod for the Integral typeclass. This performs the modulo operation, satisfying 

    ((x `div` y) * y) + (x `mod` y) == x

    Example

    >>> 7 `modInt` 3
1

    >>> 7 `mod` 3
1

  6. maxInt :: Int -> Int -> Int

    hw-excess HaskellWorks.Data.Excess.Internal.Branchless

    No documentation available.

  7. minInt :: Int -> Int -> Int

    hw-excess HaskellWorks.Data.Excess.Internal.Branchless

    No documentation available.

  8. saturatedPow :: Int -> Int -> Int

    math-extras Math.Extras.Int

    saturatedPow a b computes a ^ b. Returns maxBound and minBound in case of overflow and underflow, respectively. NB: Like ^, the exponent must be non-negative.

  9. fullDecimalDigits :: Int -> Int -> Int

    floatshow Text.FShow.Raw

    fullDecimalDigits a e calculates the number of decimal digits that may be required to exactly display a value x = m * 2^e where m is an Integer satisfying 2^a <= m < 2^(a+1). Usually, the calculated value is not much larger than the actual number of digits in the exact decimal representation, but it will be if the exponent e is negative and has large absolute value and the mantissa is divisible by a large power of 2.

  10. mkArityTag :: Int -> Int -> Int

    ghc-lib GHC.StgToJS.Utils

    No documentation available.

Page 3 of many | Previous | Next