git.iko.soy/elk
on master help sign in
Remove two unused modules
commit9346d2e51667e4836dc40e5352c18fa684ff2f6e authorEvan Czaplicki <info@elm-lang.org> dateSun 25 Aug 2013, 01:39 (13 years ago) parent089ae13
2 files changed−114
compare with master
unifiedsplit
compiler/Transform/LetBoundVars.hs−54 compiler/Transform/Replace.hs−60
compiler/Transform/LetBoundVars.hsdeleted−54
@@ -1,54 +0,0 @@
1−module LetBoundVars (letBoundVars) where
2−
3−import Context
4−import Ast
5−
6−class LetBoundVars a where
7− letBoundVars :: a -> [String]
8−
9−instance LetBoundVars a => LetBoundVars [a] where
10− letBoundVars = concatMap letBoundVars
11−
12−instance LetBoundVars Statement where
13− letBoundVars stmt =
14− case stmt of
15− Definition d -> letBoundVars d
16− Datatype _ _ tcs -> []
17− ImportEvent _ e _ _ -> letBoundVars e
18− ExportEvent _ _ _ -> []
19− TypeAnnotation _ _ -> []
20− TypeAlias _ _ _ -> []
21−
22−instance LetBoundVars Def where
23− letBoundVars (FnDef n _ e) = n : letBoundVars e
24− letBoundVars (OpDef _ _ _ e) = letBoundVars e
25− letBoundVars _ = []
26−
27−instance LetBoundVars e => LetBoundVars (Context e) where
28− letBoundVars (C _ _ e) = letBoundVars e
29−
30−instance LetBoundVars Expr where
31− letBoundVars expr =
32− let f = letBoundVars in
33− case expr of
34− IntNum _ -> []
35− FloatNum _ -> []
36− Chr _ -> []
37− Str _ -> []
38− Boolean _ -> []
39− Range e1 e2 -> f e1 ++ f e2
40− Access e _ -> []
41− Remove e _ -> []
42− Insert e1 _ e2 -> f e1 ++ f e2
43− Modify e ps -> f e ++ concatMap (f . snd) ps
44− Record trps -> concatMap (\(_,_,e) -> f e) trps
45− Binop op e1 e2 -> f e1 ++ f e2
46− Lambda x e -> f e
47− App e1 e2 -> f e1 ++ f e2
48− If e1 e2 e3 -> concatMap f [e1,e2,e3]
49− MultiIf ps -> concatMap (\(b,e) -> f b ++ f e) ps
50− Let defs e -> concatMap letBoundVars defs ++ f e
51− Var x -> []
52− Data name es -> concatMap f es
53− Case e cases -> f e ++ concatMap (f . snd) cases
54− Markdown _ -> []
compiler/Transform/Replace.hsdeleted−60
@@ -1,60 +0,0 @@
1−module Replace (replace, depth) where
2−
3−import Ast
4−import Control.Arrow ((***))
5−import Data.Set (singleton,empty,unions,member, Set)
6−
7−replace :: String -> Expr -> Expr -> Expr
8−replace y v expr =
9− let f = replace y v in
10− case expr of
11− Range e1 e2 -> Range (f e1) (f e2)
12− Access e x -> Access (f e) x
13− Binop op e1 e2 -> Binop op (f e1) (f e2)
14− App e1 e2 -> App (f e1) (f e2)
15− If e1 e2 e3 -> If (f e1) (f e2) (f e3)
16− Guard ps -> map (f *** f) ps
17− Lift e es -> Lift (f e) (map f es)
18− Fold e1 e2 e3 -> Fold (f e1) (f e2) (f e3)
19− Async e -> Async (f e)
20− Let defs e -> if y `elem` vs then Let defs e else Let (zip vs (map f es)) (f e)
21− where (vs,es) = unzip defs
22− Var x -> if x == y then v else Var x
23− ExplicitList es -> ExplicitList (map f es)
24− Data name es -> Data name (map f es)
25− Case e cases -> Case (f e) $ map (caseReplace y v) cases
26− _ -> expr
27−
28−caseReplace :: String -> Expr -> (Pattern, Expr) -> (Pattern, Expr)
29−caseReplace y v (p,e) =
30− if member y (patternVars p) then (p,e) else (p, replace y v e)
31−
32−patternVars :: Pattern -> Set String
33−patternVars pattern =
34− case pattern of
35− PData _ ps -> unions (map patternVars ps)
36− PVar x -> singleton x
37− PAsVar x p -> insert x (patternVars p)
38− PAnything -> empty
39− PLiteral _ -> empty
40−
41−depth :: Expr -> Integer
42−depth = depth' 0
43−depth' d expr =
44− let f = depth' (d+1) in
45− case expr of
46− Range e1 e2 -> max (f e1) (f e2)
47− Access e x -> f e
48− Binop op e1 e2 -> max (f e1) (f e2)
49− Lambda x e -> f e
50− App e1 e2 -> max (f e1) (f e2)
51− If e1 e2 e3 -> maximum [f e1, f e2, f e3]
52− Guard ps -> maximum (map (uncurry max . f *** f) ps)
53− Lift e es -> maximum $ f e : map f es
54− Fold e1 e2 e3 -> maximum [f e1, f e2, f e3]
55− Async e -> f e
56− Let defs e -> let (_,es) = unzip defs in maximum $ f e : map f es
57− Data "::" es -> maximum $ map (depth' d) es
58− Data name es -> maximum $ 1 : map f es
59− Case e cases -> maximum $ f e : map (f . snd) cases
60− _ -> d