HomeSort by relevance Sort by last modified time
    Searched defs:ancestors (Results 1 - 14 of 14) sorted by null

  /external/chromium_org/third_party/WebKit/Source/core/css/
SelectorFilter.cpp 95 Vector<Element*, 30> ancestors; local
97 ancestors.append(ancestor);
98 for (size_t n = ancestors.size(); n; --n)
99 pushParentStackFrame(ancestors[n - 1]);
142 // Only collect identifiers that match ancestors.
  /external/chromium_org/third_party/WebKit/Source/core/editing/
BreakBlockquoteCommand.cpp 129 // Build up list of ancestors in between the start node and the top blockquote.
130 Vector<RefPtr<Element> > ancestors; local
132 ancestors.append(node);
138 // Clone startNode's ancestors into the cloned blockquote.
140 // that was cloned (i.e. the clone of either ancestors.last()
141 // or clonedBlockquote if ancestors is empty).
143 for (size_t i = ancestors.size(); i != 0; --i) {
144 RefPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren();
147 Node* listChildNode = i > 1 ? ancestors[i - 2].get() : startNode;
162 if (!ancestors.isEmpty())
    [all...]
InsertParagraphSeparatorCommand.cpp 122 void InsertParagraphSeparatorCommand::getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<RefPtr<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<RefPtr<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();
242 Vector<RefPtr<Element> > ancestors; local
243 getAncestorsInsideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock.get(), ancestors); local
281 Vector<RefPtr<Element> > ancestors; local
282 getAncestorsInsideBlock(positionAvoidingSpecialElementBoundary(positionOutsideTabSpan(insertionPosition)).deprecatedNode(), startBlock.get(), ancestors); local
    [all...]
CompositeEditCommand.cpp 992 Vector<RefPtr<Node> > ancestors; local
    [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/chromium_org/third_party/WebKit/Source/core/dom/
Range.cpp 876 Vector<RefPtr<Node> > ancestors; local
878 ancestors.append(n);
881 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/chromium_org/third_party/WebKit/Source/core/inspector/
InspectorDOMAgent.cpp 870 // The Node's Ancestors including self.
871 Vector<Node*> ancestors; local
873 ancestors.append(node);
876 ancestors.append(ancestor);
880 for (size_t i = ancestors.size(); i; --i) {
881 Node* ancestor = ancestors[i - 1];
    [all...]
  /libcore/benchmarks/libs/
caliper.jar 
  /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/
xalan-2.6.0.jar 
  /external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
compiler.jar 
  /external/antlr/antlr-3.4/lib/
antlr-3.4-complete.jar 
  /prebuilts/misc/common/antlr/
antlr-3.4-complete.jar 

Completed in 178 milliseconds