| OLD | NEW |
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "chrome/browser/bookmarks/recently_used_folders_combo_model.h" | 5 #include "chrome/browser/ui/bookmarks/recently_used_folders_combo_model.h" |
| 6 | 6 |
| 7 #include "chrome/browser/bookmarks/bookmark_utils.h" | 7 #include "chrome/browser/bookmarks/bookmark_utils.h" |
| 8 #include "content/public/browser/user_metrics.h" | 8 #include "content/public/browser/user_metrics.h" |
| 9 #include "grit/generated_resources.h" | 9 #include "grit/generated_resources.h" |
| 10 #include "ui/base/l10n/l10n_util.h" | 10 #include "ui/base/l10n/l10n_util.h" |
| 11 | 11 |
| 12 namespace { | 12 namespace { |
| 13 | 13 |
| 14 // Max number of most recently used folders. | 14 // Max number of most recently used folders. |
| 15 const size_t kMaxMRUFolders = 5; | 15 const size_t kMaxMRUFolders = 5; |
| (...skipping 123 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 139 return items_[index].node; | 139 return items_[index].node; |
| 140 } | 140 } |
| 141 | 141 |
| 142 void RecentlyUsedFoldersComboModel::RemoveNode(const BookmarkNode* node) { | 142 void RecentlyUsedFoldersComboModel::RemoveNode(const BookmarkNode* node) { |
| 143 std::vector<Item>::iterator it = std::find(items_.begin(), | 143 std::vector<Item>::iterator it = std::find(items_.begin(), |
| 144 items_.end(), | 144 items_.end(), |
| 145 Item(node, Item::TYPE_NODE)); | 145 Item(node, Item::TYPE_NODE)); |
| 146 if (it != items_.end()) | 146 if (it != items_.end()) |
| 147 items_.erase(it); | 147 items_.erase(it); |
| 148 } | 148 } |
| OLD | NEW |