|
definition:
|
pruneMulti :: Tokens -> Width -> Position -> EndPosition -> OutGroupPrefix
-> Q.Queue (StartPosition, OutGroupPrefix)
-> StartPosition -> OutGroupPrefix -> Out
pruneMulti ts w p e outGrpPreOuter qs si outGrpPreInner
| p <= e = multiGroup ts w p e outGrpPreOuter qs si outGrpPreInner
| otherwise = outGrpPreOuter False (\r ->
(case Q.matchLast qs of
Nothing -> pruneOne ts w p (si+r) outGrpPreInner
Just ((s,outGrpPre),qs') ->
pruneMulti ts w p (s+r) outGrpPre qs' si outGrpPreInner)
r)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- pruneMulti checks whether the outermost group (in this case there are at
-- least two groups) still fits in the current line. If it doesn't fit, it
-- applies the corresponding `group output function` (the last queue entry) and
-- continues checking whether the next outermost group fits
|
|
failfree:
|
(_, _, _, _, _, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_,_,_,_,_) |-> _}
|
|
name:
|
pruneMulti
|
|
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)
-> Data.Queue.Queue (Prelude.Int, Prelude.Bool -> (Prelude.Int -> [Prelude.Int]
-> [FormatStm] -> String) -> Prelude.Int -> [Prelude.Int] -> [FormatStm]
-> String) -> 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
|