|
|
|
|
| Synopsis |
|
| class (Apply p, Commute p, ShowPatch p, ReadPatch p, Invert p) => Patchy p | | | class Apply p where | | | | mapMaybeSnd :: (a -> b) -> Maybe (c, a) -> Maybe (c, b) | | | class Commute p where | | | | commuteFL :: Commute p => (p :> FL p) -> Either (Sealed2 p) (FL p :> p) | | | commuteRL :: Commute p => (RL p :> p) -> Maybe (p :> RL p) | | | commuteRLFL :: Commute p => (RL p :> FL p) -> Maybe (FL p :> RL p) | | | mergeFL :: Commute p => (p :\/: FL p) -> FL p :/\: p | | | toFwdCommute :: (Commute p, Commute q, Monad m) => ((p :< q) -> m (q :< p)) -> (q :> p) -> m (p :> q) | | | toRevCommute :: (Commute p, Commute q, Monad m) => ((p :> q) -> m (q :> p)) -> (q :< p) -> m (p :< q) | | | class Commute p => ShowPatch p where | | | | class ReadPatch p where | | | | bracketedFL :: (ReadPatch p, ParserM m) => Word8 -> Word8 -> m (Maybe (Sealed (FL p))) | | | peekfor :: ParserM m => String -> m a -> m a -> m a | | | class MyEq p => Invert p where | | | | invertFL :: Invert p => FL p -> RL p | | | invertRL :: Invert p => RL p -> FL p |
|
|
| Documentation |
|
|
| Instances | |
|
|
|
| | Methods | | | Instances | |
|
|
|
|
|
| Things that can commute.
| | | Methods | | | Instances | |
|
|
|
|
|
|
|
|
|
|
|
| Swaps the ordered pair type so that commute can be
called directly.
|
|
|
| Swaps the ordered pair type from the order expected
by commute to the reverse order.
|
|
|
| | Methods | | | Instances | |
|
|
|
| | Methods | | | Instances | |
|
|
|
|
|
|
|
| | Methods | | | Instances | |
|
|
|
|
|
|
| Produced by Haddock version 2.6.1 |