Prepend b to the list, if not already scheduled.
Prepend b to the list, if not already scheduled. TODO: use better test than linear search
Remove and return the first element to be processed from the worklist.
Remove and return the first element to be processed from the worklist.
Linearize another subtree and append it to the existing blocks.
Process the current element from the worklist.
Process the current element from the worklist.
Run the iterative algorithm until the worklist remains empty.
Run the iterative algorithm until the worklist remains empty. The initializer is run once before the loop starts and should initialize the worklist.
(normalLinearizer: StringAdd).self
(normalLinearizer: StringFormat).self
(normalLinearizer: ArrowAssoc[ICodes.NormalLinearizer]).x
(Since version 2.10.0) Use leftOfArrow
instead
(normalLinearizer: Ensuring[ICodes.NormalLinearizer]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
A simple linearizer which predicts all branches to take the 'success' branch and tries to schedule those blocks immediately after the test. This is in sync with how 'while' statements are translated (if the test is 'true', the loop continues).