Fix files with lines > 80 cols. Part 2.

chrome/test/ui/omnibox_uitest.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 <stdio.h>
 
 #include "base/command_line.h"
 #include "base/file_util.h"
 #include "base/path_service.h"
 #include "base/perftimer.h"
@@ skipping 39 matching lines @@
   // This could probably be accomplished with regex as well.  Note that this
   // method is called even when suggestion isn't a URL.
   bool IsMatch(const std::wstring& input_test, const std::wstring& suggestion);
   // Runs a query chain. This sends each proper prefix of the input to the
   // omnibox and scores the autocompelte results returned.
   void RunQueryChain(const std::wstring& input_text);
 };
 
 bool OmniboxTest::IsMatch(const std::wstring& input_text,
                           const std::wstring& suggestion) {
-  // This prefix list comes from the list used in history_url_provider.cc withiff
-  // the exception of "ftp." and "www.".
+  // This prefix list comes from the list used in history_url_provider.cc
+  // withiff the exception of "ftp." and "www.".
   std::wstring prefixes[] = {L"", L"ftp://", L"http://", L"https://",
                              L"ftp.", L"www.", L"ftp://www.", L"ftp://ftp.",
                              L"http://www.", L"https://www."};
   std::wstring postfixes[] = {L"", L"/"};
   for (int i = 0; i < sizeof(prefixes) / sizeof(std::wstring); ++i) {
     for (int j = 0; j < sizeof(postfixes) / sizeof(std::wstring); ++j) {
       if (prefixes[i] + input_text + postfixes[j] == suggestion)
         return true;
     }
   }
@@ skipping 98 matching lines @@
   wprintf(L"__om_query_timeouts = %d\n", query_timeouts_);
   wprintf(L"__om_time_per_query_avg = %d\n", mean);
   // Use the equation stddev = sqrt(Sum(x_i^2)/N - mean^2).
   wprintf(L"__om_time_per_query_stddev = %d\n", static_cast<int64>(
       sqrt(1.0 * time_squared_ / query_count_ - mean * mean)));
   wprintf(L"__om_time_per_query_max = %d\n", time_max_);
   wprintf(L"__om_time_per_query_min = %d\n", time_min_);
   wprintf(L"__om_score = %.4f\n", 100.0 * score_ / max_score_);
 }