diff --git a/Data/Generics/Geniplate.hs b/Data/Generics/Geniplate.hs new file mode 100644 --- /dev/null +++ b/Data/Generics/Geniplate.hs @@ -0,0 +1,561 @@ +{-# LANGUAGE TemplateHaskell, MultiParamTypeClasses, FlexibleInstances, TypeSynonymInstances, PatternGuards, CPP #-} +module Data.Generics.Geniplate( + genUniverseBi, genUniverseBi', genUniverseBiT, genUniverseBiT', + genTransformBi, genTransformBi', genTransformBiT, genTransformBiT', + genTransformBiM, genTransformBiM', genTransformBiMT, genTransformBiMT', + UniverseBi(..), universe, instanceUniverseBi, instanceUniverseBiT, + TransformBi(..), transform, instanceTransformBi, instanceTransformBiT, + TransformBiM(..), transformM, instanceTransformBiM, instanceTransformBiMT, + ) where +import Control.Monad +import Control.Exception(assert) +import Control.Monad.State.Strict +import Data.Maybe +import Language.Haskell.TH +import Language.Haskell.TH.Syntax hiding (lift) +import System.IO + +---- Overloaded interface, same as Uniplate. + +-- | Class for 'universeBi'. +class UniverseBi s t where + universeBi :: s -> [t] + +-- | Class for 'transformBi'. +class TransformBi s t where + transformBi :: (s -> s) -> t -> t + +-- | Class for 'transformBiM'. +class {-(Monad m) => -} TransformBiM m s t where + transformBiM :: (s -> m s) -> t -> m t + +universe :: (UniverseBi a a) => a -> [a] +universe = universeBi + +transform :: (TransformBi a a) => (a -> a) -> a -> a +transform = transformBi + +transformM :: (TransformBiM m a a) => (a -> m a) -> a -> m a +transformM = transformBiM + +---- + +-- | Create a 'UniverseBi' instance. +-- The 'TypeQ' argument should be a pair; the /source/ and /target/ types for 'universeBi'. +instanceUniverseBi :: TypeQ -- ^(source, target) types + -> Q [Dec] +instanceUniverseBi = instanceUniverseBiT [] + +-- | Create a 'UniverseBi' instance with certain types being abstract. +-- The 'TypeQ' argument should be a pair; the /source/ and /target/ types for 'universeBi'. +instanceUniverseBiT :: [TypeQ] -- ^types not touched by 'universeBi' + -> TypeQ -- ^(source, target) types + -> Q [Dec] +instanceUniverseBiT stops ty = instanceUniverseBiT' stops =<< ty + +instanceUniverseBiT' :: [TypeQ] -> Type -> Q [Dec] +instanceUniverseBiT' stops (ForallT _ _ t) = instanceUniverseBiT' stops t +instanceUniverseBiT' stops ty | (TupleT _, [from, to]) <- splitTypeApp ty = do + (ds, f) <- uniBiQ stops from to + x <- newName "_x" + let e = LamE [VarP x] $ LetE ds $ AppE (AppE f (VarE x)) (ListE []) + return $ instDef ''UniverseBi [from, to] 'universeBi e +instanceUniverseBiT' _ t = genError "instanceUniverseBi: the argument should be of the form [t| (S, T) |]" + +funDef :: Name -> Exp -> [Dec] +funDef f e = [FunD f [Clause [] (NormalB e) []]] + +instDef :: Name -> [Type] -> Name -> Exp -> [Dec] +instDef cls ts met e = [InstanceD [] (foldl AppT (ConT cls) ts) (funDef met e)] + +-- | Create a 'TransformBi' instance. +-- The 'TypeQ' argument should be a pair; the /inner/ and /outer/ types for 'transformBi'. +instanceTransformBi :: TypeQ -- ^(inner, outer) types + -> Q [Dec] +instanceTransformBi = instanceTransformBiT [] + +-- | Create a 'TransformBi' instance with certain types being abstract. +-- The 'TypeQ' argument should be a pair; the /inner/ and /outer/ types for 'transformBi'. +instanceTransformBiT :: [TypeQ] -- ^types not touched by 'transformBi' + -> TypeQ -- ^(inner, outer) types + -> Q [Dec] +instanceTransformBiT stops ty = instanceTransformBiT' stops =<< ty + +instanceTransformBiT' :: [TypeQ] -> Type -> Q [Dec] +instanceTransformBiT' stops (ForallT _ _ t) = instanceTransformBiT' stops t +instanceTransformBiT' stops ty | (TupleT _, [ft, st]) <- splitTypeApp ty = do + f <- newName "_f" + x <- newName "_x" + (ds, tr) <- trBiQ raNormal stops f ft st + let e = LamE [VarP f, VarP x] $ LetE ds $ AppE tr (VarE x) + + return $ instDef ''TransformBi [ft, st] 'transformBi e +instanceTransformBiT' _ t = genError "instanceTransformBiT: the argument should be of the form [t| (S, T) |]" + +-- | Create a 'TransformBiM' instance. +instanceTransformBiM :: TypeQ + -> TypeQ + -> Q [Dec] +instanceTransformBiM = instanceTransformBiMT [] + +-- | Create a 'TransformBiM' instance with certain types being abstract. +instanceTransformBiMT :: [TypeQ] + -> TypeQ + -> TypeQ + -> Q [Dec] +instanceTransformBiMT stops mndq ty = instanceTransformBiMT' stops mndq =<< ty + +instanceTransformBiMT' :: [TypeQ] -> TypeQ -> Type -> Q [Dec] +instanceTransformBiMT' stops mndq (ForallT _ _ t) = instanceTransformBiMT' stops mndq t +instanceTransformBiMT' stops mndq ty | (TupleT _, [ft, st]) <- splitTypeApp ty = do + mnd <- mndq + + f <- newName "_f" + x <- newName "_x" + (ds, tr) <- trBiQ raMonad stops f ft st + let e = LamE [VarP f, VarP x] $ LetE ds $ AppE tr (VarE x) + + return $ instDef ''TransformBiM [mnd, ft, st] 'transformBiM e +instanceTransformBiMT' _ _ t = genError "instanceTransformBiMT: the argument should be of the form [t| (S, T) |]" + + +-- | Generate TH code for a function that extracts all subparts of a certain type. +-- The argument to 'genUniverseBi' is a name with the type @S -> [T]@, for some types +-- @S@ and @T@. The function will extract all subparts of type @T@ from @S@. +genUniverseBi :: Name -- ^function of type @S -> [T]@ + -> Q Exp +genUniverseBi = genUniverseBiT [] + +genUniverseBi' :: TypeQ -> Q Exp +genUniverseBi' = genUniverseBiT' [] + +-- | Same as 'genUniverseBi', but does not look inside any types mention in the +-- list of types. +genUniverseBiT :: [TypeQ] -- ^types not touched by 'universeBi' + -> Name -- ^function of type @S -> [T]@ + -> Q Exp +genUniverseBiT stops = getNameType >=> genUniverseBiTsplit stops + +genUniverseBiT' :: [TypeQ] -> TypeQ -> Q Exp +genUniverseBiT' stops q = q >>= splitType >>= genUniverseBiTsplit stops + +genUniverseBiTsplit stops (_tvs,from,tos) = do + let to = unList tos +-- qRunIO $ print (from, to) + (ds, f) <- uniBiQ stops from to + x <- newName "_x" + let e = LamE [VarP x] $ LetE ds $ AppE (AppE f (VarE x)) (ListE []) +-- qRunIO $ do putStrLn $ pprint e; hFlush stdout + return e + +type U = StateT (Map Type Dec, Map Type Bool) Q + +instance Quasi U where + qNewName = lift . qNewName + qReport b = lift . qReport b + qRecover = error "Data.Generics.Geniplate: qRecover not implemented" + qReify = lift . qReify +#if MIN_VERSION_template_haskell(2,7,0) + qReifyInstances n = lift . qReifyInstances n +#elif MIN_VERSION_template_haskell(2,5,0) + qClassInstances n = lift . qClassInstances n +#endif + qLocation = lift qLocation + qRunIO = lift . qRunIO +#if MIN_VERSION_template_haskell(2,7,0) + qLookupName ns = lift . qLookupName ns + qAddDependentFile = lift . qAddDependentFile +#endif + +uniBiQ :: [TypeQ] -> Type -> Type -> Q ([Dec], Exp) +uniBiQ stops from ato = do + ss <- sequence stops + to <- expandSyn ato + (f, (m, _)) <- runStateT (uniBi from to) (mEmpty, mFromList $ zip ss (repeat False)) + return (mElems m, f) + +uniBi :: Type -> Type -> U Exp +uniBi afrom to = do + (m, c) <- get + from <- expandSyn afrom + case mLookup from m of + Just (FunD n _) -> return $ VarE n + _ -> do + f <- qNewName "_f" + let mkRec = do + put (mInsert from (FunD f [Clause [] (NormalB $ TupE []) []]) m, c) -- insert something to break recursion, will be replaced below. + uniBiCase from to + cs <- if from == to then do + b <- contains' to from + if b then do + -- Recursive data type, we need the current value and all values inside. + g <- qNewName "_g" + gcs <- mkRec + let dg = FunD g gcs + -- Insert with a dummy type, just to get the definition in the map for mElems. + modify $ \ (m', c') -> (mInsert (ConT g) dg m', c') + unFun [d| f _x _r = _x : $(return (VarE g)) _x _r |] + else + -- Non-recursive type, just use this value. + unFun [d| f _x _r = _x : _r |] + else do + -- Types differ, look inside. + b <- contains to from + if b then do + -- Occurrences inside, recurse. + mkRec + else + -- No occurrences of to inside from, so add nothing. + unFun [d| f _ _r = _r |] + let d = FunD f cs + modify $ \ (m', c') -> (mInsert from d m', c') + return $ VarE f + +-- Check if the second type is contained anywhere in the first type. +contains :: Type -> Type -> U Bool +contains to afrom = do +-- qRunIO $ print ("contains", to, from) + from <- expandSyn afrom + if from == to then + return True + else do + c <- gets snd + case mLookup from c of + Just b -> return b + Nothing -> contains' to from + +-- Check if the second type is contained somewhere inside the first. +contains' :: Type -> Type -> U Bool +contains' to from = do +-- qRunIO $ print ("contains'", to, from) + let (con, ts) = splitTypeApp from + modify $ \ (m, c) -> (m, mInsert from False c) -- To make the fixpoint of the recursion False. + b <- case con of + ConT n -> containsCon n to ts + TupleT _ -> fmap or $ mapM (contains to) ts + ArrowT -> return False + ListT -> if to == from then return True else contains to (head ts) + VarT _ -> return False + t -> genError $ "contains: unexpected type: " ++ pprint from ++ " (" ++ show t ++ ")" + modify $ \ (m, c) -> (m, mInsert from b c) + return b + +containsCon :: Name -> Type -> [Type] -> U Bool +containsCon con to ts = do +-- qRunIO $ print ("containsCon", con, to, ts) + (tvs, cons) <- getTyConInfo con + let conCon (NormalC _ xs) = fmap or $ mapM (field . snd) xs + conCon (InfixC x1 _ x2) = fmap or $ mapM field [snd x1, snd x2] + conCon (RecC _ xs) = fmap or $ mapM field [ t | (_,_,t) <- xs ] + conCon c = genError $ "containsCon: " ++ show c + s = mkSubst tvs ts + field t = contains to (subst s t) + fmap or $ mapM conCon cons + +unFunD :: [Dec] -> [Clause] +unFunD [FunD _ cs] = cs +unFunD _ = genError $ "unFunD" + +unFun :: Q [Dec] -> U [Clause] +unFun = lift . fmap unFunD + +uniBiCase :: Type -> Type -> U [Clause] +uniBiCase from to = do + let (con, ts) = splitTypeApp from + case con of + ConT n -> uniBiCon n ts to + TupleT _ -> uniBiTuple ts to +-- ArrowT -> unFun [d| f _ _r = _r |] -- Stop at functions + ListT -> uniBiList (head ts) to + t -> genError $ "uniBiCase: unexpected type: " ++ pprint from ++ " (" ++ show t ++ ")" + +uniBiList :: Type -> Type -> U [Clause] +uniBiList t to = do + uni <- uniBi t to + rec <- uniBi (AppT ListT t) to + unFun [d| f [] _r = _r; f (_x:_xs) _r = $(return uni) _x ($(return rec) _xs _r) |] + +uniBiTuple :: [Type] -> Type -> U [Clause] +uniBiTuple ts to = fmap (:[]) $ mkArm to [] TupP ts + +uniBiCon :: Name -> [Type] -> Type -> U [Clause] +uniBiCon con ts to = do + (tvs, cons) <- getTyConInfo con + let genArm (NormalC c xs) = arm (ConP c) xs + genArm (InfixC x1 c x2) = arm (\ [p1, p2] -> InfixP p1 c p2) [x1, x2] + genArm (RecC c xs) = arm (ConP c) [ (b,t) | (_,b,t) <- xs ] + genArm c = genError $ "uniBiCon: " ++ show c + s = mkSubst tvs ts + arm c xs = mkArm to s c $ map snd xs + + if null cons then + -- No constructurs, return nothing + unFun [d| f _ _r = _r |] + else + mapM genArm cons + +mkArm :: Type -> Subst -> ([Pat] -> Pat) -> [Type] -> U Clause +mkArm to s c ts = do + r <- qNewName "_r" + vs <- mapM (const $ qNewName "_x") ts + let sub v t = do + let t' = subst s t + uni <- uniBi t' to + return $ AppE (AppE uni (VarE v)) + es <- zipWithM sub vs ts + let body = foldr ($) (VarE r) es + return $ Clause [c (map VarP vs), VarP r] (NormalB body) [] + + +type Subst = [(Name, Type)] + +mkSubst :: [TyVarBndr] -> [Type] -> Subst +mkSubst vs ts = + let vs' = map un vs + un (PlainTV v) = v + un (KindedTV v _) = v + in assert (length vs' == length ts) $ zip vs' ts + +subst :: Subst -> Type -> Type +subst s (ForallT v c t) = ForallT v c $ subst s t +subst s t@(VarT n) = fromMaybe t $ lookup n s +subst s (AppT t1 t2) = AppT (subst s t1) (subst s t2) +subst s (SigT t k) = SigT (subst s t) k +subst _ t = t + +getTyConInfo :: (Quasi q) => Name -> q ([TyVarBndr], [Con]) +getTyConInfo con = do + info <- qReify con + case info of + TyConI (DataD _ _ tvs cs _) -> return (tvs, cs) + TyConI (NewtypeD _ _ tvs c _) -> return (tvs, [c]) + PrimTyConI{} -> return ([], []) + i -> genError $ "unexpected TyCon: " ++ show i + +splitType :: (Quasi q) => Type -> q ([TyVarBndr], Type, Type) +splitType t = + case t of + (ForallT tvs _ t) -> do + (tvs', from, to) <- splitType t + return (tvs ++ tvs', from, to) + (AppT (AppT ArrowT from) to) -> return ([], from, to) + _ -> genError $ "Type is not an arrow: " ++ pprint t + + +getNameType :: (Quasi q) => Name -> q ([TyVarBndr], Type, Type) +getNameType name = do + info <- qReify name + case info of + VarI _ t _ _ -> splitType t + _ -> genError $ "Name is not variable: " ++ pprint name + +unList :: Type -> Type +unList (AppT (ConT n) t) | n == ''[] = t +unList (AppT ListT t) = t +unList t = genError $ "universeBi: Type is not a list: " ++ pprint t -- ++ " (" ++ show t ++ ")" + +splitTypeApp :: Type -> (Type, [Type]) +splitTypeApp (AppT a r) = (c, rs ++ [r]) where (c, rs) = splitTypeApp a +splitTypeApp t = (t, []) + +expandSyn :: (Quasi q) => Type -> q Type +expandSyn (ForallT tvs ctx t) = liftM (ForallT tvs ctx) $ expandSyn t +expandSyn t@AppT{} = expandSynApp t [] +expandSyn t@ConT{} = expandSynApp t [] +expandSyn (SigT t k) = expandSyn t -- Ignore kind synonyms +expandSyn t = return t + +expandSynApp :: (Quasi q) => Type -> [Type] -> q Type +expandSynApp (AppT t1 t2) ts = do t2' <- expandSyn t2; expandSynApp t1 (t2':ts) +expandSynApp (ConT n) ts | nameBase n == "[]" = return $ foldl AppT ListT ts +expandSynApp t@(ConT n) ts = do + info <- qReify n + case info of + TyConI (TySynD _ tvs rhs) -> + let (ts', ts'') = splitAt (length tvs) ts + s = mkSubst tvs ts' + rhs' = subst s rhs + in expandSynApp rhs' ts'' + _ -> return $ foldl AppT t ts +expandSynApp t ts = do t' <- expandSyn t; return $ foldl AppT t' ts + +genError :: String -> a +genError msg = error $ "Data.Generics.Geniplate: " ++ msg + +---------------------------------------------------- + +-- Exp has type (S -> S) -> T -> T, for some S and T +-- | Generate TH code for a function that transforms all subparts of a certain type. +-- The argument to 'genTransformBi' is a name with the type @(S->S) -> T -> T@, for some types +-- @S@ and @T@. The function will transform all subparts of type @S@ inside @T@ using the given function. +genTransformBi :: Name -- ^function of type @(S->S) -> T -> T@ + -> Q Exp +genTransformBi = genTransformBiT [] + +genTransformBi' :: TypeQ -> Q Exp +genTransformBi' = genTransformBiT' [] + +-- | Same as 'genTransformBi', but does not look inside any types mention in the +-- list of types. +genTransformBiT :: [TypeQ] -> Name -> Q Exp +genTransformBiT = transformBiG raNormal + +genTransformBiT' :: [TypeQ] -> TypeQ -> Q Exp +genTransformBiT' = transformBiG' raNormal + +raNormal :: RetAp +raNormal = (id, AppE, AppE) + +genTransformBiM :: Name -> Q Exp +genTransformBiM = genTransformBiMT [] + +genTransformBiM' :: TypeQ -> Q Exp +genTransformBiM' = genTransformBiMT' [] + +genTransformBiMT :: [TypeQ] -> Name -> Q Exp +genTransformBiMT = transformBiG raMonad + +genTransformBiMT' :: [TypeQ] -> TypeQ -> Q Exp +genTransformBiMT' = transformBiG' raMonad + +raMonad :: RetAp +raMonad = (eret, eap, emap) + where eret e = AppE (VarE 'Control.Monad.return) e + eap f a = AppE (AppE (VarE 'Control.Monad.ap) f) a + emap f a = AppE (AppE (VarE '(Control.Monad.=<<)) f) a + +type RetAp = (Exp -> Exp, Exp -> Exp -> Exp, Exp -> Exp -> Exp) + +transformBiG :: RetAp -> [TypeQ] -> Name -> Q Exp +transformBiG ra stops = getNameType >=> transformBiGsplit ra stops + +transformBiG' :: RetAp -> [TypeQ] -> TypeQ -> Q Exp +transformBiG' ra stops q = q >>= splitType >>= transformBiGsplit ra stops + +transformBiGsplit ra stops (_tvs,fcn,res) = do + f <- newName "_f" + x <- newName "_x" + (ds, tr) <- + case (fcn, res) of + (AppT (AppT ArrowT s) s', AppT (AppT ArrowT t) t') | s == s' && t == t' -> trBiQ ra stops f s t + (AppT (AppT ArrowT s) (AppT m s'), AppT (AppT ArrowT t) (AppT m' t')) | s == s' && t == t' && m == m' -> trBiQ ra stops f s t + _ -> genError $ "transformBi: malformed type: " ++ pprint (AppT (AppT ArrowT fcn) res) ++ ", should have form (S->S) -> (T->T)" + let e = LamE [VarP f, VarP x] $ LetE ds $ AppE tr (VarE x) +-- qRunIO $ do putStrLn $ pprint e; hFlush stdout + return e + +trBiQ :: RetAp -> [TypeQ] -> Name -> Type -> Type -> Q ([Dec], Exp) +trBiQ ra stops f aft st = do + ss <- sequence stops + ft <- expandSyn aft + (tr, (m, _)) <- runStateT (trBi ra (VarE f) ft st) (mEmpty, mFromList $ zip ss (repeat False)) + return (mElems m, tr) + +arrow :: Type -> Type -> Type +arrow t1 t2 = AppT (AppT ArrowT t1) t2 + +trBi :: RetAp -> Exp -> Type -> Type -> U Exp +trBi ra@(ret, _, rbind) f ft ast = do + (m, c) <- get + st <- expandSyn ast +-- qRunIO $ print (ft, st) + case mLookup st m of + Just (FunD n _) -> return $ VarE n + _ -> do + tr <- qNewName "_tr" + let mkRec = do + put (mInsert st (FunD tr [Clause [] (NormalB $ TupE []) []]) m, c) -- insert something to break recursion, will be replaced below. + trBiCase ra f ft st + + cs <- if ft == st then do + b <- contains' ft st + if b then do + g <- qNewName "_g" + gcs <- mkRec + let dg = FunD g gcs + -- Insert with a dummy type, just to get the definition in the map for mElems. + modify $ \ (m', c') -> (mInsert (ConT g) dg m', c') + x <- qNewName "_x" + return [Clause [VarP x] (NormalB $ rbind f (AppE (VarE g) (VarE x))) []] + else do + x <- qNewName "_x" + return [Clause [VarP x] (NormalB $ AppE f (VarE x)) []] + else do + b <- contains ft st +-- qRunIO $ print (b, ft, st) + if b then do + mkRec + else do + x <- qNewName "_x" + return [Clause [VarP x] (NormalB $ ret $ VarE x) []] + let d = FunD tr cs + modify $ \ (m', c') -> (mInsert st d m', c') + return $ VarE tr + +trBiCase :: RetAp -> Exp -> Type -> Type -> U [Clause] +trBiCase ra f ft st = do + let (con, ts) = splitTypeApp st + case con of + ConT n -> trBiCon ra f n ft st ts + TupleT _ -> trBiTuple ra f ft st ts +-- ArrowT -> unFun [d| f _ _r = _r |] -- Stop at functions + ListT -> trBiList ra f ft st (head ts) + _ -> genError $ "trBiCase: unexpected type: " ++ pprint st ++ " (" ++ show st ++ ")" + +trBiList :: RetAp -> Exp -> Type -> Type -> Type -> U [Clause] +trBiList ra f ft st et = do + nil <- trMkArm ra f ft st [] (const $ ListP []) (ListE []) [] + cons <- trMkArm ra f ft st [] (ConP '(:)) (ConE '(:)) [et, st] + return [nil, cons] + +trBiTuple :: RetAp -> Exp -> Type -> Type -> [Type] -> U [Clause] +trBiTuple ra f ft st ts = do + vs <- mapM (const $ qNewName "_t") ts + let tupE = LamE (map VarP vs) $ TupE (map VarE vs) + c <- trMkArm ra f ft st [] TupP tupE ts + return [c] + +trBiCon :: RetAp -> Exp -> Name -> Type -> Type -> [Type] -> U [Clause] +trBiCon ra f con ft st ts = do + (tvs, cons) <- getTyConInfo con + let genArm (NormalC c xs) = arm (ConP c) (ConE c) xs + genArm (InfixC x1 c x2) = arm (\ [p1, p2] -> InfixP p1 c p2) (ConE c) [x1, x2] + genArm (RecC c xs) = arm (ConP c) (ConE c) [ (b,t) | (_,b,t) <- xs ] + genArm c = genError $ "trBiCon: " ++ show c + s = mkSubst tvs ts + arm c ec xs = trMkArm ra f ft st s c ec $ map snd xs + mapM genArm cons + +trMkArm :: RetAp -> Exp -> Type -> Type -> Subst -> ([Pat] -> Pat) -> Exp -> [Type] -> U Clause +trMkArm ra@(ret, apl, _) f ft st s c ec ts = do + vs <- mapM (const $ qNewName "_x") ts + let sub v t = do + let t' = subst s t + tr <- trBi ra f ft t' + return $ AppE tr (VarE v) + conTy = foldr arrow st (map (subst s) ts) + es <- zipWithM sub vs ts + let body = foldl apl (ret ec) es + return $ Clause [c (map VarP vs)] (NormalB body) [] + + +---------------------------------------------------- + +-- Can't use Data.Map since TH stuff is not in Ord + +newtype Map a b = Map [(a, b)] + +mEmpty :: Map a b +mEmpty = Map [] + +mLookup :: (Eq a) => a -> Map a b -> Maybe b +mLookup a (Map xys) = lookup a xys + +mInsert :: (Eq a) => a -> b -> Map a b -> Map a b +mInsert a b (Map xys) = Map $ (a, b) : filter ((/= a) . fst) xys + +mElems :: Map a b -> [b] +mElems (Map xys) = map snd xys + +mFromList :: [(a, b)] -> Map a b +mFromList xys = Map xys diff --git a/LICENSE b/LICENSE new file mode 100644 --- /dev/null +++ b/LICENSE @@ -0,0 +1,34 @@ +Copyright (c) 2003-2008, Isaac Jones, Simon Marlow, Martin Sjögren, + Bjorn Bringert, Krasimir Angelov, + Malcolm Wallace, Ross Patterson, + Lemmih, Paolo Martini, Don Stewart, + Duncan Coutts +All rights reserved. + +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are +met: + + * Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above + copyright notice, this list of conditions and the following + disclaimer in the documentation and/or other materials provided + with the distribution. + + * Neither the name of Isaac Jones nor the names of other + contributors may be used to endorse or promote products derived + from this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. diff --git a/Setup.hs b/Setup.hs new file mode 100644 --- /dev/null +++ b/Setup.hs @@ -0,0 +1,3 @@ +module Main where +import Distribution.Simple +main = defaultMain diff --git a/examples/Main.hs b/examples/Main.hs new file mode 100644 --- /dev/null +++ b/examples/Main.hs @@ -0,0 +1,57 @@ +{-# LANGUAGE TemplateHaskell, ScopedTypeVariables, FlexibleInstances, MultiParamTypeClasses #-} +module Main where +import Data.Generics.Geniplate + +data T a = T { x :: Int, y :: a } deriving (Show) + +data B a = MT Bool | Bin (B a) a Bool (B a) deriving (Show) + +tree x = Bin (Bin (MT True) x True (MT False)) x False (MT True) + +instanceUniverseBi [t| ([(Maybe Int, T Int, [Double])], Int) |] +instanceUniverseBiT [ [t|Maybe Int|] ] [t| ([(Maybe Int, T Int, [Float])], Int) |] +instanceUniverseBi [t| ([B Bool], Int) |] +instanceUniverseBi [t| ([B Bool], Bool) |] +instanceUniverseBi [t| (B Char, B Char) |] +instanceUniverseBi [t| ([Int], [Int]) |] + +instanceTransformBi [t| (Int , [(Bool,T String)]) |] +instanceTransformBi [t| (Bool , B Char) |] +instanceTransformBi [t| (Bool , B Bool) |] +instanceTransformBi [t| (B Char , B Char) |] + +instanceTransformBiM [t| Maybe |] [t| (Int , [Int]) |] +instanceTransformBiM [t| Maybe |] [t| (Int , [(Int,Bool)]) |] +instanceTransformBiM [t| IO |] [t| (Int , B Int) |] +instanceTransformBiM [t| IO |] [t| (Bool , B Bool) |] +instanceTransformBiM [t| IO |] [t| (B Char , B Char) |] + +instanceUniverseBi [t| forall a . (B a, a) |] +instanceTransformBi [t| forall a . (a, [a]) |] + +main :: IO () +main = do + print (universeBi [(Just (12::Int), T 1 (2::Int), [1.1::Double]), (Just 345, T 3 4, [2.2]), (Nothing, T 5 6, [3.3])] :: [Int]) + print (universeBi [(Just (12::Int), T 1 (2::Int), [1.1::Float]), (Just 345, T 3 4, [2.2]), (Nothing, T 5 6, [3.3])] :: [Int]) + print (universeBi [tree True, tree False] :: [Int]) + print (universeBi [tree True, tree False] :: [Bool]) + print (universeBi (tree 'a') :: [B Char]) + print (universeBi [1,2::Int] :: [[Int]]) + + print $ transformBi ((+1) :: Int->Int) [(True,T 1 "a"), (False,T 2 "b")] + print $ transformBi not $ tree 'a' + print $ transformBi not $ tree True + let f :: B Char -> B Char + f (MT b) = MT b + f (Bin t1 x b t2) = Bin t1 x (not b) t2 + print $ transformBi f $ tree 'a' + + print $ transformBiM (Just :: Int -> Maybe Int) [1::Int,2,3] + print $ transformBiM (\ x -> if x==(2::Int) then Nothing else Just x) [1::Int,2,3] + print $ transformBiM (Just :: Int -> Maybe Int) [(1::Int, True)] + transformBiM (\ x -> do print (x::Int); return (x+100::Int)) (tree (3::Int)) >>= print + transformBiM (\ x -> do print (x::Bool); return (not x)) (tree True) >>= print + transformBiM (\ x -> do print (x::B Char); return x) (tree 'a') >>= print + + print (universeBi (Bin (MT True) () False (MT True)) :: [()]) + print (transformBi ((+1)::Int->Int) [1::Int,10,100]) diff --git a/examples/output b/examples/output new file mode 100644 --- /dev/null +++ b/examples/output @@ -0,0 +1,33 @@ +./Main +[12,1,2,345,3,4,5,6] +[1,2,3,4,5,6] +[] +[True,True,True,False,True,False,True,True,False,True,False,False,False,True] +[Bin (Bin (MT True) 'a' True (MT False)) 'a' False (MT True),Bin (MT True) 'a' True (MT False),MT True,MT False,MT True] +[[1,2],[2],[]] +[(True,T {x = 2, y = "a"}),(False,T {x = 3, y = "b"})] +Bin (Bin (MT False) 'a' False (MT True)) 'a' True (MT False) +Bin (Bin (MT False) False False (MT True)) False True (MT False) +Bin (Bin (MT True) 'a' False (MT False)) 'a' True (MT True) +Just [1,2,3] +Nothing +Just [(1,True)] +3 +3 +Bin (Bin (MT True) 103 True (MT False)) 103 False (MT True) +True +True +True +False +True +False +True +Bin (Bin (MT False) False False (MT True)) False True (MT False) +MT True +MT False +Bin (MT True) 'a' True (MT False) +MT True +Bin (Bin (MT True) 'a' True (MT False)) 'a' False (MT True) +Bin (Bin (MT True) 'a' True (MT False)) 'a' False (MT True) +[()] +[2,11,101] diff --git a/geniplate-mirror.cabal b/geniplate-mirror.cabal new file mode 100644 --- /dev/null +++ b/geniplate-mirror.cabal @@ -0,0 +1,31 @@ +Name: geniplate-mirror +Version: 0.6.0.6 +Synopsis: Use Template Haskell to generate Uniplate-like functions. +Description: Use Template Haskell to generate Uniplate-like functions. + . + This is a maintained mirror of the + package, + written by Lennart Augustsson. +Bug-reports: https://github.com/danr/geniplate/issues +License: BSD3 +License-File: LICENSE +Author: Lennart Augustsson +Maintainer: Dan Rosén, danr@chalmers.se +Copyright: 2014-2015 Lennart Augustsson +Category: Generics +Build-type: Simple +Cabal-Version: >= 1.8 +Stability: experimental + +Extra-source-files: + examples/Main.hs + examples/output + +source-repository head + type: git + location: https://github.com/danr/geniplate + +library + Build-Depends: base >= 4 && < 5.0, template-haskell < 2.11, mtl + + Exposed-modules: Data.Generics.Geniplate