| OLD | NEW |
| 1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2010 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/history/snippet.h" | 5 #include "chrome/browser/history/snippet.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 | 8 |
| 9 #include "base/logging.h" | 9 #include "base/logging.h" |
| 10 #include "base/scoped_ptr.h" | 10 #include "base/scoped_ptr.h" |
| 11 #include "base/string_split.h" |
| 11 #include "base/string_util.h" | 12 #include "base/string_util.h" |
| 12 #include "base/utf_string_conversions.h" | 13 #include "base/utf_string_conversions.h" |
| 13 #include "unicode/brkiter.h" | 14 #include "unicode/brkiter.h" |
| 14 #include "unicode/utext.h" | 15 #include "unicode/utext.h" |
| 15 #include "unicode/utf8.h" | 16 #include "unicode/utf8.h" |
| 16 | 17 |
| 17 namespace { | 18 namespace { |
| 18 | 19 |
| 19 bool PairFirstLessThan(const Snippet::MatchPosition& a, | 20 bool PairFirstLessThan(const Snippet::MatchPosition& a, |
| 20 const Snippet::MatchPosition& b) { | 21 const Snippet::MatchPosition& b) { |
| (...skipping 255 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 276 start = end; | 277 start = end; |
| 277 | 278 |
| 278 // Stop here if we have enough snippet computed. | 279 // Stop here if we have enough snippet computed. |
| 279 if (snippet.size() >= kSnippetMaxLength) | 280 if (snippet.size() >= kSnippetMaxLength) |
| 280 break; | 281 break; |
| 281 } | 282 } |
| 282 | 283 |
| 283 utext_close(document_utext); | 284 utext_close(document_utext); |
| 284 swap(text_, snippet); | 285 swap(text_, snippet); |
| 285 } | 286 } |
| OLD | NEW |