patch icon indicating copy to clipboard operation
patch copied to clipboard

Data structures for describing changes to other data structures.

Results 13 patch issues
Sort by recently updated
recently updated
newest added

There's a comment at the top of `Data.Monoid.DecidablyEmpty` which reads: `-- TODO upstream somwhere else?` That "somewhere else" already exists: [`Data.Monoid.Null`](https://hackage.haskell.org/package/monoid-subclasses-1.1.3/docs/Data-Monoid-Null.html) from [`monoid-subclasses`](https://hackage.haskell.org/package/monoid-subclasses). I had a look at the instances...

Continuing https://github.com/Taneb/groups/issues/7#issuecomment-1006968329 in a more appropriate place: Context: `patch` currently provides (but does not directly use) a `Group` class with lawless `instance (Ord k, Group g) => Group (MonoidalMap k...

From a discussion with a colleague, the following class emerged: ```haskell -- | Law: applyAlways (diff x y) x = y class Patch p => Diff p where -- |...

Credit to @xplat for the heterogeneous patch idea for use with dmap.

See change log, this does depend on https://github.com/reflex-frp/patch/issues/4 being resolved first, and possibly other issues.

From https://github.com/reflex-frp/reflex/pull/328 CC @treeowl

We should find an existing library for this

Giving `Identity` *meaning* just seems wrong: it should just get the underlying patch instance if it does anything at all. Worse, one cannot define the associated semigroup. `First` however already...

from https://github.com/reflex-frp/reflex/pull/357 CC @danbornside