HiggsSet: A multi-index set with advanced query capabilites
This package allows you to define several typesafe
indizes on a set. You can query the set with an SQL-like
set of query operations.
This package was developed as a successor of
It is meant to be more space efficient, since it uses
Data.TrieMap as an underlying represenation.
It also has the potential to be fast, since indizes don't
need to be recalculated after each query and since
Patricia trees perform quite well for intersection and union.
This package comes without warranties. Although I use it
without problems in a large web project it is neither properly
tested nor benchmarked.
Patches or suggestions for improvement are welcome. If you like,
start an issue on github.
|Versions [faq]||0.1, 0.1.1|
|Dependencies||base (>=4.2 && <6), bytestring, containers (>=0.4.2.0), deepseq, mtl, text, th-expand-syns (>=0.3.0.2), TrieMap (>=4.0.1), vector [details]|
|Source repo||head: git clone git://github.com/lpeterse/HiggsSet.git|
|Uploaded||by LarsPetersen at Sat Feb 4 15:22:07 UTC 2012|
|Downloads||1130 total (15 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs not available [build log]
All reported builds failed as of 2016-10-25 [all 9 reports]
For package maintainers and hackage trustees