summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorAndres Noetzli <andres.noetzli@gmail.com>2017-09-29 01:14:51 -0700
committerGitHub <noreply@github.com>2017-09-29 01:14:51 -0700
commitc884127d6d3cc3444a18ec8a9fb9a5096ae482b0 (patch)
treef7ca4007c7ff1bc0e2c1644e4cfd0a1c909225bf /src
parent821a9d90914fca4a13bc29f8ff15fb4220cbd1d4 (diff)
Better hash function for pairs (#1157)
CVC4 was computing hashes for pairs of objects by simply XORing the hashes of the two objects. This commit implements a better way of combining hashes based on the FNV-1a hash algorithm. The algorithm is public domain.
Diffstat (limited to 'src')
-rw-r--r--src/util/hash.h19
1 files changed, 18 insertions, 1 deletions
diff --git a/src/util/hash.h b/src/util/hash.h
index b04fb8bb5..aa373b0ca 100644
--- a/src/util/hash.h
+++ b/src/util/hash.h
@@ -20,6 +20,7 @@
#ifndef __CVC4__HASH_H
#define __CVC4__HASH_H
+#include <cstdint>
#include <functional>
#include <string>
@@ -40,11 +41,27 @@ struct hash<uint64_t> {
namespace CVC4 {
+namespace fnv1a {
+
+/**
+ * FNV-1a hash algorithm for 64-bit numbers.
+ *
+ * More details here: http://www.isthe.com/chongo/tech/comp/fnv/index.html
+ */
+inline uint64_t fnv1a_64(uint64_t v, uint64_t hash = 14695981039346656037U) {
+ hash ^= v;
+ // Compute (hash * 1099511628211)
+ return hash + (hash << 1) + (hash << 4) + (hash << 5) + (hash << 7) +
+ (hash << 8) + (hash << 40);
+}
+
+} // namespace fnv1a
template <class T, class U, class HashT = std::hash<T>, class HashU = std::hash<U> >
struct PairHashFunction {
size_t operator()(const std::pair<T, U>& pr) const {
- return HashT()(pr.first) ^ HashU()(pr.second);
+ uint64_t hash = fnv1a::fnv1a_64(HashT()(pr.first));
+ return static_cast<size_t>(fnv1a::fnv1a_64(HashU()(pr.second), hash));
}
};/* struct PairHashFunction */
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback