GTALib-0.0.2: A library for GTA programming

Safe HaskellNone

GTA.Data.BinTree

Documentation

data LVTree a Source

Constructors

NodeLV (LVTree a) (LVTree a) 
LeafLV a 

Instances

data LVTreeAlgebra a a Source

Constructors

LVTreeAlgebra 

Fields

nodeLV :: a -> a -> a
 
leafLV :: a -> a
 

data LVTreeMapFs a a Source

Constructors

LVTreeMapFs 

Fields

leafLVF :: a -> a
 

data BinTree n l Source

Constructors

BinNode n (BinTree n l) (BinTree n l) 
BinLeaf l 

Instances

(Eq n, Eq l) => Eq (BinTree n l) 
(Ord n, Ord l) => Ord (BinTree n l) 
(Read n, Read l) => Read (BinTree n l) 
GenericSemiringStructure (BinTreeAlgebra n0 l0) (BinTree n0 l0) (BinTreeMapFs n0 l0) 

data BinTreeAlgebra n l a Source

Constructors

BinTreeAlgebra 

Fields

binNode :: n -> a -> a -> a
 
binLeaf :: l -> a
 

Instances

data BinTreeMapFs n l a Source

Constructors

BinTreeMapFs 

Fields

binNodeF :: n -> a
 
binLeafF :: l -> a
 

Instances

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

selects :: 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