name:                   GiST
version:                0.0.1
cabal-version:          >=1.2
build-type:             Simple
license:                GPL
license-file:           LICENSE
author:                 Mihail Bogojeski, Alexander Svozil 
maintainer:             Mihail Bogojeski (mihailbogojeski@gmail.com)
extra-source-files:     COPYING, Test/Random.hs, Test/Tests.hs, Test/RandomFast.hs, Test/Interactive.hs
synopsis:               A Haskell implementation of a Generalized Search Tree (GiST)
description:            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.
category:               Data Structures
stability:              Experimental
tested-with:            GHC == 7.4.1

library 
    buildable:          True
    build-depends:      base >=4 && <5, text >= 0.11.2.3 && <0.12
    exposed-modules:    Data.GiST.GiST,
                        Data.GiST.BTree,
                        Data.GiST.RTree
    other-modules:      Data.GiST.Types