{"push_id":1118380344,"size":2,"distinct_size":2,"ref":"refs/heads/alterF","head":"7d03d76b7647dc731da2e75dcdd45f6c2e667682","before":"2d047022bb63911104d393d06cefb5e4d7afa913","commits":[{"sha":"73ba96ade09b2e1720d529566c7bf834cd54853c","author":{"email":"22ee0097135072451429b5ac45630d52779cd49b@rufflewind.com","name":"Phil Ruffwind"},"message":"Implement lens-compatible `at` function\n\nAkin to `alter` but allows an arbitrary Functor.\nAdd benchmarks for `at`\nAdd tests for `at`\nAdd `at` from Lens to benchmarks for comparison","distinct":true,"url":"https://api.github.com/repos/treeowl/containers/commits/73ba96ade09b2e1720d529566c7bf834cd54853c"},{"sha":"7d03d76b7647dc731da2e75dcdd45f6c2e667682","author":{"email":"45974cab5fc33d9f0d3677077385ac4f89cda35f@gmail.com","name":"David Feuer"},"message":"Add `alterF` for Data.Map\n\nUse a bit queue to implement `alterF` for `Data.Map`. This is fairly\ncompetitive with the simple implementation in `Control.Lens.At`\neven with `Int` keys. For keys that are more expensive to compare,\nit should be substantially better. In case of extremely large maps\nthat would overflow the bit queue, this falls back to a slower,\nYoneda-based, implementation. This code is disabled when the word\nsize is at least 61, as maps with nearly a quadrillion entries seem\nsomewhat unlikely.\n\nAdd rules to specialize to `Const` and `Identity` functors.\n\nAdd QuickCheck properties to supplement the unit tests, including\nones that should trigger the rewrite rules and ones that should not.\n\nRemove some more pre-7.0 junk.","distinct":true,"url":"https://api.github.com/repos/treeowl/containers/commits/7d03d76b7647dc731da2e75dcdd45f6c2e667682"}]}