alexfmpe

Fix overlap logic in shadowEncoder

3

`shadowEncoder`'s overlap check is neither sound nor complete. To avoid the "n * m" performance of checking everything against everything, it iterates one axis only. The idea is that if...

https://github.com/obsidiansystems/obelisk/pull/984 required me to state a law in terms of `Applicative parse` within a function that doesn't actually have that constraint. It turns out `EncoderImpl` itself has that awkwardness. One...

Should address https://github.com/haskell/containers/pull/953#discussion_r1257348718

Faster disjoint/isSubsetOf for Set via unbalanced splitting.

9

Unlike, say, `union`/`intersection`, `disjoint` doesn't return a new structure. It can avoid the re-balancing work because it immediately inspects and forgets the produced tree. This allows significant constant factor speedups....

I have: - [x] Based work on latest `develop` branch - [ ] Followed the [contribution guide](https://github.com/obsidiansystems/obelisk/blob/develop/CONTRIBUTING.md#submitting-changes) - [ ] Looked for lint in my changes with `hlint .` (lint...

I wanted to call it `dependentEncoder` since it exhibits a bit of context dependent parsing, but then there's the dependent sum aspect and the name would get confusing. While a...