Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data Reader d = Reader {}
- defReader :: Textable d => Reader d
- type Result d = Forest (DocNode d)
- defResult :: Monoid d => Result d
- data DocNode d
- = Leaf {
- docNodeSep :: d
- docNode :: d
- | Indented {
- docNodeIndent :: Indent
- docNodeSep :: d
- docNode :: d
- | BreakableFill {
- docNodeIndent :: Indent
- docNodeSep :: d
- docNode :: d
- = Leaf {
- docTree :: Monoid d => Textable d => Indentable d => Tree (DocNode d) -> d
- docTrees :: Monoid d => Textable d => Indentable d => Forest (DocNode d) -> d
- data Help d e t a = Help {
- help_result :: Reader d -> Result d
- help_plain :: Plain d e t a
- runHelp :: Monoid d => Indentable d => Textable d => Help d e t a -> d
- textHelp :: Doc d => Reader d -> Help d e t a -> d
- coerceHelp :: Help d e s a -> Help d e t b
- data PermHelp d e t a = PermHelp (Reader d -> Result d) [Plain d e t a]
Type Reader
Reader | |
|
Type Result
Type DocNode
Leaf | |
| |
Indented | |
| |
BreakableFill | |
|
Type Help
Help | |
|
Instances
coerceHelp :: Help d e s a -> Help d e t b Source #