GiST: A Haskell implementation of a Generalized Search Tree (GiST)

[ data-structures, library ] [ Propose Tags ]

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.

Versions [RSS] [faq] 0.0.1
Dependencies base (==4.*), text (>= && <0.12) [details]
License LicenseRef-GPL
Author Mihail Bogojeski, Alexander Svozil
Maintainer Mihail Bogojeski (
Category Data Structures
Uploaded by MihailBogojeski at 2013-06-27T22:10:30Z
Distributions NixOS:0.0.1
Downloads 1197 total (7 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees