Support for searching bookmarks for IDN....

chrome/browser/bookmarks/bookmark_table_model.cc

 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "chrome/browser/bookmarks/bookmark_table_model.h"
 
 #include <limits>
 
 #include "app/l10n_util.h"
 #include "app/resource_bundle.h"
@@ skipping 207 matching lines @@
   }
 
   DISALLOW_COPY_AND_ASSIGN(RecentlyBookmarkedTableModel);
 };
 
 // BookmarkSearchTableModel ----------------------------------------------------
 
 class BookmarkSearchTableModel : public VectorBackedBookmarkTableModel {
  public:
   BookmarkSearchTableModel(BookmarkModel* model,
-                           const std::wstring& search_text)
+                           const std::wstring& search_text,
+                           const std::wstring& languages)
       : VectorBackedBookmarkTableModel(model),
-        search_text_(search_text) {
+        search_text_(search_text),
+        languages_(languages) {
     bookmark_utils::GetBookmarksContainingText(
-        model, search_text, std::numeric_limits<int>::max(), &nodes());
+        model, search_text, std::numeric_limits<int>::max(),
+        languages, &nodes());
   }
 
   virtual void BookmarkNodeAdded(BookmarkModel* model,
                                  BookmarkNode* parent,
                                  int index) {
     BookmarkNode* node = parent->GetChild(index);
-    if (bookmark_utils::DoesBookmarkContainText(node, search_text_)) {
+    if (bookmark_utils::DoesBookmarkContainText(
+        node, search_text_, languages_)) {
       nodes().push_back(node);
       if (observer())
         observer()->OnItemsAdded(static_cast<int>(nodes().size() - 1), 1);
     }
   }
 
   virtual void BookmarkNodeRemoved(BookmarkModel* model,
                                    BookmarkNode* parent,
                                    int index,
                                    BookmarkNode* node) {
     int internal_index = IndexOfNode(node);
     if (internal_index == -1)
       return;
 
     nodes().erase(nodes().begin() + static_cast<int>(internal_index));
     if (observer())
       observer()->OnItemsRemoved(internal_index, 1);
   }
 
  private:
   const std::wstring search_text_;
+  const std::wstring languages_;
 
   DISALLOW_COPY_AND_ASSIGN(BookmarkSearchTableModel);
 };
 
 }  // namespace
 
 // BookmarkTableModel ----------------------------------------------------------
 
 // static
 BookmarkTableModel* BookmarkTableModel::CreateRecentlyBookmarkedModel(
     BookmarkModel* model) {
   return new RecentlyBookmarkedTableModel(model);
 }
 
 // static
 BookmarkTableModel* BookmarkTableModel::CreateBookmarkTableModelForFolder(
     BookmarkModel* model, BookmarkNode* node) {
   return new FolderBookmarkTableModel(model, node);
 }
 
 // static
 BookmarkTableModel* BookmarkTableModel::CreateSearchTableModel(
     BookmarkModel* model,
-    const std::wstring& text) {
-  return new BookmarkSearchTableModel(model, text);
+    const std::wstring& text,
+    const std::wstring& languages) {
+  return new BookmarkSearchTableModel(model, text, languages);
 }
 
 BookmarkTableModel::BookmarkTableModel(BookmarkModel* model)
     : model_(model),
       observer_(NULL) {
   model_->AddObserver(this);
 }
 
 BookmarkTableModel::~BookmarkTableModel() {
   if (model_)
@@ skipping 100 matching lines @@
     return;
   }
   if (node == model()->other_node()) {
     *path = l10n_util::GetString(IDS_BOOKMARK_TABLE_OTHER_BOOKMARKS_PATH);
     return;
   }
   BuildPath(node->GetParent(), path);
   path->append(l10n_util::GetString(IDS_BOOKMARK_TABLE_PATH_SEPARATOR));
   path->append(node->GetTitle());
 }