GTALib 0.0.2 → 0.0.3
raw patch · 2 files changed
+4/−4 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- GTA.Data.BinTree: BinTreeAlgebra :: (n_abOE -> a -> a -> a) -> (l_abOF -> a) -> BinTreeAlgebra n_abOE l_abOF a
+ GTA.Data.BinTree: BinTreeAlgebra :: (n_abPc -> gta -> gta -> gta) -> (l_abPd -> gta) -> BinTreeAlgebra n_abPc l_abPd gta
- GTA.Data.BinTree: BinTreeMapFs :: (n_abOE -> a) -> (l_abOF -> a) -> BinTreeMapFs n_abOE l_abOF a
+ GTA.Data.BinTree: BinTreeMapFs :: (n_abPc -> gta) -> (l_abPd -> gta) -> BinTreeMapFs n_abPc l_abPd gta
- GTA.Data.BinTree: LVTreeAlgebra :: (a -> a -> a) -> (a_abKW -> a) -> LVTreeAlgebra a_abKW a
+ GTA.Data.BinTree: LVTreeAlgebra :: (gta -> gta -> gta) -> (a_abLu -> gta) -> LVTreeAlgebra a_abLu gta
- GTA.Data.BinTree: LVTreeMapFs :: (a_abKW -> a) -> LVTreeMapFs a_abKW a
+ GTA.Data.BinTree: LVTreeMapFs :: (a_abLu -> gta) -> LVTreeMapFs a_abLu gta
- GTA.Data.BinTree: binLeaf :: BinTreeAlgebra n_abOE l_abOF a -> l_abOF -> a
+ GTA.Data.BinTree: binLeaf :: BinTreeAlgebra n_abPc l_abPd gta -> l_abPd -> gta
- GTA.Data.BinTree: binLeafF :: BinTreeMapFs n_abOE l_abOF a -> l_abOF -> a
+ GTA.Data.BinTree: binLeafF :: BinTreeMapFs n_abPc l_abPd gta -> l_abPd -> gta
- GTA.Data.BinTree: binNode :: BinTreeAlgebra n_abOE l_abOF a -> n_abOE -> a -> a -> a
+ GTA.Data.BinTree: binNode :: BinTreeAlgebra n_abPc l_abPd gta -> n_abPc -> gta -> gta -> gta
- GTA.Data.BinTree: binNodeF :: BinTreeMapFs n_abOE l_abOF a -> n_abOE -> a
+ GTA.Data.BinTree: binNodeF :: BinTreeMapFs n_abPc l_abPd gta -> n_abPc -> gta
- GTA.Data.BinTree: data BinTreeAlgebra n_abOE l_abOF a
+ GTA.Data.BinTree: data BinTreeAlgebra n_abPc l_abPd gta
- GTA.Data.BinTree: data BinTreeMapFs n_abOE l_abOF a
+ GTA.Data.BinTree: data BinTreeMapFs n_abPc l_abPd gta
- GTA.Data.BinTree: data LVTreeAlgebra a_abKW a
+ GTA.Data.BinTree: data LVTreeAlgebra a_abLu gta
- GTA.Data.BinTree: data LVTreeMapFs a_abKW a
+ GTA.Data.BinTree: data LVTreeMapFs a_abLu gta
- GTA.Data.BinTree: leafLV :: LVTreeAlgebra a_abKW a -> a_abKW -> a
+ GTA.Data.BinTree: leafLV :: LVTreeAlgebra a_abLu gta -> a_abLu -> gta
- GTA.Data.BinTree: leafLVF :: LVTreeMapFs a_abKW a -> a_abKW -> a
+ GTA.Data.BinTree: leafLVF :: LVTreeMapFs a_abLu gta -> a_abLu -> gta
- GTA.Data.BinTree: nodeLV :: LVTreeAlgebra a_abKW a -> a -> a -> a
+ GTA.Data.BinTree: nodeLV :: LVTreeAlgebra a_abLu gta -> gta -> gta -> gta
- GTA.Data.JoinList: JoinListAlgebra :: (a -> a -> a) -> (a_agjt -> a) -> a -> JoinListAlgebra a_agjt a
+ GTA.Data.JoinList: JoinListAlgebra :: (gta -> gta -> gta) -> (a_agk1 -> gta) -> gta -> JoinListAlgebra a_agk1 gta
- GTA.Data.JoinList: data JoinListAlgebra a_agjt a
+ GTA.Data.JoinList: data JoinListAlgebra a_agk1 gta
- GTA.Data.JoinList: nil :: JoinListAlgebra a_agjt a -> a
+ GTA.Data.JoinList: nil :: JoinListAlgebra a_agk1 gta -> gta
- GTA.Data.JoinList: single :: JoinListAlgebra a_agjt a -> a_agjt -> a
+ GTA.Data.JoinList: single :: JoinListAlgebra a_agk1 gta -> a_agk1 -> gta
- GTA.Data.JoinList: times :: JoinListAlgebra a_agjt a -> a -> a -> a
+ GTA.Data.JoinList: times :: JoinListAlgebra a_agk1 gta -> gta -> gta -> gta
Files
GTALib.cabal view
@@ -7,7 +7,7 @@ -- The package version. See the Haskell package versioning policy -- (http://www.haskell.org/haskellwiki/Package_versioning_policy) for -- standards guiding when and how versions should be incremented. -Version: 0.0.2 +Version: 0.0.3 -- A short (one-line) description of the package. Synopsis: A library for GTA programming
src/GTA/Util/GenericSemiringStructureTemplate.hs view
@@ -50,7 +50,7 @@ -} genAlgebraRecord :: forall t.Name -> [TyVarBndr] -> [(Name, [(t, Type)])] -> DecQ genAlgebraRecord typeName typeParams constructors = - let a = mkName "a"+ let a = mkName "gta" newParams = typeParams++[PlainTV a] dataName = algebraName typeName funs = map genFun constructors -- functions corresponding to constructors@@ -70,7 +70,7 @@ -} genMapFunctionsRecord :: forall t.Name -> [TyVarBndr] -> [(Name, [(t, Type)])] -> DecQ genMapFunctionsRecord typeName typeParams constructors = - let a = mkName "a"+ let a = mkName "gta" newParams = typeParams++[PlainTV a] mapName = mapFunctionsName typeName funs = map genFun constructors' -- functions corresponding to constructors@@ -169,7 +169,7 @@ fs = map (\(n, _)->funcName n) constructors binds = [recBind (algebraName typeName) fs (varE alg) name, monoidBind (varE m)]- name = mkName . (++"A") . nameBase+ name = mkName . (++"gta") . nameBase bindExp ve = appE (varE frec) ve bindPat a = varP a newAlgebraName = (mkName "makeAlgebra")