Safe Haskell	Safe
Language	Haskell2010

Algorithms.Htn

Documentation

class (Eq a, Ord a, Show a) => Term a Source #

Constructors

Instances

(Eq b, Eq a) => Eq (Task a b) Source #
Methods (==) :: Task a b -> Task a b -> Bool # (/=) :: Task a b -> Task a b -> Bool #
(Ord b, Ord a) => Ord (Task a b) Source #
Methods compare :: Task a b -> Task a b -> Ordering # (<) :: Task a b -> Task a b -> Bool # (<=) :: Task a b -> Task a b -> Bool # (>) :: Task a b -> Task a b -> Bool # (>=) :: Task a b -> Task a b -> Bool # max :: Task a b -> Task a b -> Task a b # min :: Task a b -> Task a b -> Task a b #
(Show b, Show a) => Show (Task a b) Source #
Methods showsPrec :: Int -> Task a b -> ShowS # show :: Task a b -> String # showList :: [Task a b] -> ShowS #

Constructors

Domain
Fields primitiveMap :: Map a [([c], [c])] map of PrimitiveTask to conditions, value is tuple of pre-condtions and post-condtions compoundMap :: Map b [([c], [Task a b])] map of compoundTask to conditions, value is tuple of pre-conditions and separated tasks

Instances

(Show a, Show b, Show c) => Show (Domain a b c) Source #
Methods showsPrec :: Int -> Domain a b c -> ShowS # show :: Domain a b c -> String # showList :: [Domain a b c] -> ShowS #

htn :: (PrimitiveTask a, CompoundTask b, Term c) => Domain a b c -> [c] -> [Task a b] -> ([Task a b], [c]) Source #