Hoogle Search

Within LTS Haskell 22.23 (ghc-9.6.5)

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

  1. difficultyCoeff :: Int -> Int

    LambdaHack Game.LambdaHack.Common.Faction

    No documentation available.

  2. fromStart :: Int -> Int

    input-parsers Text.Parser.Input.Position

    Construct a Position given the offset from the beginning of the full input.

  3. sumFuse :: Int -> Int

    perf Perf.Algos

    Fusion check

  4. sumFuseFoldl' :: Int -> Int

    perf Perf.Algos

    foldl' fusion

  5. sumFuseFoldr :: Int -> Int

    perf Perf.Algos

    foldr fusion

  6. runOneMore :: Int -> Int

    extensible-effects Control.Eff.QuickStart

    Run the oneMore effectful function by giving it a value to read. 

    runOneMore i = run . runReader i $ oneMore

    >>> runOneMore 1
2

  7. bitsToBytes :: Int -> Int

    flat Flat.Encoder.Size

    No documentation available.

  8. mtHeight :: Int -> Int

    merkle-tree Crypto.Hash.MerkleTree

    Merkle tree height

  9. clampChannel :: Int -> Int

    monomer Monomer.Graphics.Util

    Restricts a color channel to its valid range.

  10. xorwise :: Int -> Int

    tidal Sound.Tidal.UI

    An implementation of the well-known xorshift random number generator. Given a seed number, generates a reasonably random number out of it. This is an efficient algorithm suitable for use in tight loops and used to implement the below functions, which are used to implement rand. See George Marsaglia (2003). "Xorshift RNGs", in Journal of Statistical Software, pages 8–14.

Page 2 of many | Previous | Next