Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 1688) sorted by relevance

12345678910>>...68

/external/v8/test/mjsunit/tools/
Dsplaytree.js33 var tree = new SplayTree();
34 assertTrue(tree.isEmpty());
35 tree.insert(0, 'value');
36 assertFalse(tree.isEmpty());
41 var tree = new SplayTree();
42 assertArrayEquals([], tree.exportValues());
43 tree.insert(0, 'value');
44 assertArrayEquals(['value'], tree.exportValues());
45 tree.insert(0, 'value');
46 assertArrayEquals(['value'], tree.exportValues());
[all …]
/external/antlr/antlr-3.4/runtime/C/src/
Dantlr3basetree.c36 static void * getChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i);
37 static ANTLR3_UINT32 getChildCount (pANTLR3_BASE_TREE tree);
39 (pANTLR3_BASE_TREE tree);
40 static ANTLR3_UINT32 getLine (pANTLR3_BASE_TREE tree);
43 (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 type);
44 static void addChild (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child);
45 static void addChildren (pANTLR3_BASE_TREE tree, pANTLR3_LIST kids);
48 static void freshenPACIndexesAll(pANTLR3_BASE_TREE tree);
49 static void freshenPACIndexes (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 offset);
51 static void setChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child);
[all …]
Dantlr3commontree.c41 static pANTLR3_COMMON_TOKEN getToken (pANTLR3_BASE_TREE tree);
42 static pANTLR3_BASE_TREE dupNode (pANTLR3_BASE_TREE tree);
43 static ANTLR3_BOOLEAN isNilNode (pANTLR3_BASE_TREE tree);
44 static ANTLR3_UINT32 getType (pANTLR3_BASE_TREE tree);
45 static pANTLR3_STRING getText (pANTLR3_BASE_TREE tree);
46 static ANTLR3_UINT32 getLine (pANTLR3_BASE_TREE tree);
47 static ANTLR3_UINT32 getCharPositionInLine (pANTLR3_BASE_TREE tree);
48 static pANTLR3_STRING toString (pANTLR3_BASE_TREE tree);
49 static pANTLR3_BASE_TREE getParent (pANTLR3_BASE_TREE tree);
50 static void setParent (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE parent);
[all …]
/external/dbus/dbus/
Ddbus-object-tree.c94 DBusObjectTree *tree; in _dbus_object_tree_new() local
101 tree = dbus_new0 (DBusObjectTree, 1); in _dbus_object_tree_new()
102 if (tree == NULL) in _dbus_object_tree_new()
105 tree->refcount = 1; in _dbus_object_tree_new()
106 tree->connection = connection; in _dbus_object_tree_new()
107 tree->root = _dbus_object_subtree_new ("/", NULL, NULL); in _dbus_object_tree_new()
108 if (tree->root == NULL) in _dbus_object_tree_new()
110 tree->root->invoke_as_fallback = TRUE; in _dbus_object_tree_new()
112 return tree; in _dbus_object_tree_new()
115 if (tree) in _dbus_object_tree_new()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/
Dtree-rewrite.rb1010 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1014 stree = result.tree.nil? ? '' : result.tree.inspect
1024 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1028 stree = result.tree.nil? ? '' : result.tree.inspect
1038 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1041 result = walker.a.tree
1048 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1051 result = walker.a.tree
1061 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1065 stree = result.tree.nil? ? '' : result.tree.inspect
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-tree-wizard.rb95 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 = Wizard::PatternParser.parse( '(A B)', Tokens, @adaptor )
113 assert_instance_of( CommonTree, tree )
[all …]
/external/opencv3/3rdparty/libwebp/utils/
Dhuffman.c34 static int IsFull(const HuffmanTree* const tree) { in IsFull() argument
35 return (tree->num_nodes_ == tree->max_nodes_); in IsFull()
38 static void AssignChildren(HuffmanTree* const tree, in AssignChildren() argument
40 HuffmanTreeNode* const children = tree->root_ + tree->num_nodes_; in AssignChildren()
43 tree->num_nodes_ += 2; in AssignChildren()
48 static int TreeInit(HuffmanTree* const tree, int num_leaves) { in TreeInit() argument
49 assert(tree != NULL); in TreeInit()
54 tree->max_nodes_ = 2 * num_leaves - 1; in TreeInit()
55 tree->root_ = (HuffmanTreeNode*)WebPSafeMalloc((uint64_t)tree->max_nodes_, in TreeInit()
56 sizeof(*tree->root_)); in TreeInit()
[all …]
Dhuffman_encode.c148 static void SetBitDepths(const HuffmanTree* const tree, in SetBitDepths() argument
151 if (tree->pool_index_left_ >= 0) { in SetBitDepths()
152 SetBitDepths(&pool[tree->pool_index_left_], pool, bit_depths, level + 1); in SetBitDepths()
153 SetBitDepths(&pool[tree->pool_index_right_], pool, bit_depths, level + 1); in SetBitDepths()
155 bit_depths[tree->value_] = level; in SetBitDepths()
183 HuffmanTree* tree; in GenerateOptimalTree() local
201 tree = (HuffmanTree*)WebPSafeMalloc(3ULL * tree_size_orig, sizeof(*tree)); in GenerateOptimalTree()
202 if (tree == NULL) return 0; in GenerateOptimalTree()
203 tree_pool = tree + tree_size_orig; in GenerateOptimalTree()
220 tree[idx].total_count_ = count; in GenerateOptimalTree()
[all …]
/external/chromium-trace/catapult/third_party/html5lib-python/html5lib/
Dhtml5parser.py55 def __init__(self, tree=None, tokenizer=tokenizer.HTMLTokenizer, argument
72 if tree is None:
73 tree = treebuilders.getTreeBuilder("etree")
74 self.tree = tree(namespaceHTMLElements)
78 self.phases = dict([(name, cls(self, self.tree)) for name, cls in
100 self.tree.reset()
169 currentNode = self.tree.openElements[-1] if self.tree.openElements else None
179 if (len(self.tree.openElements) == 0 or
180 currentNodeNamespace == self.tree.defaultNamespace or
237 return self.tree.getDocument()
[all …]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTreeAdaptor.cs82 public virtual bool IsNil( object tree ) in IsNil() argument
84 return ( (ITree)tree ).IsNil; in IsNil()
109 public virtual object DupTree( object tree ) in DupTree() argument
111 return DupTree( tree, null ); in DupTree()
282 ITree tree = GetTree(t); in GetType()
283 if (tree == null) in GetType()
286 return tree.Type; in GetType()
296 ITree tree = GetTree(t); in GetText()
297 if (tree == null) in GetText()
300 return tree.Text; in GetText()
[all …]
DTreeIterator.cs46 protected object tree; field in Antlr.Runtime.Tree.TreeIterator
60 public TreeIterator( CommonTree tree ) in TreeIterator() argument
61 : this( new CommonTreeAdaptor(), tree ) in TreeIterator()
65 public TreeIterator( ITreeAdaptor adaptor, object tree ) in TreeIterator() argument
68 this.tree = tree; in TreeIterator()
69 this.root = tree; in TreeIterator()
102 if ( adaptor.GetChildCount( tree ) == 0 ) in MoveNext()
107 Current = tree; in MoveNext()
119 if ( tree == null ) in MoveNext()
126 if ( adaptor.GetChildCount( tree ) > 0 ) in MoveNext()
[all …]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DTreeIterator.java28 package org.antlr.runtime.tree;
44 protected Object tree; field in TreeIterator
57 public TreeIterator(Object tree) { in TreeIterator() argument
58 this(new CommonTreeAdaptor(),tree); in TreeIterator()
61 public TreeIterator(TreeAdaptor adaptor, Object tree) { in TreeIterator() argument
63 this.tree = tree; in TreeIterator()
64 this.root = tree; in TreeIterator()
73 tree = root; in reset()
80 if ( tree==null ) return false; in hasNext()
81 if ( adaptor.getChildCount(tree)>0 ) return true; in hasNext()
[all …]
/external/antlr/antlr-3.4/runtime/C/include/
Dantlr3basetree.h81 pANTLR3_COMMON_TOKEN (*getToken) (struct ANTLR3_BASE_TREE_struct * tree);
83 void (*addChild) (struct ANTLR3_BASE_TREE_struct * tree, void * child);
85 void (*addChildren) (struct ANTLR3_BASE_TREE_struct * tree, pANTLR3_LIST kids);
87 void (*createChildrenList) (struct ANTLR3_BASE_TREE_struct * tree);
89 void * (*deleteChild) (struct ANTLR3_BASE_TREE_struct * tree, ANTLR3_UINT32 i);
95 void * (*dupTree) (struct ANTLR3_BASE_TREE_struct * tree);
97 ANTLR3_UINT32 (*getCharPositionInLine) (struct ANTLR3_BASE_TREE_struct * tree);
99 void * (*getChild) (struct ANTLR3_BASE_TREE_struct * tree, ANTLR3_UINT32 i);
101 void (*setChildIndex) (struct ANTLR3_BASE_TREE_struct * tree, ANTLR3_INT32 );
103 ANTLR3_INT32 (*getChildIndex) (struct ANTLR3_BASE_TREE_struct * tree );
[all …]
/external/antlr/antlr-3.4/runtime/Python/tests/
Dt042ast.py42 r.tree.toStringTree(),
50 r.tree.toStringTree(),
58 r.tree.toStringTree(),
66 r.tree.toStringTree(),
74 r.tree.toStringTree(),
82 r.tree.toStringTree(),
90 r.tree.toStringTree(),
98 r.tree.toStringTree(),
106 r.tree.toStringTree(),
114 r.tree.toStringTree(),
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Dwizard.rb341 def index( tree, map = {} ) argument
342 tree or return( map )
343 type = @adaptor.type_of( tree )
345 elements << tree
346 @adaptor.each_child( tree ) { | child | index( child, map ) }
350 def find( tree, what ) argument
352 when Integer then find_token_type( tree, what )
353 when String then find_pattern( tree, what )
354 when Symbol then find_token_type( tree, @token_scheme[ what ] )
359 def find_token_type( tree, type ) argument
[all …]
/external/boringssl/src/crypto/x509v3/
Dpcy_tree.c101 static void tree_print(char *str, X509_POLICY_TREE *tree, in tree_print() argument
110 curr = tree->levels + tree->nlevel; in tree_print()
114 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); in tree_print()
115 for (plev = tree->levels; plev != curr; plev++) in tree_print()
118 plev - tree->levels, plev->flags); in tree_print()
151 X509_POLICY_TREE *tree; in tree_init() local
227 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE)); in tree_init()
229 if (!tree) in tree_init()
232 tree->flags = 0; in tree_init()
233 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); in tree_init()
[all …]
/external/opencv3/3rdparty/libjasper/
Djpc_tagtree.c102 jpc_tagtree_t *tree; in jpc_tagtree_create() local
111 if (!(tree = jpc_tagtree_alloc())) { in jpc_tagtree_create()
114 tree->numleafsh_ = numleafsh; in jpc_tagtree_create()
115 tree->numleafsv_ = numleafsv; in jpc_tagtree_create()
124 tree->numnodes_ += n; in jpc_tagtree_create()
128 if (!(tree->nodes_ = jas_alloc2(tree->numnodes_, sizeof(jpc_tagtreenode_t)))) { in jpc_tagtree_create()
134 node = tree->nodes_; in jpc_tagtree_create()
135 parentnode = &tree->nodes_[tree->numleafsh_ * tree->numleafsv_]; in jpc_tagtree_create()
162 jpc_tagtree_reset(tree); in jpc_tagtree_create()
164 return tree; in jpc_tagtree_create()
[all …]
/external/jemalloc/test/unit/
Drb.c47 tree_t tree; in TEST_BEGIN() local
50 tree_new(&tree); in TEST_BEGIN()
52 assert_true(tree_empty(&tree), "Tree should be empty"); in TEST_BEGIN()
53 assert_ptr_null(tree_first(&tree), "Unexpected node"); in TEST_BEGIN()
54 assert_ptr_null(tree_last(&tree), "Unexpected node"); in TEST_BEGIN()
58 assert_ptr_null(tree_search(&tree, &key), "Unexpected node"); in TEST_BEGIN()
62 assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node"); in TEST_BEGIN()
66 assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node"); in TEST_BEGIN()
115 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb() argument
123 search_node = tree_search(tree, node); in tree_iterate_cb()
[all …]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DTreeIterator.cs44 protected object tree; field in Antlr.Runtime.Tree.TreeIterator
57 public TreeIterator(object tree) in TreeIterator() argument
58 : this(new CommonTreeAdaptor(), tree) { in TreeIterator()
61 public TreeIterator(ITreeAdaptor adaptor, object tree) { in TreeIterator() argument
63 this.tree = tree; in TreeIterator()
64 this.root = tree; in TreeIterator()
93 if (adaptor.GetChildCount(tree) == 0) { in MoveNext()
97 Current = tree; in MoveNext()
104 if (tree == null) { in MoveNext()
108 if (adaptor.GetChildCount(tree) > 0) { in MoveNext()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/
Dtrace-event-listener.rb52 def consume_node( tree ) argument
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 ) argument
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 )
62 def flat_node( tree ) argument
63 record '(%s): unique_id=%s', __method__, @adaptor.unique_id( tree )
66 def create_node( tree, token = nil ) argument
68 record '(%s): unique_id=%s text=%p type=%s[%s]', __method__, @adaptor.unique_id( tree ),
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/tree/
DANTLRCommonTreeTest.m21 ANTLRCommonTree *tree = [ANTLRCommonTree newTree];
22 STAssertNotNil(tree, @"Tree was nil");
29 ANTLRCommonTree *tree = [ANTLRCommonTree newTree];
30 STAssertNotNil(tree, @"Tree was nil");
31 if (tree != nil)
32 …STAssertEquals([tree getType], (NSInteger)ANTLRTokenTypeInvalid, @"Tree should have an invalid tok…
33 // [tree release];
43 ANTLRCommonTree *tree = [ANTLRCommonTree newTreeWithToken:token];
44 STAssertNotNil(tree, @"Tree was nil");
45 if (tree != nil)
[all …]
/external/libvpx/libvpx/vp9/encoder/
Dvp9_treewriter.c13 static void tree2tok(struct vp9_token *tokens, const vpx_tree_index *tree, in tree2tok() argument
19 const vpx_tree_index j = tree[i++]; in tree2tok()
24 tree2tok(tokens, tree, j, v, l); in tree2tok()
30 const vpx_tree_index *tree) { in vp9_tokens_from_tree() argument
31 tree2tok(tokens, tree, 0, 0, 0); in vp9_tokens_from_tree()
34 static unsigned int convert_distribution(unsigned int i, vpx_tree tree, in convert_distribution() argument
39 if (tree[i] <= 0) in convert_distribution()
40 left = num_events[-tree[i]]; in convert_distribution()
42 left = convert_distribution(tree[i], tree, branch_ct, num_events); in convert_distribution()
44 if (tree[i + 1] <= 0) in convert_distribution()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb359 def set_child( index, tree ) argument
360 return if tree.nil?
361 tree.flat_list? and raise ArgumentError, "Can't set single child to a list"
362 tree.parent = self
363 tree.child_index = index
364 self[ index ] = tree
690 def add_child( tree, child ) argument
691 tree.add_child( child ) if tree and child
694 def child_count( tree ) argument
695 tree.child_count
[all …]
Ddot.rb91 def self.generate( tree, adaptor = nil, tree_template = TREE_TEMPLATE, argument
93 new.to_dot( tree, adaptor, tree_template, edge_template )
105 def to_dot( tree, adaptor = nil, tree_template = TREE_TEMPLATE, argument
110 define_nodes( tree, adaptor, tree_template )
113 define_edges( tree, adaptor, tree_template, edge_template )
117 def define_nodes( tree, adaptor, tree_template, known_nodes = nil ) argument
119 tree.nil? and return
120 n = adaptor.child_count( tree )
122 number = node_number( tree )
130 child = adaptor.child_of( tree, index )
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
DSimpleCParser.h50 ANTLRCommonTree *tree; // start of memVars() variable
54 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
64 ANTLRCommonTree *tree; // start of memVars() variable
68 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
78 ANTLRCommonTree *tree; // start of memVars() variable
82 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
92 ANTLRCommonTree *tree; // start of memVars() variable
96 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
106 ANTLRCommonTree *tree; // start of memVars() variable
110 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
[all …]

12345678910>>...68