Home | History | Annotate | Download | only in editing

Lines Matching refs:ancestors

122 void InsertParagraphSeparatorCommand::getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<Element*>& ancestors)
124 ancestors.clear();
126 // Build up list of ancestors elements between the insertion node and the outer block.
129 ancestors.append(n);
133 PassRefPtr<Element> InsertParagraphSeparatorCommand::cloneHierarchyUnderNewBlock(const Vector<Element*>& ancestors, PassRefPtr<Element> blockToInsert)
135 // Make clones of ancestors in between the start node and the start block.
137 for (size_t i = ancestors.size(); i != 0; --i) {
138 RefPtr<Element> child = ancestors[i - 1]->cloneElementWithoutChildren();
244 Vector<Element*> ancestors;
245 getAncestorsInsideBlock(insertionPosition.node(), startBlock, ancestors);
246 RefPtr<Element> parent = cloneHierarchyUnderNewBlock(ancestors, blockToInsert);
275 Vector<Element*> ancestors;
276 getAncestorsInsideBlock(positionAvoidingSpecialElementBoundary(insertionPosition).node(), startBlock, ancestors);
278 appendBlockPlaceholder(cloneHierarchyUnderNewBlock(ancestors, blockToInsert));
307 // Build up list of ancestors in between the start node and the start block.
308 Vector<Element*> ancestors;
309 getAncestorsInsideBlock(insertionPosition.node(), startBlock, ancestors);
342 // Make clones of ancestors in between the start node and the outer block.
343 RefPtr<Element> parent = cloneHierarchyUnderNewBlock(ancestors, blockToInsert);
366 if (!ancestors.isEmpty()) {
367 Element* leftParent = ancestors.first();