| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| BreakBlockquoteCommand.cpp | 130 // Build up list of ancestors in between the start node and the top blockquote.
131 WillBeHeapVector<RefPtrWillBeMember<Element> > ancestors; local
133 ancestors.append(node);
139 // Clone startNode's ancestors into the cloned blockquote.
141 // that was cloned (i.e. the clone of either ancestors.last()
142 // or clonedBlockquote if ancestors is empty).
144 for (size_t i = ancestors.size(); i != 0; --i) {
145 RefPtrWillBeRawPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren();
148 Node* listChildNode = i > 1 ? ancestors[i - 2].get() : startNode;
163 if (!ancestors.isEmpty())
[all...] |
| InsertParagraphSeparatorCommand.h | 51 void getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, WillBeHeapVector<RefPtrWillBeMember<Element> >& ancestors);
52 PassRefPtrWillBeRawPtr<Element> cloneHierarchyUnderNewBlock(const WillBeHeapVector<RefPtrWillBeMember<Element> >& ancestors, PassRefPtrWillBeRawPtr<Element> blockToInsert);
|
| InsertParagraphSeparatorCommand.cpp | 122 void InsertParagraphSeparatorCommand::getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, WillBeHeapVector<RefPtrWillBeMember<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 PassRefPtrWillBeRawPtr<Element> InsertParagraphSeparatorCommand::cloneHierarchyUnderNewBlock(const WillBeHeapVector<RefPtrWillBeMember<Element> >& ancestors, PassRefPtrWillBeRawPtr<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 RefPtrWillBeRawPtr<Element> child = ancestors[i - 1]->cloneElementWithoutChildren();
251 WillBeHeapVector<RefPtrWillBeMember<Element> > ancestors; local
252 getAncestorsInsideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock.get(), ancestors); local
296 WillBeHeapVector<RefPtrWillBeMember<Element> > ancestors; local
297 getAncestorsInsideBlock(positionAvoidingSpecialElementBoundary(positionOutsideTabSpan(insertionPosition)).deprecatedNode(), startBlock.get(), ancestors); local
[all...] |
| CompositeEditCommand.cpp | 996 WillBeHeapVector<RefPtrWillBeMember<Node> > ancestors; local
[all...] |
| /external/chromium_org/ui/wm/core/ |
| transient_window_stacking_client.cc | 18 // Populates |ancestors| with all transient ancestors of |window| that are
19 // siblings of |window|. Returns true if any ancestors were found, false if not.
20 bool GetAllTransientAncestors(Window* window, Window::Windows* ancestors) {
24 ancestors->push_back(window);
26 return (!ancestors->empty());
29 // Replaces |window1| and |window2| with their possible transient ancestors that
31 // are not modified if such ancestors cannot be found.
37 // Assemble chains of ancestors of both windows.
102 // For windows that have transient children stack the transient ancestors tha
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SelectorFilter.cpp | 94 Vector<Element*, 30> ancestors; local
96 ancestors.append(ancestor);
97 for (size_t n = ancestors.size(); n; --n)
98 pushParentStackFrame(*ancestors[n - 1]);
141 // Only collect identifiers that match ancestors.
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| description_util.js | 41 * @param {Array.<Node>=} opt_changedAncestors The changed ancestors that will
43 * ancestors used to determine what needs to be spoken will just be the control
49 var ancestors = [control];
51 ancestors = opt_changedAncestors;
55 ancestors = [surroundingControl, control];
60 ancestors, true, cvox.VERBOSITY_VERBOSE);
91 * ancestor nodes. The ancestors are in order from the highest in the
177 * ancestor nodes. The ancestors are in order from the highest in the
210 var ancestors = cvox.DomUtil.getUniqueAncestors(prevNode, node, true);
212 ancestors, recursive, verbosity)
[all...] |
| dom_util.js | 696 var ancestors = cvox.DomUtil.getAncestors(node);
698 var firstListitem = cvox.DomPredicates.listItemPredicate(ancestors);
[all...] |
| braille_util.js | 219 var ancestors = cvox.DomUtil.getUniqueAncestors(prev, node);
220 for (var i = 0, container; container = ancestors[i]; i++) {
|
| /external/chromium_org/third_party/WebKit/Source/bindings/scripts/ |
| compute_interfaces_info_overall.py | 58 'ancestors': all ancestor interfaces
141 """Compute inheritance information, namely ancestors and inherited extended attributes."""
147 ancestors = list(generate_ancestors(interface_name))
149 for ancestor in ancestors:
150 # Ancestors may not be present, notably if an ancestor is a generated
157 'ancestors': ancestors,
|
| idl_types.py | 78 ancestors = defaultdict(list) # interface_name -> ancestors variable
82 ancestor_name in ancestors[interface_name])
86 ancestors.update(new_ancestors)
|
| /external/chromium_org/ui/accessibility/ |
| ax_tree_serializer.h | 118 // This just walks up the ancestors of |node| until it finds a node that's
196 std::vector<AXSourceNode> ancestors;
198 ancestors.push_back(node);
212 int source_index = static_cast<int>(ancestors.size() - 1);
215 if (tree_->GetId(ancestors[source_index]) !=
219 lca = ancestors[source_index];
|
| /external/lldb/source/Plugins/SymbolFile/DWARF/ |
| DWARFDebugInfo.cpp | 461 ancestors()
469 std::vector<DWARFDebugInfoEntry> ancestors; member in struct:DumpInfo
519 const uint32_t num_ancestors = dumpInfo->ancestors.size();
524 dumpInfo->ancestors[i].Dump(dwarf2Data, cu, *s, 0);
556 dumpInfo->ancestors.back() = *die;
564 dumpInfo->ancestors.pop_back();
576 dumpInfo->ancestors.push_back(null_die);
599 dumpInfo->ancestors.clear();
600 dumpInfo->ancestors.resize(1);
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/ |
| table_shifter.js | 146 var ancestors = cvox.DomUtil.getAncestors(sel.start.node);
147 if (cvox.DomPredicates.tablePredicate(ancestors) &&
148 !cvox.DomPredicates.captionPredicate(ancestors)) {
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| BaseTree.as | 279 /** Return a list of all ancestors of this node. The first node of
282 public function get ancestors():Array {
284 var ancestors:Array = new Array();
288 ancestors.unshift(t); // insert at start
291 return ancestors;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| BaseTree.java | 326 /** Return a list of all ancestors of this node. The first node of
331 List ancestors = new ArrayList();
335 ancestors.add(0, t); // insert at start
338 return ancestors;
|
| /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/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| BaseTree.cs | 396 * Return a list of all ancestors of this node. The first node of
404 List<ITree> ancestors = new List<ITree>();
408 ancestors.Insert(0, t); // insert at start
411 return ancestors;
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| BaseTree.cs | 475 * Return a list of all ancestors of this node. The first node of
484 List<ITree> ancestors = new List<ITree>();
489 ancestors.Insert( 0, t ); // insert at start
492 return ancestors;
|
| /external/chromium_org/tools/code_coverage/ |
| croc.py | 580 ancestors = [parent]
588 ancestors.append(parent)
593 for a in ancestors:
|
| /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/devtools/front_end/ui/ |
| treeoutline.js | 299 var ancestors = [];
301 ancestors.push(currentObject);
310 for (var i = ancestors.length - 1; i >= 0; --i) {
311 var treeElement = this.getCachedTreeElement(ancestors[i]);
|
| /external/chromium_org/third_party/webtreemap/src/ |
| webtreemap.js | 29 // Hide all visible siblings of all our ancestors by lowering them.
42 // Unhide (raise) and maximize us and our ancestors.
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| Range.cpp | 753 NodeVector ancestors; local
755 ancestors.append(n);
758 for (NodeVector::const_iterator it = ancestors.begin(); it != ancestors.end(); ++it) {
[all...] |
| /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...] |
