/external/chromium_org/ui/views/corewm/ |
transient_window_stacking_client.cc | 16 // Populates |ancestors| with all transient ancestors of |window| that are 17 // siblings of |window|. Returns true if any ancestors were found, false if not. 18 bool GetAllTransientAncestors(Window* window, Window::Windows* ancestors) { 22 ancestors->push_back(window); 24 return (!ancestors->empty()); 27 // Replaces |window1| and |window2| with their possible transient ancestors that 29 // are not modified if such ancestors cannot be found. 35 // Assemble chains of ancestors of both windows. 75 // For windows that have transient children stack the transient ancestors tha [all...] |
/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 Vector<RefPtr<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 RefPtr<Element> clonedChild = ancestors[i - 1]->cloneElementWithoutChildren(); 148 Node* listChildNode = i > 1 ? ancestors[i - 2].get() : startNode; 163 if (!ancestors.isEmpty()) [all...] |
InsertParagraphSeparatorCommand.h | 49 void getAncestorsInsideBlock(const Node* insertionNode, Element* outerBlock, Vector<RefPtr<Element> >& ancestors); 50 PassRefPtr<Element> cloneHierarchyUnderNewBlock(const Vector<RefPtr<Element> >& ancestors, PassRefPtr<Element> blockToInsert);
|
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(); 251 Vector<RefPtr<Element> > ancestors; local 252 getAncestorsInsideBlock(positionOutsideTabSpan(insertionPosition).deprecatedNode(), startBlock.get(), ancestors); local 296 Vector<RefPtr<Element> > ancestors; local 297 getAncestorsInsideBlock(positionAvoidingSpecialElementBoundary(positionOutsideTabSpan(insertionPosition)).deprecatedNode(), startBlock.get(), ancestors); local [all...] |
markup.cpp | 385 // If we didn't insert open tag and there's no more siblings or we're at the end of the traversal, take care of ancestors. 388 // Close up the ancestors. 393 // Not at the end of the range, close ancestors up to sibling of next node. 400 // Surround the currently accumulated markup with markup for ancestors we never opened as we leave the subtree(s) rooted at those ancestors. 405 // All ancestors that aren't in the ancestorsToClose list should either be a) unrendered: 408 // or b) ancestors that we never encountered during a pre-order traversal starting at startNode: 504 // Include ancestors that aren't completely inside the range but are required to retain 587 // Also include all of the ancestors of lastClosed up to this special ancestor. 609 // Since this node and all the other ancestors are not in the selection we want to set RangeFullySelectsNode to DoesNotFullySelectNod [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/apache-xml/src/main/java/org/apache/xml/utils/ |
NSInfo.java | 102 /** Constant for ancestors XMLNS atributes not processed */ 108 /** Constant indicating ancestors don't have an XMLNS attribute */
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
Tree.as | 30 /** Return a list of all ancestors of this node. The first node of 33 function get ancestors():Array;
|
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/apache-xml/src/main/java/org/apache/xml/dtm/ |
Axis.java | 34 * The ancestor axis contains the ancestors of the context node; 35 * the ancestors of the context node consist of the parent of context 42 * the ancestor-or-self axis contains the context node and the ancestors of 105 * ancestors and excluding attribute nodes and namespace nodes
|
/external/chromium_org/third_party/WebKit/Source/modules/indexeddb/ |
IDBEventDispatcher.h | 42 static bool dispatch(Event*, Vector<RefPtr<EventTarget> >&); // The target first and then its ancestors in order of how the event bubbles.
|
/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/chromium_org/ui/accessibility/ |
ax_tree_serializer.h | 114 // This just walks up the ancestors of |node| until it finds a node that's 189 std::vector<const AXSourceNode*> ancestors; 191 ancestors.push_back(node); 205 int source_index = static_cast<int>(ancestors.size() - 1); 208 if (tree_->GetId(ancestors[source_index]) != 212 lca = ancestors[source_index];
|
/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;
|
/frameworks/base/core/java/com/android/internal/view/menu/ |
ContextMenuBuilder.java | 68 * ancestors) to add items.
|
/external/chromium_org/ash/wm/ |
solo_window_tracker.cc | 43 // Returns true if |child| and all of its ancestors are visible and neither 44 // |child| nor any its ancestors is animating hidden.
|
/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
hc_nodeinsertbeforenodeancestor.java | 33 * inserted is one of this nodes ancestors. 36 * node that is one of its ancestors(root node). An
|
nodeinsertbeforenodeancestor.java | 33 * inserted is one of this nodes ancestors. 36 * node that is one of its ancestors(root node). An
|
/packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
HierarchicalFolderSelectorAdapter.java | 78 * 3) If there is > 1 but < 3 ancestors, return ancestor/ancestor2/folder 79 * 4) If there are > 3 ancestors, return the top most ancestor, and direct parent
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
brw_vec4.h | 83 * easier to just ralloc_free 'ctx' (or any of its ancestors). */ 121 * easier to just ralloc_free 'ctx' (or any of its ancestors). */ 150 * easier to just ralloc_free 'ctx' (or any of its ancestors). */
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
brw_vec4.h | 83 * easier to just ralloc_free 'ctx' (or any of its ancestors). */ 121 * easier to just ralloc_free 'ctx' (or any of its ancestors). */ 150 * easier to just ralloc_free 'ctx' (or any of its ancestors). */
|
/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/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRBaseTree.m | 429 /** Return a list of all ancestors of this node. The first node of 436 AMutableArray *ancestors = [AMutableArray arrayWithCapacity:5]; 440 [ancestors insertObject:t atIndex:0]; // insert at start 443 return ancestors;
|
/external/chromium/chrome/browser/resources/shared/js/cr/ui/ |
menu.js | 37 * Walks up the ancestors until a menu item belonging to this menu is found.
|