@@ -352,7 +352,7 @@ composeN' n f =
352352{-# INLINE insertBy #-}
353353{-# INLINE deleteBy #-}
354354{-# INLINE reverse #-}
355−{-# INLINE reverse' #-}
355+-- {-# INLINE reverse' #-}
356356{-# INLINE foldrS #-}
357357{-# INLINE foldrSMap #-}
358358{-# INLINE foldrT #-}
@@ -360,7 +360,7 @@ composeN' n f =
360360scan, scanl1', map, fmap, mapMaybe, filterEven, filterAllOut,
361361 filterAllIn, takeOne, takeAll, takeWhileTrue, takeWhileMTrue, dropOne,
362362 dropAll, dropWhileTrue, dropWhileMTrue, dropWhileFalse,
363− findIndices, elemIndices, insertBy, deleteBy, reverse, reverse',
363+ findIndices, elemIndices, insertBy, deleteBy, reverse, -- reverse',
364364 foldrS, foldrSMap, foldrT, foldrTMap
365365 :: MonadIO m
366366 => Int -> Stream m Int -> m ()
@@ -437,7 +437,7 @@ intersperse n = composeN n $ S.intersperse maxValue
437437insertBy n = composeN n $ S.insertBy compare maxValue
438438deleteBy n = composeN n $ S.deleteBy (>=) maxValue
439439reverse n = composeN n $ S.reverse
440−reverse' n = composeN n $ S.reverse'
440+-- reverse' n = composeN n $ S.reverse'
441441foldrS n = composeN n $ S.foldrS S.cons S.nil
442442foldrSMap n = composeN n $ S.foldrS (\x xs -> x + 1 `S.cons` xs) S.nil
443443foldrT n = composeN n $ S.foldrT S.cons S.nil