map-syntax: Syntax sugar for defining maps

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

Haskell's canonical list of tuples syntax for defining maps is not very convenient and also has ambiguous semantics. This package leverages do notation to create a lighter syntax that makes semantics explicit and also allows the option of fail-fast handling of duplicate keys.


[Skip to Readme]

Modules

[Index]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1, 0.2, 0.2.0.1, 0.2.0.2, 0.3
Dependencies base (>=4.3 && <5), containers (>=0.3 && <0.8), mtl (>=2.0 && <2.4), semigroups (>=0.18 && <0.19) [details]
Tested with ghc ==9.10.1, ghc ==9.8.2, ghc ==9.6.5, ghc ==9.4.8, ghc ==9.2.8, ghc ==9.0.2, ghc ==8.10.7, ghc ==8.8.4, ghc ==8.6.5, ghc ==8.4.4, ghc ==8.2.2, ghc ==8.0.2
License BSD-3-Clause
Author Doug Beardsley
Maintainer mightybyte@gmail.com
Revised Revision 9 made by AndreasAbel at 2024-06-30T20:07:58Z
Category Data Structures
Source repo head: git clone https://github.com/mightybyte/map-syntax.git
Uploaded by DougBeardsley at 2018-04-03T20:49:14Z
Distributions Debian:0.3, FreeBSD:0.2, LTSHaskell:0.3, NixOS:0.3, Stackage:0.3
Reverse Dependencies 15 direct, 61 indirect [details]
Downloads 15156 total (55 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-04-14 [all 1 reports]

Readme for map-syntax-0.3

[back to package description]

Haskell's canonical list of tuples syntax for defining maps is not very convenient and also has ambiguous semantics. This package leverages do notation to create a lighter syntax that makes semantics explicit and also allows the option of fail-fast handling of duplicate keys.