relation: A data structure representing Relations on Sets.
A library to model relationships between two objects that are subclasses of Ord.
Instead using a Map structure we use a two Maps that allows fast searching either by the key element or the value element.
Each of Map is between an element and a set of values. Thus careful coordination of operations is required.
This library lacks of extensive testing, formal testing or automated testing. Also in comparison to Data.Set or Data.Map (which provide the underlying infrastructure used) there are some missing methods.
Two small examples are currently provided.
Changes:
2012.06.06. DD. Translated to English. 2009.11.09. LFL. Corrected the definition of delete. 2009.11.26. LFL. Construction
Downloads
- relation-0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.2, 0.2.1, 0.3, 0.4, 0.5, 0.5.1.0, 0.5.2.0 |
|---|---|
| Change log | Changes.txt |
| Dependencies | array (>=0.4 && <0.5), base (>=4.2 && <6.0), containers (>=0.4 && <0.6) [details] |
| License | BSD-3-Clause |
| Copyright | (C) 2012 Drew Day, (C) 2010 Leonel Fonseca |
| Author | Leonel Fonseca |
| Maintainer | Drew Day |
| Category | Data Structures |
| Home page | https://www.github.com/d-day/relation/ |
| Bug tracker | https://www.github.com/d-day/relation/issues |
| Source repo | head: git clone https://www.github.com/d-day/relation |
| Uploaded | by DrewDay at 2012-06-06T22:18:13Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 4177 total (25 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |