* src/sanity/style.test: Test for the missing header. * iface/ltsmin/check.test, src/kripketest/kripke.test, src/kripketest/parse_print_test.cc, src/ltlparse/fmterror.cc, src/ltltest/consterm.test, src/ltltest/kind.test, src/ltltest/length.test, src/ltltest/ltlfilt.test, src/ltltest/reduc.cc, src/ltltest/reduc.test, src/ltltest/reduc0.test, src/ltltest/reducpsl.test, src/ltltest/remove_x.test, src/ltltest/unabbrevwm.test, src/ltltest/utf8.test, src/ltltest/uwrm.test, src/ltlvisit/dump.cc, src/ltlvisit/remove_x.cc, src/misc/casts.hh, src/misc/fixpool.hh, src/misc/hashfunc.hh, src/misc/ltstr.hh, src/sanity/readme.test, src/taalgos/tgba2ta.cc, src/tgbaalgos/bfssteps.cc, src/tgbaalgos/stats.cc, src/tgbatest/acc.test, src/tgbatest/bitvect.test, src/tgbatest/complementation.test, src/tgbatest/cycles.test, src/tgbatest/degendet.test, src/tgbatest/dfs.test, src/tgbatest/dupexp.test, src/tgbatest/emptchkr.test, src/tgbatest/intvcomp.test, src/tgbatest/ltl2ta.test, src/tgbatest/ltl2ta2.test, src/tgbatest/ltlprod.test, src/tgbatest/maskacc.test, src/tgbatest/obligation.test, src/tgbatest/randpsl.test, src/tgbatest/readsat.cc, src/tgbatest/readsat.test, src/tgbatest/scc.test, src/tgbatest/sccsimpl.test, src/tgbatest/taatgba.test, src/tgbatest/tgbaread.test, src/tgbatest/tripprod.test, src/tgbatest/uniq.test, src/tgbatest/wdba.test: Add it.
66 lines
2.1 KiB
C++
66 lines
2.1 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2015 Laboratoire de Recherche et Développement
|
|
// de l'Epita (LRDE)
|
|
// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// This file is part of Spot, a model checking library.
|
|
//
|
|
// Spot is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Spot 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#ifndef SPOT_MISC_HASHFUNC_HH
|
|
# define SPOT_MISC_HASHFUNC_HH
|
|
# include <cstddef>
|
|
|
|
namespace spot
|
|
{
|
|
/// \addtogroup hash_funcs Hashing functions
|
|
/// \ingroup misc_tools
|
|
/// @{
|
|
|
|
/// \brief Thomas Wang's 32 bit hash function.
|
|
///
|
|
/// Hash an integer amongst the integers.
|
|
/// http://www.concentric.net/~Ttwang/tech/inthash.htm
|
|
inline size_t
|
|
wang32_hash(size_t key)
|
|
{
|
|
// We assume that size_t has at least 32bits.
|
|
key += ~(key << 15);
|
|
key ^= (key >> 10);
|
|
key += (key << 3);
|
|
key ^= (key >> 6);
|
|
key += ~(key << 11);
|
|
key ^= (key >> 16);
|
|
return key;
|
|
}
|
|
|
|
/// \brief Knuth's Multiplicative hash function.
|
|
///
|
|
/// This function is suitable for hashing values whose
|
|
/// high order bits do not vary much (ex. addresses of
|
|
/// memory objects). Prefer spot::wang32_hash() otherwise.
|
|
/// http://www.concentric.net/~Ttwang/tech/addrhash.htm
|
|
inline size_t
|
|
knuth32_hash(size_t key)
|
|
{
|
|
// 2654435761 is the golden ratio of 2^32. The right shift of 3
|
|
// bits assumes that all objects are aligned on a 8 byte boundary.
|
|
return (key >> 3) * 2654435761U;
|
|
}
|
|
/// @}
|
|
}
|
|
|
|
#endif // SPOT_MISC_HASHFUNC_HH
|