| /libcore/ojluni/src/main/java/java/util/stream/ |
| ForEachOps.java | 426 * Completion of left-predecessor, or left subtree,
428 * right subtree.
436 // leaf node of right subtree
501 // of right subtree (if any, which can be this task's right sibling)
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Tooling/ |
| RefactoringCallbacks.h | 13 // subtree match on the AST and then replace the corresponding source code
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Tooling/ |
| RefactoringCallbacks.h | 13 // subtree match on the AST and then replace the corresponding source code
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 317 // Skip predecessors whose level is above the subtree we are processing.
713 // It should be possible to rotate the subtree instead of recalculating
792 // Succ dominated by subtree From -- not affected.
795 DEBUG(dbgs() << "\t\tDominated by subtree From\n");
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 364 // If the parent occured before the subtree root, then
369 // Otherwise, it could be a descendant below the subtree root
370 // children, or it could be after the subtree root. So we have
371 // to climb up until the parent is less than the subtree root, in
372 // which case we return NULL, or until it is equal to the subtree
610 * Get the subtree root identity from the handle that was passed in by
615 * @return identity of the root of the subtree.
630 * @param subtreeRootIdentity The root context of the subtree in question.
792 * Implements traversal of the entire subtree, including the root node.
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| Axis.java | 120 * A non-xpath axis, traversing the subtree including the subtree
|
| /external/boringssl/src/crypto/x509/ |
| x509_txt.c | 162 return ("permitted subtree violation");
164 return ("excluded subtree violation");
|
| /external/jemalloc/test/unit/ |
| rb.c | 99 /* Left subtree. */
105 /* Right subtree. */
|
| /external/ltp/testcases/kernel/fs/fs_bind/ |
| README | 2 Test Suite for Bind Mount and Shared Subtree Features in the VFS:
10 These tests exercise the Linux Kernel's bind mount and shared subtree
|
| /external/toolchain-utils/ |
| verify_compiler.py | 164 'in subtree. Must be used with --root_dir '
169 help='Root of subtree in which to look for '
|
| /external/v8/src/ |
| splay-tree-inl.h | 96 // the left subtree.
120 // the right subtree.
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| Archive.h | 154 /// subtree of this archive member
156 /// the subtree of this archive member
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/glslang/glslang/MachineIndependent/ |
| IntermTraverse.cpp | 47 // but their subtree will still be traversed.
48 // Nodes with children can have their whole subtree skipped
|
| /external/libxml2/doc/ |
| library.html | 71 xmlNodePtr tree, subtree;
78 subtree = xmlNewChild(tree, NULL, "title", "Welcome to Gnome");
80 subtree = xmlNewChild(tree, NULL, "title", "The Linux adventure");
81 subtree = xmlNewChild(tree, NULL, "p", "bla bla bla ...");
82 subtree = xmlNewChild(tree, NULL, "image", NULL);
83 xmlSetProp(subtree, "href", "linus.gif");</pre><p>Not really rocket science ...</p><h3><a name="Traversing" id="Traversing">Traversing the tree</a></h3><p>Basically by <a href="html/libxml-tree.html">including "tree.h"</a> your
|
| xmlreader.html | 406 need to have their subtree expanded for validation. In practice it means
444 reader has an Expand() operation allowing to grow the subtree under the
447 full subtree available. Usual operations like XPath queries can be used on
457 node = reader.Expand() # expand the subtree
460 if reader.Next() != 1: # skip the subtree
465 affects the Read() ones, however usually once processed the full subtree is
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/ |
| pointer.h | 372 //! Create a value in a subtree.
382 \param root Root value of a DOM subtree to be resolved. It can be any value other than document root.
452 //! Query a value in a subtree.
482 //! Query a const value in a const subtree.
494 //! Query a value in a subtree with default value.
510 //! Query a value in a subtree with default null-terminated string.
518 //! Query a value in a subtree with default std::basic_string.
526 //! Query a value in a subtree with default primitive value.
571 //! Set a value in a subtree, with move semantics.
585 //! Set a value in a subtree, with copy semantics
[all...] |
| /external/valgrind/coregrind/ |
| m_oset.c | 468 // Insert into the left subtree.
470 // Only need to set the used fields in the subtree.
500 // Insert into the right subtree
502 // Only need to set the used fields in the subtree.
656 // Remove from the left subtree
658 // Only need to set the used fields in the subtree.
690 // Remove from the right subtree
693 // Only need to set the used fields in the subtree.
751 // Remove from the left subtree
755 // Remove from the right subtree
[all...] |
| m_wordfm.c | 68 struct _AvlNode* child[2]; /* [0] is left subtree, [1] is right */
185 /* insert into the left subtree */
218 /* insert into the right subtree */
274 /* remove from the left subtree */
310 /* remove from the right subtree */
374 /* remove from the left subtree */
378 /* remove from the right subtree */
|
