RegExpKey.h 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114
  1. /*
  2. * Copyright (C) 2010 University of Szeged
  3. * Copyright (C) 2010 Renata Hodovan (hodovan@inf.u-szeged.hu)
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY
  16. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  18. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR
  19. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  20. * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  21. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  22. * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
  23. * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  24. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  25. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. #ifndef RegExpKey_h
  28. #define RegExpKey_h
  29. #include <wtf/text/StringHash.h>
  30. #include <wtf/text/WTFString.h>
  31. namespace JSC {
  32. enum RegExpFlags {
  33. NoFlags = 0,
  34. FlagGlobal = 1,
  35. FlagIgnoreCase = 2,
  36. FlagMultiline = 4,
  37. InvalidFlags = 8,
  38. DeletedValueFlags = -1
  39. };
  40. struct RegExpKey {
  41. RegExpFlags flagsValue;
  42. RefPtr<StringImpl> pattern;
  43. RegExpKey()
  44. : flagsValue(NoFlags)
  45. {
  46. }
  47. RegExpKey(RegExpFlags flags)
  48. : flagsValue(flags)
  49. {
  50. }
  51. RegExpKey(RegExpFlags flags, const String& pattern)
  52. : flagsValue(flags)
  53. , pattern(pattern.impl())
  54. {
  55. }
  56. RegExpKey(RegExpFlags flags, const PassRefPtr<StringImpl> pattern)
  57. : flagsValue(flags)
  58. , pattern(pattern)
  59. {
  60. }
  61. RegExpKey(RegExpFlags flags, const RefPtr<StringImpl>& pattern)
  62. : flagsValue(flags)
  63. , pattern(pattern)
  64. {
  65. }
  66. friend inline bool operator==(const RegExpKey& a, const RegExpKey& b);
  67. struct Hash {
  68. static unsigned hash(const RegExpKey& key) { return key.pattern->hash(); }
  69. static bool equal(const RegExpKey& a, const RegExpKey& b) { return a == b; }
  70. static const bool safeToCompareToEmptyOrDeleted = false;
  71. };
  72. };
  73. inline bool operator==(const RegExpKey& a, const RegExpKey& b)
  74. {
  75. if (a.flagsValue != b.flagsValue)
  76. return false;
  77. if (!a.pattern)
  78. return !b.pattern;
  79. if (!b.pattern)
  80. return false;
  81. return equal(a.pattern.get(), b.pattern.get());
  82. }
  83. } // namespace JSC
  84. namespace WTF {
  85. template<typename T> struct DefaultHash;
  86. template<> struct DefaultHash<JSC::RegExpKey> {
  87. typedef JSC::RegExpKey::Hash Hash;
  88. };
  89. template<> struct HashTraits<JSC::RegExpKey> : GenericHashTraits<JSC::RegExpKey> {
  90. static const bool emptyValueIsZero = true;
  91. static void constructDeletedValue(JSC::RegExpKey& slot) { slot.flagsValue = JSC::DeletedValueFlags; }
  92. static bool isDeletedValue(const JSC::RegExpKey& value) { return value.flagsValue == JSC::DeletedValueFlags; }
  93. };
  94. } // namespace WTF
  95. #endif // RegExpKey_h