assert bookmark < nodePos; assert furthestBlockPos > nodePos; removeFromStack(nodePos); // node is now a bad pointer in insertIntoListOfActiveFormattingElements(formattingClone, bookmark); assert formattingEltStackPos < furthestBlockPos; removeFromStack(formattingEltStackPos);
assert bookmark < nodePos; assert furthestBlockPos > nodePos; removeFromStack(nodePos); // node is now a bad pointer in C++ furthestBlockPos--; continue; insertIntoListOfActiveFormattingElements(formattingClone, bookmark); assert formattingEltStackPos < furthestBlockPos; removeFromStack(formattingEltStackPos);
assert bookmark < nodePos; assert furthestBlockPos > nodePos; removeFromStack(nodePos); // node is now a bad pointer in C++ furthestBlockPos--; continue; insertIntoListOfActiveFormattingElements(formattingClone, bookmark); assert formattingEltStackPos < furthestBlockPos; removeFromStack(formattingEltStackPos);
activeA.retain(); adoptionAgencyEndTag("a"); removeFromStack(activeA); activeAPos = findInListOfActiveFormattingElements(activeA); if (activeAPos != -1) { StackNode<T> headOnStack = stack[currentPtr]; startTagTemplateInHead(elementName, attributes); removeFromStack(headOnStack); attributes = null; // CPP break starttagloop;
activeA.retain(); adoptionAgencyEndTag("a"); removeFromStack(activeA); activeAPos = findInListOfActiveFormattingElements(activeA); if (activeAPos != -1) { StackNode<T> headOnStack = stack[currentPtr]; startTagTemplateInHead(elementName, attributes); removeFromStack(headOnStack); attributes = null; // CPP break starttagloop;
activeA.retain(); adoptionAgencyEndTag("a"); removeFromStack(activeA); activeAPos = findInListOfActiveFormattingElements(activeA); if (activeAPos != -1) {
errUnclosedElements(eltPos, name); removeFromStack(eltPos); break endtagloop; case P:
errUnclosedElements(eltPos, name); removeFromStack(eltPos); break endtagloop; } else {
errUnclosedElements(eltPos, name); removeFromStack(eltPos); break endtagloop; } else {