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.

Exact lookup

1. foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a

   rio	RIO.ByteString

   foldl' is like foldl, but strict in the accumulator.

2. foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a

   rio	RIO.ByteString.Lazy

   foldl' is like foldl, but strict in the accumulator.

3. foldlChunks :: (a -> StrictByteString -> a) -> a -> ByteString -> a

   rio	RIO.ByteString.Lazy

   Consume the chunks of a lazy ByteString with a strict, tail-recursive, accumulating left fold.

4. foldl1 :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8

   rio	RIO.ByteString.Lazy.Partial

   foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty ByteStrings.

5. foldl1' :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8

   rio	RIO.ByteString.Lazy.Partial

   foldl1' is like foldl1, but strict in the accumulator.

6. foldl1 :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8

   rio	RIO.ByteString.Partial

   foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty ByteStrings. An exception will be thrown in the case of an empty ByteString.

7. foldl1' :: HasCallStack => (Word8 -> Word8 -> Word8) -> ByteString -> Word8

   rio	RIO.ByteString.Partial

   foldl1' is like foldl1, but strict in the accumulator. An exception will be thrown in the case of an empty ByteString.

8. foldlDeque :: forall (v :: Type -> Type -> Type) a m acc . (MVector v a, PrimMonad m) => (acc -> a -> m acc) -> acc -> Deque v (PrimState m) a -> m acc

   rio	RIO.Deque

   Fold over a Deque, starting at the beginning. Does not modify the Deque.

9. foldl' :: (a -> v -> a) -> a -> HashMap k v -> a

   rio	RIO.HashMap

   Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

10. foldlWithKey' :: (a -> k -> v -> a) -> a -> HashMap k v -> a

    rio	RIO.HashMap

    Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

Page 40 of many | Previous | Next