0ct0pu5/ladybird
1
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2024-12-04 13:30:31 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 7

Tests: Use AK::shuffle() for shuffling

Browse source
This commit is contained in:
Sam Atkins 2023-01-20 15:24:45 +00:00 committed by Sam Atkins
parent 4b525fc98e
commit 93ca5d4772
Notes: sideshowbarker 2024-07-17 06:46:15 +09:00 
Author: https://github.com/AtkinsSJ
Commit: https://github.com/SerenityOS/serenity/commit/93ca5d4772
Pull-request: https://github.com/SerenityOS/serenity/pull/17104
1 changed files with 1 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
Tests/LibC/TestQsort.cpp
View file

@ -38,15 +38,6 @@ static int calc_payload_for_pos(size_t pos)
return pos ^ (pos << 8) ^ (pos << 16) ^ (pos << 24);
}
static void shuffle_vec(Vector<SortableObject>& test_objects)
{
for (size_t i = 0; i < test_objects.size() * 3; ++i) {
auto i1 = get_random_uniform(test_objects.size());
auto i2 = get_random_uniform(test_objects.size());
swap(test_objects[i1], test_objects[i2]);
}
}
TEST_CASE(quick_sort)
{
// Generate vector of SortableObjects in sorted order, with payloads determined by their sorted positions
@ -56,7 +47,7 @@ TEST_CASE(quick_sort)
}
for (size_t i = 0; i < NUM_RUNS; i++) {
// Shuffle the vector, then sort it again
shuffle_vec(test_objects);
shuffle(test_objects);
qsort(test_objects.data(), test_objects.size(), sizeof(SortableObject), compare_sortable_object);
// Check that the objects are sorted by key
for (auto i = 0u; i + 1 < test_objects.size(); ++i) {