Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

  1. toEnum :: Enum a => Int -> a

    copilot-language Copilot.Language.Prelude

    Convert from an Int.

  2. numDigitsInt :: Integral a => Int -> a

    hledger-lib Hledger.Utils

    Find the number of digits of an Int.

  3. 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.

  4. lucas :: Num a => Int -> a

    arithmoi Math.NumberTheory.Recurrences.Linear

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

  5. intSeedToRand :: Fractional a => Int -> a

    tidal-core Sound.Tidal.UI

    No documentation available.

  6. intSeedToRand :: Fractional a => Int -> a

    tidal Sound.Tidal.Boot

    No documentation available.

  7. numSegs :: forall c (v :: Type -> Type) n a . (Num c, Measured (SegMeasure v n) a) => a -> c

    diagrams-lib Diagrams

    Compute the number of segments of anything measured by SegMeasure (e.g. SegMeasure itself, Segment, SegTree, Trails...)

  8. numSegs :: forall c (v :: Type -> Type) n a . (Num c, Measured (SegMeasure v n) a) => a -> c

    diagrams-lib Diagrams.Trail

    Compute the number of segments of anything measured by SegMeasure (e.g. SegMeasure itself, Segment, SegTree, Trails...)

  9. norm :: C a v => v -> a

    numeric-prelude Algebra.NormedSpace.Euclidean

    Euclidean norm of a vector.

  10. norm :: C a v => v -> a

    numeric-prelude Algebra.NormedSpace.Maximum

    No documentation available.

Page 8 of many | Previous | Next