OLD | NEW |
1 /* | 1 /* |
2 * This file is part of Adblock Plus <https://adblockplus.org/>, | 2 * This file is part of Adblock Plus <https://adblockplus.org/>, |
3 * Copyright (C) 2006-present eyeo GmbH | 3 * Copyright (C) 2006-present eyeo GmbH |
4 * | 4 * |
5 * Adblock Plus is free software: you can redistribute it and/or modify | 5 * Adblock Plus is free software: you can redistribute it and/or modify |
6 * it under the terms of the GNU General Public License version 3 as | 6 * it under the terms of the GNU General Public License version 3 as |
7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
8 * | 8 * |
9 * Adblock Plus is distributed in the hope that it will be useful, | 9 * Adblock Plus is distributed in the hope that it will be useful, |
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
12 * GNU General Public License for more details. | 12 * GNU General Public License for more details. |
13 * | 13 * |
14 * You should have received a copy of the GNU General Public License | 14 * You should have received a copy of the GNU General Public License |
15 * along with Adblock Plus. If not, see <http://www.gnu.org/licenses/>. | 15 * along with Adblock Plus. If not, see <http://www.gnu.org/licenses/>. |
16 */ | 16 */ |
17 | 17 |
18 #pragma once | 18 #pragma once |
19 | 19 |
20 #include <cstddef> | 20 #include <cstddef> |
| 21 #include <type_traits> |
21 | 22 |
22 #include "Map.h" | 23 #include "Map.h" |
23 #include "String.h" | 24 #include "String.h" |
24 | 25 |
25 namespace { | 26 namespace { |
26 size_t stringHash(const String& key) | 27 size_t stringHash(const String& key) |
27 { | 28 { |
28 // FNV-1a hash function | 29 // FNV-1a hash function |
29 size_t result = 2166136261; | 30 size_t result = 2166136261; |
30 for (size_t i = 0; i < key.length(); i++) | 31 for (size_t i = 0; i < key.length(); i++) |
(...skipping 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
106 } | 107 } |
107 }; | 108 }; |
108 } | 109 } |
109 | 110 |
110 using StringSet = Set<StringMap_internal::StringSetEntry<DependentString>>; | 111 using StringSet = Set<StringMap_internal::StringSetEntry<DependentString>>; |
111 | 112 |
112 template<typename Value> | 113 template<typename Value> |
113 using StringMap = Map<StringMap_internal::StringMapEntry<DependentString, Value>
>; | 114 using StringMap = Map<StringMap_internal::StringMapEntry<DependentString, Value>
>; |
114 template<typename Value> | 115 template<typename Value> |
115 using OwnedStringMap = Map<StringMap_internal::StringMapEntry<OwnedString, Value
>>; | 116 using OwnedStringMap = Map<StringMap_internal::StringMapEntry<OwnedString, Value
>>; |
OLD | NEW |