A Haskell implementation of a Generalized Search Tree (GiST)

Latest on Hackage:0.0.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

GPL licensed by Mihail Bogojeski, Alexander Svozil
Maintained by Mihail Bogojeski (

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.

Depends on:
Used by 1 package:
comments powered byDisqus