Move basic string operations to ui/app_list/search

ui/app_list/search/tokenized_string_match.cc

 // Copyright 2013 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/ui/app_list/search/tokenized_string_match.h"
+#include "ui/app_list/search/tokenized_string_match.h"
 
 #include "base/i18n/string_search.h"
 #include "base/logging.h"
-#include "chrome/browser/ui/app_list/search/tokenized_string_char_iterator.h"
+#include "ui/app_list/search/tokenized_string_char_iterator.h"
 
 namespace app_list {
 
 namespace {
 
 // The factors below are applied when the current char of query matches
 // the current char of the text to be matched. Different factors are chosen
 // based on where the match happens. kIsPrefixMultiplier is used when the
 // matched portion is a prefix of both the query and the text, which implies
 // that the matched chars are at the same position in query and text. This is
@@ skipping 207 matching lines @@
 }
 
 bool TokenizedStringMatch::Calculate(const base::string16& query,
                                      const base::string16& text) {
   const TokenizedString tokenized_query(query);
   const TokenizedString tokenized_text(text);
   return Calculate(tokenized_query, tokenized_text);
 }
 
 }  // namespace app_list