Issue 5142 - Convert Element Hiding to C++

compiled/StringMap.h

 /*
  * This file is part of Adblock Plus <https://adblockplus.org/>,
  * Copyright (C) 2006-present eyeo GmbH
  *
  * Adblock Plus is free software: you can redistribute it and/or modify
  * it under the terms of the GNU General Public License version 3 as
  * published by the Free Software Foundation.
  *
  * Adblock Plus is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  * GNU General Public License for more details.
  *
  * You should have received a copy of the GNU General Public License
  * along with Adblock Plus.  If not, see <http://www.gnu.org/licenses/>.
  */
 
 #pragma once
 
 #include <cstddef>
 
 #include "Map.h"
 #include "String.h"
 
+class StringHash

[hub, 2017/10/25 01:19:38]

this is needed for the unordered_map<>. Otherwise not.

+{
+public:
+  size_t operator()(const String& key) const
+  {
+    // FNV-1a hash function
+    size_t result = 2166136261;
+    for (size_t i = 0; i < key.length(); i++)
+      result = (result ^ key[i]) * 16777619;
+    return result;
+  }
+};
+
 namespace StringMap_internal
 {
   struct StringSetEntry
   {
     typedef String key_type;
     typedef size_t size_type;
 
     DependentString first;
+    static StringHash hashFunctor;
 
     StringSetEntry(const key_type& key = DependentString())
     {
       if (!key.is_invalid())
         first.reset(key);
     }
 
     bool equals(const key_type& other) const
     {
       return first.equals(other);
     }
 
     bool is_invalid() const
     {
       return first.is_invalid();
     }
 
     bool is_deleted() const
     {
       return first.is_deleted();
     }
 
     void erase()
     {
       first.erase();
     }
 
     static size_type hash(const key_type& key)
     {
-      // FNV-1a hash function
-      size_type result = 2166136261;
-      for (String::size_type i = 0; i < key.length(); i++)
-        result = (result ^ key[i]) * 16777619;
-      return result;
+      return hashFunctor(key);
     }
   };
 
   template<typename Value>
   struct StringMapEntry : StringSetEntry
   {
     typedef StringSetEntry super;
     typedef Value value_type;
 
     Value second;
 
     StringMapEntry(const key_type& key = DependentString(),
                    value_type value = value_type())
         : super(key), second(value)
     {
     }
 
     void erase()
     {
       super::erase();
       second = value_type();
     }
   };
 }
 
 using StringSet = Set<StringMap_internal::StringSetEntry>;
 
 template<typename Value>
 using StringMap = Map<StringMap_internal::StringMapEntry<Value>>;