Data.GiST.BTree

A simple implementation of the B+ tree predicate. A containment predicate is a tuple of two integers representing an open interval, while the equality predicate is simply an interger value.

Documentation

data Predicate a

Constructors

Contains (a, a)

containment predicate (interval)

Equals a

equality predicate (integer value)

Instances

Predicates Predicate Int

More documentation on the instance implementation in the source

Eq a => Eq (Predicate a)

Ord a => Ord (Predicate a)

Read a => Read (Predicate a)

Show a => Show (Predicate a)

between :: Ord a => a -> a -> a -> Bool

Tests if a value is between two others