-
If you don't care about potential partiality, you can add a sorting combinator which works over any `Traversal`:
```haskell
import Data.Functor.Compose (Compose(..))
import Data.Monoid (Endo(..))…
-
Would it be possible to add a `fromMaybeOf` combinator? This would generalize `fromMaybe` to work on any `Traversal`. Or does this already exist in some form?
I imagine it would be implemented li…
-
We deal with two sequencing dimensions user specified ordering of stream and time ordering of stream. For example, the Ahead stream return values in the user specified sequence whereas the Async strea…
-
Dependent parsing allows semantic attribute to control the parsing. For example a new combinator `#e` expects a synthesized argument of type integer and repeat `e` exactly this number of times.
-
Have you considered implementing https://clang.llvm.org/docs/LibASTMatchersReference.html ?
They are very good at the least for prototyping with `clang-check`, and it would be nice if one could just …
-
Run a bunch of parsers, checking that they all succeed, without advancing the position.
Something like:
```
// [Parser e s (m t) a] -> Parser e s (m t) [a]
// or [forall a. Parser e s (m t) a] -> Par…
-
**Use case**
Currently clickhouse supports a set of functions which can be used in SimpleAggregateFunction Data Type for AggregatingMergeTree, but it is not complete, for example it doesn't support -…
-
Is there a setting that allow putting space around combinators ?
like `parent > child`
-
Conal Elliott has a pretty cool article on how [just fmap and (generalized) flip](http://conal.net/blog/posts/semantic-editor-combinators) are sufficient for doing complex transformations of functions…
-
**Describe the issue**
Aggregate functions with -Resample combinator don't work with some expressions that can be pre-evaluated and converted to constants.
**How to reproduce**
```sql
CREATE TAB…