| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| InsertionPoint.cpp | 161 // Since this insertion point is no longer visible from the shadow subtree, it need to clean itself up.
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderObjectChildList.cpp | 107 // rendererRemovedFromTree walks the whole subtree. We can improve performance
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/ |
| DependencyGraphBuilder.cpp | 123 // After traversing the left subtree of this assignment, we should have found a real
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| bintree.py | 126 # find replacment node: smallest key in right-subtree
|
| walker.py | 111 # find smallest node of right subtree
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| inttree.c | 393 while(y->left != it->nil) /* returns the minium of the right subtree of x */
427 while(y->right != it->nil) /* returns the maximum of the left subtree of x */
785 * again at the first left child and find an overlap in the left subtree
786 * of the left child of root we must recursively check the right subtree
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| expression-trees.js | 46 // Adjoin every possible left and right subtree.
|
| /external/clang/tools/scan-build/ |
| set-xcode-analyzer | 102 # of the Xcode.app subtree.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 93 // So we know now that the edge is not already in a subtree, so we push
|
| /external/stressapptest/src/ |
| error_diag.h | 39 // Atomically find arbitrary device in subtree.
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 46 // Adjoin every possible left and right subtree.
|
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| InnerNodeImpl.java | 152 * Normalize the text nodes within this subtree. Although named similarly,
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| Entity.java | 40 * <code>Entity</code> node subtree is <code>null</code>. The same is true
|
| Document.java | 228 * and the resulting nodes reassembled to form the corresponding subtree.
237 * <code>DocumentFragment</code> to form the corresponding subtree.
254 * corresponding subtree.</dd>
264 * the resulting nodes reassembled to form the corresponding subtree.</dd>
296 * @param deep If <code>true</code>, recursively import the subtree under
[all...] |
| /packages/inputmethods/PinyinIME/jni/include/ |
| dictbuilder.h | 131 // Construct a subtree using a subset of the spelling array (from
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| ftw.h | 96 subtree, instead just continue with its next
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/ |
| ftw.h | 96 subtree, instead just continue with its next
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/ |
| ftw.h | 96 subtree, instead just continue with its next
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 56 /// Return a pointer to the left subtree. This value
57 /// is NULL if there is no left subtree.
60 /// Return a pointer to the right subtree. This value is
61 /// NULL if there is no right subtree.
71 /// find - Finds the subtree associated with the specified key value.
72 /// This method returns NULL if no matching subtree is found.
87 /// getMaxElement - Find the subtree associated with the highest ranged
165 /// contains - Returns true if this tree contains a subtree (node) that
171 /// object (specifed by Callback) for every node/subtree in the tree.
253 /// isMutable - Returns true if the left and right subtree reference
[all...] |
| /external/iproute2/man/man7/ |
| tc-hfsc.7 | 299 R arbitrates between left subtree (A) and right (B). Assume that A2 and B are
305 subtree gets 3mbit, but its children would want (at the point when A1 became
309 In the left subtree \- we have the same situation as previously (fair split
313 violated fairness in the A subtree and set A2's service curve to 0, A1 would
532 capacity. Or - in special cases, such as testing (limit certain subtree to some
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 57 * tree. You can wrap a DOM2DTM around a specific node and its subtree
84 /** The top of the subtree.
93 /** true if ALL the nodes in the m_root subtree have been processed;
709 // we decided to allow wrapping a DTM around a subtree.
895 * Retrieve the text content of a DOM subtree, appending it into a
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.cpp | [all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| tree.py | 395 Given the root of the subtree created for this rule, post process
503 Get the token start index for this subtree; return -1 if no such index
511 Get the token stop index for this subtree; return -1 if no such index
1005 # ensure new subtree root has parent/child index set
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_merge.c | 1076 /* insert into the left subtree */
1109 /* insert into the right subtree */
1162 /* remove from the left subtree */
1198 /* remove from the right subtree */
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| CanvasViewInfo.java | 1163 CanvasViewInfo subtree = createSubtree(parent, viewInfo, parentX, parentY); local
[all...] |
