| /external/webkit/Source/WebCore/editing/ |
| BreakBlockquoteCommand.cpp | 128 // 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.isEmpty())
[all...] |
| 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();
241 Vector<Element*> ancestors; local
242 getAncestorsInsideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock, ancestors);
275 Vector<Element*> ancestors; local
[all...] |
| CompositeEditCommand.cpp | 785 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();
[all...] |
| /libcore/luni/src/main/java/java/util/prefs/ |
| XMLParser.java | 168 StringTokenizer ancestors = new StringTokenizer(prefs.absolutePath(), "/"); local
169 exportNode(ancestors, prefs, withSubTree, out);
177 private static void exportNode(StringTokenizer ancestors,
180 if (ancestors.hasMoreTokens()) {
181 String name = ancestors.nextToken();
183 if (ancestors.hasMoreTokens()) {
185 exportNode(ancestors, prefs, withSubTree, out);
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| tree.rb | 215 [ancestors] the list of successive parents from a tree node to the root node
277 def ancestors method in class:ANTLR3.AST
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| Range.cpp | 863 Vector<RefPtr<Node> > ancestors; local
865 ancestors.append(n);
868 for (Vector<RefPtr<Node> >::const_iterator it = ancestors.begin(); it != ancestors.end(); it++) {
[all...] |
| /external/apache-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/Source/WebCore/css/ |
| CSSStyleSelector.cpp | 657 Vector<Element*, 30> ancestors; local
659 ancestors.append(ancestor);
660 int count = ancestors.size();
662 pushParentStackFrame(ancestors[n]);
[all...] |
| /tools/motodev/src/plugins/preflighting.core/apktool/ |
| apktool.jar | |
| /external/antlr/antlr-3.4/lib/ |
| antlr-3.4-complete.jar | |
| /prebuilts/misc/common/antlr/ |
| antlr-3.4-complete.jar | |
