Searched refs:nodes_ (Results 1 - 10 of 10) sorted by relevance
/external/chromium/chrome/browser/bookmarks/ |
H A D | recently_used_folders_combo_model.cc | 21 : nodes_(bookmark_utils::GetMostRecentlyModifiedFolders( 35 nodes_.insert(nodes_.begin(), node->parent()); 39 if (nodes_.size() > kMaxMRUFolders) 40 nodes_.erase(nodes_.begin() + kMaxMRUFolders, nodes_.end()); 43 nodes_.push_back(model->GetBookmarkBarNode()); 44 nodes_.push_back(model->other_node()); 46 std::vector<const BookmarkNode*>::iterator it = std::find(nodes_ [all...] |
H A D | recently_used_folders_combo_model.h | 34 // Removes |node| from |nodes_|. Does nothing if |node| is not in |nodes_|. 37 std::vector<const BookmarkNode*> nodes_; member in class:RecentlyUsedFoldersComboModel
|
/external/openfst/src/include/fst/extensions/pdt/ |
H A D | pdt.h | 45 // 'nodes_'. Each node represents the top of some stack and is 74 nodes_.push_back(StackNode(-1, -1)); // Tree root. 97 child_id = nodes_.size(); 98 nodes_.push_back(StackNode(stack_id, paren_id)); 103 const StackNode &node = nodes_[stack_id]; 113 return nodes_[stack_id].parent_id; 118 return nodes_[stack_id].paren_id; 139 vector<StackNode> nodes_; member in class:fst::PdtStack
|
/external/chromium/chrome/browser/ui/gtk/ |
H A D | custom_drag.cc | 127 nodes_(nodes) { 136 bookmark_utils::WriteBookmarksToSelection(nodes_, selection_data,
|
H A D | custom_drag.h | 102 std::vector<const BookmarkNode*> nodes_; member in class:BookmarkDrag
|
/external/v8/src/ |
H A D | global-handles.cc | 288 nodes_[i].Initialize(i, first_free); 294 return &nodes_[index]; 328 Node nodes_[kSize];
|
H A D | profile-generator.h | 1116 nodes_(ObjectsMatch), 1151 HashMap nodes_; member in class:v8::internal::HeapSnapshotJSONSerializer
|
H A D | ast.cc | 966 : nodes_(nodes) {
|
H A D | ast.h | 2255 ZoneList<RegExpTree*>* nodes() { return nodes_; } 2257 ZoneList<RegExpTree*>* nodes_; member in class:v8::internal::RegExpAlternative
|
H A D | profile-generator.cc | 3487 HashMap::Entry* cache_entry = nodes_.Lookup(entry, ObjectHash(entry), true); 3617 SortHashMap(&nodes_, &sorted_nodes);
|
Completed in 229 milliseconds