/external/antlr/antlr-3.4/runtime/Python/tests/ |
H A D | t047treeparser.py | 4 import antlr3.tree namespace 60 r.tree.toStringTree(), 64 nodes = antlr3.tree.CommonTreeNodeStream(r.tree) 113 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
|
H A D | t056lexer.py | 4 import antlr3.tree namespace
|
/external/chromium_org/cc/resources/ |
H A D | tile_priority.cc | 13 std::string WhichTreeToString(WhichTree tree) { argument 14 switch (tree) { 20 DCHECK(false) << "Unrecognized WhichTree value " << tree;
|
/external/chromium_org/cc/test/ |
H A D | layer_tree_json_parser_unittest.cc | 70 LayerTreeImpl* tree = host_impl.active_tree(); local 72 scoped_ptr<LayerImpl> root_impl(LayerImpl::Create(tree, 1)); 73 scoped_ptr<LayerImpl> parent(LayerImpl::Create(tree, 2)); 74 scoped_ptr<LayerImpl> child(LayerImpl::Create(tree, 3)); 87 tree->SetRootLayer(root_impl.Pass()); 99 LayerTreeImpl* tree = host_impl.active_tree(); local 101 scoped_ptr<LayerImpl> root_impl(LayerImpl::Create(tree, 1)); 102 scoped_ptr<LayerImpl> touch_layer(LayerImpl::Create(tree, 2)); 113 tree->SetRootLayer(root_impl.Pass());
|
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_tree_test.cc | 17 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/chromium_org/third_party/WebKit/Source/platform/ |
H A D | PODRedBlackTreeTest.cpp | 26 // 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...] |
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/ |
H A D | pcy_lib.c | 68 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/chromium_org/third_party/libaddressinput/src/cpp/test/ |
H A D | region_data_builder_test.cc | 67 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/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
H A D | vp9_prob.c | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 34 const vp9_tree_index *tree, 40 const int l = tree[i]; 43 : tree_merge_probs_impl(l, tree, pre_probs, counts, 45 const int r = tree[i + 1]; 48 : tree_merge_probs_impl(r, tree, pre_probs, counts, 56 void vp9_tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, argument 59 tree_merge_probs_impl(0, tree, pre_probs, counts, count_sat, 33 tree_merge_probs_impl(unsigned int i, const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update, vp9_prob *probs) argument
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 6 * 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...] |
H A D | vp9_cost.h | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs, argument 42 i = tree[i + bit]; 48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree); 49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
H A D | vp9_treewriter.c | 6 * 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 D | vp9_treewriter.h | 6 * 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/chromium_org/ui/accessibility/ |
H A D | ax_serializable_tree.cc | 16 // accessibility tree. 19 AXTreeSourceAdapter(AXTree* tree) : tree_(tree) {} argument
|
/external/chromium_org/v8/src/ |
H A D | profile-generator-inl.h | 42 ProfileNode::ProfileNode(ProfileTree* tree, CodeEntry* entry) argument 43 : tree_(tree), 47 id_(tree->next_node_id()) { }
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_prob.c | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 34 const vp9_tree_index *tree, 40 const int l = tree[i]; 43 : tree_merge_probs_impl(l, tree, pre_probs, counts, 45 const int r = tree[i + 1]; 48 : tree_merge_probs_impl(r, tree, pre_probs, counts, 56 void vp9_tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, argument 59 tree_merge_probs_impl(0, tree, pre_probs, counts, count_sat, 33 tree_merge_probs_impl(unsigned int i, const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update, vp9_prob *probs) argument
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 6 * 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...] |
H A D | vp9_cost.h | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs, argument 42 i = tree[i + bit]; 48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree); 49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
H A D | vp9_treewriter.c | 6 * 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 D | vp9_treewriter.h | 6 * 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/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | AnnotationNode.java | 30 package org.mockito.asm.tree;
|
H A D | FieldInsnNode.java | 30 package org.mockito.asm.tree;
|
H A D | FieldNode.java | 30 package org.mockito.asm.tree;
|
H A D | IincInsnNode.java | 30 package org.mockito.asm.tree;
|
H A D | InnerClassNode.java | 30 package org.mockito.asm.tree;
|