BSD-3-Clause licensed by James Cranch
Maintained by [email protected]
This version can be pinned in stack with:mappings-,2719


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.


[] - 2024-05-20

  • Support for GHC 9.10

[] - 2023-12-06

  • Extra functionality for Data.Mapping.Piecewise

[] - 2023-11-22

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

[] - 2023-11-09

  • baseLength and decisionLength functions
  • rewritten the counting functions

[] - 2023-11-05

Initial version