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

Remove unnecessary RNG

Browse Source
This commit is contained in:
Peter Dimov
2022-07-22 19:12:39 +03:00
parent 2c5b8577aa
commit dfa3c7311f
4 changed files with 8 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
benchmark/string.cpp
View File

@ -172,14 +172,10 @@ template<class Map> BOOST_NOINLINE void test_erase( Map& map, std::chrono::stead
print_time( t1, "Consecutive erase", 0, map.size() );
{
boost::detail::splitmix64 rng;
for( unsigned i = 1; i <= N; ++i )
{
map.erase( indices2[ i ] );
}
}
print_time( t1, "Random erase", 0, map.size() );

4
benchmark/string_view.cpp
View File

@ -173,14 +173,10 @@ template<class Map> BOOST_NOINLINE void test_erase( Map& map, std::chrono::stead
print_time( t1, "Consecutive erase", 0, map.size() );
{
boost::detail::splitmix64 rng;
for( unsigned i = 1; i <= N; ++i )
{
map.erase( indices2[ i ] );
}
}
print_time( t1, "Random erase", 0, map.size() );

4
benchmark/uint32.cpp
View File

@ -182,14 +182,10 @@ template<class Map> BOOST_NOINLINE void test_erase( Map& map, std::chrono::stead
print_time( t1, "Consecutive erase", 0, map.size() );
{
boost::detail::splitmix64 rng;
for( unsigned i = 1; i <= N; ++i )
{
map.erase( indices2[ i ] );
}
}
print_time( t1, "Random erase", 0, map.size() );

4
benchmark/uint64.cpp
View File

@ -182,14 +182,10 @@ template<class Map> BOOST_NOINLINE void test_erase( Map& map, std::chrono::stead
print_time( t1, "Consecutive erase", 0, map.size() );
{
boost::detail::splitmix64 rng;
for( unsigned i = 1; i <= N; ++i )
{
map.erase( indices2[ i ] );
}
}
print_time( t1, "Random erase", 0, map.size() );