From f85232947e74ee7ef8c7b0ad2338212e7e68f1be Mon Sep 17 00:00:00 2001
From: krasimir <krasimir@chalmers.se>
Date: Sun, 13 Dec 2009 18:50:29 +0000
Subject: reorganize the directories under src, and rescue the JavaScript
 interpreter from deprecated

---
 src/GF/Data/TrieMap.hs | 66 --------------------------------------------------
 1 file changed, 66 deletions(-)
 delete mode 100644 src/GF/Data/TrieMap.hs

(limited to 'src/GF/Data/TrieMap.hs')

diff --git a/src/GF/Data/TrieMap.hs b/src/GF/Data/TrieMap.hs
deleted file mode 100644
index a6749d641..000000000
--- a/src/GF/Data/TrieMap.hs
+++ /dev/null
@@ -1,66 +0,0 @@
-module GF.Data.TrieMap
-         ( TrieMap
-
-         , empty
-         , singleton
-
-         , lookup
-         
-         , null
-         , decompose
-         
-         , insertWith
-
-         , unionWith
-         , unionsWith
-         
-         , elems
-         ) where
-
-import Prelude hiding (lookup, null)
-import qualified Data.Map as Map
-
-data TrieMap k v = Tr (Maybe v) (Map.Map k (TrieMap k v))
-
-empty = Tr Nothing Map.empty
-
-singleton :: [k] -> a -> TrieMap k a
-singleton []     v = Tr (Just v) Map.empty
-singleton (k:ks) v = Tr Nothing  (Map.singleton k (singleton ks v))
-
-lookup :: Ord k => [k] -> TrieMap k a -> Maybe a
-lookup []     (Tr mb_v m) = mb_v
-lookup (k:ks) (Tr mb_v m) = Map.lookup k m >>= lookup ks
-
-null :: TrieMap k v -> Bool
-null (Tr Nothing m) = Map.null m
-null _              = False
-
-decompose :: TrieMap k v -> (Maybe v, Map.Map k (TrieMap k v))
-decompose (Tr mb_v m) = (mb_v,m)
-
-insertWith :: Ord k => (v -> v -> v) -> [k] -> v -> TrieMap k v -> TrieMap k v
-insertWith f []     v0 (Tr mb_v m) = case mb_v of
-                                       Just  v -> Tr (Just (f v0 v)) m
-                                       Nothing -> Tr (Just v0      ) m
-insertWith f (k:ks) v0 (Tr mb_v m) = case Map.lookup k m of
-                                       Nothing -> Tr mb_v (Map.insert k (singleton ks v0) m)
-                                       Just tr -> Tr mb_v (Map.insert k (insertWith f ks v0 tr) m)
-
-unionWith :: Ord k => (v -> v -> v) -> TrieMap k v -> TrieMap k v -> TrieMap k v
-unionWith f (Tr mb_v1 m1) (Tr mb_v2 m2) =
-  let mb_v = case (mb_v1,mb_v2) of
-               (Nothing,Nothing) -> Nothing
-               (Just v ,Nothing) -> Just v
-               (Nothing,Just v ) -> Just v
-               (Just v1,Just v2) -> Just (f v1 v2)
-      m    = Map.unionWith (unionWith f) m1 m2
-  in Tr mb_v m
-
-unionsWith :: Ord k => (v -> v -> v) -> [TrieMap k v] -> TrieMap k v
-unionsWith f = foldl (unionWith f) empty
-
-elems :: TrieMap k v -> [v]
-elems tr = collect tr []
-  where
-    collect (Tr mb_v m) xs = maybe id (:) mb_v (Map.fold collect xs m)
-- 
cgit v1.2.3