@@ -408,7 +408,7 @@ next = Parser step initial extract
408408-- /Pre-release/
409409--
410410{-# INLINE either #-}
411−either :: MonadThrow m => (a -> Either String b) -> Parser m a b
411+either :: Monad m => (a -> Either String b) -> Parser m a b
412412either f = Parser step initial extract
413413
414414 where
@@ -430,7 +430,7 @@ either f = Parser step initial extract
430430-- /Pre-release/
431431--
432432{-# INLINE maybe #-}
433−maybe :: MonadThrow m => (a -> Maybe b) -> Parser m a b
433+maybe :: Monad m => (a -> Maybe b) -> Parser m a b
434434-- maybe f = either (Maybe.maybe (Left "maybe: predicate failed") Right . f)
435435maybe parserF = Parser step initial extract
436436
@@ -453,7 +453,7 @@ maybe parserF = Parser step initial extract
453453-- /Pre-release/
454454--
455455{-# INLINE satisfy #-}
456−satisfy :: MonadThrow m => (a -> Bool) -> Parser m a a
456+satisfy :: Monad m => (a -> Bool) -> Parser m a a
457457-- satisfy predicate = maybe (\a -> if predicate a then Just a else Nothing)
458458satisfy predicate = Parser step initial extract
459459
@@ -1567,7 +1567,7 @@ postscan :: -- Monad m =>
15671567postscan = undefined
15681568
15691569{-# INLINE zipWithM #-}
1570−zipWithM :: MonadThrow m =>
1570+zipWithM :: Monad m =>
15711571 (a -> b -> m c) -> D.Stream m a -> Fold m c x -> Parser m b x
15721572zipWithM zf (D.Stream sstep state) (Fold fstep finitial fextract) =
15731573 Parser step initial extract
@@ -1623,14 +1623,14 @@ zipWithM zf (D.Stream sstep state) (Fold fstep finitial fextract) =
16231623-- /Pre-release/
16241624--
16251625{-# INLINE zip #-}
1626−zip :: MonadThrow m => D.Stream m a -> Fold m (a, b) x -> Parser m b x
1626+zip :: Monad m => D.Stream m a -> Fold m (a, b) x -> Parser m b x
16271627zip = zipWithM (curry return)
16281628
16291629-- | Pair each element of a fold input with its index, starting from index 0.
16301630--
16311631-- /Pre-release/
16321632{-# INLINE indexed #-}
1633−indexed :: forall m a b. MonadThrow m => Fold m (Int, a) b -> Parser m a b
1633+indexed :: forall m a b. Monad m => Fold m (Int, a) b -> Parser m a b
16341634indexed = zip (D.enumerateFromIntegral 0 :: D.Stream m Int)
16351635
16361636-- | @makeIndexFilter indexer filter predicate@ generates a fold filtering
@@ -1659,7 +1659,7 @@ makeIndexFilter f comb g = f . comb g . FL.lmap snd
16591659--
16601660-- /Pre-release/
16611661{-# INLINE sampleFromthen #-}
1662−sampleFromthen :: MonadThrow m => Int -> Int -> Fold m a b -> Parser m a b
1662+sampleFromthen :: Monad m => Int -> Int -> Fold m a b -> Parser m a b
16631663sampleFromthen offset size =
16641664 makeIndexFilter indexed FL.filter (\(i, _) -> (i + offset) `mod` size == 0)
16651665
@@ -2163,7 +2163,7 @@ data ManyTillState fs sr sl
21632163-- /Pre-release/
21642164--
21652165{-# INLINE manyTill #-}
2166−manyTill :: MonadThrow m
2166+manyTill :: Monad m
21672167 => Fold m b c -> Parser m a b -> Parser m a x -> Parser m a c
21682168manyTill (Fold fstep finitial fextract)
21692169 (Parser stepL initialL extractL)