Searched refs:tree (Results 1 - 25 of 1842) sorted by relevance

1234567891011>>

/external/chromium_org/v8/test/mjsunit/tools/
H A Dsplaytree.js28 // Load the Splay tree implementation from <project root>/tools.
33 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
[all...]
/external/chromium_org/net/spdy/
H A Dspdy_priority_tree_test.cc17 explicit SpdyPriorityTreePeer(SpdyPriorityTree<NodeId>* tree) : tree_(tree) {} argument
28 SpdyPriorityTree<uint32> tree; local
29 EXPECT_EQ(1, tree.num_nodes());
30 EXPECT_TRUE(tree.NodeExists(0));
31 EXPECT_FALSE(tree.NodeExists(1));
33 EXPECT_TRUE(tree.AddNode(1, 0, 100, false));
34 EXPECT_EQ(2, tree.num_nodes());
35 ASSERT_TRUE(tree.NodeExists(1));
36 EXPECT_EQ(100, tree
78 SpdyPriorityTree<uint32> tree; local
131 SpdyPriorityTree<uint32> tree; local
271 SpdyPriorityTree<uint32> tree; local
374 SpdyPriorityTree<uint32> tree; local
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DTreeExtensions.cs39 public static ITree getNextSibling( this ITree tree )
41 return tree.Parent.GetChild( tree.ChildIndex + 1 );
45 public static void setFirstChild( this ITree tree, ITree child ) argument
47 if ( tree.ChildCount == 0 )
48 tree.AddChild( child );
50 tree.SetChild( 0, child );
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DTree.js1 /** What does a tree look like? ANTLR has a number of support classes
6 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
9 * This is a tree node without any payload; just navigation and factory stuff.
11 org.antlr.runtime.tree.Tree = function(){};
H A DRewriteEmptyStreamException.js2 org.antlr.runtime.tree.RewriteEmptyStreamException = function(elementDescription) {
3 var sup = org.antlr.runtime.tree.RewriteEmptyStreamException.superclass;
7 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteEmptyStreamException,
8 org.antlr.runtime.tree.RewriteCardinalityException, {
10 return "org.antlr.runtime.tree.RewriteEmptyStreamException";
/external/chromium_org/third_party/WebKit/Source/platform/
H A DPODRedBlackTreeTest.cpp26 // Tests for the red-black tree class.
49 PODRedBlackTree<int> tree(arena);
52 tree.add(i);
60 PODRedBlackTree<int> tree; local
61 tree.add(5);
62 ASSERT_TRUE(tree.checkInvariants());
63 EXPECT_TRUE(tree.contains(5));
68 PODRedBlackTree<int> tree; local
69 tree.add(4);
70 ASSERT_TRUE(tree
84 PODRedBlackTree<int> tree; local
97 PODRedBlackTree<int> tree; local
108 PODRedBlackTree<int> tree; local
135 PODRedBlackTree<int> tree; local
159 PODRedBlackTree<int> tree; local
178 PODRedBlackTree<int> tree; local
[all...]
H A DPODIntervalTreeTest.cpp26 // Tests for the interval tree class.
60 PODIntervalTree<float> tree; local
61 tree.add(PODInterval<float>(2, 4));
62 ASSERT_TRUE(tree.checkInvariants());
67 PODIntervalTree<float> tree; local
68 tree.add(PODInterval<float>(2, 4));
69 ASSERT_TRUE(tree.checkInvariants());
70 Vector<PODInterval<float> > result = tree.allOverlaps(PODInterval<float>(1, 3));
78 PODIntervalTree<float> tree; local
79 tree
101 PODIntervalTree<float, int*> tree; local
144 PODIntervalTree<float, UserData1> tree; local
154 PODIntervalTree<float, UserData1> tree; local
201 PODIntervalTree<EndpointType1> tree; local
224 PODIntervalTree<int> tree; local
297 PODIntervalTree<int> tree; local
335 PODIntervalTree<int> tree; local
[all...]
/external/chromium_org/third_party/cython/src/Cython/Tests/
H A 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
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3basetree.h2 /// Definition of the ANTLR3 base tree.
45 /// A generic tree implementation with no payload. You must subclass to
47 /// instead of the child-sibling approach in v2. A flat tree (a list) is
59 /// like to a tree node, in many cases saving the need to create their own tree
60 /// and tree adaptors. ANTLR does not use this pointer, but will copy it for you and so on.
65 /// as they belong to the common tree node that implements this.
70 /// and ascending trees as the tree walk progresses.
79 /// for the payload in the supplied tree.
81 pANTLR3_COMMON_TOKEN (*getToken) (struct ANTLR3_BASE_TREE_struct * tree);
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DTreeIterator.cs36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
44 protected object tree; field in class:Antlr.Runtime.Tree.TreeIterator
57 public TreeIterator(object tree) argument
58 : this(new CommonTreeAdaptor(), tree) {
61 public TreeIterator(ITreeAdaptor adaptor, object tree) { argument
63 this.tree = tree;
64 this.root = tree;
93 if (adaptor.GetChildCount(tree)
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreeIterator.cs37 /** Return a node stream from a doubly-linked tree whose nodes
40 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
46 protected object tree; field in class:Antlr.Runtime.Tree.TreeIterator
60 public TreeIterator( CommonTree tree )
61 : this( new CommonTreeAdaptor(), tree )
65 public TreeIterator( ITreeAdaptor adaptor, object tree )
68 this.tree = tree;
69 this.root = tree;
102 if ( adaptor.GetChildCount( tree )
[all...]
/external/chromium_org/third_party/skia/tests/
H A DGrRedBlackTreeTest.cpp18 Tree tree; local
26 Tree::Iter xi = tree.insert(x);
31 tree.insert(0);
33 tree.insert(99);
35 REPORTER_ASSERT(reporter, *tree.begin() == 0);
36 REPORTER_ASSERT(reporter, *tree.last() == 99);
37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin());
38 REPORTER_ASSERT(reporter, --tree.end() == tree
[all...]
/external/skia/tests/
H A DGrRedBlackTreeTest.cpp18 Tree tree; local
26 Tree::Iter xi = tree.insert(x);
31 tree.insert(0);
33 tree.insert(99);
35 REPORTER_ASSERT(reporter, *tree.begin() == 0);
36 REPORTER_ASSERT(reporter, *tree.last() == 99);
37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin());
38 REPORTER_ASSERT(reporter, --tree.end() == tree
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_treewriter.c6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
13 static void tree2tok(struct vp9_token *tokens, const vp9_tree_index *tree, argument
19 const vp9_tree_index j = tree[i++];
24 tree2tok(tokens, tree, j, v, l);
30 const vp9_tree_index *tree) {
31 tree2tok(tokens, tree, 0, 0, 0);
34 static unsigned int convert_distribution(unsigned int i, vp9_tree tree, argument
39 if (tree[i] <= 0)
40 left = num_events[-tree[
29 vp9_tokens_from_tree(struct vp9_token *tokens, const vp9_tree_index *tree) argument
54 vp9_tree_probs_from_distribution(vp9_tree tree, unsigned int branch_ct[ ][2], const unsigned int num_events[ ]) argument
[all...]
H A Dvp9_cost.c6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, argument
44 const vp9_tree_index ii = tree[i + b];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) { argument
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) { argument
58 assert(tree[0] <= 0 && tree[
[all...]
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_treewriter.c6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
13 static void tree2tok(struct vp9_token *tokens, const vp9_tree_index *tree, argument
19 const vp9_tree_index j = tree[i++];
24 tree2tok(tokens, tree, j, v, l);
30 const vp9_tree_index *tree) {
31 tree2tok(tokens, tree, 0, 0, 0);
34 static unsigned int convert_distribution(unsigned int i, vp9_tree tree, argument
39 if (tree[i] <= 0)
40 left = num_events[-tree[
29 vp9_tokens_from_tree(struct vp9_token *tokens, const vp9_tree_index *tree) argument
54 vp9_tree_probs_from_distribution(vp9_tree tree, unsigned int branch_ct[ ][2], const unsigned int num_events[ ]) argument
[all...]
H A Dvp9_cost.c6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, argument
44 const vp9_tree_index ii = tree[i + b];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) { argument
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) { argument
58 assert(tree[0] <= 0 && tree[
[all...]
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/
H A DValue.java30 package org.mockito.asm.tree.analysis;
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeIterator.java28 package org.antlr.runtime.tree;
36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
44 protected Object tree; field in class:TreeIterator
57 public TreeIterator(Object tree) { argument
58 this(new CommonTreeAdaptor(),tree);
61 public TreeIterator(TreeAdaptor adaptor, Object tree) { argument
63 this.tree = tree;
64 this.root = tree;
[all...]
/external/chromium_org/ui/file_manager/file_manager/foreground/css/
H A Dtree.css7 tree {
13 .tree-item > .tree-row {
23 background-image: -webkit-canvas(tree-triangle);
37 .tree-item[expanded] > .tree-row > .expand-icon {
39 background-image: -webkit-canvas(tree-triangle);
42 .tree-row .expand-icon {
46 .tree-row[may-have-children] .expand-icon {
50 .tree
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A 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_UINT3
58 antlr3BaseTreeNew(pANTLR3_BASE_TREE tree) argument
84 getCharPositionInLine(pANTLR3_BASE_TREE tree) argument
90 getLine(pANTLR3_BASE_TREE tree) argument
95 getFirstChildWithType(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 type) argument
119 getChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i) argument
131 getChildCount(pANTLR3_BASE_TREE tree) argument
144 addChild(pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child) argument
222 addChildren(pANTLR3_BASE_TREE tree, pANTLR3_LIST kids) argument
236 setChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child) argument
246 deleteChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i) argument
257 dupTree(pANTLR3_BASE_TREE tree) argument
288 toStringTree(pANTLR3_BASE_TREE tree) argument
461 freshenPACIndexesAll(pANTLR3_BASE_TREE tree) argument
470 freshenPACIndexes(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 offset) argument
[all...]
H A Dantlr3commontree.c4 // starting point for your own tree. Though it is often easier just to tag things on
5 // to the user pointer in the tree unless you are building a different type
41 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);
156 pANTLR3_COMMON_TREE tree; local
213 newFromTree(pANTLR3_ARBORETUM factory, pANTLR3_COMMON_TREE tree) argument
289 antlr3SetCTAPI(pANTLR3_COMMON_TREE tree) argument
339 pANTLR3_COMMON_TREE tree; local
374 createChildrenList(pANTLR3_BASE_TREE tree) argument
381 getToken(pANTLR3_BASE_TREE tree) argument
393 dupNode(pANTLR3_BASE_TREE tree) argument
408 isNilNode(pANTLR3_BASE_TREE tree) argument
423 getType(pANTLR3_BASE_TREE tree) argument
440 getText(pANTLR3_BASE_TREE tree) argument
445 getLine(pANTLR3_BASE_TREE tree) argument
468 getCharPositionInLine(pANTLR3_BASE_TREE tree) argument
489 toString(pANTLR3_BASE_TREE tree) argument
504 getParent(pANTLR3_BASE_TREE tree) argument
510 setParent(pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE parent) argument
516 setChildIndex(pANTLR3_BASE_TREE tree, ANTLR3_INT32 i) argument
530 reuse(pANTLR3_BASE_TREE tree) argument
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/
H A Dpcy_lib.c68 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
70 if (!tree)
72 return tree->nlevel;
76 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument
78 if (!tree || (i < 0) || (i >= tree->nlevel))
80 return tree->levels + i;
84 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)
86 if (!tree)
88 return tree
[all...]
/external/openssl/crypto/x509v3/
H A Dpcy_lib.c70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
72 if (!tree)
74 return tree->nlevel;
78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument
80 if (!tree || (i < 0) || (i >= tree->nlevel))
82 return tree->levels + i;
86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)
88 if (!tree)
90 return tree
[all...]
/external/chromium_org/third_party/libwebp/utils/
H A Dhuffman.c5 // tree. An additional intellectual property rights grant can be found
7 // be found in the AUTHORS file in the root of the source tree.
38 static int IsFull(const HuffmanTree* const tree) { argument
39 return (tree->num_nodes_ == tree->max_nodes_);
42 static void AssignChildren(HuffmanTree* const tree, argument
44 HuffmanTreeNode* const children = tree->root_ + tree->num_nodes_;
47 tree->num_nodes_ += 2;
52 // A Huffman tree i
58 HuffmanTreeAllocate(HuffmanTree* const tree, int num_nodes) argument
65 TreeInit(HuffmanTree* const tree, int num_leaves) argument
78 VP8LHuffmanTreeFree(HuffmanTree* const tree) argument
188 TreeAddSymbol(HuffmanTree* const tree, int symbol, int code, int code_length) argument
231 VP8LHuffmanTreeBuildImplicit(HuffmanTree* const tree, const int* const code_lengths, int* const codes, int code_lengths_size) argument
288 VP8LHuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
[all...]

Completed in 1401 milliseconds

1234567891011>>