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.

  1. package vector-extras

    Utilities for the "vector" library This library is in an experimental state. Users should be prepared for frequent updates.

  2. toVectorOf :: Vector v a => Getting (Endo [a]) s a -> s -> v a

    lens Data.Vector.Generic.Lens

    Similar to toListOf, but returning a Vector.

    >>> (toVectorOf both (8,15) :: Vector.Vector Int) == Vector.fromList [8,15]
    True
    

  3. toVectorOf :: Getting (Endo [a]) s a -> s -> Vector a

    lens Data.Vector.Lens

    Similar to toListOf, but returning a Vector.

    >>> toVectorOf both (8,15) == Vector.fromList [8,15]
    True
    

  4. conduitVector :: forall v a (m :: Type -> Type) . (Vector v a, PrimMonad m) => Int -> ConduitT a (v a) m ()

    conduit Conduit

    Break up a stream of values into vectors of size n. The final vector may be smaller than n if the total number of values is not a strict multiple of n. No empty vectors will be yielded.

  5. sinkVector :: forall v a (m :: Type -> Type) o . (Vector v a, PrimMonad m) => ConduitT a o m (v a)

    conduit Conduit

    Sink incoming values into a vector, growing the vector as necessary to fit more elements. Note that using this function is more memory efficient than sinkList and then converting to a Vector, as it avoids intermediate list constructors. Subject to fusion

  6. sinkVectorN :: forall v a (m :: Type -> Type) o . (Vector v a, PrimMonad m) => Int -> ConduitT a o m (v a)

    conduit Conduit

    Sink incoming values into a vector, up until size maxSize. Subsequent values will be left in the stream. If there are less than maxSize values present, returns a Vector of smaller size. Note that using this function is more memory efficient than sinkList and then converting to a Vector, as it avoids intermediate list constructors. Subject to fusion

  7. conduitVector :: forall v a (m :: Type -> Type) . (Vector v a, PrimMonad m) => Int -> ConduitT a (v a) m ()

    conduit Data.Conduit.Combinators

    Break up a stream of values into vectors of size n. The final vector may be smaller than n if the total number of values is not a strict multiple of n. No empty vectors will be yielded.

  8. sinkVector :: forall v a (m :: Type -> Type) o . (Vector v a, PrimMonad m) => ConduitT a o m (v a)

    conduit Data.Conduit.Combinators

    Sink incoming values into a vector, growing the vector as necessary to fit more elements. Note that using this function is more memory efficient than sinkList and then converting to a Vector, as it avoids intermediate list constructors. Subject to fusion

  9. sinkVectorN :: forall v a (m :: Type -> Type) o . (Vector v a, PrimMonad m) => Int -> ConduitT a o m (v a)

    conduit Data.Conduit.Combinators

    Sink incoming values into a vector, up until size maxSize. Subsequent values will be left in the stream. If there are less than maxSize values present, returns a Vector of smaller size. Note that using this function is more memory efficient than sinkList and then converting to a Vector, as it avoids intermediate list constructors. Subject to fusion

  10. sinkVectorNS :: forall (v :: Type -> Type) a (m :: Type -> Type) . (Vector v a, PrimMonad m) => Int -> StreamConsumer a m (v a)

    conduit Data.Conduit.Combinators.Stream

    No documentation available.

Page 40 of many | Previous | Next