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.
-
rio RIO.Vector.Boxed No documentation available.
-
rio RIO.Vector.Storable No documentation available.
MVector :: Int -> {-# UNPACK #-} !ForeignPtr a -> MVector s ario RIO.Vector.Storable No documentation available.
-
rio RIO.Vector.Unboxed No documentation available.
resampleVector :: (PrimMonad m, Vector v a) => Gen (PrimState m) -> v a -> m (v a)statistics Statistics.Resampling Create vector using resamples
-
Fast, packed, strict storable arrays with a list interface like ByteString Fast, packed, strict storable arrays with a list interface, a chunky lazy list interface with variable chunk size and an interface for write access via the ST monad. This is much like bytestring and binary but can be used for every Foreign.Storable.Storable type. See also package http://hackage.haskell.org/package/vector with a similar intention. We do not provide advanced fusion optimization, since especially for lazy vectors this would either be incorrect or not applicable. However we provide fusion with lazy lists in the package http://hackage.haskell.org/package/storablevector-streamfusion.
-
A time and space-efficient implementation of vectors using packed arrays, suitable for high performance use, both in terms of large data quantities, or high speed requirements. Vectors are encoded as strict arrays, held in a ForeignPtr, and can be passed between C and Haskell with little effort. This module is intended to be imported qualified, to avoid name clashes with Prelude functions. eg.
import qualified Data.StorableVector as V
Original GHC implementation by Bryan O'Sullivan. Rewritten to use UArray by Simon Marlow. Rewritten to support slices and use ForeignPtr by David Roundy. Polished and extended by Don Stewart. Generalized to any Storable value by Spencer Janssen. Chunky lazy stream, also with chunk pattern control, mutable access in ST monad, Builder monoid by Henning Thieleman. cancelNullVector :: (Vector a, b) -> Maybe (Vector a, b)storablevector Data.StorableVector.Lazy Warning: do not use it
toLazyStorableVector :: Storable a => ChunkSize -> Builder a -> Vector astorablevector Data.StorableVector.Lazy.Builder toLazyStorableVector (ChunkSize 7) $ foldMap put ['a'..'z']
splitAtVectorPattern :: Storable a => LazySize -> Vector a -> (Vector a, Vector a)storablevector Data.StorableVector.Lazy.Pattern No documentation available.