@@ -256,7 +256,6 @@ import Streamly.Internal.Data.Stream.Serial (SerialT(..))
256import qualified Data.Map.Strict as Map
256import qualified Data.Map.Strict as Map
257import qualified Streamly.Internal.Data.Pipe.Type as Pipe
257import qualified Streamly.Internal.Data.Pipe.Type as Pipe
258-- import qualified Streamly.Internal.Data.Stream.IsStream.Enumeration as Stream
258-- import qualified Streamly.Internal.Data.Stream.IsStream.Enumeration as Stream
259−import qualified Streamly.Internal.Data.Stream.StreamK.Type as K
260import qualified Prelude
259import qualified Prelude
262import Prelude hiding
261import Prelude hiding
@@ -275,7 +274,9 @@ import Streamly.Internal.Data.Fold.Type
275-- >>> import qualified Streamly.Internal.Data.Stream.IsStream as Stream (parse, foldMany)
274-- >>> import qualified Streamly.Internal.Data.Stream.IsStream as Stream (parse, foldMany)
276-- >>> import qualified Streamly.Data.Fold as Fold
275-- >>> import qualified Streamly.Data.Fold as Fold
277-- >>> import qualified Streamly.Internal.Data.Fold as Fold
276-- >>> import qualified Streamly.Internal.Data.Fold as Fold
277+-- >>> import qualified Streamly.Internal.Data.Fold.Type as Fold
278-- >>> import qualified Streamly.Internal.Data.Parser as Parser
278-- >>> import qualified Streamly.Internal.Data.Parser as Parser
279+-- >>> import Streamly.Internal.Data.Stream.Serial (SerialT(..))
279-- >>> import Data.IORef (newIORef, readIORef, writeIORef)
280-- >>> import Data.IORef (newIORef, readIORef, writeIORef)
281------------------------------------------------------------------------------
282------------------------------------------------------------------------------
@@ -1694,12 +1695,12 @@ chunksBetween _low _high _f1 _f2 = undefined
1694-- /Warning!/ working on large streams accumulated as buffers in memory could
1695-- /Warning!/ working on large streams accumulated as buffers in memory could
1695-- be very inefficient, consider using "Streamly.Data.Array" instead.
1696-- be very inefficient, consider using "Streamly.Data.Array" instead.
1697−-- > toStream = foldr K.cons K.nil
1698+-- >>> toStream = fmap SerialT Fold.toStreamK
1699-- /Pre-release/
1700-- /Pre-release/
1700{-# INLINE toStream #-}
1701{-# INLINE toStream #-}
1701−toStream :: Monad m => Fold m a (SerialT Identity a)
1702+toStream :: Monad m => Fold m a (SerialT n a)
1702−toStream = fmap SerialT $ foldr K.cons K.nil
1703+toStream = fmap SerialT toStreamK
1704-- This is more efficient than 'toStream'. toStream is exactly the same as
1705-- This is more efficient than 'toStream'. toStream is exactly the same as
1705-- reversing the stream after toStreamRev.
1706-- reversing the stream after toStreamRev.
@@ -1707,7 +1708,7 @@ toStream = fmap SerialT $ foldr K.cons K.nil
1707-- | Buffers the input stream to a pure stream in the reverse order of the
1708-- | Buffers the input stream to a pure stream in the reverse order of the
1708-- input.
1709-- input.
1710−-- > toStreamRev = foldl' (flip K.cons) K.nil
1711+-- >>> toStreamRev = fmap SerialT Fold.toStreamKRev
1712-- /Warning!/ working on large streams accumulated as buffers in memory could
1713-- /Warning!/ working on large streams accumulated as buffers in memory could
1713-- be very inefficient, consider using "Streamly.Data.Array" instead.
1714-- be very inefficient, consider using "Streamly.Data.Array" instead.
@@ -1716,5 +1717,5 @@ toStream = fmap SerialT $ foldr K.cons K.nil
1717-- xn : ... : x2 : x1 : []
1718-- xn : ... : x2 : x1 : []
1718{-# INLINABLE toStreamRev #-}
1719{-# INLINABLE toStreamRev #-}
1719−toStreamRev :: Monad m => Fold m a (SerialT Identity a)
1720+toStreamRev :: Monad m => Fold m a (SerialT n a)
1720−toStreamRev = fmap SerialT $ foldl' (flip K.cons) K.nil
1721+toStreamRev = fmap SerialT toStreamKRev