14 #include "libmesh/point.h" 36 template <
class T,
class... Rest>
42 seed ^= hasher(
value) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
50 template <
class Container>
54 std::size_t size = container.size();
55 std::size_t stride = 1 + size / 10;
58 for (std::size_t i = 0; i < size; i += stride)
89 hashCombine(seed, time, point(0), point(1), point(2));
This namespace provides efficient algorithms for quickly hashing different types for checking identit...
void hashCombine(HashValue &)
Final iteration of the variadic template with no additional arguments.
Real value(unsigned n, unsigned alpha, unsigned beta, Real x)
HashValue hashLargeContainer(Container const &container)
Hash function for sampling 10 points from a large container and hashing see: https://stackoverflow.com/a/37007715.