foldr' package:rio

foldr' :: (Word8 -> a -> a) -> a -> ByteString -> a
rio RIO.ByteString
foldr' is like foldr, but strict in the accumulator.
foldr' :: (a -> b -> b) -> b -> Map k a -> b
rio RIO.Map
O(n). 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
rio RIO.Set
O(n). 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' :: Vector v a => (a -> b -> b) -> b -> v a -> b
rio RIO.Vector
O(n) Right fold with a strict accumulator
foldr' :: (a -> b -> b) -> b -> Vector a -> b
rio RIO.Vector.Boxed
O(n) Right fold with a strict accumulator
foldr' :: Storable a => (a -> b -> b) -> b -> Vector a -> b
rio RIO.Vector.Storable
O(n) Right fold with a strict accumulator
foldr' :: Unbox a => (a -> b -> b) -> b -> Vector a -> b
rio RIO.Vector.Unboxed
O(n) Right fold with a strict accumulator
bifoldr' :: Bifoldable t => (a -> c -> c) -> (b -> c -> c) -> c -> t a b -> c
rio RIO.Prelude
As bifoldr, but strict in the result of the reduction functions at each step.
ifoldr' :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b
rio RIO.Vector
O(n) Right fold with strict accumulator (function applied to each element and its index)
ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b
rio RIO.Vector.Boxed
O(n) Right fold with strict accumulator (function applied to each element and its index)
ifoldr' :: Storable a => (Int -> a -> b -> b) -> b -> Vector a -> b
rio RIO.Vector.Storable
O(n) Right fold with strict accumulator (function applied to each element and its index)
ifoldr' :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
rio RIO.Vector.Unboxed
O(n) Right fold with strict accumulator (function applied to each element and its index)