/external/chromium_org/chrome/test/ispy/client/ |
H A D | wait_on_ajax.js | 18 characterData: true, subtree: true});
|
/external/llvm/lib/Support/ |
H A D | 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(pat [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
H A D | NameConstraints.java | 76 private GeneralSubtree[] createArray(ASN1Sequence subtree) argument 78 GeneralSubtree[] ar = new GeneralSubtree[subtree.size()]; 82 ar[i] = GeneralSubtree.getInstance(subtree.getObjectAt(i));
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | 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, [all...] |
H A D | SkRTree.h | 89 return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1; 108 Node* subtree; member in union:SkRTree::Branch::__anon15196
|
/external/skia/src/core/ |
H A D | 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, [all...] |
H A D | SkRTree.h | 89 return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1; 108 Node* subtree; member in union:SkRTree::Branch::__anon30603
|
/external/chromium_org/chrome/renderer/resources/extensions/ |
H A D | tag_watcher.js | 29 documentObserver.observe(document, {subtree: true, childList: true});
|
/external/chromium_org/mojo/public/tools/bindings/pylib/mojom/parse/ |
H A D | translate.py | 17 return [func(subtree) for subtree in tree if isinstance(subtree, type_to_map)]
|
/external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
H A D | 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); 153 TLeftmostSymbolMaintainer( TDependencyGraphBuilder *factory, TGraphSymbol &subtree) argument
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreePatternParser.cs | 76 object subtree = ParseTree(); 77 adaptor.AddChild(root, subtree);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | TreePatternParser.cs | 88 object subtree = ParseTree(); 89 adaptor.AddChild( root, subtree );
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
H A D | 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(); 101 if (withinDNSubtree(dns, subtree)) 108 "Subject distinguished name is not from a permitted subtree"); 123 ASN1Sequence subtree = (ASN1Sequence)it.next(); 125 if (withinDNSubtree(dns, subtree)) 46 withinDNSubtree( ASN1Sequence dns, ASN1Sequence subtree) argument 1610 addExcludedSubtree(GeneralSubtree subtree) argument [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | isakmp_xauth.h | 138 int subtree; member in struct:xauth_ldap_config
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreePatternParser.java | 75 Object subtree = parseTree(); 76 adaptor.addChild(root, subtree);
|
/external/chromium_org/ui/accessibility/extensions/alt/ |
H A D | hide-images.js | 52 observer.observe(document, { childList: true, subtree: true });
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGUseElement.cpp | 367 // Clone the target subtree into the shadow tree, not handling <use> and <symbol> yet. 518 static inline void removeDisallowedElementsFromSubtree(Element& subtree) argument 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/llvm/include/llvm/ADT/ |
H A D | 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 tha [all...] |
/external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
H A D | scrollbar.js | 84 this.domObserver_.observe(this.view_, {subtree: true, attributes: true});
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
H A D | 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) { 449 * describing atomic nodes or leaf nodes in the subtree rooted
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | treewizard.py | 196 subtree = self.parseTree() 197 self.adaptor.addChild(root, subtree) 524 on the various nodes and '.' (dot) as the node/subtree wildcard,
|
/external/chromium_org/extensions/common/ |
H A D | message_bundle_unittest.cc | 40 base::DictionaryValue* subtree, 42 target->Set(name, static_cast<base::Value*>(subtree)); 39 SetDictionary(const std::string& name, base::DictionaryValue* subtree, base::DictionaryValue* target) argument
|
/external/chromium_org/third_party/polymer/components-chromium/core-style/ |
H A D | core-style-extracted.js | 99 .observe(this.shadowRoot, {subtree: true,
|
/external/chromium_org/remoting/webapp/ |
H A D | ui_mode.js | 216 subtree: false,
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | MutationObserver.cpp | 112 if (observerInit.subtree())
|