@@ -1446,14 +1446,14 @@ manyThen _parser _recover _f = undefined
14461446--
14471447{-# INLINE deintercalate #-}
14481448deintercalate :: Monad m =>
1449− Fold m (Either x y) z
1450− -> Parser m a x
1449+ Parser m a x
14511450 -> Parser m a y
1451+ -> Fold m (Either x y) z
14521452 -> Parser m a z
1453−deintercalate sink contentL contentR =
1453+deintercalate contentL contentR sink =
14541454 D.toParserK
14551455 $ D.deintercalate
1456− sink (D.fromParserK contentL) (D.fromParserK contentR)
1456+ (D.fromParserK contentL) (D.fromParserK contentR) sink
14571457
14581458-- | Parse items separated by a separator parsed by the supplied parser. At
14591459-- least one item must be present for the parser to succeed.
@@ -1474,7 +1474,7 @@ sepBy1 sink p sep = do
14741474-- run, when it is done content parser is run again and so on. If none of the
14751475-- parsers consumes an input then parser returns a failure.
14761476--
1477−-- >>> sepBy sink = Parser.deintercalate (Fold.lefts sink)
1477+-- >>> sepBy sink p1 p2 = Parser.deintercalate p1 p2 (Fold.lefts sink)
14781478-- >>> sepBy sink content sep = Parser.sepBy1 sink content sep <|> return mempty
14791479--
14801480{-# INLINE sepBy #-}