Hoogle Search

Within LTS Haskell 24.58 (ghc-9.10.3)

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

Exact lookup

1. withMatrix :: Matrix ℝ -> (forall (m :: Nat) (n :: Nat) . (KnownNat m, KnownNat n) => L m n -> z) -> z

   hmatrix	Numeric.LinearAlgebra.Static

   No documentation available.

2. module Data.Vector.Algorithms.Radix

   This module provides a radix sort for a subclass of unboxed arrays. The radix class gives information on * the number of passes needed for the data type

   • the size of the auxiliary arrays
   • how to compute the pass-k radix of a value
   Radix sort is not a comparison sort, so it is able to achieve O(n) run time, though it also uses O(n) auxiliary space. In addition, there is a constant space overhead of 2*size*sizeOf(Int) for the sort, so it is not advisable to use this sort for large numbers of very small arrays. A standard example (upon which one could base their own Radix instance) is Word32:
   • We choose to sort on r = 8 bits at a time
   • A Word32 has b = 32 bits total
   Thus, b/r = 4 passes are required, 2^r = 256 elements are needed in an auxiliary array, and the radix function is:

   radix k e = (e `shiftR` (k*8)) .&. 255
   

3. class Radix e

   vector-algorithms	Data.Vector.Algorithms.Radix

   No documentation available.

4. radix :: Radix e => Int -> e -> Int

   vector-algorithms	Data.Vector.Algorithms.Radix

   The radix function parameterized by the current pass

5. configPrefix :: Config -> String

   weigh	Weigh

   No documentation available.

6. module Data.MonoTraversable.Unprefixed

   The functions in Data.MonoTraversable are all prefixed with the letter o to avoid conflicts with their polymorphic counterparts. This module exports the same identifiers without the prefix, for all cases where the monomorphic variant loses no generality versus the polymorphic version. For example, olength is just as general as Data.Foldable.length, so we export length = length. By contrast, omap cannot fully subsume fmap or map, so we do not provide such an export.

7. dropPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq

   mono-traversable	Data.Sequences

   dropPrefix drops the given prefix from a sequence. It returns the original sequence if the sequence doesn't start with the given prefix.

   > dropPrefix "foo" "foobar"
   "bar"
   > dropPrefix "abc" "foobar"
   "foobar"
   

8. dropSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq

   mono-traversable	Data.Sequences

   dropSuffix drops the given suffix from a sequence. It returns the original sequence if the sequence doesn't end with the given suffix.

   > dropSuffix "bar" "foobar"
   "foo"
   > dropSuffix "abc" "foobar"
   "foobar"
   

9. ensurePrefix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq

   mono-traversable	Data.Sequences

   ensurePrefix will add a prefix to a sequence if it doesn't exist, and otherwise have no effect.

   > ensurePrefix "foo" "foobar"
   "foobar"
   > ensurePrefix "abc" "foobar"
   "abcfoobar"
   

10. ensureSuffix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq

    mono-traversable	Data.Sequences

    Append a suffix to a sequence, unless it already has that suffix.

    > ensureSuffix "bar" "foobar"
    "foobar"
    > ensureSuffix "abc" "foobar"
    "foobarabc"
    

Page 128 of many | Previous | Next