/external/chromium_org/ui/views/controls/tree/ |
H A D | tree_view_unittest.cc | 65 PrefixSelector* selector() { return tree_.selector_.get(); } 68 TreeView tree_; member in class:views::TreeViewTest 88 return InternalNodeAsString(&tree_.root_); 92 TreeModelNode* model_node = tree_.GetSelectedNode(); 98 TreeModelNode* model_node = tree_.GetEditingNode(); 108 tree_.IncrementSelection(next ? TreeView::INCREMENT_NEXT : 113 tree_.CollapseOrSelectParent(); 117 tree_.ExpandOrSelectChild(); 121 return tree_.GetRowCount(); 153 tree_ [all...] |
/external/chromium_org/ui/accessibility/ |
H A D | ax_tree_serializer.h | 141 AXTreeSource<AXSourceNode>* tree_; member in class:ui::AXTreeSerializer 164 : tree_(tree), 187 tree_ = new_tree; 193 if (!tree_->IsValid(node) || client_node == NULL) 194 return tree_->GetNull(); 197 while (tree_->IsValid(node)) { 199 node = tree_->GetParent(node); 211 AXSourceNode lca = tree_->GetNull(); 215 if (tree_->GetId(ancestors[source_index]) != 231 ClientTreeNode* client_node = ClientTreeNodeById(tree_ [all...] |
H A D | ax_serializable_tree.cc | 19 AXTreeSourceAdapter(AXTree* tree) : tree_(tree) {} 24 return tree_->GetRoot(); 28 return tree_->GetFromId(id); 65 AXTree* tree_; member in class:ui::AXTreeSourceAdapter
|
/external/chromium_org/components/url_matcher/ |
H A D | substring_set_matcher.cc | 104 tree_.reserve(TreeSize(sorted_patterns)); 114 matches->insert(tree_[0].matches().begin(), tree_[0].matches().end()); 118 uint32 edge_from_current = tree_[current_node].GetEdge(*i); 121 current_node = tree_[current_node].failure(); 122 edge_from_current = tree_[current_node].GetEdge(*i); 126 matches->insert(tree_[current_node].matches().begin(), 127 tree_[current_node].matches().end()); 138 return patterns_.empty() && tree_.size() == 1u; 143 tree_ [all...] |
H A D | substring_set_matcher.h | 84 // Key: label of the edge, value: node index in |tree_| of parent class. 134 std::vector<AhoCorasickNode> tree_; member in class:url_matcher::SubstringSetMatcher
|
/external/chromium_org/mojo/examples/compositor_app/ |
H A D | compositor_host.cc | 26 tree_ = cc::LayerTreeHost::CreateThreaded( 38 tree_->SetViewportSize(viewport_size); 39 tree_->SetLayerTreeHostClientReady(); 47 tree_->SetRootLayer(root_layer); 71 tree_->SetNeedsAnimate(); 80 tree_->SetOutputSurface(make_scoped_ptr(new cc::OutputSurface(
|
H A D | compositor_host.h | 50 scoped_ptr<cc::LayerTreeHost> tree_; member in class:mojo::examples::CompositorHost
|
/external/chromium_org/content/browser/accessibility/ |
H A D | browser_accessibility_manager.cc | 71 tree_(new ui::AXSerializableTree()), 74 tree_->SetDelegate(this); 83 tree_(new ui::AXSerializableTree()), 86 tree_->SetDelegate(this); 91 tree_.reset(NULL); 96 if (!tree_->Unserialize(initial_tree)) { 98 LOG(ERROR) << tree_->error(); 101 LOG(FATAL) << tree_->error(); 106 SetFocus(tree_->GetRoot(), false); 120 return GetFromAXNode(tree_ [all...] |
/external/chromium_org/v8/src/ |
H A D | profile-generator-inl.h | 43 : tree_(tree),
|
H A D | profile-generator.cc | 197 ProfileNode* new_node = new ProfileNode(tree_, entry); 357 tree_.Insert(addr, &locator); 367 if (!tree_.FindGreatestLessThan(addr, &locator)) break; 372 for (int i = 0; i < to_delete.length(); ++i) tree_.Remove(to_delete[i]); 378 if (tree_.FindGreatestLessThan(addr, &locator)) { 395 if (tree_.Find(addr, &locator)) { 400 tree_.Insert(addr, &locator); 411 if (!tree_.Find(from, &locator)) return; 413 tree_.Remove(from); 431 tree_ [all...] |
H A D | allocation-tracker.h | 35 AllocationTraceTree* tree_; member in class:v8::internal::AllocationTraceNode
|
H A D | allocation-tracker.cc | 16 : tree_(tree), 43 child = new AllocationTraceNode(tree_, function_info_index);
|
H A D | profile-generator.h | 135 ProfileTree* tree_; member in class:v8::internal::ProfileNode 249 CodeTree tree_; member in class:v8::internal::CodeMap
|
/external/chromium_org/cc/test/ |
H A D | fake_picture_layer_tiling_client.h | 59 void set_tree(WhichTree tree) { tree_ = tree; } 79 WhichTree tree_; member in class:cc::FakePictureLayerTilingClient
|
H A D | fake_picture_layer_tiling_client.cc | 91 return tree_;
|
/external/chromium_org/cc/resources/ |
H A D | picture_layer_tiling.h | 104 RasterMode mode = tile->DetermineRasterModeForTree(tree_); 105 return !tile->is_occluded(tree_) && tile->NeedsRasterForMode(mode); 111 WhichTree tree_; member in class:cc::PictureLayerTiling::TilingRasterTileIterator
|
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
H A D | LeftRecursiveRuleWalker.g | 251 | tree_ 268 tree_
|
H A D | ANTLRTreePrinter.g | 385 | tree_ 425 tree_
|
H A D | AssignTokenTypesWalker.g | 368 | tree_ 386 tree_
|
/external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_impl.h | 939 iter->tree_ = l_tree; 994 iter->tree_ = l_tree; 1017 iter->tree_ = l_tree; 1042 iter->tree_->root : iter->path_h[iter->depth - 1]); 1050 #define l_tree (iter->tree_) 1055 iter->tree_->root : iter->path_h[iter->depth - 1]), 1); 1092 #define l_tree (iter->tree_) 1097 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
|
H A D | cavl_if.h | 169 L_(avl) *tree_; member in struct:__anon13225
|
/external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_impl.h | 939 iter->tree_ = l_tree; 994 iter->tree_ = l_tree; 1017 iter->tree_ = l_tree; 1042 iter->tree_->root : iter->path_h[iter->depth - 1]); 1050 #define l_tree (iter->tree_) 1055 iter->tree_->root : iter->path_h[iter->depth - 1]), 1); 1092 #define l_tree (iter->tree_) 1097 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
|
H A D | cavl_if.h | 169 L_(avl) *tree_; member in struct:__anon24995
|
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_tree_test.cc | 17 explicit SpdyPriorityTreePeer(SpdyPriorityTree<NodeId>* tree) : tree_(tree) {} 20 tree_->PropagateNodeState(node); 24 SpdyPriorityTree<NodeId>* tree_; member in class:net::test::SpdyPriorityTreePeer
|
/external/chromium_org/mojo/services/public/cpp/view_manager/tests/ |
H A D | view_manager_unittest.cc | 130 : tree_(tree), 135 return CountViews(tree_) == tree_size_; 153 View* tree_; member in class:mojo::__anon8822::TreeSizeMatchesObserver
|