Jacqueline Firth
Jacqueline Firth
Lenses for things provided from the `math` library in general could be very useful, but I'm not sure they should go in the main `lens` package. A side package like...
If `lens-set` version made sure to preserve the type of dict, then even if viewing didn't it'd still obey the lens laws, so it's not a deal breaker. I think...
Probably not, since when you actually go to create the dict you have to pict a concrete implementation like hashes or assoc lists. It would make more sense to have...
It makes sense to abstract over types when accessing, but not when _constructing_, because in order to actually create a dictionary from a set of items you have to pick...
Ah, I see, I totally misread your suggestion and didn't see the `make-dict` argument.That makes sense, at the very least we could implement it just to remove duplication.
What if it took only the `make-dict` argument, then returned a function that took the keys and lenses as varargs? That makes it easy to define your own dict lens...
Update: Ramda uses this order because Haskell does - Haskell does because it uses van Laarhoven lenses, which are functions and lens composition is the same as function composition. The...
It'd be really nice if we had a benchmarking suite and maybe some sort of Coveralls-like CI service for performance reports.
You're right. I was thinking an assoc list to list isomorphism would be something for converting `'(a 1 b 2 c 3)` to `'((a . 1) (b . 2) (c...
Maybe, but it'd probably be simpler and easier to just keep it separate.