HomeSort by relevance Sort by last modified time
    Searched full:subtree (Results 101 - 125 of 583) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/apache-xml/src/main/java/org/apache/xpath/functions/
Function2Args.java 120 * the current subtree.
122 * @return true if traversal outside the context node's subtree can occur.
Function3Args.java 118 * the current subtree.
120 * @return true if traversal outside the context node's subtree can occur.
FunctionDef1Arg.java 159 * the current subtree.
161 * @return true if traversal outside the context node's subtree can occur.
FunctionMultiArgs.java 139 * the current subtree.
141 * @return true if traversal outside the context node's subtree can occur.
FunctionOneArg.java 99 * the current subtree.
101 * @return true if traversal outside the context node's subtree can occur.
  /external/apache-xml/src/main/java/org/apache/xpath/operations/
Operation.java 63 * the current subtree.
65 * @return true if traversal outside the context node's subtree can occur.
  /external/apache-xml/src/main/java/org/apache/xpath/patterns/
UnionPattern.java 56 * the current subtree.
58 * @return true if traversal outside the context node's subtree can occur.
  /external/chromium_org/chrome/common/extensions/api/devtools/
experimental_audits.json 74 "description": "A subtree that appears under the added result that may provide additional details on the violations found."
169 "description": "If set, the subtree will always be expanded."
  /external/chromium_org/third_party/WebKit/Source/core/css/invalidation/
StyleInvalidator.cpp 34 // If we're already going to invalidate the whole subtree we don't need to store any new sets.
37 // If this set would invalidate the whole subtree we can discard all existing sets.
  /external/chromium_org/third_party/angle/src/compiler/translator/
IntermTraverse.cpp 14 // but their subtree will still be traversed.
15 // Nodes with children can have their whole subtree skipped
  /external/chromium_org/third_party/skia/src/pdf/
SkPDFPage.cpp 123 // subtree. However, by construction, we know that unless it's the
124 // last subtree for the current depth, the leaf count will be
  /external/chromium_org/ui/accessibility/
ax_tree.h 101 // call recursively on all nodes in its subtree.
105 // child and its subtree if its id is not in |new_child_ids|. Returns
  /external/eigen/Eigen/src/SparseLU/
SparseLU_Structs.h 100 // in a subtree of the elimination tree is less than relax, this subtree is considered
  /external/owasp/sanitizer/src/main/org/owasp/html/
Trie.java 65 * subtree.
67 * subtree.
  /external/skia/src/pdf/
SkPDFPage.cpp 123 // subtree. However, by construction, we know that unless it's the
124 // last subtree for the current depth, the leaf count will be
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
heap.h 148 // heapify subtree rooted at index i.
169 // insert(update) element at subtree rooted at index i
  /libcore/luni/src/main/java/javax/xml/transform/dom/
DOMSource.java 71 * will be applied to the subtree rooted at this node. In XSLT,
72 * a "/" pattern still means the root of the tree (not the subtree),
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/
live_regions.js 235 * @param {boolean} subtree True if we should check the subtree.
240 node, parent, isRemoval, subtree, handler) {
252 if (subtree && node != document.body) {
423 * describing atomic nodes or leaf nodes in the subtree rooted
  /external/chromium_org/third_party/sqlite/src/src/
rowset.c 82 struct RowSetEntry *pRight; /* Right subtree (larger entries) or list */
83 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
269 ** The input, pIn, is a binary tree (or subtree) of RowSetEntry objects.
313 struct RowSetEntry *pLeft; /* Left subtree */
341 struct RowSetEntry *pLeft; /* Left subtree */
  /external/jsilver/src/com/google/clearsilver/jsilver/data/
NestedMapData.java 299 * Retrieves the object that is the root of the subtree at hdfpath, returning null if the subtree
313 * Retrieves the HDF object that is the root of the subtree at hdfpath, create the subtree if it
359 * Remove the specified subtree.
  /external/chromium_org/third_party/skia/src/gpu/
GrRedBlackTree.h 279 // found one. check if another in left subtree.
299 // found one. check if another in right subtree.
720 // when x is deleted its subtree will have reduced black-height.
728 // now subtree at p has black-height of one less than
729 // p's parent's other child's subtree. We move x up to
733 // if p is the root there is no other subtree to balance
785 // Whether p was red or black, we've increased its pc subtree
787 // we've also its subtree rooted at s's black-height by 1. This
809 // must be red, otherwise the subtree at c1 will have a different
810 // black-height than the subtree rooted at c0
    [all...]
  /external/skia/src/gpu/
GrRedBlackTree.h 279 // found one. check if another in left subtree.
299 // found one. check if another in right subtree.
720 // when x is deleted its subtree will have reduced black-height.
728 // now subtree at p has black-height of one less than
729 // p's parent's other child's subtree. We move x up to
733 // if p is the root there is no other subtree to balance
785 // Whether p was red or black, we've increased its pc subtree
787 // we've also its subtree rooted at s's black-height by 1. This
809 // must be red, otherwise the subtree at c1 will have a different
810 // black-height than the subtree rooted at c0
    [all...]
  /external/clang/lib/Rewrite/Core/
RewriteRope.cpp 104 /// If there is no space in this subtree for the extra piece, the extra tree
112 /// If there is no space in this subtree for the extra piece, the extra tree
205 /// If there is no space in this subtree for the extra piece, the extra tree
213 /// If there is no space in this subtree for the extra piece, the extra tree
232 /// If there is no space in this subtree for the extra piece, the extra tree
273 /// If there is no space in this subtree for the extra piece, the extra tree
437 /// If there is no space in this subtree for the extra piece, the extra tree
446 /// If there is no space in this subtree for the extra piece, the extra tree
468 /// If there is no space in this subtree for the extra piece, the extra tree
494 /// If there is no space in this subtree for the extra piece, the extra tre
    [all...]
  /external/chromium_org/cc/trees/
layer_tree_host_common.cc 445 // transparent, we would have skipped the entire subtree and never made it
490 // We cannot skip the the subtree if a descendant has a wheel or touch handler
495 // If the layer is not drawn, then skip it and its subtree.
500 // this subtree can't be skipped as we need to create, prioritize and
507 // entire subtree can be skipped if this layer is fully transparent.
521 // We cannot skip the the subtree if a descendant has a wheel or touch handler
526 // If the layer is not drawn, then skip it and its subtree.
533 // In particular, it should not cause the subtree to be skipped.
535 // animation, their subtree should also not be skipped.
588 // If the layer flattens its subtree, but it is treated as a 3D object by it
    [all...]
  /external/chromium_org/v8/tools/
profile.js 322 var subTree = tree.cloneSubtree(opt_label);
323 subTree.computeTotalWeights();
324 return subTree;
583 * Creates a subtree by cloning and merging all subtrees rooted at nodes
599 var subTree = new CallTree();
604 var child = (parent ? parent : subTree).findOrAddChild(node.label);
608 return subTree;

Completed in 472 milliseconds

1 2 3 45 6 7 8 91011>>