Jacqueline Firth
Jacqueline Firth
Closes #247 This should increase the minor version as in the process of implementing this, a new struct was provided by the main library.
Similar to the struct:foo form created by `(struct foo ...)`, this should be a transformer binding holding a list of the lens ids. Used for reflection at compile time. `struct-lenses-out`...
The naive approach of `hash->list` + `list->hash` doesn't work because no ordering is guaranteed, this breaks the lens laws. One possible approach: - hash to set isomorphism where set contains...
`lens-compose` should compose lenses in the same order as `compose` (it does currently, but it should be documented in tests that this order is preferred). This is to preserve the...
Definitely include: - [x] struct-nested-lens - [ ] struct-pick - [ ] lens-join/struct - [x] set-filter-lens - [x] mapper-lens - [x] vector-mapper-lens - [x] struct-lenses-out - [x] Sublist lenses -...
It's irritating to have to move things from unstable to stable when releasing, and it's difficult to organize the code when there's internals that unstable features depend on. It may...
This is some example code from [oflatt/space-orbs](https://github.com/oflatt/space-orbs): ``` racket (define game-orbs-enemys-lens (lens-thrush game-orbs-lens orbs-enemys-lens)) (define game-orbs-player-lens (lens-thrush game-orbs-lens orbs-player-lens)) (define game-orbs-player-pos-lens (lens-thrush game-orbs-player-lens orb-pos-lens)) (define game-orbs-player-time-lens (lens-thrush game-orbs-player-lens orb-time-lens)) (define...
A suite of benchmarks giving performance data about lens uses is needed to spot performance problems and measure optimizations.
Would it be worthwhile to use `quickcheck` to make lens law property checks? This has the advantage of making it much easier to find corner cases that break the lens...