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