diff options
| author | aarne <unknown> | 2003-11-10 08:48:51 +0000 |
|---|---|---|
| committer | aarne <unknown> | 2003-11-10 08:48:51 +0000 |
| commit | a4741d681f1fb330686d3e758ee8211da087feb6 (patch) | |
| tree | 749707564835301b31d900d7bd8bd032cc0b1bd2 /src/GF/Data/RedBlack.hs | |
| parent | d8e07f189a6c825b9ced62e38c3fc2ec6c6c5f67 (diff) | |
Glue modules.
Diffstat (limited to 'src/GF/Data/RedBlack.hs')
| -rw-r--r-- | src/GF/Data/RedBlack.hs | 55 |
1 files changed, 55 insertions, 0 deletions
diff --git a/src/GF/Data/RedBlack.hs b/src/GF/Data/RedBlack.hs new file mode 100644 index 000000000..8a24c07a3 --- /dev/null +++ b/src/GF/Data/RedBlack.hs @@ -0,0 +1,55 @@ +{- + ************************************************************** + * Filename : RedBlack.hs * + * Author : Markus Forsberg * + * markus@cs.chalmers.se * + * Last Modified : 15 December, 2001 * + * Lines : 57 * + ************************************************************** +-} -- Modified version of Osanaki's implementation. + +module RedBlack ( + emptyTree, + Tree, + lookupTree, + insertTree, + flatten + ) where + +data Color = R | B + deriving (Show,Read) + +data Tree key el = E | T Color (Tree key el) (key,el) (Tree key el) + deriving (Show,Read) + +balance :: Color -> Tree a b -> (a,b) -> Tree a b -> Tree a b +balance B (T R (T R a x b) y c) z d = T R (T B a x b) y (T B c z d) +balance B (T R a x (T R b y c)) z d = T R (T B a x b) y (T B c z d) +balance B a x (T R (T R b y c) z d) = T R (T B a x b) y (T B c z d) +balance B a x (T R b y (T R c z d)) = T R (T B a x b) y (T B c z d) +balance color a x b = T color a x b + +emptyTree :: Tree key el +emptyTree = E + +lookupTree :: Ord a => a -> Tree a b -> Maybe b +lookupTree _ E = Nothing +lookupTree x (T _ a (y,z) b) + | x < y = lookupTree x a + | x > y = lookupTree x b + | otherwise = return z + +insertTree :: Ord a => (a,b) -> Tree a b -> Tree a b +insertTree (key,el) tree = T B a y b + where + T _ a y b = ins tree + ins E = T R E (key,el) E + ins (T color a y@(key',el') b) + | key < key' = balance color (ins a) y b + | key > key' = balance color a y (ins b) + | otherwise = T color a (key',el) b + +flatten :: Tree a b -> [(a,b)] +flatten E = [] +flatten (T _ left (key,e) right) + = (flatten left) ++ ((key,e):(flatten right)) |
