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 0.0.1
Dependencies base (==4.*), text (>=0.11.2.3 && <0.12) [details]
License LicenseRef-GPL
Author Mihail Bogojeski, Alexander Svozil
Maintainer Mihail Bogojeski (mihailbogojeski@gmail.com)
Category Data Structures
Uploaded by MihailBogojeski at Thu Jun 27 22:10:30 UTC 2013
Distributions NixOS:0.0.1
Downloads 726 total (13 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees