Home
last modified time | relevance | path

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

12345678910>>...93

/external/chromium_org/net/spdy/
Dspdy_priority_tree_test.cc17 explicit SpdyPriorityTreePeer(SpdyPriorityTree<NodeId>* tree) : tree_(tree) {} in SpdyPriorityTreePeer() argument
28 SpdyPriorityTree<uint32> tree; in TEST() local
29 EXPECT_EQ(1, tree.num_nodes()); in TEST()
30 EXPECT_TRUE(tree.NodeExists(0)); in TEST()
31 EXPECT_FALSE(tree.NodeExists(1)); in TEST()
33 EXPECT_TRUE(tree.AddNode(1, 0, 100, false)); in TEST()
34 EXPECT_EQ(2, tree.num_nodes()); in TEST()
35 ASSERT_TRUE(tree.NodeExists(1)); in TEST()
36 EXPECT_EQ(100, tree.GetWeight(1)); in TEST()
37 EXPECT_FALSE(tree.NodeExists(5)); in TEST()
[all …]
/external/chromium_org/third_party/WebKit/Source/platform/
DPODRedBlackTreeTest.cpp49 PODRedBlackTree<int> tree(arena); in TEST() local
52 tree.add(i); in TEST()
60 PODRedBlackTree<int> tree; in TEST() local
61 tree.add(5); in TEST()
62 ASSERT_TRUE(tree.checkInvariants()); in TEST()
63 EXPECT_TRUE(tree.contains(5)); in TEST()
68 PODRedBlackTree<int> tree; in TEST() local
69 tree.add(4); in TEST()
70 ASSERT_TRUE(tree.checkInvariants()); in TEST()
71 EXPECT_TRUE(tree.contains(4)); in TEST()
[all …]
DPODIntervalTreeTest.cpp60 PODIntervalTree<float> tree; in TEST() local
61 tree.add(PODInterval<float>(2, 4)); in TEST()
62 ASSERT_TRUE(tree.checkInvariants()); in TEST()
67 PODIntervalTree<float> tree; in TEST() local
68 tree.add(PODInterval<float>(2, 4)); in TEST()
69 ASSERT_TRUE(tree.checkInvariants()); in TEST()
70 Vector<PODInterval<float> > result = tree.allOverlaps(PODInterval<float>(1, 3)); in TEST()
78 PODIntervalTree<float> tree; in TEST() local
79 tree.add(PODInterval<float>(1, 2.5)); in TEST()
80 tree.add(PODInterval<float>(3.5, 5)); in TEST()
[all …]
/external/chromium_org/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/skia/tests/
DGrRedBlackTreeTest.cpp18 Tree tree; in DEF_TEST() local
26 Tree::Iter xi = tree.insert(x); in DEF_TEST()
31 tree.insert(0); in DEF_TEST()
33 tree.insert(99); in DEF_TEST()
35 REPORTER_ASSERT(reporter, *tree.begin() == 0); in DEF_TEST()
36 REPORTER_ASSERT(reporter, *tree.last() == 99); in DEF_TEST()
37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin()); in DEF_TEST()
38 REPORTER_ASSERT(reporter, --tree.end() == tree.last()); in DEF_TEST()
39 REPORTER_ASSERT(reporter, tree.count() == 10002); in DEF_TEST()
44 for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) { in DEF_TEST()
[all …]
/external/chromium_org/third_party/skia/tests/
DGrRedBlackTreeTest.cpp18 Tree tree; in DEF_TEST() local
26 Tree::Iter xi = tree.insert(x); in DEF_TEST()
31 tree.insert(0); in DEF_TEST()
33 tree.insert(99); in DEF_TEST()
35 REPORTER_ASSERT(reporter, *tree.begin() == 0); in DEF_TEST()
36 REPORTER_ASSERT(reporter, *tree.last() == 99); in DEF_TEST()
37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin()); in DEF_TEST()
38 REPORTER_ASSERT(reporter, --tree.end() == tree.last()); in DEF_TEST()
39 REPORTER_ASSERT(reporter, tree.count() == 10002); in DEF_TEST()
44 for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) { in DEF_TEST()
[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/chromium_org/third_party/libwebp/utils/
Dhuffman.c38 static int IsFull(const HuffmanTree* const tree) { in IsFull() argument
39 return (tree->num_nodes_ == tree->max_nodes_); in IsFull()
42 static void AssignChildren(HuffmanTree* const tree, in AssignChildren() argument
44 HuffmanTreeNode* const children = tree->root_ + tree->num_nodes_; in AssignChildren()
47 tree->num_nodes_ += 2; in AssignChildren()
58 static int HuffmanTreeAllocate(HuffmanTree* const tree, int num_nodes) { in HuffmanTreeAllocate() argument
59 assert(tree != NULL); in HuffmanTreeAllocate()
60 tree->root_ = in HuffmanTreeAllocate()
61 (HuffmanTreeNode*)WebPSafeMalloc(num_nodes, sizeof(*tree->root_)); in HuffmanTreeAllocate()
62 return (tree->root_ != NULL); in HuffmanTreeAllocate()
[all …]
/external/webp/src/utils/
Dhuffman.c38 static int IsFull(const HuffmanTree* const tree) { in IsFull() argument
39 return (tree->num_nodes_ == tree->max_nodes_); in IsFull()
42 static void AssignChildren(HuffmanTree* const tree, in AssignChildren() argument
44 HuffmanTreeNode* const children = tree->root_ + tree->num_nodes_; in AssignChildren()
47 tree->num_nodes_ += 2; in AssignChildren()
58 static int HuffmanTreeAllocate(HuffmanTree* const tree, int num_nodes) { in HuffmanTreeAllocate() argument
59 assert(tree != NULL); in HuffmanTreeAllocate()
60 tree->root_ = in HuffmanTreeAllocate()
61 (HuffmanTreeNode*)WebPSafeMalloc(num_nodes, sizeof(*tree->root_)); in HuffmanTreeAllocate()
62 return (tree->root_ != NULL); in HuffmanTreeAllocate()
[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/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/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/chromium_org/third_party/cython/src/Cython/Tests/
DTestStringIOTree.py29 self.tree = stringtree.StringIOTree()
32 assert not self.tree.allmarkers()
36 line_4_to_6_insertion_point = self.tree.insertion_point()
38 line_9_to_13_insertion_point = self.tree.insertion_point()
42 self.write_lines((5, 6), tree=line_4_to_6_insertion_point)
46 self.write_line(13, tree=line_9_to_13_insertion_point)
48 self.write_line(4, tree=line_4_insertion_point)
49 self.write_line(9, tree=line_9_to_12_insertion_point)
51 self.write_line(11, tree=line_9_to_12_insertion_point)
52 self.write_line(10, tree=line_10_insertion_point)
[all …]
/external/chromium_org/ui/webui/resources/css/
Dtree.css5 tree { selector
11 .tree-item > .tree-row {
27 background-image: -webkit-canvas(tree-triangle);
44 .tree-item[expanded] > .tree-row > .expand-icon {
46 background-image: -webkit-canvas(tree-triangle);
50 .tree-row .expand-icon {
54 .tree-row[may-have-children] .expand-icon {
58 .tree-row[has-children=false] .expand-icon {
62 .tree-row:hover {
69 WebKit has a bug with attribute selectors so we apply selected to the tree row
[all …]
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/
Dpcy_tree.c99 static void tree_print(char *str, X509_POLICY_TREE *tree, in tree_print() argument
108 curr = tree->levels + tree->nlevel; in tree_print()
112 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); in tree_print()
113 for (plev = tree->levels; plev != curr; plev++) in tree_print()
116 plev - tree->levels, plev->flags); in tree_print()
149 X509_POLICY_TREE *tree; in tree_init() local
225 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE)); in tree_init()
227 if (!tree) in tree_init()
230 tree->flags = 0; in tree_init()
231 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); in tree_init()
[all …]
/external/openssl/crypto/x509v3/
Dpcy_tree.c96 static void tree_print(char *str, X509_POLICY_TREE *tree, in tree_print() argument
105 curr = tree->levels + tree->nlevel; in tree_print()
109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); in tree_print()
110 for (plev = tree->levels; plev != curr; plev++) in tree_print()
113 plev - tree->levels, plev->flags); in tree_print()
146 X509_POLICY_TREE *tree; in tree_init() local
222 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE)); in tree_init()
224 if (!tree) in tree_init()
227 tree->flags = 0; in tree_init()
228 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); in tree_init()
[all …]
/external/jemalloc/test/unit/
Drb.c47 tree_t tree; in TEST_BEGIN() local
50 tree_new(&tree); in TEST_BEGIN()
52 assert_ptr_null(tree_first(&tree), "Unexpected node"); in TEST_BEGIN()
53 assert_ptr_null(tree_last(&tree), "Unexpected node"); in TEST_BEGIN()
57 assert_ptr_null(tree_search(&tree, &key), "Unexpected node"); in TEST_BEGIN()
61 assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node"); in TEST_BEGIN()
65 assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node"); in TEST_BEGIN()
109 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb() argument
117 search_node = tree_search(tree, node); in tree_iterate_cb()
122 search_node = tree_nsearch(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 …]

12345678910>>...93