/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/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});
|
/external/chromium_org/third_party/skia/src/core/ |
SkRTree.cpp | 70 fRoot.fChild.subtree = allocateNode(0); 71 fRoot.fChild.subtree->fNumChildren = 0; 75 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch); 76 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree); 79 Node* oldRoot = fRoot.fChild.subtree; 84 fRoot.fChild.subtree = newRoot; 85 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree); 97 fRoot.fChild.subtree = allocateNode(0); 98 fRoot.fChild.subtree->fNumChildren = 0; 99 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0]) [all...] |
SkRTree.h | 89 return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1; 108 Node* subtree; member in union:SkRTree::Branch::__anon19814
|
/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...] |
SkRTree.h | 89 return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1; 108 Node* subtree; member in union:SkRTree::Branch::__anon14294
|
/external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
DependencyGraphBuilder.h | 142 // left subtree, and kRightSubtree under a right subtree. 154 TDependencyGraphBuilder *factory, TGraphSymbol &subtree) 158 mLeftmostSymbols.empty() || mLeftmostSymbols.top() != &subtree; 160 mLeftmostSymbols.push(&subtree);
|
/libcore/luni/src/test/java/libcore/xml/ |
NodeTest.java | 75 private List<Node> flattenSubtree(Node subtree) { 77 traverse(subtree, result);
|
/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).
|
/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/ipsec-tools/src/racoon/ |
isakmp_xauth.h | 138 int subtree; member in struct:xauth_ldap_config
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.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/ |
TreePatternParser.java | 75 Object subtree = parseTree(); local 76 adaptor.addChild(root, subtree);
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
node_breadcrumb.js | 72 * @param {Node} node Root of the subtree which to mark. 105 // we copy the whole subtree of that ancestor anyways 116 * @param {Node|Text} node The root of the subtree to clone. 117 * @return {Node|Text} The cloned subtree.
|
/external/chromium_org/tools/grit/grit/gather/ |
policy_json.py | 85 '''Traverses the subtree of a DOM node, and register a tclib message for
|
/external/chromium_org/mojo/public/tools/bindings/pylib/mojom/parse/ |
translate.py | 17 return [func(subtree) for subtree in tree if isinstance(subtree, type_to_map)]
|
/external/llvm/include/llvm/ADT/ |
IntervalMap.h | 513 /// subtree - Access the i'th subtree reference in a branch node. 516 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 683 // The key array in a branch node holds the rightmost stop key of each subtree. 687 // It is unusual for a branch node to only have one subtree, but it can happen 700 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 703 NodeRef &subtree(unsigned i) { return this->first[i]; } 705 /// findFrom - Find the first subtree after i that may contain x. 710 /// This is the first subtree that can possibly contain x. 719 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
RewriteRuleSubtreeStream.js | 8 /** Treat next element as a single node even if it's a subtree.
|
/external/chromium_org/chrome/renderer/resources/extensions/ |
tag_watcher.js | 29 documentObserver.observe(document, {subtree: true, childList: true});
|
/frameworks/base/libs/hwui/ |
RenderNode.cpp | 336 void RenderNode::prepareSubTree(TreeInfo& info, DisplayListData* subtree) { 337 if (subtree) { 339 info.out.hasFunctors |= subtree->functors.size(); 342 if (subtree->ownedBitmapResources.size()) { 345 for (size_t i = 0; info.prepareTextures && i < subtree->bitmapResources.size(); i++) { 346 info.prepareTextures = cache.prefetchAndMarkInUse(subtree->bitmapResources[i]); 348 for (size_t i = 0; i < subtree->children().size(); i++) { 349 DrawRenderNodeOp* op = subtree->children()[i]; [all...] |
RenderNode.h | 243 void prepareSubTree(TreeInfo& info, DisplayListData* subtree);
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
SVGUseElement.cpp | 367 // Clone the target subtree into the shadow tree, not handling <use> and <symbol> yet. 518 static inline void removeDisallowedElementsFromSubtree(Element& subtree) 520 ASSERT(!subtree.inDocument()); 521 Element* element = ElementTraversal::firstWithin(subtree); 524 Element* next = ElementTraversal::nextSkippingChildren(*element, &subtree); 525 // The subtree is not in document so this won't generate events that could mutate the tree. 529 element = ElementTraversal::next(*element, &subtree); 580 // Though if there are disallowed elements in the subtree, we have to remove them. 633 // Though if there are disallowed elements in the subtree, we have to remove them.
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
find_util.js | 40 // We may have been sync'ed into a subtree of the current predicate match.
|