OLD | NEW |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 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 <string> | 5 #include <string> |
6 | 6 |
7 #include "base/message_loop.h" | 7 #include "base/message_loop.h" |
8 #include "base/string_util.h" | 8 #include "base/string_util.h" |
9 #include "base/utf_string_conversions.h" | 9 #include "base/utf_string_conversions.h" |
10 #include "chrome/browser/bookmarks/bookmark_model.h" | 10 #include "chrome/browser/bookmarks/bookmark_model.h" |
11 #include "chrome/browser/browser_thread.h" | 11 #include "chrome/browser/browser_thread.h" |
12 #include "chrome/browser/prefs/pref_service.h" | |
13 #include "chrome/browser/profiles/profile.h" | 12 #include "chrome/browser/profiles/profile.h" |
14 #include "chrome/browser/ui/views/bookmark_editor_view.h" | 13 #include "chrome/browser/ui/views/bookmark_editor_view.h" |
15 #include "chrome/test/testing_profile.h" | 14 #include "chrome/test/testing_profile.h" |
16 #include "testing/gtest/include/gtest/gtest.h" | 15 #include "testing/gtest/include/gtest/gtest.h" |
17 | 16 |
18 using base::Time; | 17 using base::Time; |
19 using base::TimeDelta; | 18 using base::TimeDelta; |
20 | 19 |
21 // Base class for bookmark editor tests. Creates a BookmarkModel and populates | 20 // Base class for bookmark editor tests. Creates a BookmarkModel and populates |
22 // it with test data. | 21 // it with test data. |
(...skipping 335 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
358 EXPECT_EQ(BookmarkNode::FOLDER, new_node->type()); | 357 EXPECT_EQ(BookmarkNode::FOLDER, new_node->type()); |
359 EXPECT_EQ(ASCIIToUTF16("new_F"), new_node->GetTitle()); | 358 EXPECT_EQ(ASCIIToUTF16("new_F"), new_node->GetTitle()); |
360 // The node should have one child. | 359 // The node should have one child. |
361 ASSERT_EQ(1, new_node->GetChildCount()); | 360 ASSERT_EQ(1, new_node->GetChildCount()); |
362 const BookmarkNode* new_child = new_node->GetChild(0); | 361 const BookmarkNode* new_child = new_node->GetChild(0); |
363 // Make sure the child url/title match. | 362 // Make sure the child url/title match. |
364 EXPECT_EQ(BookmarkNode::URL, new_child->type()); | 363 EXPECT_EQ(BookmarkNode::URL, new_child->type()); |
365 EXPECT_EQ(WideToUTF16Hack(details.urls[0].second), new_child->GetTitle()); | 364 EXPECT_EQ(WideToUTF16Hack(details.urls[0].second), new_child->GetTitle()); |
366 EXPECT_EQ(details.urls[0].first, new_child->GetURL()); | 365 EXPECT_EQ(details.urls[0].first, new_child->GetURL()); |
367 } | 366 } |
OLD | NEW |