Use ASCII case-insensitive matching for attribute selectors

third_party/WebKit/Source/wtf/text/StringImpl.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2009 Google Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
@@ skipping 34 matching lines @@
 struct AlreadyHashed;
 struct CStringTranslator;
 template<typename CharacterType> struct HashAndCharactersTranslator;
 struct HashAndUTF8CharactersTranslator;
 struct LCharBufferTranslator;
 struct CharBufferFromLiteralDataTranslator;
 struct SubstringTranslator;
 struct UCharBufferTranslator;
 template<typename> class RetainPtr;
 
-enum TextCaseSensitivity { TextCaseSensitive, TextCaseInsensitive };
+enum TextCaseSensitivity { TextCaseSensitive, TextCaseASCIIInsensitive, TextCaseInsensitive };
 
 enum StripBehavior { StripExtraWhiteSpace, DoNotStripWhiteSpace };
 
 typedef bool (*CharacterMatchFunctionPtr)(UChar);
 typedef bool (*IsWhiteSpaceFunctionPtr)(UChar);
 typedef HashMap<unsigned, StringImpl*, AlreadyHashed> StaticStringsTable;
 
 // Define STRING_STATS to turn on run time statistics of string sizes and memory usage
 #undef STRING_STATS
 
@@ skipping 301 matching lines @@
     size_t find(char character, unsigned start = 0);
     size_t find(UChar character, unsigned start = 0);
     size_t find(CharacterMatchFunctionPtr, unsigned index = 0);
     size_t find(const LChar*, unsigned index = 0);
     ALWAYS_INLINE size_t find(const char* s, unsigned index = 0) { return find(reinterpret_cast<const LChar*>(s), index); }
     size_t find(StringImpl*);
     size_t find(StringImpl*, unsigned index);
     size_t findIgnoringCase(const LChar*, unsigned index = 0);
     ALWAYS_INLINE size_t findIgnoringCase(const char* s, unsigned index = 0) { return findIgnoringCase(reinterpret_cast<const LChar*>(s), index); }
     size_t findIgnoringCase(StringImpl*, unsigned index = 0);
+    size_t findIgnoringASCIICase(StringImpl*, unsigned index = 0);
 
     size_t findNextLineStart(unsigned index = UINT_MAX);
 
     size_t reverseFind(UChar, unsigned index = UINT_MAX);
     size_t reverseFind(StringImpl*, unsigned index = UINT_MAX);
 
     size_t count(LChar) const;
 
     bool startsWith(UChar) const;
     bool startsWith(const char*, unsigned matchLength) const;
     bool startsWith(const StringImpl*) const;
     bool startsWithIgnoringCase(const StringImpl*) const;
+    bool startsWithIgnoringASCIICase(const StringImpl*) const;
 
     bool endsWith(UChar) const;
     bool endsWith(const char*, unsigned matchLength) const;
     bool endsWith(const StringImpl*) const;
     bool endsWithIgnoringCase(const StringImpl*) const;
+    bool endsWithIgnoringASCIICase(const StringImpl*) const;
 
     PassRefPtr<StringImpl> replace(UChar, UChar);
     PassRefPtr<StringImpl> replace(UChar, StringImpl*);
     ALWAYS_INLINE PassRefPtr<StringImpl> replace(UChar pattern, const char* replacement, unsigned replacementLength) { return replace(pattern, reinterpret_cast<const LChar*>(replacement), replacementLength); }
     PassRefPtr<StringImpl> replace(UChar, const LChar*, unsigned replacementLength);
     PassRefPtr<StringImpl> replace(UChar, const UChar*, unsigned replacementLength);
     PassRefPtr<StringImpl> replace(StringImpl*, StringImpl*);
     PassRefPtr<StringImpl> replace(unsigned index, unsigned len, StringImpl*);
     PassRefPtr<StringImpl> upconvertedString();
 
@@ skipping 95 matching lines @@
 inline bool equalIgnoringASCIICase(const CharacterTypeA* a, const CharacterTypeB* b, unsigned length)
 {
     for (unsigned i = 0; i < length; ++i) {
         if (toASCIILower(a[i]) != toASCIILower(b[i]))
             return false;
     }
     return true;
 }
 
 template<typename CharacterTypeA, typename CharacterTypeB>
-bool startsWithIgnoringASCIICase(const CharacterTypeA& reference, const CharacterTypeB& prefix)
+inline bool equalIgnoringASCIICase(const CharacterTypeA& a, const CharacterTypeB& b)
 {
-    unsigned prefixLength = prefix.length();
-    if (prefixLength > reference.length())
+    unsigned length = b.length();
+    if (a.length() != length)
         return false;
-
-    if (reference.is8Bit()) {
-        if (prefix.is8Bit())
-            return equalIgnoringASCIICase(reference.characters8(), prefix.characters8(), prefixLength);
-        return equalIgnoringASCIICase(reference.characters8(), prefix.characters16(), prefixLength);
+    if (a.is8Bit()) {
+        if (b.is8Bit())
+            return equalIgnoringASCIICase(a.characters8(), b.characters8(), length);
+        return equalIgnoringASCIICase(a.characters8(), b.characters16(), length);
     }
-    if (prefix.is8Bit())
-        return equalIgnoringASCIICase(reference.characters16(), prefix.characters8(), prefixLength);
-    return equalIgnoringASCIICase(reference.characters16(), prefix.characters16(), prefixLength);
+    if (b.is8Bit())
+        return equalIgnoringASCIICase(a.characters16(), b.characters8(), length);
+    return equalIgnoringASCIICase(a.characters16(), b.characters16(), length);
 }
 
 template<typename CharacterType>
 inline size_t find(const CharacterType* characters, unsigned length, CharacterType matchCharacter, unsigned index = 0)
 {
     while (index < length) {
         if (characters[index] == matchCharacter)
             return index;
         ++index;
     }
@@ skipping 229 matching lines @@
     typedef StringHash Hash;
 };
 
 }
 
 using WTF::StringImpl;
 using WTF::equal;
 using WTF::equalNonNull;
 using WTF::TextCaseSensitivity;
 using WTF::TextCaseSensitive;
+using WTF::TextCaseASCIIInsensitive;
 using WTF::TextCaseInsensitive;
 
 #endif