| 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 "chrome/browser/bookmarks/bookmark_utils.h" | 5 #include "chrome/browser/bookmarks/bookmark_utils.h" |
| 6 | 6 |
| 7 #include <utility> | 7 #include <utility> |
| 8 | 8 |
| 9 #include "base/basictypes.h" | 9 #include "base/basictypes.h" |
| 10 #include "base/file_path.h" | 10 #include "base/file_path.h" |
| (...skipping 476 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 487 &MoreRecentlyAdded); | 487 &MoreRecentlyAdded); |
| 488 if (nodes->size() < count || insert_position != nodes->end()) { | 488 if (nodes->size() < count || insert_position != nodes->end()) { |
| 489 nodes->insert(insert_position, node); | 489 nodes->insert(insert_position, node); |
| 490 while (nodes->size() > count) | 490 while (nodes->size() > count) |
| 491 nodes->pop_back(); | 491 nodes->pop_back(); |
| 492 } | 492 } |
| 493 } | 493 } |
| 494 } | 494 } |
| 495 } | 495 } |
| 496 | 496 |
| 497 TitleMatch::TitleMatch() {} |
| 498 |
| 499 TitleMatch::~TitleMatch() {} |
| 500 |
| 497 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) { | 501 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) { |
| 498 return n1->date_added() > n2->date_added(); | 502 return n1->date_added() > n2->date_added(); |
| 499 } | 503 } |
| 500 | 504 |
| 501 void GetBookmarksContainingText(BookmarkModel* model, | 505 void GetBookmarksContainingText(BookmarkModel* model, |
| 502 const string16& text, | 506 const string16& text, |
| 503 size_t max_count, | 507 size_t max_count, |
| 504 const std::string& languages, | 508 const std::string& languages, |
| 505 std::vector<const BookmarkNode*>* nodes) { | 509 std::vector<const BookmarkNode*>* nodes) { |
| 506 std::vector<string16> words; | 510 std::vector<string16> words; |
| (...skipping 154 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 661 return true; | 665 return true; |
| 662 | 666 |
| 663 for (int i = 0; i < node->GetChildCount(); ++i) { | 667 for (int i = 0; i < node->GetChildCount(); ++i) { |
| 664 if (NodeHasURLs(node->GetChild(i))) | 668 if (NodeHasURLs(node->GetChild(i))) |
| 665 return true; | 669 return true; |
| 666 } | 670 } |
| 667 return false; | 671 return false; |
| 668 } | 672 } |
| 669 | 673 |
| 670 } // namespace bookmark_utils | 674 } // namespace bookmark_utils |
| OLD | NEW |