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. lpackArraysChunksOf :: forall (m :: Type -> Type) a . (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()

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

    No documentation available.

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

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

    This mutates the first array (if it has space) to append values from the second one. This would work for immutable arrays as well because an immutable array never has space so a new array is allocated instead of mutating it. | Coalesce adjacent arrays in incoming stream to form bigger arrays of a maximum specified size. Note that if a single array is bigger than the specified size we do not split it to fit. When we coalesce multiple arrays if the size would exceed the specified size we do not coalesce therefore the actual array size may be less than the specified chunk size.

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

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

    Like chunksOf but creates pinned arrays.

  4. bsChunksOf :: Int -> ByteString -> [ByteString]

    lz4-frame-conduit Codec.Compression.LZ4.Conduit

    No documentation available.

  5. listChunksOf :: Int -> [a] -> [[a]]

    slist Slist

    O(n). Splits a list into components of the given length. The last element may be shorter than the other chunks, depending on the length of the input. 

    >>> listChunksOf 3 [0..7]
[[0,1,2],[3,4,5],[6,7]]

>>> listChunksOf 0 [0..10]
[]

>>> listChunksOf (-13) [0..10]
[]

>>> listChunksOf 100 [1,2,3]
[[1,2,3]]

    >>> P.take 2 $ listChunksOf 3 [1..]
[[1,2,3],[4,5,6]]

Page 6 of many | Previous | Next