Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. vectors :: VectorIDs -> Vector Text

   pinecone	Pinecone.Vectors

   No documentation available.

2. vectorOf :: MonadGen m => Int -> m a -> m [a]

   quickcheck-transformer	Test.QuickCheck.GenT

   Generates a list of the given length.

3. vectorRg :: Rg rg => rg -> [Int] -> Vector rg

   rg	Data.Rg

   list the items in the enumeration as a Vector, stopping as soon as an index is out of range

4. vectorCoercion :: (Coercible a b, Unboxable a, Unboxable b, CoercibleRep a ~ CoercibleRep b, Rep a ~ Rep b) => Coercion (Vector a) (Vector b)

   unboxing-vector	Data.Vector.Unboxing

   No documentation available.

5. package vector-bytes-instances

   Serial (from the bytes package) for Vector (from the vector package) Serial (from the bytes package) for Vector (from the vector package) Based on the original BSD3-licensed work by Don Stewart in the vector-binary-instances library.

6. package vector-fftw

   A binding to the fftw library for one-dimensional vectors. This package provides bindings to the fftw library for one-dimensional vectors. It provides both high-level functions and more low-level manipulation of fftw plans. We provide three different modules which wrap fftw's operations:

   • Numeric.FFT.Vector.Unnormalized contains the raw transforms;
   • Numeric.FFT.Vector.Invertible scales the backwards transforms to be true inverses;
   • Numeric.FFT.Vector.Unitary additionally scales all transforms to preserve the L2 (sum-of-squares) norm of the input.
   In addition, we provide .Multi modules for each of these providing multi-dimensional transforms.

7. package vector-mmap

   Memory map immutable and mutable vectors Memory map immutable and mutable vectors.

8. package vector-quicksort

   Fast and flexible quicksort implementation for mutable vectors Quicksort implementation developed with performance in mind. Has good default single-threaded sort and provides parallelised versions that are actually faster than the single-threaded version. Users can define new parallelisation methods. Good starting point:

   import Data.Vector.Algorithms.Quicksort qualified as Quick
   

   Then call as

   Quick.sort xs
   

9. package vector-rotcev

   Vectors with O(1) reverse A wrapper for an arbitrary Vector with O(1) reverse. Instead of creating a copy, it just flips a flag, which inverts indexing. Imagine it as a vector with a switch between little-endianness and big-endianness.

10. vectorLineIntegral :: CurveApprox -> VectorField -> Curve -> Vec

    LPFP-core	LPFPCore

    No documentation available.

Page 37 of many | Previous | Next