boostorg/functional
1
0
Fork 1
mirror of https://github.com/boostorg/functional.git synced 2025-08-01 21:44:28 +02:00
Code Issues Packages Projects Releases Wiki Activity

Hash: Merge documentation fixes. Fixes #7957.

Browse Source 
[SVN r82827]
This commit is contained in:
Daniel James
2013-02-12 00:19:56 +00:00
parent 33e11b79e4
commit f3f75a101d
2 changed files with 9 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
hash/doc/changes.qbk
View File

@@ -142,14 +142,17 @@
[h2 Boost 1.52.0] [h2 Boost 1.52.0]
* Restore `enum` support, which was accidentally removed in the last version. * Restore `enum` support, which was accidentally removed in the last version.
* New floating point hasher - will hash the binary representation on more
platforms, which should be faster.
[h2 Boost 1.53.0]
* Add support for `boost::int128_type` and `boost::uint128_type` where * Add support for `boost::int128_type` and `boost::uint128_type` where
available - currently only `__int128` and `unsigned __int128` on some available - currently only `__int128` and `unsigned __int128` on some
versions of gcc. versions of gcc.
* New floating point hasher - will hash the binary representation on more * On platforms that are known to have the standard floating point functions,
platforms, which should be faster. don't use automatic detection - which can break if there are ambiguous
* On platforms that are known to have standard floating point, don't use the overloads.
automatic detection of floating point functions - which can break if there
are ambiguous overloads.
* Fix undefined behaviour when using the binary float hash (Thomas Heller). * Fix undefined behaviour when using the binary float hash (Thomas Heller).
[endsect] [endsect]

2
hash/doc/rationale.qbk
View File

@@ -38,7 +38,7 @@ function, such as [@http://www.concentric.net/~ttwang/tech/inthash.htm
Thomas Wang's hash function]. This this may not work as Thomas Wang's hash function]. This this may not work as
well as a hash algorithm tailored for the input. well as a hash algorithm tailored for the input.
For strings that are several fast, high quality hash functions For strings there are several fast, high quality hash functions
available (for example [@http://code.google.com/p/smhasher/ MurmurHash3] available (for example [@http://code.google.com/p/smhasher/ MurmurHash3]
and [@http://code.google.com/p/cityhash/ Google's CityHash]), and [@http://code.google.com/p/cityhash/ Google's CityHash]),
although they tend to be more machine specific. although they tend to be more machine specific.