ilyakooo0/monoidal-containers
1
0
Fork 0
mirror of https://github.com/ilyakooo0/monoidal-containers.git synced 2024-10-06 00:57:18 +03:00
Code Issues Projects Releases Wiki Activity
Maps using values' monoidal structure during merging
143 Commits 11 Branches 15 Tags 209 KiB
Haskell 99.5%
Nix 0.5%
c81e80f54d
Go to file
iko c81e80f54d
Split lens instances into a separate package
2021-08-28 21:49:33 +03:00
monoidal-containers Split lens instances into a separate package 2021-08-28 21:49:33 +03:00
monoidal-containers-lens Split lens instances into a separate package 2021-08-28 21:49:33 +03:00
.gitignore ignore cabal newstyle outputs. 2018-08-30 12:58:33 -04:00
.travis.yml Split lens instances into a separate package 2021-08-28 21:49:33 +03:00
cabal.project Split lens instances into a separate package 2021-08-28 21:49:33 +03:00
README.md Update README.md 2019-08-27 16:13:14 -04: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.