boostorg/container_hash
1
0
Fork 1
mirror of https://github.com/boostorg/container_hash.git synced 2025-08-03 14:34:39 +02:00
Code Issues Packages Projects Releases Wiki Activity

Update benchmark/unordered.cpp

Browse Source
This commit is contained in:
Peter Dimov
2022-12-12 21:08:00 +02:00
parent 5bef4901b9
commit 45270ae11e
1 changed files with 1 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
benchmark/unordered.cpp
View File

@@ -181,14 +181,6 @@ struct fnv1a_hash: fnv1a_hash_impl< std::numeric_limits<std::size_t>::digits > {
#ifdef HAVE_MULXP_HASH #ifdef HAVE_MULXP_HASH
struct mulxp0_hash_
{
std::size_t operator()( std::string const& st ) const BOOST_NOEXCEPT
{
return mulxp0_hash( (unsigned char const*)st.data(), st.size(), 0 );
}
};
struct mulxp1_hash_ struct mulxp1_hash_
{ {
std::size_t operator()( std::string const& st ) const BOOST_NOEXCEPT std::size_t operator()( std::string const& st ) const BOOST_NOEXCEPT
@@ -197,14 +189,6 @@ struct mulxp1_hash_
} }
}; };
struct mulxp2_hash_
{
std::size_t operator()( std::string const& st ) const BOOST_NOEXCEPT
{
return mulxp2_hash( (unsigned char const*)st.data(), st.size(), 0 );
}
};
struct mulxp3_hash_ struct mulxp3_hash_
{ {
std::size_t operator()( std::string const& st ) const BOOST_NOEXCEPT std::size_t operator()( std::string const& st ) const BOOST_NOEXCEPT
@@ -398,9 +382,7 @@ int main()
test_hash_speed<ankerl::unordered_dense::hash<std::string> >( N * 16, v ); test_hash_speed<ankerl::unordered_dense::hash<std::string> >( N * 16, v );
#endif #endif
#ifdef HAVE_MULXP_HASH #ifdef HAVE_MULXP_HASH
test_hash_speed<mulxp0_hash_>( N * 16, v );
test_hash_speed<mulxp1_hash_>( N * 16, v ); test_hash_speed<mulxp1_hash_>( N * 16, v );
test_hash_speed<mulxp2_hash_>( N * 16, v );
test_hash_speed<mulxp3_hash_>( N * 16, v ); test_hash_speed<mulxp3_hash_>( N * 16, v );
test_hash_speed<mulxp1_hash32_>( N * 16, v ); test_hash_speed<mulxp1_hash32_>( N * 16, v );
test_hash_speed<mulxp3_hash32_>( N * 16, v ); test_hash_speed<mulxp3_hash32_>( N * 16, v );
@@ -437,9 +419,7 @@ int main()
test_hash_collision<ankerl::unordered_dense::hash<std::string> >( N * 16, v, n ); test_hash_collision<ankerl::unordered_dense::hash<std::string> >( N * 16, v, n );
#endif #endif
#ifdef HAVE_MULXP_HASH #ifdef HAVE_MULXP_HASH
test_hash_collision<mulxp0_hash_>( N * 16, v, n );
test_hash_collision<mulxp1_hash_>( N * 16, v, n ); test_hash_collision<mulxp1_hash_>( N * 16, v, n );
test_hash_collision<mulxp2_hash_>( N * 16, v, n );
test_hash_collision<mulxp3_hash_>( N * 16, v, n ); test_hash_collision<mulxp3_hash_>( N * 16, v, n );
test_hash_collision<mulxp1_hash32_>( N * 16, v, n ); test_hash_collision<mulxp1_hash32_>( N * 16, v, n );
test_hash_collision<mulxp3_hash32_>( N * 16, v, n ); test_hash_collision<mulxp3_hash32_>( N * 16, v, n );
@@ -450,7 +430,7 @@ int main()
typedef std::string K; typedef std::string K;
std::puts( "Container speed test:\n" ); std::puts( "Container speed test:\n---\n" );
test_container_speed<K, mul31_hash>( N, v ); test_container_speed<K, mul31_hash>( N, v );
test_container_speed<K, mul31_x4_hash>( N, v ); test_container_speed<K, mul31_x4_hash>( N, v );
@@ -465,9 +445,7 @@ int main()
test_container_speed<K, ankerl::unordered_dense::hash<std::string> >( N, v ); test_container_speed<K, ankerl::unordered_dense::hash<std::string> >( N, v );
#endif #endif
#ifdef HAVE_MULXP_HASH #ifdef HAVE_MULXP_HASH
test_container_speed<K, mulxp0_hash_>( N, v );
test_container_speed<K, mulxp1_hash_>( N, v ); test_container_speed<K, mulxp1_hash_>( N, v );
test_container_speed<K, mulxp2_hash_>( N, v );
test_container_speed<K, mulxp3_hash_>( N, v ); test_container_speed<K, mulxp3_hash_>( N, v );
test_container_speed<K, mulxp1_hash32_>( N, v ); test_container_speed<K, mulxp1_hash32_>( N, v );
test_container_speed<K, mulxp3_hash32_>( N, v ); test_container_speed<K, mulxp3_hash32_>( N, v );