Searched refs:tree (Results 51 - 75 of 1842) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DRewriteRuleSubtreeStream.js1 org.antlr.runtime.tree.RewriteRuleSubtreeStream = function() {
2 var sup = org.antlr.runtime.tree.RewriteRuleSubtreeStream.superclass;
6 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteRuleSubtreeStream,
7 org.antlr.runtime.tree.RewriteRuleElementStream, {
10 * tree root node. Also prevents us from duplicating recently-added
14 * Referencing a rule result twice is ok; dup entire tree as
19 * and super.next() doesn't know which to call: dup node or dup tree.
H A DRewriteRuleTokenStream.js1 org.antlr.runtime.tree.RewriteRuleTokenStream = function(adaptor, elementDescription, el) {
2 var sup = org.antlr.runtime.tree.RewriteRuleTokenStream.superclass;
6 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteRuleTokenStream,
7 org.antlr.runtime.tree.RewriteRuleElementStream, {
18 /** Don't convert to a tree unless they explicitly call nextTree.
19 * This way we can do hetero tree nodes in rewrite.
H A DRewriteCardinalityException.js1 org.antlr.runtime.tree.RewriteCardinalityException = function(elementDescription) {
9 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteCardinalityException, Error, {
17 return "org.antlr.runtime.tree.RewriteCardinalityException";
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DTransformSourceLibxslt.cpp30 #include <libxml/tree.h>
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dasm-tree-3.3.jar ... AnnotationNode.class " package org.objectweb.asm.tree public org.objectweb.asm.tree.AnnotationNode ...
/external/jemalloc/test/unit/
H A Drb.c33 * Duplicates are not allowed in the tree, so force an
47 tree_t tree; local
50 tree_new(&tree);
52 assert_ptr_null(tree_first(&tree), "Unexpected node");
53 assert_ptr_null(tree_last(&tree), "Unexpected node");
57 assert_ptr_null(tree_search(&tree, &key), "Unexpected node");
61 assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node");
65 assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node");
109 tree_iterate_cb(tree_t *tree, node_t *node, void *data) argument
117 search_node = tree_search(tree, nod
137 tree_iterate(tree_t *tree) argument
148 tree_iterate_reverse(tree_t *tree) argument
159 node_remove(tree_t *tree, node_t *node, unsigned nnodes) argument
193 remove_iterate_cb(tree_t *tree, node_t *node, void *data) argument
204 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) argument
221 tree_t tree; local
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/
H A Dtrace-event-listener.rb52 def consume_node( tree )
53 record '(%s) unique_id=%s text=%p type=%s[%s]', __method__, @adaptor.unique_id( tree ),
54 @adaptor.text_of( tree ), @adaptor.type_name( tree ), @adaptor.type_of( tree )
57 def look( i, tree )
58 record '(%s): k=%s unique_id=%s text=%p type=%s[%s]', __method__, i, @adaptor.unique_id( tree ),
59 @adaptor.text_of( tree ), @adaptor.type_name( tree ), @adaptor.type_of( tree )
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
H A Dtest-tree-wizard.rb5 require 'antlr3/tree/wizard'
95 tree = Wizard::PatternParser.parse( 'ID', Tokens, @adaptor )
97 assert_instance_of(CommonTree, tree)
98 assert_equal( ID, tree.type )
99 assert_equal( 'ID', tree.text )
103 tree = Wizard::PatternParser.parse( 'ID[foo]', Tokens, @adaptor )
105 assert_instance_of( CommonTree, tree )
106 assert_equal( ID, tree.type )
107 assert_equal( 'foo', tree.text )
111 tree
[all...]
/external/chromium_org/third_party/libaddressinput/src/cpp/test/
H A Dregion_data_builder_test.cc67 const RegionData& tree = builder_.Build("US", "en-US", &best_language_); local
68 EXPECT_FALSE(tree.sub_regions().empty());
73 const RegionData& tree = builder_.Build("CN", "zh-Hans", &best_language_); local
74 ASSERT_FALSE(tree.sub_regions().empty());
75 EXPECT_FALSE(tree.sub_regions().front()->sub_regions().empty());
80 const RegionData& tree = builder_.Build("CH", "de-CH", &best_language_); local
82 // administrative area field is not used, which results in an empty tree of
84 EXPECT_TRUE(tree.sub_regions().empty());
89 const RegionData& tree = builder_.Build("ZW", "en-ZW", &best_language_); local
90 EXPECT_TRUE(tree
95 const RegionData& tree = builder_.Build("US", "en-US", &best_language_); local
105 const RegionData& tree = builder_.Build("KR", "ko-Latn", &best_language_); local
116 const RegionData& tree = builder_.Build("KR", "ko-KR", &best_language_); local
[all...]
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DRewriteEarlyExitException.as28 package org.antlr.runtime.tree {
H A DRewriteEmptyStreamException.as28 package org.antlr.runtime.tree
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
H A DMismatchedTreeNodeException.java30 import org.antlr.runtime.tree.TreeNodeStream;
31 import org.antlr.runtime.tree.Tree;
/external/chromium_org/tools/git/
H A Dpost-merge9 if git diff-tree ORIG_HEAD HEAD | grep -qs $'\tDEPS$'; then
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_treewriter.h6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
20 void vp9_tree_probs_from_distribution(vp9_tree tree,
31 static INLINE void vp9_write_tree(vp9_writer *w, const vp9_tree_index *tree, argument
37 i = tree[i + bit];
41 static INLINE void vp9_write_token(vp9_writer *w, const vp9_tree_index *tree, argument
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_treewriter.h6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
20 void vp9_tree_probs_from_distribution(vp9_tree tree,
31 static INLINE void vp9_write_tree(vp9_writer *w, const vp9_tree_index *tree, argument
37 i = tree[i + bit];
41 static INLINE void vp9_write_token(vp9_writer *w, const vp9_tree_index *tree, argument
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
/external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/
H A Dtgt.h45 @brief Implementation of a tag-tree coder (TGT)
47 The functions in TGT.C have for goal to realize a tag-tree coder. The functions in TGT.C
51 /** @defgroup TGT TGT - Implementation of a tag-tree coder */
65 Tag tree
81 Create a tag-tree
82 @param numleafsh Width of the array of leafs of the tree
83 @param numleafsv Height of the array of leafs of the tree
84 @return Returns a new tag-tree if successful, returns NULL otherwise
89 * Reinitialises a tag-tree from an exixting one.
91 * @param p_tree the tree t
[all...]
H A Dtgt.c44 Tag-tree coder interface
54 opj_tgt_tree_t *tree = 00; local
60 tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t));
61 if(!tree) {
62 fprintf(stderr, "ERROR in tgt_create while allocating tree\n");
65 memset(tree,0,sizeof(opj_tgt_tree_t));
67 tree->numleafsh = numleafsh;
68 tree->numleafsv = numleafsv;
73 tree->numnodes = 0;
78 tree
253 opj_tgt_setvalue(opj_tgt_tree_t *tree, OPJ_UINT32 leafno, OPJ_INT32 value) argument
262 opj_tgt_encode(opj_bio_t *bio, opj_tgt_tree_t *tree, OPJ_UINT32 leafno, OPJ_INT32 threshold) argument
302 opj_tgt_decode(opj_bio_t *bio, opj_tgt_tree_t *tree, OPJ_UINT32 leafno, OPJ_INT32 threshold) argument
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/
H A Dpcy_tree.c68 /* Enable this to print out the complete policy tree at various point during
99 static void tree_print(char *str, X509_POLICY_TREE *tree, argument
108 curr = tree->levels + tree->nlevel;
112 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
113 for (plev = tree->levels; plev != curr; plev++)
116 plev - tree->levels, plev->flags);
137 /* Initialize policy tree. Return values:
141 * 2 Policy tree is empty.
149 X509_POLICY_TREE *tree; local
377 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
405 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
445 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
507 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
589 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument
636 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument
700 tree_evaluate(X509_POLICY_TREE *tree) argument
732 X509_policy_tree_free(X509_POLICY_TREE *tree) argument
777 X509_POLICY_TREE *tree = NULL; local
[all...]
/external/openssl/crypto/x509v3/
H A Dpcy_tree.c65 /* Enable this to print out the complete policy tree at various point during
96 static void tree_print(char *str, X509_POLICY_TREE *tree, argument
105 curr = tree->levels + tree->nlevel;
109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
110 for (plev = tree->levels; plev != curr; plev++)
113 plev - tree->levels, plev->flags);
134 /* Initialize policy tree. Return values:
138 * 2 Policy tree is empty.
146 X509_POLICY_TREE *tree; local
374 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
402 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
442 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
504 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
586 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument
632 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument
696 tree_evaluate(X509_POLICY_TREE *tree) argument
728 X509_policy_tree_free(X509_POLICY_TREE *tree) argument
773 X509_POLICY_TREE *tree = NULL; local
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/net/
H A Dlayouttestresults.py41 def for_each_test(tree, handler, prefix=''):
42 for key in tree:
44 if 'actual' not in tree[key]:
45 for_each_test(tree[key], handler, new_prefix)
47 handler(new_prefix, tree[key])
50 def result_for_test(tree, test):
53 if part not in tree:
55 tree = tree[part]
56 return tree
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
H A DSimpleCParser.h68 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
72 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
87 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
91 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
106 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
110 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
125 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
129 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
144 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
148 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
163 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
167 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
182 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
186 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
201 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
205 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
220 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
224 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
239 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
243 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
258 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
262 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
277 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
281 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
296 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
300 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
315 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
319 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
334 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
338 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
H A DSimpleCParser.h50 ANTLRCommonTree *tree; // start of memVars() variable
54 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
64 ANTLRCommonTree *tree; // start of memVars() variable
68 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
78 ANTLRCommonTree *tree; // start of memVars() variable
82 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
92 ANTLRCommonTree *tree; // start of memVars() variable
96 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
106 ANTLRCommonTree *tree; // start of memVars() variable
110 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
120 ANTLRCommonTree *tree; // start of memVars() variable
124 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
134 ANTLRCommonTree *tree; // start of memVars() variable
138 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
148 ANTLRCommonTree *tree; // start of memVars() variable
152 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
162 ANTLRCommonTree *tree; // start of memVars() variable
166 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
176 ANTLRCommonTree *tree; // start of memVars() variable
180 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
190 ANTLRCommonTree *tree; // start of memVars() variable
194 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
204 ANTLRCommonTree *tree; // start of memVars() variable
208 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
218 ANTLRCommonTree *tree; // start of memVars() variable
222 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
232 ANTLRCommonTree *tree; // start of memVars() variable
236 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
246 ANTLRCommonTree *tree; // start of memVars() variable
250 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
[all...]
/external/chromium_org/third_party/skia/tests/
H A DBBoxHierarchyTest.cpp76 SkBBoxHierarchy& tree) {
80 tree.search(query, &hits);
85 static void tree_test_main(SkBBoxHierarchy* tree, int minChildren, int maxChildren, argument
89 REPORTER_ASSERT(reporter, tree);
117 tree->insert(rects[i].data, rects[i].rect, true);
119 tree->flushDeferredInserts();
120 run_queries(reporter, rand, rects, *tree);
121 REPORTER_ASSERT(reporter, NUM_RECTS == tree->getCount());
123 ((expectedDepthMin <= 0) || (expectedDepthMin <= tree->getDepth())) &&
124 ((expectedDepthMax <= 0) || (expectedDepthMax >= tree
75 run_queries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[], SkBBoxHierarchy& tree) argument
[all...]
/external/skia/tests/
H A DBBoxHierarchyTest.cpp76 SkBBoxHierarchy& tree) {
80 tree.search(query, &hits);
85 static void tree_test_main(SkBBoxHierarchy* tree, int minChildren, int maxChildren, argument
89 REPORTER_ASSERT(reporter, NULL != tree);
117 tree->insert(rects[i].data, rects[i].rect, true);
119 tree->flushDeferredInserts();
120 run_queries(reporter, rand, rects, *tree);
121 REPORTER_ASSERT(reporter, NUM_RECTS == tree->getCount());
123 ((expectedDepthMin <= 0) || (expectedDepthMin <= tree->getDepth())) &&
124 ((expectedDepthMax <= 0) || (expectedDepthMax >= tree
75 run_queries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[], SkBBoxHierarchy& tree) argument
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DDOTTreeGenerator.java28 package org.antlr.runtime.tree;
36 * can pass in any kind of tree or use Tree interface method.
38 * ST just to use the org.antlr.runtime.tree.* package.
47 * Tree t = (Tree)r.tree;
79 public StringTemplate toDOT(Object tree, argument
86 toDOTDefineNodes(tree, adaptor, treeST);
88 toDOTDefineEdges(tree, adaptor, treeST);
90 if ( adaptor.getChildCount(tree)==0 ) {
92 treeST.add("nodes", adaptor.getText(tree));
98 public StringTemplate toDOT(Object tree, argument
121 toDOT(Tree tree) argument
125 toDOTDefineNodes(Object tree, TreeAdaptor adaptor, StringTemplate treeST) argument
152 toDOTDefineEdges(Object tree, TreeAdaptor adaptor, StringTemplate treeST) argument
[all...]

Completed in 3046 milliseconds

1234567891011>>