Safe Haskell	None

GTA.Data.ConsList

Description

This module provides the GTA framework on cons lists, such as definitions of the data structure and its algebra, generators, aggregators, etc.

Documentation

data ConsList a Source

Constructors

Cons a (ConsList a)
Nil

Instances

Eq a => Eq (ConsList a)
Ord a => Ord (ConsList a)
Read a => Read (ConsList a)
Show a => Show (ConsList a)
GenericSemiringStructure (ConsListAlgebra b) (ConsList b) (ConsListMapFs b)

data ConsListAlgebra b a Source

Constructors

ConsListAlgebra
Fields cons :: b -> a -> a nil :: a

Instances

GenericSemiringStructure (ConsListAlgebra b) (ConsList b) (ConsListMapFs b)

consize :: forall a. [a] -> ConsList aSource

deconsize :: forall a. ConsList a -> [a]Source

segs :: [a] -> ConsSemiring a s -> sSource

inits :: [a] -> ConsSemiring a s -> sSource

tails :: [a] -> ConsSemiring a s -> sSource

subs :: [a] -> ConsSemiring a s -> sSource

assigns :: [m] -> [a] -> ConsSemiring (m, a) s -> sSource

assignsBy :: (a -> [m]) -> [a] -> ConsSemiring (m, a) s -> sSource

paths :: BinTree a a -> ConsSemiring a s -> sSource

mapC :: forall b a. (b -> a) -> ConsListMapFs b aSource

count :: Num a => ConsSemiring b aSource

maxsum :: (Ord a, Num a) => ConsSemiring a (AddIdentity a)Source

maxsumsolution :: (Ord a, Num a) => ConsSemiring a (AddIdentity a, Bag (ConsList a))Source

maxsumWith :: (Ord a, Num a) => (b -> a) -> ConsSemiring b (AddIdentity a)Source

maxsumKWith :: (Ord a, Num a) => Int -> (b -> a) -> ConsSemiring b [AddIdentity a]Source

maxsumsolutionXKWith :: (Ord a, Num a) => ConsSemiring c b -> Int -> (c -> a) -> ConsSemiring c [(AddIdentity a, b)]Source

maxsumsolutionXWith :: (Ord a, Num a) => ConsSemiring c b -> (c -> a) -> ConsSemiring c (AddIdentity a, b)Source

maxsumsolutionWith :: (Ord a, Num a) => (b -> a) -> ConsSemiring b (AddIdentity a, Bag (ConsList b))Source

maxsumsolutionKWith :: (Ord a, Num a) => Int -> (b -> a) -> ConsSemiring b [(AddIdentity a, Bag (ConsList b))]Source

maxprodWith :: (Ord a, Num a) => (b -> a) -> ConsSemiring b (AddIdentity a)Source

maxprodKWith :: (Ord a, Num a) => Int -> (b -> a) -> ConsSemiring b [AddIdentity a]Source

maxprodsolutionXKWith :: (Ord a, Num a) => ConsSemiring c b -> Int -> (c -> a) -> ConsSemiring c [(AddIdentity a, b)]Source

maxprodsolutionXWith :: (Ord a, Num a) => ConsSemiring c b -> (c -> a) -> ConsSemiring c (AddIdentity a, b)Source

maxprodsolutionWith :: (Ord a, Num a) => (b -> a) -> ConsSemiring b (AddIdentity a, Bag (ConsList b))Source

maxprodsolutionKWith :: (Ord a, Num a) => Int -> (b -> a) -> ConsSemiring b [(AddIdentity a, Bag (ConsList b))]Source

crossCons :: a -> Bag (ConsList a) -> Bag (ConsList a)Source

emptyBag :: Bag (ConsList a)Source

bagOfNil :: Bag (ConsList a)Source

bagUnion :: Bag (ConsList a) -> Bag (ConsList a) -> Bag (ConsList a)Source

type ConsSemiring a s = GenericSemiring (ConsListAlgebra a) sSource

foldr' :: forall a s. (a -> s -> s) -> s -> ConsListAlgebra a sSource

data ConsListMapFs b b' Source

Instances

GenericSemiringStructure (ConsListAlgebra b) (ConsList b) (ConsListMapFs b)

mapMap :: (b -> b') -> GenericSemiring (ConsListAlgebra b') a -> GenericSemiring (ConsListAlgebra b) aSource

perms :: [a] -> ConsSemiring a s -> sSource