/external/chromium_org/third_party/WebKit/Source/platform/ |
PODRedBlackTree.h | 308 // is used to compute the maximum endpoint of the subtree below the 423 // Left-rotates the subtree rooted at x. 424 // Returns the new root of the subtree (x's right child). 430 // Turn y's left subtree into x's right subtree. 456 // Right-rotates the subtree rooted at y. 457 // Returns the new root of the subtree (y's left child). 463 // Turn x's right subtree into y's left subtree. 706 // Visits the subtree rooted at the given node in order [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3rewritestreams.c | 370 // Subtree rewrite stream 386 // Install the subtree based overrides 408 // Install the subtree based overrides 431 // Install the subtree based overrides 564 /// Return a duplicate node/subtree if stream is out of elements and 619 /// a tree node or subtree. Deal with the optimization of single- 678 /// subtree. Dup'ing a token means just creating another AST node 692 /// subtree. Dup'ing a token means just creating another AST node 706 /// subtree. Dup'ing a token means just creating another AST node 778 /// Treat next element as a single node even if it's a subtree [all...] |
/external/llvm/include/llvm/ADT/ |
IntervalMap.h | 513 /// subtree - Access the i'th subtree reference in a branch node. 516 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 683 // The key array in a branch node holds the rightmost stop key of each subtree. 687 // It is unusual for a branch node to only have one subtree, but it can happen 700 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 703 NodeRef &subtree(unsigned i) { return this->first[i]; } 705 /// findFrom - Find the first subtree after i that may contain x. 710 /// This is the first subtree that can possibly contain x. 719 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/external/chromium_org/third_party/WebKit/Tools/GardeningServer/scripts/ |
base.js | 112 function walkSubtree(subtree, directory) 114 for (var childName in subtree) { 115 var child = subtree[childName];
|
/external/apache-xml/src/main/java/org/apache/xalan/extensions/ |
ExpressionVisitor.java | 60 * @return true to continue the visit in the subtree, if any.
|
/external/chromium-trace/trace-viewer/src/tcmalloc/ |
heap.js | 64 // each subtree is the total memory for that tree.
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
find_util.js | 40 // We may have been sync'ed into a subtree of the current predicate match.
|
/external/chromium_org/third_party/WebKit/PerformanceTests/ |
Skipped | 27 Layout/subtree-detaching.html
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
ChildFrameDisconnector.cpp | 56 // Must disable frame loading in the subtree so an unload handler cannot
|
MutationObserver.h | 72 Subtree = 1 << 3,
|
MutationObserverRegistration.h | 56 bool isSubtree() const { return m_options & MutationObserver::Subtree; }
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
SubtreeLayoutScope.h | 36 // This is the way to mark a subtree as needing layout during layout,
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
SVGGElement.cpp | 73 // subtree may be hidden - we only want the resource renderers to exist so they can be
|
SVGUseElement.cpp | 384 // Clone the target subtree into the shadow tree, not handling <use> and <symbol> yet. 534 static inline void removeDisallowedElementsFromSubtree(Element& subtree) 536 ASSERT(!subtree.inDocument()); 537 Element* element = ElementTraversal::firstWithin(subtree); 540 Element* next = ElementTraversal::nextSkippingChildren(*element, &subtree); 541 // The subtree is not in document so this won't generate events that could mutate the tree. 545 element = ElementTraversal::next(*element, &subtree); 596 // Though if there are disallowed elements in the subtree, we have to remove them. 649 // Though if there are disallowed elements in the subtree, we have to remove them.
|
/development/tools/elftree/ |
elftree.c | 259 " -S Duplicate entire subtree when a duplicate is found\n" 260 " -P Show duplicates, but only include subtree once\n"
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
TreeParser.as | 88 input.consume(); // not subtree, consume 1 node and return 91 // current node is a subtree, skip to corresponding UP.
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreeFilter.cs | 43 subtree in our original tree? In what order should we visit nodes? 67 apply them to a particular subtree. The final piece of the tree
|
TreePatternParser.cs | 76 object subtree = ParseTree(); 77 adaptor.AddChild(root, subtree);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
TreePatternParser.cs | 88 object subtree = ParseTree(); 89 adaptor.AddChild( root, subtree );
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
TreeFilter.java | 39 subtree in our original tree? In what order should we visit nodes? 63 apply them to a particular subtree. The final piece of the tree
|
TreePatternParser.java | 75 Object subtree = parseTree(); local 76 adaptor.addChild(root, subtree);
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
TreeParser.js | 58 this.input.consume(); // not subtree, consume 1 node and return 61 // current node is a subtree, skip to corresponding UP.
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRTreeParser.m | 125 [input consume]; // not subtree, consume 1 node and return 128 // current node is a subtree, skip to corresponding UP.
|
ANTLRTreePatternParser.m | 113 id<ANTLRBaseTree> subtree = [self parseTree]; 114 [adaptor addChild:subtree toTree:root];
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
AVTPartXPath.java | 61 * the current subtree. 63 * @return true if traversal outside the context node's subtree can occur.
|