(excludeFacts, includeFacts, node, outermostLabeledStatement, convert)
| 100167 | } |
| 100168 | } |
| 100169 | function visitIterationStatementWithFacts(excludeFacts, includeFacts, node, outermostLabeledStatement, convert) { |
| 100170 | var ancestorFacts = enterSubtree(excludeFacts, includeFacts); |
| 100171 | var updated = convertIterationStatementBodyIfNecessary(node, outermostLabeledStatement, ancestorFacts, convert); |
| 100172 | exitSubtree(ancestorFacts, 0 /* HierarchyFacts.None */, 0 /* HierarchyFacts.None */); |
| 100173 | return updated; |
| 100174 | } |
| 100175 | function visitDoOrWhileStatement(node, outermostLabeledStatement) { |
| 100176 | return visitIterationStatementWithFacts(0 /* HierarchyFacts.DoOrWhileStatementExcludes */, 1280 /* HierarchyFacts.DoOrWhileStatementIncludes */, node, outermostLabeledStatement); |
| 100177 | } |
no test coverage detected
searching dependent graphs…