| definition: |
fill :: Int -> Doc -> Doc
fill i d = d <> fill'
where w = width d
fill' = if w >= i then empty else spaces (i - w)
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- The document `(fill i d)` renders document `d`. It than appends
--- `space`s until the width is equal to `i`. If the width of `d` is
--- already larger, nothing is appended. This combinator is quite
--- useful in practice to output a list of bindings. The following
--- example demonstrates this.
---
--- types = [("empty","Doc")
--- ,("nest","Int -> Doc -> Doc")
--- ,("linebreak","Doc")]
---
--- ptype (name,tp)
--- = fill 6 (text name) <+> text "::" <+> text tp
---
--- test = text "let" <+> align (vcat (map ptype types))
---
--- Which is layed out as:
---
--- let empty :: Doc
--- nest :: Int -> Doc -> Doc
--- linebreak :: Doc
---
--- Note that `fill` is not guaranteed to be linear-time bounded since it has to
--- compute the width of a document before pretty printing it
|
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
fill |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Int -> Text.PrettyImpl.Doc -> Text.PrettyImpl.Doc |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |