ilyakooo0/monoidal-containers
1
0
Fork 0
mirror of https://github.com/ilyakooo0/monoidal-containers.git synced 2024-07-07 08:56:46 +03:00
Code Issues Projects Releases Wiki Activity
Maps using values' monoidal structure during merging
142 Commits 11 Branches 15 Tags 209 KiB
Haskell 99.5%
Nix 0.5%
master
Go to file
Ben Gamari 64c44462f8
Bump base upper bound
2021-04-20 21:05:13 -04:00
src/Data Derive Unalign instances 2020-10-10 12:19:31 +10:00
.gitignore ignore cabal newstyle outputs. 2018-08-30 12:58:33 -04:00
.travis.yml Regenerate Travis 2020-10-09 10:06:41 +10:00
Changelog.md Version 0.6.0.1 2019-11-25 21:16:25 -05:00
default.nix default.nix: Update for 0.6 2019-08-24 06:19:03 -04:00
LICENSE Monoidal map 2015-01-20 11:12:30 -05:00
monoidal-containers.cabal Bump base upper bound 2021-04-20 21:05:13 -04:00
README.md Update README.md 2019-08-27 16:13:14 -04:00
Setup.hs Monoidal map 2015-01-20 11:12:30 -05:00

README.md

monoidal-containers

Often when working with the containers offered by the containers and unordered-containers packages one would prefer the monoidal structure of the values to be used when resolving conflicts between keys when merging structures. Sadly, these are not the semantics offered by the provided instances. This package provides newtypes with an appropriate set of instances and utility functions to make them usable.

Important Note

This library is designed to be a drop-in replacement for Data.Map and similar. Absolutely no other semantic changes are introduced in functions like fromList or insert. They are still left-biased like Data.Map's. The only difference is in instances for Semigroup.