The relation package
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.
2012.06.06. DD. Translated to English. 2009.11.09. LFL. Corrected the definition of delete. 2009.11.26. LFL. Construction
|Dependencies||array (==0.4.*), base (>=4.2 && <6.0), containers (>=0.4 && <0.6)|
|Copyright||(C) 2012 Drew Day, (C) 2010 Leonel Fonseca|
|Source repository||head: git clone https://www.github.com/d-day/relation|
|Upload date||Wed Jun 6 22:18:13 UTC 2012|
|Downloads||181 total (17 in last 30 days)|
For package maintainers and hackage trustees