Ideas.Common.Strategy

Data types and type classes

data Strategy a

data LabeledStrategy a

class IsStrategy f

Running strategies

derivationList

Strategy combinators

Basic combinators

(.*.)

(.|.)

(.%.)

(.@.)

(!~>)

succeed

fail

atomic

label

inits

sequence

choice

alternatives

interleave

permute

EBNF combinators

many

many1

replicate

option

Negation and greedy combinators

check

not

repeat

repeat1

try

(|>)

(./.)

exhaustive

while

until

dynamic

Graph

type DependencyGraph node key

dependencyGraph

Traversal combinators

Configuration combinators

Strategy locations

strategyLocations

checkLocation

subTaskLocation

nextTaskLocation

Prefixes

data Prefix a

emptyPrefix

noPrefix

replayPath

replayPaths

replayStrategy

data Path

emptyPath

readPath

readPaths

prefixPaths

majorPrefix

isEmptyPrefix

Misc

cleanUpStrategy

cleanUpStrategyAfter

rulesInStrategy