mappings: Types which represent functions k -> v

A typeclass and a number of implementations; please read README.md on github

[Skip to Readme]

Modules

For package maintainers and hackage trustees

Candidates

Versions [RSS]	0.0.1.0, 0.0.2.0, 0.1.0.0, 0.2.0.0, 0.2.1.0, 0.2.2.0, 0.3.0.0, 0.3.1.0
Change log	CHANGELOG.md
Dependencies	base (>=4.16 && <4.21), cond (>=0.5.1 && <0.6), containers (>=0.6.5 && <0.8), formatting (>=7.0.0 && <7.3), indexed-traversable (>=0.1.1 && <0.2), mappings, partialord (>=0.0.2 && <0.1) [details]
License	BSD-3-Clause
Copyright	2023-24 James Cranch
Author	James Cranch
Maintainer	j.d.cranch@sheffield.ac.uk
Category	Data structures
Home page	https://github.com/jcranch/mapping#readme
Bug tracker	https://github.com/jcranch/mapping/issues
Source repo	head: git clone https://github.com/jcranch/mapping
Uploaded	by jcranch at 2024-05-20T10:04:11Z
Distributions	LTSHaskell:0.3.1.0, Stackage:0.3.1.0
Executables	view
Downloads	334 total (30 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2024-05-20 [all 1 reports]

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:
- Decision diagrams, with nodes which may themselves be an arbitrary Mapping (there is some code for viewing these in the examples directory);
- Piecewise constant maps on an ordered domain k;
- Maps equipped with a default value.

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