GiST: A Haskell implementation of a Generalized Search Tree (GiST)
A simple implementation of the GiST data structure, including a couple of basic predicates used for implementing a GiST based B+ or R-tree. The GiST is also capable und working with any user defined instance of the class Predicates, making this package perfect for developing and testing new types of balanced trees.
Downloads
- GiST-0.0.1.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.0.1 |
|---|---|
| Dependencies | base (>=4 && <5), text (>=0.11.2.3 && <0.12) [details] |
| Tested with | ghc ==7.4.1 |
| License | LicenseRef-GPL |
| Author | Mihail Bogojeski, Alexander Svozil |
| Maintainer | Mihail Bogojeski (mihailbogojeski@gmail.com) |
| Category | Data Structures |
| Uploaded | by MihailBogojeski at 2013-06-27T22:10:30Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1350 total (6 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] |