Searched refs:ancestors (Results 1 - 15 of 15) sorted by relevance

/external/webkit/Source/WebCore/editing/
H A DBreakBlockquoteCommand.cpp128 // Build up list of ancestors in between the start node and the top blockquote.
129 Vector<Element*> ancestors; local
131 ancestors.append(node);
137 // Clone startNode's ancestors into the cloned blockquote.
139 // that was cloned (i.e. the clone of either ancestors.last()
140 // or clonedBlockquote if ancestors is empty).
142 for (size_t i = ancestors.size(); i != 0; --i) {
143 RefPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren();
146 Node* listChildNode = i > 1 ? ancestors[i - 2] : startNode;
168 if (!ancestors
[all...]
H A DInsertParagraphSeparatorCommand.h49 void getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<Element*>& ancestors);
50 PassRefPtr<Element> cloneHierarchyUnderNewBlock(const Vector<Element*>& ancestors, PassRefPtr<Element> blockToInsert);
H A DInsertParagraphSeparatorCommand.cpp122 void InsertParagraphSeparatorCommand::getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<Element*>& ancestors) argument
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) argument
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();
241 Vector<Element*> ancestors; local
242 getAncestorsInsideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock, ancestors);
275 Vector<Element*> ancestors; local
[all...]
H A DCompositeEditCommand.cpp785 Vector<RefPtr<Node> > ancestors; local
789 ancestors.append(n);
793 for (size_t i = ancestors.size(); i != 0; --i) {
794 Node* item = ancestors[i - 1].get();
/external/webkit/Source/WebCore/dom/
H A DEventDispatcher.cpp170 // Since ancestors does not contain target itself, we must account
177 // Trim ancestors to lowestCommonBoundary to keep events inside of the common shadow DOM subtree.
184 inline static bool ancestorsCrossShadowBoundaries(const Vector<EventContext>& ancestors) argument
186 return ancestors.isEmpty() || ancestors.first().node() == ancestors.last().node();
207 // ancestors size and if the retargeting has occured (indicating the presence of shadow DOM boundaries).
H A DRange.cpp858 Vector<RefPtr<Node> > ancestors; local
860 ancestors.append(n);
863 for (Vector<RefPtr<Node> >::const_iterator it = ancestors.begin(); it != ancestors.end(); it++) {
/external/antlr/src/org/antlr/runtime/tree/
H A DBaseTree.java300 /** Return a list of all ancestors of this node. The first node of
305 List ancestors = new ArrayList();
309 ancestors.add(0, t); // insert at start
312 return ancestors;
/external/webkit/Source/WebCore/inspector/
H A DInspectorInstrumentation.cpp77 static bool eventHasListeners(const AtomicString& eventType, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors) argument
85 for (size_t i = 0; i < ancestors.size(); i++) {
86 Node* ancestor = ancestors[i].node();
243 InspectorInstrumentationCookie InspectorInstrumentation::willDispatchEventImpl(InspectorAgent* inspectorAgent, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors) argument
249 if (timelineAgent && eventHasListeners(event.type(), window, node, ancestors)) {
H A DInspectorInstrumentation.h96 static InspectorInstrumentationCookie willDispatchEvent(Document*, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors);
215 static InspectorInstrumentationCookie willDispatchEventImpl(InspectorAgent*, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors);
475 inline InspectorInstrumentationCookie InspectorInstrumentation::willDispatchEvent(Document* document, const Event& event, DOMWindow* window, Node* node, const Vector<EventContext>& ancestors) argument
479 return willDispatchEventImpl(inspectorAgent, event, window, node, ancestors);
H A DInspectorDOMAgent.cpp736 Vector<ContainerNode*> ancestors;
738 ancestors.append(ancestor);
742 for (size_t i = ancestors.size(); i; --i) {
743 ContainerNode* ancestor = ancestors[i - 1];
/external/webkit/Source/WebCore/inspector/front-end/
H A Dtreeoutline.js291 // tree element that represents representedObject or one of its ancestors.
306 // Build up a list of representedObject's ancestors that aren't already in our tree.
307 var ancestors = [];
310 ancestors.unshift(currentObject);
316 // For each of those ancestors we populate them to fill in the tree.
317 for (var i = 0; i < ancestors.length; ++i) {
320 if (ancestors[i] === representedObject)
324 item = this.findTreeElement(ancestors[i], isAncestor, getParent);
/external/apache-xml/src/main/java/org/apache/xalan/templates/
H A DElemNumber.java173 * Only ancestors that are searched are
186 * Only ancestors that are searched are
203 * Only ancestors that are searched are
222 * attribute is specified, then the only ancestors that are searched are those
226 * When level="multiple", it constructs a list of all ancestors of the current node
230 * If the from attribute is specified, then the only ancestors that are searched are
819 NodeVector ancestors =
822 int lastIndex = ancestors.size() - 1;
830 int target = ancestors.elementAt(i);
965 * Get the ancestors, u
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/parse-only/
H A Dprototype-1.6.0.3.js1698 ancestors: function(element) {
1741 var ancestors = element.ancestors();
1742 return Object.isNumber(expression) ? ancestors[expression] :
1743 Selector.findElement(ancestors, expression, index);
3868 var elements = [element].concat(element.ancestors());
H A Dconcat-jquery-mootools-prototype.js10077 ancestors: function(element) {
10120 var ancestors = element.ancestors();
10121 return Object.isNumber(expression) ? ancestors[expression] :
10122 Selector.findElement(ancestors, expression, index);
12247 var elements = [element].concat(element.ancestors());
/external/webkit/Source/WebCore/css/
H A DCSSStyleSelector.cpp657 Vector<Element*, 30> ancestors; local
659 ancestors.append(ancestor);
660 int count = ancestors.size();
662 pushParentStackFrame(ancestors[n]);
2113 // Rewind to the topmost child or subselector and the element it matched, continue checking ancestors.
3075 // Only collect identifiers that match ancestors.

Completed in 204 milliseconds