Data.Trie.Pred.Base.Step

Single Predicated Step

data PredStep k c s a

Constructors

forall r . Typeable r => PredStep

Fields

predTag :: !k

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 k c)

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

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

(Show s, Show k) => Show (PredStep k c s a)

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

Adjacent Predicated Steps

newtype PredSteps k c s a

Adjacent steps

Constructors

PredSteps

Fields

unPredSteps :: [PredStep k c s a]

Instances

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

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

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

(Show k, Show s) => Show (PredSteps k c s a)

(Eq s, Eq k) => Monoid (PredSteps k c s a)

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

Last-style instance