Painless
A framework to ease parallelization of sequential CDCL SAT solvers
Loading...
Searching...
No Matches
hashfunc.hpp
1// -*- coding: utf-8 -*-
2// Copyright (C) 2015, 2018 Laboratoire de Recherche et Développement
3// de l'Epita (LRDE)
4// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
5// département Systèmes Répartis Coopératifs (SRC), Université Pierre
6// et Marie Curie.
7//
8// This file is part of Spot, a model checking library.
9//
10// Spot is free software; you can redistribute it and/or modify it
11// under the terms of the GNU General Public License as published by
12// the Free Software Foundation; either version 3 of the License, or
13// (at your option) any later version.
14//
15// Spot is distributed in the hope that it will be useful, but WITHOUT
16// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
18// License for more details.
19//
20// You should have received a copy of the GNU General Public License
21// along with this program. If not, see <http://www.gnu.org/licenses/>.
22
23#pragma once
24
25#include <cstddef>
26#include <type_traits>
27
30
33
38inline size_t
39wang32_hash(size_t key)
40{
41 // We assume that size_t has at least 32bits.
42 key += ~(key << 15);
43 key ^= (key >> 10);
44 key += (key << 3);
45 key ^= (key >> 6);
46 key += ~(key << 11);
47 key ^= (key >> 16);
48 return key;
49}
50
57inline size_t
58knuth32_hash(size_t key)
59{
60 // 2654435761 is the golden ratio of 2^32. The right shift of 3
61 // bits assumes that all objects are aligned on a 8 byte boundary.
62 return (key >> 3) * 2654435761U;
63}
64
66template<class T, class Enable = void>
67struct fnv
68{};
69
71template<class T>
72struct fnv<T, typename std::enable_if<sizeof(T) == 4>::type>
73{
74 static_assert(std::is_integral<T>::value && std::is_unsigned<T>::value,
75 "Fowler-Noll-Vo hash requires an unsigned integral type");
76 static constexpr T init = 2166136261UL;
77 static constexpr T prime = 16777619UL;
78};
79
81template<class T>
82struct fnv<T, typename std::enable_if<sizeof(T) == 8>::type>
83{
84 static_assert(std::is_integral<T>::value && std::is_unsigned<T>::value,
85 "Fowler-Noll-Vo hash requires an unsigned integral type");
86 static constexpr T init = 14695981039346656037ULL;
87 static constexpr T prime = 1099511628211ULL;
88};
89
94template<class It>
95size_t
96fnv_hash(It begin, It end)
97{
98 size_t res = fnv<size_t>::init;
99 for (; begin != end; ++begin) {
100 res ^= *begin;
101 res *= fnv<size_t>::prime;
102 }
103 return res;
104}
size_t wang32_hash(size_t key)
Thomas Wang's 32 bit hash function.
Definition hashfunc.hpp:39
size_t fnv_hash(It begin, It end)
Fowler-Noll-Vo hash function.
Definition hashfunc.hpp:96
size_t knuth32_hash(size_t key)
Knuth's Multiplicative hash function.
Definition hashfunc.hpp:58
Struct for Fowler-Noll-Vo parameters.
Definition hashfunc.hpp:68