Generic hash function for STL style unordered containers
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Go to file
Peter Dimov e798972130 Update C++03 deprecation message 1 week ago
.drone Update .drone.jsonnet 4 months ago
.github/workflows Update ci.yml 3 weeks ago
benchmark Update benchmark/unordered.cpp 6 months ago
doc Update documentation 2 months ago
examples Add examples/point2.cpp 7 months ago
include/boost Update C++03 deprecation message 1 week ago
meta Update key in libraries.json 2 years ago
test Use link=static for /boost//filesystem under UBSan 3 months ago
.appveyor.yml Remove msvc-14.2 from appveyor.yml 11 months ago
.drone.jsonnet Update .drone.jsonnet 3 months ago
.gitattributes This commit was generated by cvs2svn to compensate for changes in r4, 23 years ago
.travis.yml Use boost 1.67.0 in travis and appveyor 5 years ago
CMakeLists.txt Update CMakeLists.txt 7 months ago Add 9 months ago
index.html Update index.html 1 year ago


The Boost.ContainerHash library, part of Boost C++ Libraries, provides boost::hash, an enhanced implementation of the hash function object specified by C++11 as std::hash, and several support facilities (hash_combine, hash_range, hash_unordered_range).

boost::hash supports most standard types and some user-defined types out of the box, and is extensible; it's possible for a user-defined type X to make iself hashable via boost::hash<X> by defining an appropriate overload of the function hash_value.

See the documentation of the library for more information.


Distributed under the Boost Software License, Version 1.0.