| /external/chromium_org/ui/views/controls/tree/ |
| tree_view_unittest.cc | 63 PrefixSelector* selector() { return tree_.selector_.get(); }
66 TreeView tree_; member in class:views::TreeViewTest
86 return InternalNodeAsString(&tree_.root_);
90 TreeModelNode* model_node = tree_.GetSelectedNode();
95 TreeModelNode* model_node = tree_.GetEditingNode();
104 tree_.IncrementSelection(next ? TreeView::INCREMENT_NEXT :
109 tree_.CollapseOrSelectParent();
113 tree_.ExpandOrSelectChild();
117 return tree_.GetRowCount();
149 tree_.SetModel(&model_)
[all...] |
| /external/chromium_org/extensions/common/matcher/ |
| 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_.clear()
[all...] |
| substring_set_matcher.h | 83 // Key: label of the edge, value: node index in |tree_| of parent class.
133 std::vector<AhoCorasickNode> tree_; member in class:extensions::SubstringSetMatcher
|
| /external/chromium_org/ui/oak/ |
| oak_window.cc | 36 tree_.reset();
122 tree_.reset(new views::TreeView);
123 tree_->set_owned_by_client();
124 tree_->SetController(this);
125 tree_->SetModel(tree_model_.get());
126 tree_container_ = tree_->CreateParentIfNecessary();
141 OnTreeViewSelectionChanged(tree_.get());
|
| oak_window.h | 51 scoped_ptr<views::TreeView> tree_; member in class:oak::internal::OakWindow
|
| /external/chromium_org/content/browser/indexed_db/leveldb/ |
| leveldb_transaction.cc | 18 tree_.abstractor().comparator_ = comparator_;
26 iterator.StartIterLeast(&tree_);
34 tree_.Purge();
47 AVLTreeNode* node = tree_.Search(key);
52 tree_.Insert(node);
76 AVLTreeNode* node = tree_.Search(key);
98 if (tree_.IsEmpty()) {
106 iterator.StartIterLeast(&tree_);
143 iterator_.StartIterGreatest(tree_);
149 iterator_.StartIter(tree_, target, TreeType::EQUAL)
[all...] |
| avltree.h | 191 tree_ = tree;
194 handle h = tree_->abs_.root;
239 tree_ = tree;
241 handle h = tree_->abs_.root;
256 tree_ = tree;
258 handle h = tree_->abs_.root;
276 return depth_ == 0 ? tree_->abs_.root : path_h_[depth_ - 1];
334 AVLTree* tree_;
349 int CmpKN(key k, handle h) { return tree_->abs_.CompareKeyNode(k, h); }
351 return tree_->abs_.CompareNodeNode(h1, h2)
[all...] |
| leveldb_transaction.h | 102 TreeType* tree_; member in class:content::LevelDBTransaction::TreeIterator
154 TreeType tree_; member in class:content::LevelDBTransaction
|
| /external/chromium_org/v8/src/ |
| profile-generator.cc | 204 ProfileNode* new_node = new ProfileNode(tree_, entry);
213 return tree_->TicksToMillis(self_ticks_);
218 return tree_->TicksToMillis(total_ticks_);
421 tree_.Insert(addr, &locator);
431 if (!tree_.FindGreatestLessThan(addr, &locator)) break;
436 for (int i = 0; i < to_delete.length(); ++i) tree_.Remove(to_delete[i]);
442 if (tree_.FindGreatestLessThan(addr, &locator)) {
459 if (tree_.Find(addr, &locator)) {
464 tree_.Insert(addr, &locator);
475 if (!tree_.Find(from, &locator)) return
[all...] |
| profile-generator-inl.h | 74 : tree_(tree),
|
| profile-generator.h | 156 ProfileTree* tree_; member in class:v8::internal::ProfileNode
279 CodeTree tree_; member in class:v8::internal::CodeMap
|
| jsregexp.h | 346 explicit DispatchTable(Zone* zone) : tree_(zone) { }
396 ZoneSplayTree<Config>* tree() { return &tree_; }
397 ZoneSplayTree<Config> tree_; member in class:v8::internal::DispatchTable
[all...] |
| /external/v8/src/ |
| profile-generator-inl.h | 73 : tree_(tree),
|
| profile-generator.cc | 229 ProfileNode* new_node = new ProfileNode(tree_, entry);
238 return tree_->TicksToMillis(self_ticks_);
243 return tree_->TicksToMillis(total_ticks_);
504 tree_.Insert(addr, &locator);
514 if (!tree_.FindGreatestLessThan(addr, &locator)) break;
519 for (int i = 0; i < to_delete.length(); ++i) tree_.Remove(to_delete[i]);
525 if (tree_.FindGreatestLessThan(addr, &locator)) {
538 if (tree_.Find(addr, &locator)) {
543 tree_.Insert(addr, &locator);
554 if (!tree_.Find(from, &locator)) return
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| LeftRecursiveRuleWalker.g | 251 | tree_
268 tree_
|
| ANTLRTreePrinter.g | 385 | tree_
425 tree_
|
| AssignTokenTypesWalker.g | 368 | tree_
386 tree_
|
| DefineGrammarItemsWalker.g | 434 | tree_
493 tree_
|
| TreeToNFAConverter.g | 365 | tree_ {$g = $tree_.g;}
460 tree_ returns [StateCluster g=null]
|
| ANTLR.g | 736 | t3=tree_
773 tree_
|
| /external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 937 iter->tree_ = l_tree;
992 iter->tree_ = l_tree;
1015 iter->tree_ = l_tree;
1040 iter->tree_->root : iter->path_h[iter->depth - 1]);
1048 #define l_tree (iter->tree_)
1053 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
1090 #define l_tree (iter->tree_)
1095 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
|
| cavl_if.h | 167 L_(avl) *tree_; member in struct:__anon23130
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/ |
| command_line_interface.cc | 188 : format_(format), tree_(tree) {}
198 tree_ != NULL &&
199 tree_->VirtualFileToDiskFile(filename, &dfile)) {
229 DiskSourceTree *tree_; member in class:google::protobuf::compiler::CommandLineInterface::ErrorPrinter
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-profile-generator.cc | 94 : tree_(tree) { }
99 ProfileNode* node = tree_->root();
113 const ProfileTree* tree_; member in class:__anon17117::ProfileTreeTestHelper
|
| /external/v8/test/cctest/ |
| test-profile-generator.cc | 113 : tree_(tree) { }
118 ProfileNode* node = tree_->root();
132 const ProfileTree* tree_; member in class:__anon28841::ProfileTreeTestHelper
|
