| /external/chromium_org/content/test/data/accessibility/ |
| modal-dialog-opened-expected-mac.txt | 3 AXStaticText AXValue='The dialog subtree should be the only text content in the accessibility tree. '
|
| modal-dialog-opened-expected-win.txt | 3 ROLE_SYSTEM_STATICTEXT name='The dialog subtree should be the only text content in the accessibility tree. '
|
| modal-dialog-opened-expected-android.txt | 3 android.view.View clickable name='The dialog subtree should be the only text content in the accessibility tree. '
|
| modal-dialog-opened.html | 9 The dialog subtree should be the only text content in the accessibility tree.
|
| /external/chromium_org/chrome/browser/sync_file_system/ |
| subtree_set.h | 23 // Returns true if the subtree induced by |subtree_root| is disjoint with
27 // Returns true and inserts the subtree induced by |subtree_root| if the
28 // subtree is disjoint with all subtrees in the container.
31 // Erases the subtree induced by |subtree_root| from the container.
32 // Returns true if this erases the subtree.
52 // Each subtree root has |contained_as_subtree_root| flag true.
|
| /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.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \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/ispy/client/ |
| wait_on_ajax.js | 18 characterData: true, subtree: true});
|
| dom.py | 28 characterData: true, subtree: true});
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRTree.cpp | 63 fRoot.fChild.subtree = allocateNode(0);
64 fRoot.fChild.subtree->fNumChildren = 0;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
69 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
72 Node* oldRoot = fRoot.fChild.subtree;
77 fRoot.fChild.subtree = newRoot;
78 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
90 fRoot.fChild.subtree = allocateNode(0);
91 fRoot.fChild.subtree->fNumChildren = 0;
92 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0])
[all...] |
| /external/skia/src/core/ |
| SkRTree.cpp | 63 fRoot.fChild.subtree = allocateNode(0);
64 fRoot.fChild.subtree->fNumChildren = 0;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
69 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
72 Node* oldRoot = fRoot.fChild.subtree;
77 fRoot.fChild.subtree = newRoot;
78 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
90 fRoot.fChild.subtree = allocateNode(0);
91 fRoot.fChild.subtree->fNumChildren = 0;
92 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0])
[all...] |
| /external/chromium_org/cc/trees/ |
| occlusion_tracker.h | 97 // RenderSurfaceImpl-Layer tree, so that when we leave a subtree we may apply
98 // a mask to it, but not to the parts outside the subtree.
99 // - The first time we see a new subtree under a target, we add that target to
102 // - When we visit a target surface, we apply its mask to its subtree, which
105 // current subtree, which is at the top of the stack.
110 // subtree. This new target is pushed onto the stack if not already there.
115 // already current, then this indicates we have entered a new surface subtree.
126 // child subtree into its parent.
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| RenderSVGHiddenContainer.cpp | 42 // This subtree does not paint.
47 // 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/third_party/libvpx/source/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 202 /* Balances subtree, returns handle of root node of subtree after balancing.
207 /* Either the "greater than" or the "less than" subtree of
212 /* "Greater than" subtree is deeper. */
260 /* "Less than" subtree is deeper. */
567 ** node in the less subtree (of the node to remove), or the least
568 ** node in the greater subtree. We take the leaf node from the
569 ** deeper subtree, if there is one. */
622 /* "path" is the parent of the subtree being eliminated or reduced
771 /* Gives path to subtree being built. If bit n is false, branc
[all...] |
| /external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 202 /* Balances subtree, returns handle of root node of subtree after balancing.
207 /* Either the "greater than" or the "less than" subtree of
212 /* "Greater than" subtree is deeper. */
260 /* "Less than" subtree is deeper. */
567 ** node in the less subtree (of the node to remove), or the least
568 ** node in the greater subtree. We take the leaf node from the
569 ** deeper subtree, if there is one. */
622 /* "path" is the parent of the subtree being eliminated or reduced
771 /* Gives path to subtree being built. If bit n is false, branc
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 202 /* Balances subtree, returns handle of root node of subtree after balancing.
207 /* Either the "greater than" or the "less than" subtree of
212 /* "Greater than" subtree is deeper. */
260 /* "Less than" subtree is deeper. */
567 ** node in the less subtree (of the node to remove), or the least
568 ** node in the greater subtree. We take the leaf node from the
569 ** deeper subtree, if there is one. */
622 /* "path" is the parent of the subtree being eliminated or reduced
771 /* Gives path to subtree being built. If bit n is false, branc
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/speech_rules/ |
| speech_rule_evaluator.js | 25 * @param {!Node} node The target node (or root of subtree).
|
