|
definition:
|
pruneOne :: Tokens -> Width -> Position -> EndPosition -> OutGroupPrefix -> Out
pruneOne ts w p e outGrpPre | p <= e = oneGroup ts w p e outGrpPre
| otherwise = outGrpPre False (noGroup ts w p)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- pruneOne checks whether the outermost group (in this case there is only one
-- group) still fits in the current line. If it doesn't fit, it applies the
-- corresponding `group output function` (the group is formatted vertically)
-- and continues processing the token sequence
|
|
failfree:
|
(_, _, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_,_) |-> _}
|
|
name:
|
pruneOne
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Tokens -> Prelude.Int -> Prelude.Int -> Prelude.Int -> (Prelude.Bool
-> (Prelude.Int -> [Prelude.Int] -> [FormatStm] -> String) -> Prelude.Int
-> [Prelude.Int] -> [FormatStm] -> String) -> Prelude.Int -> [Prelude.Int]
-> [FormatStm] -> String
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|