| /external/valgrind/main/coregrind/m_demangle/ |
| demangle.h | 214 right (a component type with only one subtree puts it in the left
215 subtree). */
221 /* A qualified name. The left subtree is a class or namespace or
222 some such thing, and the right subtree is a name qualified by
225 /* A local name. The left subtree describes a function, and the
226 right subtree is a name which is local to that function. */
228 /* A typed name. The left subtree is a name, and the right subtree
231 /* A template. The left subtree is a template name, and the right
232 subtree is a template argument list. *
[all...] |
| /external/gcc-demangle/ |
| demangle.h | 204 right (a component type with only one subtree puts it in the left
205 subtree). */
211 /* A qualified name. The left subtree is a class or namespace or
212 some such thing, and the right subtree is a name qualified by
215 /* A local name. The left subtree describes a function, and the
216 right subtree is a name which is local to that function. */
218 /* A typed name. The left subtree is a name, and the right subtree
221 /* A template. The left subtree is a template name, and the right
222 subtree is a template argument list. *
[all...] |
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second));
39 // NR is the subtree containing our left sibling.
40 NodeRef NR = path[l].subtree(path[l].offset - 1);
44 NR = NR.subtree(NR.size() - 1);
63 // NR is the subtree containing our left sibling.
65 NodeRef NR = subtree(l);
67 // Get the rightmost node in the subtree.
70 NR = NR.subtree(NR.size() - 1);
89 // NR is the subtree containing our right sibling.
90 NodeRef NR = path[l].subtree(path[l].offset + 1)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| BstBalancePolicy.java | 33 * the same inorder traversal order as the subtree {@code left}, then the entry {@code source},
34 * then the subtree {@code right}.
40 * guaranteed that the resulting tree will have the same inorder traversal order as the subtree
41 * {@code left}, then the subtree {@code right}.
|
| BstMutationResult.java | 43 * @param originalRoot The root of the subtree that was modified.
44 * @param changedRoot The root of the subtree, after the modification and any rebalancing.
79 * Returns the root of the subtree that was modified.
87 * Returns the root of the subtree, after the modification and any rebalancing was performed.
95 * Returns the entry in the original subtree with key {@code targetKey}, if any. This should not
96 * be treated as a subtree, but only as an entry, and no guarantees are made about its children
97 * when viewed as a subtree.
106 * treated as a subtree, but only as an entry, and no guarantees are made about its children when
107 * viewed as a subtree.
119 * If this mutation was to an immediate child subtree of the specified root on the specifie
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDFS.h | 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
76 /// is the root of a subtree. Later it is set to its parent to indicate an
77 /// interior node. Finally, it is set to a representative subtree ID during
86 /// \brief Per-Subtree data computed during DFS.
110 // For each subtree discovered during DFS, record its connections to other
114 /// Cache the current connection level of each subtree.
146 /// \brief Get the number of instructions in the given subtree and its
152 /// \brief Get the number of instructions in the given subtree not including
168 /// \brief Get the ID of the subtree the given DAG node belongs to
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| AbstractData.java | 47 * Retrieves the value at the specified path in this HDF node's subtree.
62 * Retrieves the integer value at the specified path in this HDF node's subtree. If the value does
82 * Retrieves the value at the specified path in this HDF node's subtree. If not found, returns
90 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid,
98 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid,
106 * Sets the value at the specified path in this HDF node's subtree.
|
| Data.java | 151 * Retrieves the object that is the root of the subtree at hdfpath, returning null if the subtree
157 * Retrieves the HDF object that is the root of the subtree at hdfpath, create the subtree if it
163 * Remove the specified subtree.
209 * Retrieves the value at the specified path in this HDF node's subtree.
214 * Retrieves the integer value at the specified path in this HDF node's subtree. If the value does
220 * Retrieves the value at the specified path in this HDF node's subtree. If not found, returns
226 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid,
232 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| NameConstraints.java | 76 private GeneralSubtree[] createArray(ASN1Sequence subtree)
78 GeneralSubtree[] ar = new GeneralSubtree[subtree.size()];
82 ar[i] = GeneralSubtree.getInstance(subtree.getObjectAt(i));
|
| /external/chromium_org/chrome/test/functional/ispy/ispy_core/ |
| wait_on_ajax.js | 18 characterData: true, subtree: true});
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRTree.cpp | 65 fRoot.fChild.subtree = allocateNode(0);
66 fRoot.fChild.subtree->fNumChildren = 0;
70 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
71 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
74 Node* oldRoot = fRoot.fChild.subtree;
79 fRoot.fChild.subtree = newRoot;
80 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
92 fRoot.fChild.subtree = allocateNode(0);
93 fRoot.fChild.subtree->fNumChildren = 0;
94 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0])
[all...] |
| /external/skia/src/core/ |
| SkRTree.cpp | 65 fRoot.fChild.subtree = allocateNode(0);
66 fRoot.fChild.subtree->fNumChildren = 0;
70 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
71 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
74 Node* oldRoot = fRoot.fChild.subtree;
79 fRoot.fChild.subtree = newRoot;
80 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
92 fRoot.fChild.subtree = allocateNode(0);
93 fRoot.fChild.subtree->fNumChildren = 0;
94 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0])
[all...] |
| /external/chromium_org/cc/trees/ |
| occlusion_tracker.h | 120 // RenderSurfaceImpl-Layer tree, so that when we leave a subtree we may apply
121 // a mask to it, but not to the parts outside the subtree.
122 // - The first time we see a new subtree under a target, we add that target to
125 // - When we visit a target surface, we apply its mask to its subtree, which
128 // current subtree, which is at the top of the stack.
133 // subtree. This new target is pushed onto the stack if not already there.
138 // already current, then this indicates we have entered a new surface subtree.
149 // child subtree into its parent.
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| RenderSVGHiddenContainer.cpp | 41 // This subtree does not paint.
46 // This subtree does not take up space or paint
|
| /external/jsilver/src/org/clearsilver/ |
| HDF.java | 71 * subtree. If the value does not exist, or cannot be converted to an
77 * Retrieves the value at the specified path in this HDF node's subtree.
82 * Sets the value at the specified path in this HDF node's subtree.
87 * Remove the specified subtree.
107 * Retrieves the HDF object that is the root of the subtree at hdfpath, or
113 * Retrieves the HDF for the first child of the root of the subtree
139 * Retrieves the HDF object that is the root of the subtree at
140 * hdfpath, create the subtree if it doesn't exist
|
| /external/chromium_org/content/browser/indexed_db/leveldb/ |
| avltree.h | 365 // Gives path to subtree being built. If branch[N] is false, branch
369 // If rem[N] is true, then for the current subtree at depth N, it's
370 // greater subtree has one more node than it's less subtree.
373 // Depth of root node of current subtree.
376 // Number of nodes in current subtree.
379 // The algorithm relies on a stack of nodes whose less subtree has
380 // been built, but whose right subtree has not yet been built. The
387 // h is root of current subtree, child is one of its children.
392 // Subtract one for root of subtree
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| CompositingReasons.h | 33 // Subtree reasons that require knowing what the status of your subtree is before knowing the answer
46 // a layer if anything else in the subtree is composited.
|
| /external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 200 /* Balances subtree, returns handle of root node of subtree after balancing.
205 /* Either the "greater than" or the "less than" subtree of
210 /* "Greater than" subtree is deeper. */
258 /* "Less than" subtree is deeper. */
565 ** node in the less subtree (of the node to remove), or the least
566 ** node in the greater subtree. We take the leaf node from the
567 ** deeper subtree, if there is one. */
620 /* "path" is the parent of the subtree being eliminated or reduced
769 /* Gives path to subtree being built. If bit n is false, branc
[all...] |
| /external/chromium_org/chrome/renderer/resources/extensions/ |
| content_watcher.js | 31 subtree: true});
|
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| leak-observer-nonmain-world.html | 18 testRunner.evaluateScriptInIsolatedWorld(1, 'new MutationObserver(function(){}).observe(document, {childList: true, subtree: true});');
|
| /external/smack/src/org/xbill/DNS/ |
| DNAMERecord.java | 6 * DNAME Record - maps a nonterminal alias (subtree) to a different domain
|
| /external/chromium/chrome/browser/resources/bookmark_manager/js/ |
| bmm.js | 35 * Loads a subtree of the bookmark tree and returns a {@code cr.Promise} that
37 * load the same subtree more than once at the same time.
|
| /external/chromium_org/cc/output/ |
| copy_output_request.h | 51 // By default copy requests copy the entire layer's subtree output. If an
53 // the layer's subtree output will be returned.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| PKIXNameConstraintValidator.java | 48 ASN1Sequence subtree)
50 if (subtree.size() < 1)
55 if (subtree.size() > dns.size())
60 for (int j = subtree.size() - 1; j >= 0; j--)
62 if (!subtree.getObjectAt(j).equals(dns.getObjectAt(j)))
99 ASN1Sequence subtree = (ASN1Sequence)it.next(); local
101 if (withinDNSubtree(dns, subtree))
108 "Subject distinguished name is not from a permitted subtree");
123 ASN1Sequence subtree = (ASN1Sequence)it.next(); local
125 if (withinDNSubtree(dns, subtree))
152 ASN1Sequence subtree = (ASN1Sequence)_iter.next(); local
187 ASN1Sequence subtree = (ASN1Sequence)it.next(); local
1540 GeneralSubtree subtree = permitted[i]; local
[all...] |
| /external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/ |
| DependencyGraphBuilder.h | 129 // It will push the placeholder symbol kLeftSubtree when instantiated under a left subtree,
130 // and kRightSubtree under a right subtree.
138 TLeftmostSymbolMaintainer(TDependencyGraphBuilder* factory, TGraphSymbol& subtree)
141 needsPlaceholderSymbol = leftmostSymbols.empty() || leftmostSymbols.top() != &subtree;
143 leftmostSymbols.push(&subtree);
|
