Data.Tree.RBTree
Documentation
insertOrdList :: Ord a => RBTree a -> [a] -> RBTree aSource
deleteOrdList :: Ord a => RBTree a -> [a] -> RBTree aSource
searchFast :: (a -> a -> Ordering) -> RBTree a -> a -> Maybe aSource
RBTree-0.0.3: Pure haskell Red-Black-Tree implemetation
Data.Tree.RBTree
insertOrdList :: Ord a => RBTree a -> [a] -> RBTree aSource
deleteOrdList :: Ord a => RBTree a -> [a] -> RBTree aSource
searchFast :: (a -> a -> Ordering) -> RBTree a -> a -> Maybe aSource