HomeSort by relevance Sort by last modified time
    Searched full:subtree (Results 326 - 350 of 757) sorted by null

<<11121314151617181920>>

  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
ImmutableSet.h 58 /// Return a pointer to the left subtree. This value
59 /// is NULL if there is no left subtree.
62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
73 /// find - Finds the subtree associated with the specified key value.
74 /// This method returns NULL if no matching subtree is found.
89 /// getMaxElement - Find the subtree associated with the highest ranged
167 /// contains - Returns true if this tree contains a subtree (node) that
173 /// object (specifed by Callback) for every node/subtree in the tree.
254 /// isMutable - Returns true if the left and right subtree reference
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
ImmutableSet.h 58 /// Return a pointer to the left subtree. This value
59 /// is NULL if there is no left subtree.
62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
73 /// find - Finds the subtree associated with the specified key value.
74 /// This method returns NULL if no matching subtree is found.
89 /// getMaxElement - Find the subtree associated with the highest ranged
167 /// contains - Returns true if this tree contains a subtree (node) that
173 /// object (specifed by Callback) for every node/subtree in the tree.
254 /// isMutable - Returns true if the left and right subtree reference
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
ImmutableSet.h 58 /// Return a pointer to the left subtree. This value
59 /// is NULL if there is no left subtree.
62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
73 /// find - Finds the subtree associated with the specified key value.
74 /// This method returns NULL if no matching subtree is found.
89 /// getMaxElement - Find the subtree associated with the highest ranged
167 /// contains - Returns true if this tree contains a subtree (node) that
173 /// object (specifed by Callback) for every node/subtree in the tree.
254 /// isMutable - Returns true if the left and right subtree reference
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
ImmutableSet.h 58 /// Return a pointer to the left subtree. This value
59 /// is NULL if there is no left subtree.
62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
73 /// find - Finds the subtree associated with the specified key value.
74 /// This method returns NULL if no matching subtree is found.
89 /// getMaxElement - Find the subtree associated with the highest ranged
167 /// contains - Returns true if this tree contains a subtree (node) that
173 /// object (specifed by Callback) for every node/subtree in the tree.
254 /// isMutable - Returns true if the left and right subtree reference
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
ImmutableSet.h 58 /// Return a pointer to the left subtree. This value
59 /// is NULL if there is no left subtree.
62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
73 /// find - Finds the subtree associated with the specified key value.
74 /// This method returns NULL if no matching subtree is found.
89 /// getMaxElement - Find the subtree associated with the highest ranged
167 /// contains - Returns true if this tree contains a subtree (node) that
173 /// object (specifed by Callback) for every node/subtree in the tree.
254 /// isMutable - Returns true if the left and right subtree reference
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
ImmutableSet.h 58 /// Return a pointer to the left subtree. This value
59 /// is NULL if there is no left subtree.
62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
73 /// find - Finds the subtree associated with the specified key value.
74 /// This method returns NULL if no matching subtree is found.
89 /// getMaxElement - Find the subtree associated with the highest ranged
167 /// contains - Returns true if this tree contains a subtree (node) that
173 /// object (specifed by Callback) for every node/subtree in the tree.
254 /// isMutable - Returns true if the left and right subtree reference
    [all...]
  /external/iproute2/man/man7/
tc-hfsc.7 300 R arbitrates between left subtree (A) and right (B). Assume that A2 and B are
306 subtree gets 3Mbit, but its children would want (at the point when A1 became
310 In the left subtree \- we have the same situation as previously (fair split
314 violated fairness in the A subtree and set A2's service curve to 0, A1 would
533 capacity. Or in special cases, such as testing (limit certain subtree to some
  /frameworks/base/wifi/java/android/net/wifi/hotspot2/pps/
Credential.java 39 * Class representing Credential subtree in the PerProviderSubscription (PPS)
44 * In addition to the fields in the Credential subtree, this will also maintain necessary
138 * Contains the fields under PerProviderSubscription/Credential/UsernamePassword subtree.
472 * Contains fields under PerProviderSubscription/Credential/DigitalCertificate subtree.
638 * Contains fields under PerProviderSubscription/Credential/SIM subtree.
    [all...]
  /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...]
  /frameworks/base/core/java/android/provider/
DocumentsContract.java 198 * subtree containing zero or more documents, which can recursively contain
825 * URI will leverage access granted through a subtree URI, typically
827 * must be a descendant (child, grandchild, etc) of the subtree.
833 * @param treeUri the subtree to leverage to gain access to the target
835 * subtree.
    [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/cachegrind/
cg_merge.c 1087 /* insert into the left subtree */
1120 /* insert into the right subtree */
1173 /* remove from the left subtree */
    [all...]
  /libcore/luni/src/main/java/org/w3c/dom/
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...]
  /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...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
BaseTreeAdaptor.cs 127 // ensure new subtree root has parent/child index set
417 * Track start/stop token for subtree root created for a rule.
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRBaseTreeAdaptor.m 116 // ensure new subtree root has parent/child index set
386 /** Track start/stop token for subtree root created for a rule.
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
wizard.rb 221 subtree = parse_tree
222 @adaptor.add_child( root, subtree )
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
AVT.java 533 * the current subtree.
535 * @return true if traversal outside the context node's subtree can occur.
  /external/apache-xml/src/main/java/org/apache/xml/dtm/
DTMIterator.java 129 * within the root's subtree which is _not_ skipped by the filters.
170 * is rejected by the filters) the first node within its subtree which is
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
TreeWalker.java 127 * Note that TreeWalker assumes that the subtree is intended to represent
182 * Note that TreeWalker assumes that the subtree is intended to represent
  /external/apache-xml/src/main/java/org/apache/xpath/axes/
AxesWalker.java 241 * whether or not it is within the subtree specified by the root node or
514 * false, the subtree should not be called.
  /external/autotest/client/site_tests/power_Thermal/
power_Thermal.py 26 # device's subtree. We use the file name to locate the subtree, only one file
  /external/llvm/test/CodeGen/X86/
misched-matrix.ll 27 ; For -misched=ilpmin, verify that each expression subtree is
58 ; For -misched=ilpmax, verify that each expression subtree is
  /external/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/
cpuset.h 281 * at once from an entire cpuset subtree, a simple error return would
283 * cpuset in the subtree. So, except for malloc(3) failures, errors

Completed in 1320 milliseconds

<<11121314151617181920>>