foldr package:unordered-containers

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).
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 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).
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.
foldrWithKey :: (k -> 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).
foldrWithKey' :: (k -> 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.