Safe Haskell | None |
---|
This module provides the GTA framework on binary (and leaf-valued) trees, such as definitions of the data structures and their algebras, generators, aggregators, etc.
Documentation
Eq a => Eq (LVTree a) | |
Ord a => Ord (LVTree a) | |
Read a => Read (LVTree a) | |
GenericSemiringStructure (LVTreeAlgebra b) (LVTree b) (LVTreeMapFs b) |
data LVTreeAlgebra b a Source
GenericSemiringStructure (LVTreeAlgebra b) (LVTree b) (LVTreeMapFs b) |
data LVTreeMapFs b b' Source
LVTreeMapFs | |
|
GenericSemiringStructure (LVTreeAlgebra b) (LVTree b) (LVTreeMapFs b) |
data BinTreeAlgebra n l a Source
GenericSemiringStructure (BinTreeAlgebra n l) (BinTree n l) (BinTreeMapFs n l) |
data BinTreeMapFs n l b' Source
GenericSemiringStructure (BinTreeAlgebra n l) (BinTree n l) (BinTreeMapFs n l) |
lvtrees :: [a] -> LVTreeSemiring a s -> sSource
subtreeSelectsWithRoot :: BinTree n l -> BinTreeSemiring (Bool, n) (Bool, l) a -> aSource
subtreeSelects :: BinTree n l -> BinTreeSemiring (Bool, n) (Bool, l) a -> aSource
assignTrans :: [b] -> [c] -> BinTreeSemiring c (b, a) s -> LVTreeSemiring a sSource
assignTrees :: [b] -> [c] -> [a] -> BinTreeSemiring c (b, a) s -> sSource
count :: Num a => BinTreeSemiring n l aSource
maxsum :: (Num a, Ord a) => BinTreeSemiring (Bool, a) (Bool, a) (AddIdentity a)Source
maxsumsolution :: (Num a, Ord a) => BinTreeSemiring (Bool, a) (Bool, a) (AddIdentity a, Bag (BinTree (Bool, a) (Bool, a)))Source
type LVTreeSemiring a s = GenericSemiring (LVTreeAlgebra a) sSource
type BinTreeSemiring n l a = GenericSemiring (BinTreeAlgebra n l) aSource