| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2013 Apple Inc. All rights
reserved. | 3 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2013 Apple Inc. All rights
reserved. |
| 4 * Copyright (C) 2009 Google Inc. All rights reserved. | 4 * Copyright (C) 2009 Google Inc. All rights reserved. |
| 5 * | 5 * |
| 6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
| 7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
| 8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
| 9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
| 10 * | 10 * |
| (...skipping 216 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 227 template <typename CharType> | 227 template <typename CharType> |
| 228 ALWAYS_INLINE const CharType * getCharacters() const; | 228 ALWAYS_INLINE const CharType * getCharacters() const; |
| 229 | 229 |
| 230 size_t sizeInBytes() const; | 230 size_t sizeInBytes() const; |
| 231 | 231 |
| 232 bool isAtomic() const { return m_isAtomic; } | 232 bool isAtomic() const { return m_isAtomic; } |
| 233 void setIsAtomic(bool isAtomic) { m_isAtomic = isAtomic; } | 233 void setIsAtomic(bool isAtomic) { m_isAtomic = isAtomic; } |
| 234 | 234 |
| 235 bool isStatic() const { return m_isStatic; } | 235 bool isStatic() const { return m_isStatic; } |
| 236 | 236 |
| 237 private: | 237 //private: |
| 238 // The high bits of 'hash' are always empty, but we prefer to store our | 238 // The high bits of 'hash' are always empty, but we prefer to store our |
| 239 // flags in the low bits because it makes them slightly more efficient to | 239 // flags in the low bits because it makes them slightly more efficient to |
| 240 // access. So, we shift left and right when setting and getting our hash | 240 // access. So, we shift left and right when setting and getting our hash |
| 241 // code. | 241 // code. |
| 242 void setHash(unsigned hash) const | 242 void setHash(unsigned hash) const |
| 243 { | 243 { |
| 244 ASSERT(!hasHash()); | 244 ASSERT(!hasHash()); |
| 245 // Multiple clients assume that StringHasher is the canonical string | 245 // Multiple clients assume that StringHasher is the canonical string |
| 246 // hash function. | 246 // hash function. |
| 247 ASSERT(hash == (is8Bit() ? StringHasher::computeHashAndMaskTop8Bits(char
acters8(), m_length) : StringHasher::computeHashAndMaskTop8Bits(characters16(),
m_length))); | 247 ASSERT(hash == (is8Bit() ? StringHasher::computeHashAndMaskTop8Bits(char
acters8(), m_length) : StringHasher::computeHashAndMaskTop8Bits(characters16(),
m_length))); |
| (...skipping 524 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 772 | 772 |
| 773 using WTF::StringImpl; | 773 using WTF::StringImpl; |
| 774 using WTF::equal; | 774 using WTF::equal; |
| 775 using WTF::equalNonNull; | 775 using WTF::equalNonNull; |
| 776 using WTF::TextCaseSensitivity; | 776 using WTF::TextCaseSensitivity; |
| 777 using WTF::TextCaseSensitive; | 777 using WTF::TextCaseSensitive; |
| 778 using WTF::TextCaseASCIIInsensitive; | 778 using WTF::TextCaseASCIIInsensitive; |
| 779 using WTF::TextCaseInsensitive; | 779 using WTF::TextCaseInsensitive; |
| 780 | 780 |
| 781 #endif | 781 #endif |
| OLD | NEW |