Data.GiST.RTree

A simple implementation of the R-Tree predicate. A containment predicate is a tuple of two points representing a rectangle with the first tuple (minx,maxy) being the upper left corner of the rectangle and the second (maxx,miny) being the lower right corner of the rectangle, while the equality predicate is simply a 2D point (tuple of two integers).

Documentation

data Predicate a

Constructors

Contains (a, a)

containment predicate (rectangle)

Equals a

equality predicate (2D point)

Instances

Predicates Predicate (Int, 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)