hashCombine.h

Go to the documentation of this file.

/*
 * LSST Data Management System
 * See COPYRIGHT file at the top of the source tree.
 *
 * This product includes software developed by the
 * LSST Project (http://www.lsst.org/).
 *
 * This program 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.
 *
 * This program 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 LSST License Statement and
 * the GNU General Public License along with this program.  If not,
 * see <http://www.lsstcorp.org/LegalNotices/>.
 */
#ifndef LSST_CPPUTILS_HASH_COMBINE_H
#define LSST_CPPUTILS_HASH_COMBINE_H
 
#include <functional>
 
namespace lsst {
namespace cpputils {
 
inline std::size_t hashCombine(std::size_t seed) noexcept { return seed; }
 
// This implementation is provided by Matteo Italia, https://stackoverflow.com/a/38140932/834250
// Algorithm described at https://stackoverflow.com/a/27952689
// WARNING: should not be inline or constexpr; it can cause instantiation-order problems with std::hash<T>
template <typename T, typename... Rest>
std::size_t hashCombine(std::size_t seed, const T& value, Rest... rest) noexcept {
    std::hash<T> hasher;
    seed ^= hasher(value) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    return hashCombine(seed, rest...);
}
 
// Note: not an overload of hashCombine to avoid ambiguity with hashCombine(size_t, T1, T2)
// WARNING: should not be inline or constexpr; it can cause instantiation-order problems with std::hash<T>
template <typename InputIterator>
std::size_t hashIterable(std::size_t seed, InputIterator begin, InputIterator end) noexcept {
    std::size_t result = 0;
    for (; begin != end; ++begin) {
        result = hashCombine(result, *begin);
    }
    return result;
}
 
}
namespace utils = cpputils;
} // namespace lsst::cpputils
 
#endif