RBTree-0.0.4: Pure haskell Red-Black-Tree implemetation

Data.Tree.RBTree

Documentation

data Color Source

Constructors

Red
Black

Instances

Eq Color
Show Color

data RBTree a Source

Constructors

Node Color a !(RBTree a) !(RBTree a)
Leaf

Instances

Show a => Show (RBTree a)

emptyRB :: RBTree aSource

data Interval a Source

Constructors

Interval (RealOrd a, RealOrd a)

Instances

Show a => Show (Interval a)

data RealOrd a Source

Constructors

PInfinity
NInfinity
RealValue a

Instances

Show a => Show (RealOrd a)

insert :: (a -> a -> Ordering) -> RBTree a -> a -> RBTree aSource

insertOrd :: Ord a => RBTree a -> a -> RBTree aSource

insertOrdList :: Ord a => RBTree a -> [a] -> RBTree aSource

delete :: (a -> a -> Ordering) -> RBTree a -> a -> RBTree aSource

deleteOrd :: Ord a => RBTree a -> a -> RBTree aSource

deleteOrdList :: Ord a => RBTree a -> [a] -> RBTree aSource

search :: (b -> a -> Ordering) -> RBTree a -> b -> Maybe aSource

searchOrd :: Ord a => RBTree a -> a -> Maybe aSource

searchFast :: (b -> a -> Ordering) -> RBTree a -> b -> Maybe aSource

searchMax :: Ord a => RBTree a -> Maybe aSource

searchMin :: Ord a => RBTree a -> Maybe aSource

searchInterval :: (b -> a -> Ordering) -> RBTree a -> b -> Interval aSource

searchIntervalOrd :: Ord a => RBTree a -> a -> Interval aSource

vD :: RBTree a -> Maybe Int Source

vR :: RBTree a -> Bool Source