boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 03:17:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Add mulx variants to benchmarks

Browse Source
This commit is contained in:
Peter Dimov
2022-12-08 22:29:35 +02:00
parent afbaf9361d
commit b0e076c55d
3 changed files with 24 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
benchmark/uint32.cpp
View File

@ -289,8 +289,11 @@ template<class K, class V> using std_unordered_map =
template<class K, class V> using boost_unordered_map = template<class K, class V> using boost_unordered_map =
boost::unordered_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>; boost::unordered_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>;
template<class K, class V> using boost_unordered_flat_map = template<class K, class V> using boost_unordered_flat_map_xmx =
boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>; boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>, boost::unordered::detail::foa::xmx_mix>;
template<class K, class V> using boost_unordered_flat_map_mulx =
boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>, boost::unordered::detail::foa::mulx_mix>;
#ifdef HAVE_ABSEIL #ifdef HAVE_ABSEIL
@ -315,7 +318,8 @@ int main()
test<std_unordered_map>( "std::unordered_map" ); test<std_unordered_map>( "std::unordered_map" );
test<boost_unordered_map>( "boost::unordered_map" ); test<boost_unordered_map>( "boost::unordered_map" );
test<boost_unordered_flat_map>( "boost::unordered_flat_map" ); test<boost_unordered_flat_map_xmx>( "boost::unordered_flat_map, xmx" );
test<boost_unordered_flat_map_mulx>( "boost::unordered_flat_map, mulx" );
#ifdef HAVE_ANKERL_UNORDERED_DENSE #ifdef HAVE_ANKERL_UNORDERED_DENSE
@ -334,7 +338,7 @@ int main()
for( auto const& x: times ) for( auto const& x: times )
{ {
std::cout << std::setw( 30 ) << ( x.label_ + ": " ) << std::setw( 5 ) << x.time_ << " ms, " << std::setw( 9 ) << x.bytes_ << " bytes in " << x.count_ << " allocations\n"; std::cout << std::setw( 33 ) << ( x.label_ + ": " ) << std::setw( 5 ) << x.time_ << " ms, " << std::setw( 9 ) << x.bytes_ << " bytes in " << x.count_ << " allocations\n";
} }
} }

12
benchmark/uint64.cpp
View File

@ -289,8 +289,11 @@ template<class K, class V> using std_unordered_map =
template<class K, class V> using boost_unordered_map = template<class K, class V> using boost_unordered_map =
boost::unordered_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>; boost::unordered_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>;
template<class K, class V> using boost_unordered_flat_map = template<class K, class V> using boost_unordered_flat_map_xmx =
boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>; boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>, boost::unordered::detail::foa::xmx_mix>;
template<class K, class V> using boost_unordered_flat_map_mulx =
boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>, boost::unordered::detail::foa::mulx_mix>;
#ifdef HAVE_ABSEIL #ifdef HAVE_ABSEIL
@ -325,7 +328,8 @@ int main()
#endif #endif
test<boost_unordered_map>( "boost::unordered_map" ); test<boost_unordered_map>( "boost::unordered_map" );
test<boost_unordered_flat_map>( "boost::unordered_flat_map" ); test<boost_unordered_flat_map_xmx>( "boost::unordered_flat_map, xmx" );
test<boost_unordered_flat_map_mulx>( "boost::unordered_flat_map, mulx" );
#ifdef HAVE_ANKERL_UNORDERED_DENSE #ifdef HAVE_ANKERL_UNORDERED_DENSE
@ -344,7 +348,7 @@ int main()
for( auto const& x: times ) for( auto const& x: times )
{ {
std::cout << std::setw( 30 ) << ( x.label_ + ": " ) << std::setw( 5 ) << x.time_ << " ms, " << std::setw( 9 ) << x.bytes_ << " bytes in " << x.count_ << " allocations\n"; std::cout << std::setw( 33 ) << ( x.label_ + ": " ) << std::setw( 5 ) << x.time_ << " ms, " << std::setw( 9 ) << x.bytes_ << " bytes in " << x.count_ << " allocations\n";
} }
} }

12
benchmark/word_size.cpp
View File

@ -181,8 +181,11 @@ template<class K, class V> using std_unordered_map =
template<class K, class V> using boost_unordered_map = template<class K, class V> using boost_unordered_map =
boost::unordered_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>; boost::unordered_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>;
template<class K, class V> using boost_unordered_flat_map = template<class K, class V> using boost_unordered_flat_map_xmx =
boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>>; boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>, boost::unordered::detail::foa::xmx_mix>;
template<class K, class V> using boost_unordered_flat_map_mulx =
boost::unordered_flat_map<K, V, boost::hash<K>, std::equal_to<K>, allocator_for<K, V>, boost::unordered::detail::foa::mulx_mix>;
#ifdef HAVE_ABSEIL #ifdef HAVE_ABSEIL
@ -207,7 +210,8 @@ int main()
test<std_unordered_map>( "std::unordered_map" ); test<std_unordered_map>( "std::unordered_map" );
test<boost_unordered_map>( "boost::unordered_map" ); test<boost_unordered_map>( "boost::unordered_map" );
test<boost_unordered_flat_map>( "boost::unordered_flat_map" ); test<boost_unordered_flat_map_xmx>( "boost::unordered_flat_map, xmx" );
test<boost_unordered_flat_map_mulx>( "boost::unordered_flat_map, mulx" );
#ifdef HAVE_ANKERL_UNORDERED_DENSE #ifdef HAVE_ANKERL_UNORDERED_DENSE
@ -226,7 +230,7 @@ int main()
for( auto const& x: times ) for( auto const& x: times )
{ {
std::cout << std::setw( 30 ) << ( x.label_ + ": " ) << std::setw( 5 ) << x.time_ << " ms, " << std::setw( 9 ) << x.bytes_ << " bytes in " << x.count_ << " allocations\n"; std::cout << std::setw( 33 ) << ( x.label_ + ": " ) << std::setw( 5 ) << x.time_ << " ms, " << std::setw( 9 ) << x.bytes_ << " bytes in " << x.count_ << " allocations\n";
} }
} }