Safe Haskell | None |
---|---|

Language | Haskell2010 |

## Synopsis

- data Permutable p c t a
- runPermutable :: forall p c t a b. Monoid p => Phase p c t b -> Permutable p c t a -> Phase p c t a
- term :: Phase p c t a -> Permutable p c t a

# Documentation

data Permutable p c t a Source #

## Instances

Functor (Permutable p c t) Source # | |

Defined in Codec.Phaser.Permutation fmap :: (a -> b) -> Permutable p c t a -> Permutable p c t b # (<$) :: a -> Permutable p c t b -> Permutable p c t a # | |

Applicative (Permutable p c t) Source # | |

Defined in Codec.Phaser.Permutation pure :: a -> Permutable p c t a # (<*>) :: Permutable p c t (a -> b) -> Permutable p c t a -> Permutable p c t b # liftA2 :: (a -> b -> c0) -> Permutable p c t a -> Permutable p c t b -> Permutable p c t c0 # (*>) :: Permutable p c t a -> Permutable p c t b -> Permutable p c t b # (<*) :: Permutable p c t a -> Permutable p c t b -> Permutable p c t a # |

runPermutable :: forall p c t a b. Monoid p => Phase p c t b -> Permutable p c t a -> Phase p c t a Source #

Create a `Phase`

which runs the constituent terms of the `Permutable`

in every order in which they succeed, running a separator `Phase`

between
each term which consumes input.

term :: Phase p c t a -> Permutable p c t a Source #