mappings

Types which represent functions k -> v

https://github.com/jcranch/mapping#readme

Version on this page:0.3.1.0@rev:1
LTS Haskell 23.21:0.3.1.0
Stackage Nightly 2025-05-11:0.3.1.0@rev:1
Latest on Hackage:0.3.2.0

See all snapshots mappings appears in

BSD-3-Clause licensed by James Cranch
Maintained by [email protected]
This version can be pinned in stack with:mappings-0.3.1.0@sha256:1c97ea459c41a524b9738ed76012d752330b8fe7dcd685d60360d19c4818e1f5,2830

Mappings

What’s it do?

This package does two jobs:

  • It offers a general typeclass Mapping for types which represent functions k -> v (for fixed k, but arbitrary ordered v).

    There are some fairly straightforward examples which build up mappings where k is Either, or a pair, or Maybe, or Bool.

  • Three less trivial implementations are provided:

Why did I bother?

The aim is to use decision diagrams with nodes that are piecewise constant maps to store monomials for Grobner basis algorithms.

Changes

[0.3.1.0] - 2024-05-20

  • Support for GHC 9.10

[0.3.0.0] - 2023-12-06

  • Extra functionality for Data.Mapping.Piecewise

[0.2.2.0] - 2023-11-22

  • Uses a newer version of cond allowing many newtypes to be derived.

[0.1.0.0] - 2023-11-09

  • baseLength and decisionLength functions
  • rewritten the counting functions

[0.0.1.0] - 2023-11-05

Initial version