/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
RewriteEmptyStreamException.js | 1 /** Ref to ID or expr but no tokens in ID stream or subtrees in expr stream */
|
/external/bouncycastle/src/main/java/org/bouncycastle/asn1/x509/ |
NameConstraints.java | 44 * Permitted subtrees 46 * Excludes subtrees
|
GeneralSubtree.java | 15 * Class for containing a restriction object subtrees in NameConstraints. See
|
/external/guava/guava/src/com/google/common/collect/ |
BstBalancePolicy.java | 32 * subtrees {@code left} and {@code right}. It is guaranteed that the resulting tree will have 39 * Constructs a locally balanced tree around the subtrees {@code left} and {@code right}. It is
|
/external/apache-harmony/security/src/test/impl/java.injected/java/security/cert/ |
X509CertSelectorTest.java | 1789 GeneralSubtrees subtrees = new GeneralSubtrees(); local 1941 GeneralSubtrees subtrees = new GeneralSubtrees(); local 2332 GeneralSubtrees subtrees; local 2448 GeneralSubtrees subtrees; local 2565 GeneralSubtrees subtrees; local [all...] |
/external/dbus/dbus/ |
dbus-object-tree.c | 77 DBusObjectSubtree **subtrees; /**< Child nodes */ member in struct:DBusObjectSubtree 79 int max_subtrees; /**< Number of allocated entries in subtrees */ 199 v = strcmp (path[0], subtree->subtrees[k]->name); 203 path[0], subtree->subtrees[k]->name, 221 next = find_subtree_recurse (subtree->subtrees[k], 239 return find_subtree_recurse (subtree->subtrees[k], 280 new_subtrees = dbus_realloc (subtree->subtrees, 287 subtree->subtrees = new_subtrees; 298 memmove (&subtree->subtrees[child_pos+1], 299 &subtree->subtrees[child_pos], [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
RewriteEmptyStreamException.as | 30 /** Ref to ID or expr but no tokens in ID stream or subtrees in expr stream */
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
RewriteEmptyStreamException.java | 30 /** Ref to ID or expr but no tokens in ID stream or subtrees in expr stream */
|
TreeWizard.java | 51 * match subtrees against it. 210 /** Return a List of subtrees matching pattern. */ 212 final List subtrees = new ArrayList(); local 229 subtrees.add(t); 233 return subtrees; 268 /** For all subtrees that match the pattern, execute the visit action.
|
TreeFilter.java | 67 we need to reduce multiply-by-zero subtrees on the way up (postorder).
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
RewriteEmptyStreamException.cs | 38 /** <summary>Ref to ID or expr but no tokens in ID stream or subtrees in expr stream</summary> */
|
TreeWizard.cs | 61 * match subtrees against it. 253 public FindTreeWizardContextVisitor(TreeWizard outer, TreePattern tpattern, IList subtrees) { 256 _subtrees = subtrees; 273 /** <summary>Return a List of subtrees matching pattern.</summary> */ 275 IList subtrees = new List<object>(); 288 Visit(t, rootTokenType, new FindTreeWizardContextVisitor(this, tpattern, subtrees)); 289 return subtrees; 353 * For all subtrees that match the pattern, execute the visit action.
|
TreeFilter.cs | 71 we need to reduce multiply-by-zero subtrees on the way up (postorder).
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
RewriteEmptyStreamException.cs | 39 /** <summary>Ref to ID or expr but no tokens in ID stream or subtrees in expr stream</summary> */
|
TreeWizard.cs | 62 * match subtrees against it. 289 public FindTreeWizardContextVisitor( TreeWizard outer, TreePattern tpattern, IList subtrees ) 293 _subtrees = subtrees; 313 /** <summary>Return a List of subtrees matching pattern.</summary> */ 316 IList subtrees = new List<object>(); 330 Visit( t, rootTokenType, new FindTreeWizardContextVisitor( this, tpattern, subtrees ) ); 331 return subtrees; 407 * For all subtrees that match the pattern, execute the visit action.
|
/external/mesa3d/src/glsl/ |
opt_if_simplification.cpp | 59 * FINISHME: in a constant before processing both of the other subtrees.
|
/libcore/luni/src/main/java/org/apache/harmony/security/x509/ |
GeneralSubtrees.java | 59 * Returns the list of values of subtrees.
|
/external/v8/test/mjsunit/compiler/ |
expression-trees.js | 41 // Split the leaves into left and right subtrees in all possible 42 // ways. For each split recursively compute all possible subtrees.
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRTreeWizard.m | 80 [(AMutableArray *)object2/* subtrees */ addObject:t]; 364 /** Return a List of subtrees matching pattern. */ 367 AMutableArray *subtrees = [AMutableArray arrayWithCapacity:100]; 386 subtrees.add(t); 391 ANTLRVisitor *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/antlr3/ |
treewizard.py | 319 match subtrees against it. 431 """Return a List of subtrees matching pattern.""" 433 subtrees = [] 449 subtrees.append(tree) 453 return subtrees 460 subtrees will be visited. 498 For all subtrees that match the pattern, execute the visit action.
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
test-tree-wizard.rb | 484 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/ |
wizard.rb | 366 subtrees = [] 367 visit_pattern( tree, pattern ) { | t, | subtrees << t } 368 return( subtrees )
|
/external/openssl/crypto/x509v3/ |
v3_ncons.c | 300 /* Permitted subtrees: if any subtrees exist of matching the type 326 /* Excluded subtrees: must not match any of these */
|
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3rewritestreams.h | 74 /// The list of tokens or subtrees we are tracking
|
/external/antlr/antlr-3.4/runtime/Python/unittests/ |
testtreewizard.py | 674 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]
|