Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

Exact lookup

1. type VectorFunction = Vector Double -> Vector Double

   plot	Graphics.Rendering.Plot.Figure

   No documentation available.

2. vectorOf :: Int -> Gen a -> Gen [a]

   QuickCheck	Test.QuickCheck

   Generates a list of the given length.

3. vectorOf :: Int -> Gen a -> Gen [a]

   QuickCheck	Test.QuickCheck.Gen

   Generates a list of the given length.

4. vectorOf :: Int -> Gen a -> Gen [a]

   tasty-quickcheck	Test.Tasty.QuickCheck

   Generates a list of the given length.

5. vector2 :: (Vector v a, Vector v b, ToJSON a, ToJSON b) => Text -> Text -> v a -> v b -> Value

   criterion	Criterion.Report

   Render the elements of two vectors.

6. vectorIx :: forall (v :: Type -> Type) a . Vector v a => Int -> Traversal' (v a) a

   lens	Data.Vector.Generic.Lens

   Like ix but polymorphic in the vector type.

7. vectorTraverse :: forall (v :: Type -> Type) a (w :: Type -> Type) b . (Vector v a, Vector w b) => IndexedTraversal Int (v a) (w b) a b

   lens	Data.Vector.Generic.Lens

   Indexed vector traversal for a generic vector.

8. vectorBuilderC :: forall (m :: Type -> Type) v e n i r . (PrimMonad m, Vector v e, PrimMonad n, PrimState m ~ PrimState n) => Int -> ((e -> n ()) -> ConduitT i Void m r) -> ConduitT i (v e) m r

   conduit	Conduit

   Generally speaking, yielding values from inside a Conduit requires some allocation for constructors. This can introduce an overhead, similar to the overhead needed to represent a list of values instead of a vector. This overhead is even more severe when talking about unboxed values. This combinator allows you to overcome this overhead, and efficiently fill up vectors. It takes two parameters. The first is the size of each mutable vector to be allocated. The second is a function. The function takes an argument which will yield the next value into a mutable vector. Under the surface, this function uses a number of tricks to get high performance. For more information on both usage and implementation, please see: https://www.fpcomplete.com/user/snoyberg/library-documentation/vectorbuilder

9. vectorBuilder :: forall (m :: Type -> Type) n v e i r . (PrimMonad m, PrimMonad n, Vector v e, PrimState m ~ PrimState n) => Int -> ((e -> n ()) -> ConduitT i Void m r) -> ConduitT i (v e) m r

   conduit	Data.Conduit.Combinators

   Generally speaking, yielding values from inside a Conduit requires some allocation for constructors. This can introduce an overhead, similar to the overhead needed to represent a list of values instead of a vector. This overhead is even more severe when talking about unboxed values. This combinator allows you to overcome this overhead, and efficiently fill up vectors. It takes two parameters. The first is the size of each mutable vector to be allocated. The second is a function. The function takes an argument which will yield the next value into a mutable vector. Under the surface, this function uses a number of tricks to get high performance. For more information on both usage and implementation, please see: https://www.schoolofhaskell.com/user/snoyberg/library-documentation/vectorbuilder

10. vectorM :: forall (m :: Type -> Type) v a . (PrimMonad m, Vector v a) => FoldM m a (v a)

    foldl	Control.Foldl

    Fold all values into a vector This is more efficient than vector but is impure

Page 26 of many | Previous | Next