Adithya Kumar

- `deleteBy` - `uniq` - `findIndices` - `elemIndices` The above can be implemented using `scanMaybe` along with `Fold` combinators.

Parser `Step` representation: make ParserK and ParserD consistent

6

In `ParserD` the `Int` in step indicates the amount of elements to backtrack. - `Partial 3 a` means go back by 3 elements before running the driver again. - `Partial...

Use streamly idioms to implement a few megaparsec combinators. The following to begin with. - takeRest - atEnd - match In doc, we can write about using parser-combinators with some...

Replacing `Continue` with `Partial` in the chunk parser does not work as expected

1

See https://github.com/composewell/streamly/commit/9efd2b211cb926dfd2236cb1867b8d96d5b09ff0 `Data.Parser.ParserK/o-n-heap/sequenceA` in `bench:Data.Parser.ParserK` fails with `Segmentation fault (core dumped)`

# Alternative to Deprecation ## Major changes * `Streamly.Prelude` is deprecated. * Streams have been monomorphized. * Concurrency is now explicit. The entire model of concurrency changed. ## Alternatives `Streamly.Prelude`...

WRT parsers and folds, you can think of, 1. Performing an action (`dropWhile`, `takeWhile`) 2. Getting a resulting object In all cases, both 1 and 2 happen but the hirerchy...