ilyakooo0/monoidal-containers
1
0
Fork 0
mirror of https://github.com/ilyakooo0/monoidal-containers.git synced 2024-10-05 16:47:24 +03:00
Code Issues Projects Releases Wiki Activity
Maps using values' monoidal structure during merging
128 Commits 11 Branches 15 Tags 209 KiB
Haskell 99.5%
Nix 0.5%
ba647e7275
Go to file
Jack Kelly ba647e7275 Relax upper bound on these
2020-09-01 10:37:43 +10:00
src/Data Support semialign-1.1 2019-10-21 13:46:19 +03:00
.gitignore ignore cabal newstyle outputs. 2018-08-30 12:58:33 -04:00
.travis.yml ci: Update for ghc 8.6 and 8.8 2019-09-17 11:38:26 -04: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 Relax upper bound on these 2020-09-01 10:37:43 +10: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.