Copyright | (c) 2015 Athan Clark |
---|---|
License | BSD-3 |
Maintainer | athan.clark@gmail.com |
Stability | experimental |
Portability | GHC |
Safe Haskell | None |
Language | Haskell2010 |
- data Pred c s a = Typeable r => Pred {}
- singletonPred :: (Monoid (c s (r -> a)), Typeable r) => (s -> Maybe r) -> (r -> a) -> Pred c s a
- newtype PredStep k c s a = PredStep {
- unPredSteps :: HashMap k (Pred c s a)
- unionPred :: (Eq k, Hashable k) => PredStep k c s a -> PredStep k c s a -> PredStep k c s a
Single Predicated Step
Typeable r => Pred | |
|
singletonPred :: (Monoid (c s (r -> a)), Typeable r) => (s -> Maybe r) -> (r -> a) -> Pred c s a Source #
Adjacent Predicated Steps
newtype PredStep k c s a Source #
Adjacent steps
PredStep | |
|
Trie NonEmpty s c => Trie NonEmpty s (PredStep k c) Source # | Lookup and delete only - can't arbitrarilly construct a predicated trie. |
Functor (c s) => Functor (PredStep k c s) Source # | |
Show k => Show (PredStep k c s a) Source # | |
(Eq k, Hashable k) => Monoid (PredStep k c s a) Source # | |
(Functor (c s), NFData (c s (s -> Maybe a)), NFData k) => NFData (PredStep k c s a) Source # | |