Searched refs:nodesToRemove (Results 1 – 3 of 3) sorted by relevance
45 WillBeHeapVector<RefPtrWillBeMember<ContainerNode> > nodesToRemove; in doApply() local65 nodesToRemove.append(currentNode); in doApply()85 nodesToRemove.append(node); in doApply()90 for (size_t i = 0; i < nodesToRemove.size(); ++i) { in doApply()92 int numPrunedAncestors = pruneSubsequentAncestorsToRemove(nodesToRemove, i); in doApply()95 removeNodePreservingChildren(nodesToRemove[i], AssumeContentIsAlwaysEditable); in doApply()100 …cestorsToRemove(WillBeHeapVector<RefPtrWillBeMember<ContainerNode> >& nodesToRemove, size_t startN… in pruneSubsequentAncestorsToRemove() argument103 for (; pastLastNodeToRemove < nodesToRemove.size(); ++pastLastNodeToRemove) { in pruneSubsequentAncestorsToRemove()104 … if (nodesToRemove[pastLastNodeToRemove - 1]->parentNode() != nodesToRemove[pastLastNodeToRemove]) in pruneSubsequentAncestorsToRemove()106 …ASSERT(nodesToRemove[pastLastNodeToRemove]->firstChild() == nodesToRemove[pastLastNodeToRemove]->l… in pruneSubsequentAncestorsToRemove()[all …]
46 …cestorsToRemove(WillBeHeapVector<RefPtrWillBeMember<ContainerNode> >& nodesToRemove, size_t startN…
402 NodeVector nodesToRemove; in moveRemainingSiblingsToNewParent() local406 nodesToRemove.append(node); in moveRemainingSiblingsToNewParent()408 for (unsigned i = 0; i < nodesToRemove.size(); i++) { in moveRemainingSiblingsToNewParent()409 removeNode(nodesToRemove[i]); in moveRemainingSiblingsToNewParent()410 appendNode(nodesToRemove[i], newParent); in moveRemainingSiblingsToNewParent()