GeomAlg-0.2.3: Library of geometric algorithms in Haskell Source code Contents Index

GeomAlg.Tree.RangeTree

Description

Range trees.

Synopsis

data RangeTree a empty :: RangeTree a fromList :: (Point p, Ord a, Num a) => [p a] -> RangeTree (p a) toList :: RangeTree a -> [a] rangeQuery :: (Point p, Ord a, Num a) => RangeTree (p a) -> (p a, p a) -> [p a] member :: (Point p, Ord a, Num a) => p a -> RangeTree (p a) -> Bool pprint :: Show a => RangeTree a -> String

Documentation

data RangeTree a Source

empty :: RangeTree a Source

Suchbauminvariante: (Node m _ ls hs _) => all ( x -> ith i x < ith i m) ls all ( x -> ith i x >= ith i m) hs

fromList :: (Point p, Ord a, Num a) => [p a] -> RangeTree (p a) Source

toList :: RangeTree a -> [a] Source

rangeQuery :: (Point p, Ord a, Num a) => RangeTree (p a) -> (p a, p a) -> [p a] Source

member :: (Point p, Ord a, Num a) => p a -> RangeTree (p a) -> Bool Source

pprint :: Show a => RangeTree a -> String Source

Produced by Haddock version 2.4.2