This seems like it could be easily done using json1. This could be done either as a flagged (off by default) module in selda-sqlite or as a separate selda-sqlite-json1 package.

The reason for not including the functionality in selda-sqlite by default is to avoid pulling in aeson's massive list of dependencies when they're not needed.

The moveToKey function is a O(n) search from its current position to the desired key or an error from the end of the object. The succinct data structures make this incredibly fast and the movements are super efficient.

But how efficient this is remains to be measured. Create benchmarks for an increasing in size ordered key object and find out where we run into performance problems by lookin

I think that for any functor m and clocks cl, cl', all ClSF m cl, SN m cl and Resbuf m cl cl' are instances of Profunctor. This means that we can pre- and postcompose them with pure functions, and that precomposition is contravariant. In arrows, precomposition is known as the (^>>) operator.

To do

• Add dependency of the `profunc