feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests 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

8
benchmark/string.cpp
View File

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

8
benchmark/string_view.cpp
View File

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

8
benchmark/uint32.cpp
View File

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

8
benchmark/uint64.cpp
View File

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