Skip to content

Benchmark Test Correction for boost::sort #83

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
SebastianMenzelSAP wants to merge 3 commits into
base: develop
Choose a base branch
from
Open

Benchmark Test Correction for boost::sort #83

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
bf5a937
solved issues in benchmark_numbers.cpp
SebastianMenzelSAP Jan 22, 2024
9349789
changed formatting to match with the current version
SebastianMenzelSAP Jan 22, 2024
ff244cd
formatting should be correct now
SebastianMenzelSAP Jan 22, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 6 additions & 8 deletions benchmark/single/benchmark_numbers.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -185,18 +185,16 @@ void Generator_sorted_middle (size_t n_last)
for (size_t i = NELEM; i < A.size (); ++i)
B.push_back (std::move (A[i]));
A.resize ( NELEM);
for (size_t i = 0; i < (NELEM >> 1); ++i)
std::swap (A[i], A[NELEM - 1 - i]);

std::sort (A.begin (), A.end ());
size_t step = NELEM / n_last + 1;
size_t step = NELEM / n_last;
size_t pos = 0;

for (size_t i = 0; i < B.size (); ++i, pos += step)
{
C.push_back (B[i]);
for (size_t k = 0; k < step; ++k)
C.push_back (A[pos + k]);
C.push_back (A.at(pos + k));
};
while (pos < A.size ())
C.push_back (A[pos++]);
Expand Down Expand Up @@ -243,18 +241,18 @@ void Generator_reverse_sorted_middle (size_t n_last)
for (size_t i = NELEM; i < A.size (); ++i)
B.push_back (std::move (A[i]));
A.resize ( NELEM);
for (size_t i = 0; i < (NELEM >> 1); ++i)
std::swap (A[i], A[NELEM - 1 - i]);

std::sort (A.begin (), A.end ());
size_t step = NELEM / n_last + 1;
size_t step = NELEM / n_last;
size_t pos = 0;
for (size_t i = 0; i < (NELEM >> 1); ++i)
std::swap (A[i], A[NELEM - 1 - i]);

for (size_t i = 0; i < B.size (); ++i, pos += step)
{
C.push_back (B[i]);
for (size_t k = 0; k < step; ++k)
C.push_back (A[pos + k]);
C.push_back (A.at(pos + k));
};
while (pos < A.size ())
C.push_back (A[pos++]);
Expand Down