Home
last modified time | relevance | path

Searched refs:subtrees (Results 1 – 22 of 22) sorted by relevance

/external/apache-harmony/security/src/test/impl/java.injected/java/security/cert/
DX509CertSelectorTest.java1786 GeneralSubtrees subtrees = new GeneralSubtrees(); in testSetNameConstraints0() local
1788 subtrees.addSubtree(subtree); in testSetNameConstraints0()
1808 constraints = new NameConstraints(subtrees, null); in testSetNameConstraints0()
1825 ? new NameConstraints(subtrees, subtrees) in testSetNameConstraints0()
1826 : new NameConstraints(null, subtrees); in testSetNameConstraints0()
1938 GeneralSubtrees subtrees = new GeneralSubtrees(); in testSetNameConstraints1() local
1940 subtrees.addSubtree(subtree); in testSetNameConstraints1()
1960 constraints = new NameConstraints(subtrees, null); in testSetNameConstraints1()
1977 ? new NameConstraints(subtrees, subtrees) in testSetNameConstraints1()
1978 : new NameConstraints(null, subtrees); in testSetNameConstraints1()
[all …]
/external/dbus/dbus/
Ddbus-object-tree.c77 DBusObjectSubtree **subtrees; /**< Child nodes */ member
199 v = strcmp (path[0], subtree->subtrees[k]->name); in find_subtree_recurse()
203 path[0], subtree->subtrees[k]->name, in find_subtree_recurse()
221 next = find_subtree_recurse (subtree->subtrees[k], in find_subtree_recurse()
239 return find_subtree_recurse (subtree->subtrees[k], in find_subtree_recurse()
280 new_subtrees = dbus_realloc (subtree->subtrees, in find_subtree_recurse()
287 subtree->subtrees = new_subtrees; in find_subtree_recurse()
298 memmove (&subtree->subtrees[child_pos+1], in find_subtree_recurse()
299 &subtree->subtrees[child_pos], in find_subtree_recurse()
301 sizeof subtree->subtrees[0]); in find_subtree_recurse()
[all …]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DTreeWizard.cs289 … public FindTreeWizardContextVisitor( TreeWizard outer, TreePattern tpattern, IList subtrees ) in FindTreeWizardContextVisitor() argument
293 _subtrees = subtrees; in FindTreeWizardContextVisitor()
316 IList subtrees = new List<object>(); in Find()
330 Visit( t, rootTokenType, new FindTreeWizardContextVisitor( this, tpattern, subtrees ) ); in Find()
331 return subtrees; in Find()
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DTreeWizard.cs253 … public FindTreeWizardContextVisitor(TreeWizard outer, TreePattern tpattern, IList subtrees) { in FindTreeWizardContextVisitor() argument
256 _subtrees = subtrees; in FindTreeWizardContextVisitor()
275 IList subtrees = new List<object>(); in Find()
288 Visit(t, rootTokenType, new FindTreeWizardContextVisitor(this, tpattern, subtrees)); in Find()
289 return subtrees; in Find()
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-tree-wizard.rb484 subtrees = @wizard.find(tree, "(A B)").map { |t| t.to_s }
485 assert_equal(%w(foo big), subtrees)
490 subtrees = @wizard.find( tree, A ).map { |t| t.to_s }
491 assert_equal(%w(A foo big), subtrees)
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Dwizard.rb366 subtrees = []
367 visit_pattern( tree, pattern ) { | t, | subtrees << t }
368 return( subtrees )
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DTreeWizard.java212 final List subtrees = new ArrayList(); in find() local
229 subtrees.add(t); in find()
233 return subtrees; in find()
/external/antlr/antlr-3.4/runtime/Python/antlr3/
Dtreewizard.py433 subtrees = []
449 subtrees.append(tree)
453 return subtrees
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRTreeWizard.m80 [(AMutableArray *)object2/* subtrees */ addObject:t];
364 /** Return a List of subtrees matching pattern. */
367 AMutableArray *subtrees = [AMutableArray arrayWithCapacity:100];
386 subtrees.add(t);
391 …itor *contextVisitor = [ANTLRVisitor newANTLRVisitor:1 Actor:self Object:tpattern Object:subtrees];
393 return subtrees;
436 /** For all subtrees that match the pattern, execute the visit action.
/external/antlr/antlr-3.4/runtime/Python/unittests/
Dtesttreewizard.py674 subtrees = wiz.find(t, "(A B)")
675 found = [str(node) for node in subtrees]
683 subtrees = wiz.find(t, wiz.getTokenType('A'))
684 found = [str(node) for node in subtrees]
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DRewriteEmptyStreamException.as30 /** Ref to ID or expr but no tokens in ID stream or subtrees in expr stream */
DRewriteRuleElementStream.as52 /** The list of tokens or subtrees we are tracking */
/external/chromium-trace/catapult/tracing/third_party/components/webcomponentsjs/
DREADME.md12 **Shadow DOM**: provides encapsulation by hiding DOM subtrees under shadow roots ([spec](https://w3…
/external/chromium-trace/catapult/third_party/polymer/components/webcomponentsjs/
DREADME.md12 **Shadow DOM**: provides encapsulation by hiding DOM subtrees under shadow roots ([spec](https://w3…
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
DTestTreeWizard.java395 final List subtrees = wiz.find(t, "(A B)"); in testFindPattern() local
396 List elements = subtrees; in testFindPattern()
/external/llvm/test/CodeGen/X86/
Dmisched-matrix.ll12 ; uniform set of bottom-up subtrees (unrolled matrix multiply).
Dswitch.ll216 ; Should pivot around 400 for two subtrees of equal size.
238 ; Should pivot around 300 for two subtrees with two jump tables each.
Dmisched-matmul.ll8 ; scheduled subtrees. However, these heuristics are marginally
/external/icu/icu4c/source/data/
Dcldr-icu-readme.txt17 # and tools (tools.zip) directory subtrees from the Data column in
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/x509/
DCertPathReviewerMessages.properties66 # exception extracting subject name when checking subtrees
/external/antlr/antlr-3.4/tool/
DCHANGES.txt428 ANTLR only sets token boundaries for subtrees returned from a rule.
461 * Added new ctor to CommonTreeNodeStream for walking subtrees. Avoids
/external/libxml2/
DChangeLog10823 and Next() operation to work on subtrees within the reader
19487 support when copying subtrees.