NO CODE CHANGE.

chrome/browser/bookmarks/bookmark_utils.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_utils.h"
 
 #include "base/basictypes.h"
 #include "base/string_util.h"
 #include "base/time.h"
 #include "chrome/browser/bookmarks/bookmark_drag_data.h"
@@ skipping 40 matching lines @@
                        const GURL& referrer,
                        WindowOpenDisposition disposition,
                        PageTransition::Type transition) {
     if (!browser_) {
       Profile* profile = (disposition == OFF_THE_RECORD) ?
           profile_->GetOffTheRecordProfile() : profile_;
       browser_ = Browser::Create(profile);
       // Always open the first tab in the foreground.
       disposition = NEW_FOREGROUND_TAB;
     }
-    browser_->OpenURLFromTab(NULL, url, referrer, NEW_FOREGROUND_TAB, transition);
+    browser_->OpenURLFromTab(NULL, url, referrer, NEW_FOREGROUND_TAB,
+                             transition);
   }
 
  private:
   Profile* profile_;
   Browser* browser_;
 
   DISALLOW_COPY_AND_ASSIGN(NewBrowserPageNavigator);
 };
 
 void CloneDragDataImpl(BookmarkModel* model,
@@ skipping 55 matching lines @@
     }
   } else {
     // Group, recurse through children.
     for (int i = 0; i < node->GetChildCount(); ++i) {
       OpenAllImpl(node->GetChild(i), initial_disposition, navigator,
                   opened_url);
     }
   }
 }
 
-bool ShouldOpenAll(gfx::NativeWindow parent, const std::vector<BookmarkNode*>& nodes) {
+bool ShouldOpenAll(gfx::NativeWindow parent,
+                   const std::vector<BookmarkNode*>& nodes) {
   int descendant_count = 0;
   for (size_t i = 0; i < nodes.size(); ++i)
     descendant_count += DescendantURLCount(nodes[i]);
   if (descendant_count < bookmark_utils::num_urls_before_prompting)
     return true;
 
   std::wstring message =
       l10n_util::GetStringF(IDS_BOOKMARK_BAR_SHOULD_OPEN_ALL,
                             IntToWString(descendant_count));
 #if defined(OS_WIN)
@@ skipping 313 matching lines @@
   std::vector<std::wstring> words;
   QueryParser parser;
   parser.ExtractQueryWords(l10n_util::ToLower(text), &words);
   if (words.empty())
     return false;
 
   return (node->is_url() && DoesBookmarkContainWords(node, words));
 }
 
 }  // namespace bookmark_utils