foldr' -package:base

foldr' :: (Word8 -> a -> a) -> a -> ByteString -> a
bytestring Data.ByteString Data.ByteString.Lazy
foldr' is like foldr, but strict in the accumulator.
foldr' :: (Char -> a -> a) -> a -> ByteString -> a
bytestring Data.ByteString.Char8
foldr' is a strict variant of foldr
foldr' :: (Char -> a -> a) -> a -> ByteString -> a
bytestring Data.ByteString.Lazy.Char8
foldr' is like foldr, but strict in the accumulator.
foldr' :: (Word8 -> a -> a) -> a -> ShortByteString -> a
bytestring Data.ByteString.Short Data.ByteString.Short.Internal
foldr' is like foldr, but strict in the accumulator.
foldr' :: (Char -> a -> a) -> a -> Text -> a
text Data.Text
O(n) A strict version of foldr. foldr' evaluates as a right-to-left traversal using constant stack space.
foldr' :: (a -> b -> b) -> b -> IntMap a -> b
containers Data.IntMap.Internal Data.IntMap.Lazy Data.IntMap.Strict Data.IntMap.Strict.Internal
A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldr' :: (Key -> b -> b) -> b -> IntSet -> b
containers Data.IntSet Data.IntSet.Internal
A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldr' :: (a -> b -> b) -> b -> Map k a -> b
containers Data.Map.Internal Data.Map.Lazy Data.Map.Strict Data.Map.Strict.Internal
A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldr' :: (a -> b -> b) -> b -> Set a -> b
containers Data.Set Data.Set.Internal
A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldr' :: (a -> b -> b) -> b -> KeyMap a -> b
aeson Data.Aeson.KeyMap
foldr' :: (a -> b -> b) -> b -> Vector a -> b
vector Data.Vector Data.Vector.Strict
O(n) Right fold with a strict accumulator.
foldr' :: Vector v a => (a -> b -> b) -> b -> v a -> b
vector Data.Vector.Generic
O(n) Right fold with a strict accumulator.
foldr' :: (PrimMonad m, MVector v a) => (a -> b -> b) -> b -> v (PrimState m) a -> m b
vector Data.Vector.Generic.Mutable
O(n) Pure right fold with strict accumulator.
foldr' :: PrimMonad m => (a -> b -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Mutable Data.Vector.Strict.Mutable
O(n) Pure right fold with strict accumulator.
foldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b
vector Data.Vector.Primitive
O(n) Right fold with a strict accumulator.
foldr' :: (PrimMonad m, Prim a) => (a -> b -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Primitive.Mutable
O(n) Pure right fold with strict accumulator.
foldr' :: Storable a => (a -> b -> b) -> b -> Vector a -> b
vector Data.Vector.Storable
O(n) Right fold with a strict accumulator.
foldr' :: (PrimMonad m, Storable a) => (a -> b -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Storable.Mutable
O(n) Pure right fold with strict accumulator.
foldr' :: Unbox a => (a -> b -> b) -> b -> Vector a -> b
vector Data.Vector.Unboxed
O(n) Right fold with a strict accumulator.
foldr' :: (PrimMonad m, Unbox a) => (a -> b -> b) -> b -> MVector (PrimState m) a -> m b
vector Data.Vector.Unboxed.Mutable
O(n) Pure right fold with strict accumulator.
foldr' :: (v -> a -> a) -> a -> HashMap k v -> a
unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict
Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-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.
foldr' :: (a -> b -> b) -> b -> Array a -> b
unordered-containers Data.HashMap.Internal.Array
foldr' :: (b -> a -> a) -> a -> HashSet b -> a
unordered-containers Data.HashSet.Internal
Reduce this set by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before before using the result in the next application. This function is strict in the starting value.
foldr' :: (a -> b -> b) -> b -> Word64Map a -> b
ghc GHC.Data.Word64Map.Internal GHC.Data.Word64Map.Lazy GHC.Data.Word64Map.Strict GHC.Data.Word64Map.Strict.Internal
A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.
foldr' :: (Key -> b -> b) -> b -> Word64Set -> b
ghc GHC.Data.Word64Set
A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.