Move tree-related classes that Linux code depends on from views/ to app/
TEST=If it compiles and unit_tests pass, it's ok. Just moving files around.
http://crbug.com/11066
Review URL: http://codereview.chromium.org/115185
git-svn-id: svn://svn.chromium.org/chrome/trunk/src@15982 0039d316-1c4b-4281-b951-d872f2087c98
diff --git a/chrome/browser/bookmarks/bookmark_utils.cc b/chrome/browser/bookmarks/bookmark_utils.cc
index e21e230..8082f160 100644
--- a/chrome/browser/bookmarks/bookmark_utils.cc
+++ b/chrome/browser/bookmarks/bookmark_utils.cc
@@ -12,6 +12,7 @@
#else
#include "chrome/common/temp_scaffolding_stubs.h"
#endif
+#include "app/tree_node_iterator.h"
#include "base/basictypes.h"
#include "base/string_util.h"
#include "base/time.h"
@@ -28,7 +29,6 @@
#include "chrome/common/pref_service.h"
#include "grit/chromium_strings.h"
#include "grit/generated_resources.h"
-#include "views/controls/tree/tree_node_iterator.h"
#include "views/event.h"
using base::Time;
@@ -417,7 +417,7 @@
BookmarkModel* model,
size_t max_count) {
std::vector<BookmarkNode*> nodes;
- views::TreeNodeIterator<BookmarkNode> iterator(model->root_node());
+ TreeNodeIterator<BookmarkNode> iterator(model->root_node());
while (iterator.has_next()) {
BookmarkNode* parent = iterator.Next();
if (parent->is_folder() && parent->date_group_modified() > base::Time()) {
@@ -455,7 +455,7 @@
void GetMostRecentlyAddedEntries(BookmarkModel* model,
size_t count,
std::vector<BookmarkNode*>* nodes) {
- views::TreeNodeIterator<BookmarkNode> iterator(model->root_node());
+ TreeNodeIterator<BookmarkNode> iterator(model->root_node());
while (iterator.has_next()) {
BookmarkNode* node = iterator.Next();
if (node->is_url()) {
@@ -481,7 +481,7 @@
if (query_nodes.empty())
return;
- views::TreeNodeIterator<BookmarkNode> iterator(model->root_node());
+ TreeNodeIterator<BookmarkNode> iterator(model->root_node());
Snippet::MatchPositions match_position;
while (iterator.has_next()) {
BookmarkNode* node = iterator.Next();
@@ -511,7 +511,7 @@
if (words.empty())
return;
- views::TreeNodeIterator<BookmarkNode> iterator(model->root_node());
+ TreeNodeIterator<BookmarkNode> iterator(model->root_node());
while (iterator.has_next()) {
BookmarkNode* node = iterator.Next();
if (node->is_url() && DoesBookmarkContainWords(node, words)) {
