Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

  1. chunksOfNonEmptyText :: forall (chunkSize :: Nat) (totalSize :: Nat) . (KnownNat chunkSize, KnownNat totalSize, chunkSize <= totalSize, 1 <= chunkSize) => NonEmptyText totalSize -> NonEmpty (NonEmptyText chunkSize)

    string-variants Data.StringVariants

    O(n) Splits a NonEmptyText into components of length chunkSize. The chunks may be shorter than the chunkSize depending on the length of the input and spacing. Each chunk is stripped of whitespace.

  2. chunksOfNonEmptyText :: forall (chunkSize :: Nat) (totalSize :: Nat) . (KnownNat chunkSize, KnownNat totalSize, chunkSize <= totalSize, 1 <= chunkSize) => NonEmptyText totalSize -> NonEmpty (NonEmptyText chunkSize)

    string-variants Data.StringVariants.NonEmptyText

    O(n) Splits a NonEmptyText into components of length chunkSize. The chunks may be shorter than the chunkSize depending on the length of the input and spacing. Each chunk is stripped of whitespace.

  3. chunksOfN :: Int -> ByteString -> [ByteString]

    attoparsec-framer Data.Attoparsec.Framer.Testing

    Split a ByteString into chunks of given size

  4. chunksOfTimeout :: forall t (m :: Type -> Type) a b . (IsStream t, MonadAsync m, Functor (t m)) => Int -> Double -> Fold m a b -> t m a -> t m b

    streamly Streamly.Internal.Data.Stream.IsStream

    Like chunksOf but if the chunk is not completed within the specified time interval then emit whatever we have collected till now. The chunk timeout is reset whenever a chunk is emitted. The granularity of the clock is 100 ms. 

    >>> s = Stream.delayPost 0.3 $ Stream.fromList [1..1000]

>>> f = Stream.mapM_ print $ Stream.chunksOfTimeout 5 1 Fold.toList s
    Pre-release

  5. chunksOfCE :: forall (m :: Type -> Type) seq . (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Split input into chunk of size chunkSize The last element may be smaller than the chunkSize (see also chunksOfExactlyE which will not yield this last element)

  6. chunksOfExactlyCE :: forall (m :: Type -> Type) seq . (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Split input into chunk of size chunkSize If the input does not split into chunks exactly, the remainder will be leftover (see also chunksOfE)

  7. pinnedChunksOf :: forall (m :: Type -> Type) a . (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)

    streamly-core Streamly.Internal.Data.Array

    Like chunksOf but creates pinned arrays.

  8. lpackArraysChunksOf :: forall (m :: Type -> Type) a . (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()

    streamly-core Streamly.Internal.Data.Array.Stream

    No documentation available.

  9. pinnedChunksOf :: forall (m :: Type -> Type) a . (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)

    streamly-core Streamly.Internal.Data.Array.Stream

    Like chunksOf but creates pinned arrays.

  10. pinnedChunksOf :: forall (m :: Type -> Type) a . (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)

    streamly-core Streamly.Internal.Data.MutArray

    Like chunksOf but creates pinned arrays.

Page 5 of many | Previous | Next