OLD | NEW |
1 /* | 1 /* |
2 * (C) 1999 Lars Knoll (knoll@kde.org) | 2 * (C) 1999 Lars Knoll (knoll@kde.org) |
3 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012, 2013 Apple Inc.
All rights reserved. | 3 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012, 2013 Apple Inc.
All rights reserved. |
4 * | 4 * |
5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
9 * | 9 * |
10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
(...skipping 217 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
228 size_t reverseFind(UChar c, unsigned start = UINT_MAX) const | 228 size_t reverseFind(UChar c, unsigned start = UINT_MAX) const |
229 { return m_impl ? m_impl->reverseFind(c, start) : kNotFound; } | 229 { return m_impl ? m_impl->reverseFind(c, start) : kNotFound; } |
230 size_t reverseFind(const String& str, unsigned start = UINT_MAX) const | 230 size_t reverseFind(const String& str, unsigned start = UINT_MAX) const |
231 { return m_impl ? m_impl->reverseFind(str.impl(), start) : kNotFound; } | 231 { return m_impl ? m_impl->reverseFind(str.impl(), start) : kNotFound; } |
232 | 232 |
233 // Case insensitive string matching. | 233 // Case insensitive string matching. |
234 size_t findIgnoringCase(const LChar* str, unsigned start = 0) const | 234 size_t findIgnoringCase(const LChar* str, unsigned start = 0) const |
235 { return m_impl ? m_impl->findIgnoringCase(str, start) : kNotFound; } | 235 { return m_impl ? m_impl->findIgnoringCase(str, start) : kNotFound; } |
236 size_t findIgnoringCase(const String& str, unsigned start = 0) const | 236 size_t findIgnoringCase(const String& str, unsigned start = 0) const |
237 { return m_impl ? m_impl->findIgnoringCase(str.impl(), start) : kNotFoun
d; } | 237 { return m_impl ? m_impl->findIgnoringCase(str.impl(), start) : kNotFoun
d; } |
238 size_t reverseFindIgnoringCase(const String& str, unsigned start = UINT_MAX)
const | |
239 { return m_impl ? m_impl->reverseFindIgnoringCase(str.impl(), start) : k
NotFound; } | |
240 | 238 |
241 // Wrappers for find & reverseFind adding dynamic sensitivity check. | 239 // Wrappers for find adding dynamic sensitivity check. |
242 size_t find(const LChar* str, unsigned start, TextCaseSensitivity caseSensit
ivity) const | 240 size_t find(const LChar* str, unsigned start, TextCaseSensitivity caseSensit
ivity) const |
243 { return DISPATCH_CASE_OP(caseSensitivity, find, (str, start)); } | 241 { return DISPATCH_CASE_OP(caseSensitivity, find, (str, start)); } |
244 size_t find(const String& str, unsigned start, TextCaseSensitivity caseSensi
tivity) const | 242 size_t find(const String& str, unsigned start, TextCaseSensitivity caseSensi
tivity) const |
245 { return DISPATCH_CASE_OP(caseSensitivity, find, (str, start)); } | 243 { return DISPATCH_CASE_OP(caseSensitivity, find, (str, start)); } |
246 size_t reverseFind(const String& str, unsigned start, TextCaseSensitivity ca
seSensitivity) const | |
247 { return (caseSensitivity == TextCaseSensitive) ? reverseFind(str, start
) : reverseFindIgnoringCase(str, start); } | |
248 | 244 |
249 Vector<UChar> charactersWithNullTermination() const; | 245 Vector<UChar> charactersWithNullTermination() const; |
250 unsigned copyTo(UChar* buffer, unsigned pos, unsigned maxLength) const; | 246 unsigned copyTo(UChar* buffer, unsigned pos, unsigned maxLength) const; |
251 | 247 |
252 template<size_t inlineCapacity> | 248 template<size_t inlineCapacity> |
253 void appendTo(Vector<UChar, inlineCapacity>&, unsigned pos = 0, unsigned len
= UINT_MAX) const; | 249 void appendTo(Vector<UChar, inlineCapacity>&, unsigned pos = 0, unsigned len
= UINT_MAX) const; |
254 | 250 |
255 template<typename BufferType> | 251 template<typename BufferType> |
256 void appendTo(BufferType&, unsigned pos = 0, unsigned len = UINT_MAX) const; | 252 void appendTo(BufferType&, unsigned pos = 0, unsigned len = UINT_MAX) const; |
257 | 253 |
(...skipping 441 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
699 using WTF::charactersToFloat; | 695 using WTF::charactersToFloat; |
700 using WTF::equal; | 696 using WTF::equal; |
701 using WTF::equalIgnoringCase; | 697 using WTF::equalIgnoringCase; |
702 using WTF::find; | 698 using WTF::find; |
703 using WTF::isAllSpecialCharacters; | 699 using WTF::isAllSpecialCharacters; |
704 using WTF::isSpaceOrNewline; | 700 using WTF::isSpaceOrNewline; |
705 using WTF::reverseFind; | 701 using WTF::reverseFind; |
706 | 702 |
707 #include "wtf/text/AtomicString.h" | 703 #include "wtf/text/AtomicString.h" |
708 #endif // WTFString_h | 704 #endif // WTFString_h |
OLD | NEW |