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. takeVectorPattern :: Storable a => LazySize -> Vector a -> Vector a

   storablevector	Data.StorableVector.Lazy.Pattern

   Preserves the chunk pattern of the lazy vector.

2. type DefaultVector = Vector DefaultChunkSize

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

3. fromVectorLazy :: (Size size, Storable a) => Vector a -> Vector size a

   storablevector	Data.StorableVector.Lazy.Typed

   This will maintain all laziness breaks, but if chunks are too big, they will be split.

4. toVectorLazy :: Vector size a -> Vector a

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

5. runSTVector :: Storable e => (forall s . () => ST s (Vector s e)) -> Vector e

   storablevector	Data.StorableVector.ST.Lazy

   No documentation available.

6. runSTVector :: Storable e => (forall s . () => ST s (Vector s e)) -> Vector e

   storablevector	Data.StorableVector.ST.Strict

   No documentation available.

7. mapSegmentVectors :: (v n -> v' n') -> Segment c v n -> Segment c v' n'

   diagrams-lib	Diagrams.Segment

   Map over the vectors of each segment.

8. sumVector :: (Vector v Double, Summation s) => (s -> Double) -> v Double -> Double

   math-functions	Numeric.Sum

   O(n) Sum a vector of values.

9. module Data.Monoid.Instances.CharVector

   This module contains orphan IsString and TextualMonoid instances of Vector Char.

10. fromStorableVector :: Storable a => Vector a -> Array (ZeroBased Int) a

    comfort-array	Data.Array.Comfort.Storable

    No documentation available.

Page 50 of many | Previous | Next