@@ -207,6 +207,8 @@ module Streamly.Internal.Data.Parser.ParserD.Type
207207 )
208208where
209209
210+#include "assert.hs"
211+
210212import Control.Applicative (Alternative(..), liftA2)
211213import Control.Exception (Exception(..))
212214import Control.Monad (MonadPlus(..), (>=>))
@@ -216,7 +218,6 @@ import Control.Monad.State.Class (MonadState, get, put)
216218import Control.Monad.Catch (MonadCatch, try, throwM, MonadThrow)
217219import Data.Bifunctor (Bifunctor(..))
218220import Fusion.Plugin.Types (Fuse(..))
219−import Streamly.Internal.Control.Exception (assertM)
220221import Streamly.Internal.Data.Fold.Type (Fold(..), toList)
221222import Streamly.Internal.Data.Tuple.Strict (Tuple3'(..))
222223
@@ -505,15 +506,15 @@ parseDToK pstep initial extract leftover (level, count) cont = do
505506 pRes <- pstep r x
506507 case pRes of
507508 Done n b -> do
508− assertM (n <= cnt1)
509+ assertM(n <= cnt1)
509510 cont (level, cnt1 - n) (K.Success n b)
510511 Error err ->
511512 cont (level, cnt1) (K.Failure err)
512513 Partial n pst1 -> do
513− assertM (n <= cnt1)
514+ assertM(n <= cnt1)
514515 return $ K.Partial n (parseCont (cnt1 - n) (return pst1))
515516 Continue n pst1 -> do
516− assertM (n <= cnt1)
517+ assertM(n <= cnt1)
517518 return $ K.Continue n (parseCont (cnt1 - n) (return pst1))
518519 parseCont cnt acc Nothing = do
519520 pst <- acc
@@ -584,7 +585,7 @@ fromParserK parser0 = Parser step initial extract
584585 -- always transitions to only FPKCont. The input remains unconsumed in
585586 -- this case so we use "n + 1".
586587 step (FPKDone n b) _ = do
587− assertM (n == 0)
588+ assertM(n == 0)
588589 return $ Done (n + 1) b
589590 step (FPKCont cont) a = do
590591 r <- cont (Just a)
@@ -981,7 +982,7 @@ alt (Parser stepL initialL extractL) (Parser stepR initialR extractR) =
981982 case r of
982983 Partial n s -> return $ Partial n (AltParseL 0 s)
983984 Continue n s -> do
984− assertM (cnt + 1 - n >= 0)
985+ assertM(cnt + 1 - n >= 0)
985986 return $ Continue n (AltParseL (cnt + 1 - n) s)
986987 Done n b -> return $ Done n b
987988 Error _ -> do
@@ -1038,13 +1039,13 @@ splitMany (Parser step1 initial1 extract1) (Fold fstep finitial fextract) =
10381039 let cnt1 = cnt + 1
10391040 case r of
10401041 Partial n s -> do
1041− assertM (cnt1 - n >= 0)
1042+ assertM(cnt1 - n >= 0)
10421043 return $ Continue n (Tuple3' s (cnt1 - n) fs)
10431044 Continue n s -> do
1044− assertM (cnt1 - n >= 0)
1045+ assertM(cnt1 - n >= 0)
10451046 return $ Continue n (Tuple3' s (cnt1 - n) fs)
10461047 Done n b -> do
1047− assertM (cnt1 - n >= 0)
1048+ assertM(cnt1 - n >= 0)
10481049 fstep fs b >>= handleCollect (Partial n) (Done n)
10491050 Error _ -> do
10501051 xs <- fextract fs
@@ -1098,13 +1099,13 @@ splitManyPost (Parser step1 initial1 extract1) (Fold fstep finitial fextract) =
10981099 let cnt1 = cnt + 1
10991100 case r of
11001101 Partial n s -> do
1101− assertM (cnt1 - n >= 0)
1102+ assertM(cnt1 - n >= 0)
11021103 return $ Continue n (Tuple3' s (cnt1 - n) fs)
11031104 Continue n s -> do
1104− assertM (cnt1 - n >= 0)
1105+ assertM(cnt1 - n >= 0)
11051106 return $ Continue n (Tuple3' s (cnt1 - n) fs)
11061107 Done n b -> do
1107− assertM (cnt1 - n >= 0)
1108+ assertM(cnt1 - n >= 0)
11081109 fstep fs b >>= handleCollect (Partial n) (Done n)
11091110 Error _ -> do
11101111 xs <- fextract fs
@@ -1171,13 +1172,13 @@ splitSome (Parser step1 initial1 extract1) (Fold fstep finitial fextract) =
11711172 let cnt1 = cnt + 1
11721173 case r of
11731174 Partial n s -> do
1174− assertM (cnt1 - n >= 0)
1175+ assertM(cnt1 - n >= 0)
11751176 return $ Continue n (Tuple3' s (cnt1 - n) (Left fs))
11761177 Continue n s -> do
1177− assertM (cnt1 - n >= 0)
1178+ assertM(cnt1 - n >= 0)
11781179 return $ Continue n (Tuple3' s (cnt1 - n) (Left fs))
11791180 Done n b -> do
1180− assertM (cnt1 - n >= 0)
1181+ assertM(cnt1 - n >= 0)
11811182 fstep fs b >>= handleCollect (Partial n) (Done n)
11821183 Error err -> return $ Error err
11831184 step (Tuple3' st cnt (Right fs)) a = do
@@ -1185,13 +1186,13 @@ splitSome (Parser step1 initial1 extract1) (Fold fstep finitial fextract) =
11851186 let cnt1 = cnt + 1
11861187 case r of
11871188 Partial n s -> do
1188− assertM (cnt1 - n >= 0)
1189+ assertM(cnt1 - n >= 0)
11891190 return $ Partial n (Tuple3' s (cnt1 - n) (Right fs))
11901191 Continue n s -> do
1191− assertM (cnt1 - n >= 0)
1192+ assertM(cnt1 - n >= 0)
11921193 return $ Continue n (Tuple3' s (cnt1 - n) (Right fs))
11931194 Done n b -> do
1194− assertM (cnt1 - n >= 0)
1195+ assertM(cnt1 - n >= 0)
11951196 fstep fs b >>= handleCollect (Partial n) (Done n)
11961197 Error _ -> Done cnt1 <$> fextract fs
11971198