| /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/skia/src/core/ |
| SkRTree.cpp | 65 fRoot.fChild.subtree = allocateNode(0);
66 fRoot.fChild.subtree->fNumChildren = 0;
70 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
71 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
74 Node* oldRoot = fRoot.fChild.subtree;
79 fRoot.fChild.subtree = newRoot;
80 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
92 fRoot.fChild.subtree = allocateNode(0);
93 fRoot.fChild.subtree->fNumChildren = 0;
94 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0])
[all...] |
| SkRTree.h | 83 int getDepth() const { return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1; }
99 Node* subtree; member in union:SkRTree::Branch::__anon14980
|
| /libcore/luni/src/test/java/libcore/xml/ |
| NodeTest.java | 75 private List<Node> flattenSubtree(Node subtree) {
77 traverse(subtree, result);
|
| /external/webkit/Source/WebKit/mac/WebView/ |
| WebPDFDocumentExtras.mm | 40 static void appendValuesInPDFNameSubtreeToVector(CGPDFDictionaryRef subtree, Vector<CGPDFObjectRef>& values)
43 if (CGPDFDictionaryGetArray(subtree, "Names", &names)) {
54 if (!CGPDFDictionaryGetArray(subtree, "Kids", &kids))
|
| /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
|
| isakmp_xauth.c | 732 xauth_ldap_config.subtree = 0;
904 if (xauth_ldap_config.subtree)
1121 if (xauth_ldap_config.subtree)
[all...] |
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_nodeclonenodetrue.js | 79 and the subtree under it if deep=true.
83 method should clone this node and the subtree under it.
85 checked to insure the entire subtree under the second
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_nodeclonenodetrue.js | 79 and the subtree under it if deep=true.
83 method should clone this node and the subtree under it.
85 checked to insure the entire subtree under the second
|
| /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/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/webkit/Source/WebCore/svg/ |
| SVGUseElement.cpp | 287 // Update whole subtree, scanning for shadow container elements, that correspond to <svg>/<symbol> tags
340 // Update whole subtree, scanning for shadow container elements, marking a cloned use subtree
782 void SVGUseElement::removeDisallowedElementsFromSubtree(Node* subtree)
784 ASSERT(!subtree->inDocument());
786 Node* node = subtree->firstChild();
789 Node* next = node->traverseNextSibling(subtree);
790 // The subtree is not in document so this won't generate events that could mutate the tree.
794 node = node->traverseNextNode(subtree);
809 // Though if there are disallowed elements in the subtree, we have to remove them
[all...] |
| /external/chromium/chrome/common/extensions/ |
| extension_message_bundle_unittest.cc | 38 DictionaryValue* subtree,
40 target->Set(name, static_cast<Value*>(subtree));
|
| /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/Python/antlr3/ |
| 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/v8/test/mjsunit/compiler/ |
| expression-trees.js | 46 // Adjoin every possible left and right subtree.
|
| /external/webkit/Source/WebCore/page/ |
| FrameView.cpp | 646 // call will not cause the subtree under it to repaint. Explicitly call the syncCompositingState on
856 bool subtree = m_layoutRoot; local
863 RenderObject* root = subtree ? m_layoutRoot : document->renderer();
903 m_doFullRepaint = !subtree && (m_firstLayout || toRenderView(root)->printing());
905 if (!subtree) {
954 if (subtree) {
968 if (subtree) {
978 if (!subtree && !toRenderView(root)->printing())
990 subtree ? 0 : &cachedOffset);
[all...] |
| /external/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 165 // the left subtree.
285 * Performs an ordered traversal of the subtree starting at
|
| /external/chromium/net/tools/spdyshark/ |
| packet-spdy.c | 1482 proto_tree *subtree; local
[all...] |
| /external/v8/benchmarks/ |
| splay.js | 260 // the left subtree.
380 * Performs an ordered traversal of the subtree starting at
|
