hash.h

Go to the documentation of this file.

/***
 * Bitwuzla: Satisfiability Modulo Theories (SMT) solver.
 *
 * Copyright (C) 2023 by the authors listed in the AUTHORS file at
 * https://github.com/bitwuzla/bitwuzla/blob/main/AUTHORS
 *
 * This file is part of Bitwuzla under the MIT license. See COPYING for more
 * information at https://github.com/bitwuzla/bitwuzla/blob/main/COPYING
 */
// Modified by Xiang Zhang, 2026
// Additional changes licensed under the MIT License
#ifndef BZLA_UTIL_HASH_H_INCLUDED
#define BZLA_UTIL_HASH_H_INCLUDED
 
#include <cstdint>
#include <functional>
#include <utility>
 
namespace stabilizer::util::hash {
static constexpr uint32_t s_hash_primes[] = {333444569u, 76891121u, 456790003u};
static constexpr uint32_t s_n_primes =
    ((uint32_t)(sizeof s_hash_primes / sizeof *s_hash_primes));
}  // namespace stabilizer::util::hash
 
namespace std {
template <>
struct hash<std::pair<uint64_t, uint64_t>> {
    size_t operator()(const std::pair<uint64_t, uint64_t> &p) const;
};
}  // namespace std
#endif