@@ -184,12 +184,12 @@ composeN n f =
184{-# INLINE _dropWhileMTrue #-}
184{-# INLINE _dropWhileMTrue #-}
185{-# INLINE dropWhileFalse #-}
185{-# INLINE dropWhileFalse #-}
186{-# INLINE _foldrS #-}
186{-# INLINE _foldrS #-}
187−{-# INLINE foldlS #-}
187+{-# INLINE _foldlS #-}
188{-# INLINE concatMap #-}
188{-# INLINE concatMap #-}
189{-# INLINE intersperse #-}
189{-# INLINE intersperse #-}
190scan, map, fmapD, mapM, mapMaybe, mapMaybeM, filterEven, filterAllOut,
190scan, map, fmapD, mapM, mapMaybe, mapMaybeM, filterEven, filterAllOut,
191 filterAllIn, _takeOne, takeAll, takeWhileTrue, _takeWhileMTrue, dropOne,
191 filterAllIn, _takeOne, takeAll, takeWhileTrue, _takeWhileMTrue, dropOne,
192− dropAll, dropWhileTrue, _dropWhileMTrue, dropWhileFalse, _foldrS, foldlS,
192+ dropAll, dropWhileTrue, _dropWhileMTrue, dropWhileFalse, _foldrS, _foldlS,
193 concatMap, intersperse
193 concatMap, intersperse
194 :: Monad m
194 :: Monad m
195 => Int -> Stream m Int -> m ()
195 => Int -> Stream m Int -> m ()
@@ -215,7 +215,7 @@ dropWhileTrue n = composeN n $ S.dropWhile (<= maxValue)
215_dropWhileMTrue n = composeN n $ S.dropWhileM (return . (<= maxValue))
215_dropWhileMTrue n = composeN n $ S.dropWhileM (return . (<= maxValue))
216dropWhileFalse n = composeN n $ S.dropWhile (> maxValue)
216dropWhileFalse n = composeN n $ S.dropWhile (> maxValue)
217_foldrS n = composeN n $ S.foldrS S.cons S.nil
217_foldrS n = composeN n $ S.foldrS S.cons S.nil
218−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
218+_foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
219concatMap n = composeN n $ (\s -> S.concatMap (\_ -> s) s)
219concatMap n = composeN n $ (\s -> S.concatMap (\_ -> s) s)
220intersperse n = composeN n $ S.intersperse maxValue
220intersperse n = composeN n $ S.intersperse maxValue
@@ -535,7 +535,7 @@ o_n_space =
537 -- This is horribly slow, never finishes
537 -- This is horribly slow, never finishes
538− benchFold "foldlS" (foldlS 1) sourceUnfoldrM
538+ -- benchFold "foldlS" (_foldlS 1) sourceUnfoldrM