Emilio Cobos Álvarez
bb460ea208
Hashing char by char is unnecessarily expensive, this hashes four bytes at a time for those. I did that rather than keeping size_t because HashBytes(uint64_t) ends up in two AddUint32ToHash() anyways, and that way we avoid the python re-implementation from depending on the word size of the target. For wide strings, keep the current char-by-char version for now, but reduce the amount of times this algorithm is duplicated and we rely on it matching: * HashUTF8AsUTF16() * JS atoms * xpcom atoms. Use constexpr to simplify the static atoms set up. Differential Revision: https://phabricator.services.mozilla.com/D306312
29 lines
783 B
C++
29 lines
783 B
C++
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
#ifndef nsTStringHasher_h_
|
|
#define nsTStringHasher_h_
|
|
|
|
#include "mozilla/HashTable.h" // mozilla::{DefaultHasher, HashNumber, HashString}
|
|
|
|
namespace mozilla {
|
|
|
|
template <typename T>
|
|
struct DefaultHasher<nsTString<T>> {
|
|
using Key = nsTString<T>;
|
|
using Lookup = nsTString<T>;
|
|
|
|
static mozilla::HashNumber hash(const Lookup& aLookup) {
|
|
return mozilla::HashString(aLookup.get(), aLookup.Length());
|
|
}
|
|
|
|
static bool match(const Key& aKey, const Lookup& aLookup) {
|
|
return aKey.Equals(aLookup);
|
|
}
|
|
};
|
|
|
|
} // namespace mozilla
|
|
|
|
#endif // !defined(nsTStringHasher_h_)
|