Ideas.Common.Strategy.Sequence

A type class for sequences together with the Step datatype.

Sequence type class

class Sequence f where

Methods

done :: f a

The empty sequence.

(~>) :: a -> f a -> f a infixr 5

Prefix a sequence with one element.

(<*>) :: f a -> f a -> f a infixr 5

Append two sequences.

Instances

Sequence Builder

Sequence Process

Sequence GCore

Firsts type class

class Firsts s where

Minimal complete definition

menu

Associated Types

type Elem s

The type associated with a step in the first set.

Methods

ready :: s -> Bool

The ready predicate (we are done).

firsts :: s -> [(Elem s, s)]

The first set.

menu :: s -> Menu (MenuItem (Elem s) s)

The menu offers single steps (with the remainder) and done steps.

Instances

Firsts (Process a)

Firsts (Prefix a)

Firsts (State a)

firstsMenu :: Firsts s => s -> Menu (Elem s, s)

firstsOrdered :: Firsts s => (Elem s -> Elem s -> Ordering) -> s -> [(Elem s, s)]

firstsTree :: Firsts s => s -> DerivationTree (Elem s) s

stopped :: Firsts s => s -> Bool

Not ready and no further steps to take.

MenuItem data type with some utility functions

data MenuItem a s

Constructors

a :~> s infixr 5

A single step.

Done

No step (we are done).

Instances

BiFunctor MenuItem

Functor (MenuItem a)

menuItem :: b -> (a -> s -> b) -> MenuItem a s -> b

The menuItem function takes a default value for Done and a function to combine the values for a single step.

isDone :: MenuItem a s -> Bool

Is the item done?