| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 516 /// subtree - Access the i'th subtree reference in a branch node.
519 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
685 // The key array in a branch node holds the rightmost stop key of each subtree.
689 // It is unusual for a branch node to only have one subtree, but it can happen
702 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
705 NodeRef &subtree(unsigned i) { return this->first[i]; }
707 /// findFrom - Find the first subtree after i that may contain x.
712 /// This is the first subtree that can possibly contain x.
721 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /external/swiftshader/ |
| README.md | 46 [subzero](third_party/subzero/) contains a fork of the [Subzero](https://chromium.googlesource.com/native_client/pnacl-subzero/) project. It is part of Google Chrome's (Portable) [Native Client](https://developer.chrome.com/native-client) project. Its authoritative source is at [https://chromium.googlesource.com/native_client/pnacl-subzero/](https://chromium.googlesource.com/native_client/pnacl-subzero/). The fork was made using [git-subtree](https://github.com/git/git/blob/master/contrib/subtree/git-subtree.txt) to include all of Subzero's history, and until further notice it should **not** diverge from the upstream project. Contributions must be tested using the [README](third_party/subzero/docs/README.rst) instructions, reviewed at [https://chromium-review.googlesource.com](https://chromium-review.googlesource.com/q/project:native_client%252Fpnacl-subzero), and then pulled into the SwiftShader repository.
|
| /libcore/ojluni/src/main/java/sun/security/x509/ |
| OtherName.java | 231 * naming subtree)
233 * naming subtree)
258 * Return subtree depth of this name for purposes of determining
|
| DNSName.java | 169 * <li>NAME_NARROWS = 1: input name narrows name (is lower in the naming subtree)
170 * <li>NAME_WIDENS = 2: input name widens name (is higher in the naming subtree)
227 * Return subtree depth of this name for purposes of determining
235 // subtree depth is always at least 1
|
| /art/test/utils/python/testgen/ |
| utils.py | 63 A generator that yields a tuple containing a possible arrangement of subtree
|
| /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/brotli/c/enc/ |
| hash_to_binary_tree_inc.h | 128 /* The forest index of the rightmost node of the left subtree of the new
131 /* The forest index of the leftmost node of the right subtree of the new
134 /* The match length of the rightmost node of the left subtree of the new
137 /* The match length of the leftmost node of the right subtree of the new
|
| /external/libxml2/os400/libxmlrpg/ |
| xmlsave.rpgle | 2 * Description: API to save document or subtree of document
|
| /external/ltp/testcases/kernel/syscalls/mount/ |
| mount05.c | 22 * "Perform a bind mount, making a file or a directory subtree visible
|
| /external/v8/src/compiler/ |
| state-values-utils.cc | 209 // Otherwise, add the values to a subtree and add that as an input.
210 Node* subtree = BuildTree(values_idx, values, count, liveness, local
212 (*node_buffer)[node_count++] = subtree;
220 // only happen if we built a single subtree (as nodes with values are always
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| AbstractTask.java | 35 * of the input associated with the subtree rooted at this task.
103 * The spliterator for the portion of the input associated with the subtree
148 * @param spliterator {@code Spliterator} describing the subtree rooted at
164 * @param spliterator {@code Spliterator} describing the subtree rooted at
|
| /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.
|
