OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 305 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
316 return result; | 316 return result; |
317 } | 317 } |
318 | 318 |
319 struct ToLower { | 319 struct ToLower { |
320 char16 operator()(char16 c) { return tolower(c); } | 320 char16 operator()(char16 c) { return tolower(c); } |
321 }; | 321 }; |
322 | 322 |
323 // Returns True if item1 < item2. | 323 // Returns True if item1 < item2. |
324 bool HistoryItemCompareLess(const WebHistoryItem& item1, const WebHistoryItem& i
tem2) | 324 bool HistoryItemCompareLess(const WebHistoryItem& item1, const WebHistoryItem& i
tem2) |
325 { | 325 { |
326 string16 target1 = item1.target(); | 326 base::string16 target1 = item1.target(); |
327 string16 target2 = item2.target(); | 327 base::string16 target2 = item2.target(); |
328 std::transform(target1.begin(), target1.end(), target1.begin(), ToLower()); | 328 std::transform(target1.begin(), target1.end(), target1.begin(), ToLower()); |
329 std::transform(target2.begin(), target2.end(), target2.begin(), ToLower()); | 329 std::transform(target2.begin(), target2.end(), target2.begin(), ToLower()); |
330 return target1 < target2; | 330 return target1 < target2; |
331 } | 331 } |
332 | 332 |
333 string dumpHistoryItem(const WebHistoryItem& item, int indent, bool isCurrent) | 333 string dumpHistoryItem(const WebHistoryItem& item, int indent, bool isCurrent) |
334 { | 334 { |
335 string result; | 335 string result; |
336 | 336 |
337 if (isCurrent) { | 337 if (isCurrent) { |
(...skipping 1057 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1395 | 1395 |
1396 void WebTestProxyBase::resetInputMethod() | 1396 void WebTestProxyBase::resetInputMethod() |
1397 { | 1397 { |
1398 // If a composition text exists, then we need to let the browser process | 1398 // If a composition text exists, then we need to let the browser process |
1399 // to cancel the input method's ongoing composition session. | 1399 // to cancel the input method's ongoing composition session. |
1400 if (m_webWidget) | 1400 if (m_webWidget) |
1401 m_webWidget->confirmComposition(); | 1401 m_webWidget->confirmComposition(); |
1402 } | 1402 } |
1403 | 1403 |
1404 } | 1404 } |
OLD | NEW |