Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. dequeToVector :: forall v' a (v :: Type -> Type -> Type) m . (Vector v' a, MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (v' a)

    rio RIO.Deque

    Convert to an immutable vector of any type. If resulting pure vector corresponds to the mutable one used by the Deque, it will be more efficient to use freezeDeque instead.

    Example

    >>> :set -XTypeApplications

>>> import qualified RIO.Vector.Unboxed as U

>>> import qualified RIO.Vector.Storable as S

>>> d <- newDeque @U.MVector @Int

>>> mapM_ (pushFrontDeque d) [0..10]

>>> dequeToVector @S.Vector d
[10,9,8,7,6,5,4,3,2,1,0]

  2. type GVector = Vector

    rio RIO.Prelude.Types

    No documentation available.

  3. type SVector = Vector

    rio RIO.Prelude.Types

    No documentation available.

  4. type UVector = Vector

    rio RIO.Prelude.Types

    No documentation available.

  5. data MVector s a

    rio RIO.Vector.Boxed

    No documentation available.

  6. data MVector s a

    rio RIO.Vector.Storable

    No documentation available.

  7. MVector :: Int -> {-# UNPACK #-} !ForeignPtr a -> MVector s a

    rio RIO.Vector.Storable

    No documentation available.

  8. data family MVector s a

    rio RIO.Vector.Unboxed

    No documentation available.

  9. resampleVector :: (PrimMonad m, Vector v a) => Gen (PrimState m) -> v a -> m (v a)

    statistics Statistics.Resampling

    Create vector using resamples

  10. package storablevector

    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.

Page 49 of many | Previous | Next