| /external/webkit/WebCore/editing/ |
| InsertParagraphSeparatorCommand.h | 47 void getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<Element*>& ancestors);
48 PassRefPtr<Element> cloneHierarchyUnderNewBlock(const Vector<Element*>& ancestors, PassRefPtr<Element> blockToInsert);
|
| InsertParagraphSeparatorCommand.cpp | 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; local
245 getAncestorsInsideBlock(insertionPosition.node(), startBlock, ancestors);
275 Vector<Element*> ancestors; local
308 Vector<Element*> ancestors; local
[all...] |
| BreakBlockquoteCommand.cpp | 132 // Build up list of ancestors in between the start node and the top blockquote.
133 Vector<Element*> ancestors; local
135 ancestors.append(node);
141 // Clone startNode's ancestors into the cloned blockquote.
143 // that was cloned (i.e. the clone of either ancestors.last()
144 // or clonedBlockquote if ancestors is empty).
146 for (size_t i = ancestors.size(); i != 0; --i) {
147 RefPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren();
150 Node* listChildNode = i > 1 ? ancestors[i - 2] : startNode;
172 if (!ancestors.isEmpty())
[all...] |
| CompositeEditCommand.cpp | 754 Vector<RefPtr<Node> > ancestors; local
758 ancestors.append(n);
762 for (size_t i = ancestors.size(); i != 0; --i) {
763 Node* item = ancestors[i - 1].get();
[all...] |
| /dalvik/libcore/prefs/src/main/java/java/util/prefs/ |
| XMLParser.java | 196 StringTokenizer ancestors = new StringTokenizer(prefs.absolutePath(), local
198 exportNode(ancestors, prefs, withSubTree, out);
206 private static void exportNode(StringTokenizer ancestors,
209 if (ancestors.hasMoreTokens()) {
210 String name = ancestors.nextToken();
213 if (ancestors.hasMoreTokens()) {
215 exportNode(ancestors, prefs, withSubTree, out);
|
| /external/webkit/WebCore/dom/ |
| Node.cpp | 1130 // newChild node, or if the node to append is one of this node's ancestors.
2682 Vector<RefPtr<ContainerNode> > ancestors; local
[all...] |
| Node.h | 208 // Node ancestors when concerned about event flow
209 void eventAncestors(Vector<RefPtr<ContainerNode> > &ancestors);
|
| /external/webkit/WebCore/inspector/ |
| InspectorDOMAgent.cpp | 380 // The Node's Event Ancestors (not including self)
381 Vector<RefPtr<ContainerNode> > ancestors; local
382 node->eventAncestors(ancestors);
386 for (size_t i = ancestors.size(); i; --i) {
387 ContainerNode* ancestor = ancestors[i - 1].get();
|
| /external/webkit/WebCore/inspector/front-end/ |
| treeoutline.js | 291 // 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);
|
| /dalvik/libcore/xml/src/main/java/org/apache/xalan/templates/ |
| ElemNumber.java | 173 * 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 = local
822 int lastIndex = ancestors.size() - 1;
830 int target = ancestors.elementAt(i);
965 * Get the ancestors, up to the root, that match th
982 NodeSetDTM ancestors = new NodeSetDTM(xctxt.getDTMManager()); local
[all...] |
| /external/webkit/SunSpider/tests/parse-only/ |
| prototype-1.6.0.3.js | [all...] |
| concat-jquery-mootools-prototype.js | [all...] |
