Data.Trie.Pred.Step

Single Predicated Step

data PredStep c s a

Constructors

forall r . PredStep

Fields

predTag :: !s

Unique identifier for the predicate - used for combination

predPred :: s -> Maybe r

The predicate, existentially quantified in the successful result r

predData :: Maybe (r -> a)

The result function, capturing the quantified result r and turning it into a top-level variable a.

predSub :: c s (r -> a)

Any sub-trie must have all results preceeded in arity with the result at this step.

Instances

Trie NonEmpty s c => Trie NonEmpty s (PredStep c)

Lookup and delete only - can't arbitrarilly construct a predicated trie.

Functor (c s) => Functor (PredStep c s)

singletonPred :: Monoid (c s (r -> a)) => s -> (s -> Maybe r) -> (r -> a) -> PredStep c s a

Adjacent Predicated Steps

newtype PredSteps c s a

Adjacent steps

Constructors

PredSteps

Fields

unPredSteps :: [PredStep c s a]

Instances

Trie NonEmpty s c => Trie NonEmpty s (PredSteps c)

Lookup and delete only - can't arbitrarilly construct a predicated trie.

Functor (c s) => Functor (PredSteps c s)

Eq s => Monoid (PredSteps c s a)

unionPred :: Eq s => PredSteps c s a -> PredSteps c s a -> PredSteps c s a

Last-style instance