mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-01-22 09:12:13 -05:00
c16c20b836
Previously, it ignored 'start', sorting from the array's beginning. This caused unintended changes and slower performance. Fix ensures sorting stays within 'start' and 'end' indices only.
80 lines
2 KiB
C++
80 lines
2 KiB
C++
/*
|
|
* Copyright (c) 2022, Marc Luqué <marc.luque@outlook.com>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibTest/TestCase.h>
|
|
|
|
#include <AK/InsertionSort.h>
|
|
#include <AK/Random.h>
|
|
#include <AK/Vector.h>
|
|
|
|
static constexpr int const n = 10;
|
|
static constexpr int const iterations = 10;
|
|
static constexpr int const seed = 1337;
|
|
|
|
TEST_CASE(sorts_ascending)
|
|
{
|
|
srand(seed);
|
|
|
|
for (int i = 0; i < iterations; ++i) {
|
|
Vector<int, n> ints;
|
|
for (int j = 0; j < n; ++j)
|
|
ints.append(get_random<int>());
|
|
Vector<int, n> ints_copy = ints;
|
|
|
|
insertion_sort(ints);
|
|
insertion_sort(ints_copy);
|
|
|
|
for (int j = 0; j < n - 1; ++j) {
|
|
EXPECT(ints[j] <= ints[j + 1]);
|
|
EXPECT_EQ(ints[j], ints_copy[j]);
|
|
EXPECT_EQ(ints[j + 1], ints_copy[j + 1]);
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_CASE(sorts_decending)
|
|
{
|
|
srand(seed);
|
|
|
|
for (int i = 0; i < iterations; ++i) {
|
|
Vector<int, n> ints;
|
|
for (int j = 0; j < n; ++j)
|
|
ints.append(get_random<int>());
|
|
Vector<int, n> ints_copy = ints;
|
|
|
|
insertion_sort(ints, [](auto& a, auto& b) { return a > b; });
|
|
insertion_sort(ints_copy, [](auto& a, auto& b) { return a > b; });
|
|
|
|
for (int j = 0; j < n - 1; ++j) {
|
|
EXPECT(ints[j] >= ints[j + 1]);
|
|
EXPECT_EQ(ints[j], ints_copy[j]);
|
|
EXPECT_EQ(ints[j + 1], ints_copy[j + 1]);
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_CASE(sorts_subrange_without_affecting_outside_elements)
|
|
{
|
|
Vector<int> ints = { 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 };
|
|
Vector<int> const original_ints = ints;
|
|
|
|
ssize_t const start = 3;
|
|
ssize_t const end = 6;
|
|
|
|
insertion_sort(ints, start, end, [](auto& a, auto& b) { return a < b; });
|
|
|
|
for (ssize_t i = start; i < end; ++i) {
|
|
EXPECT(ints[i] <= ints[i + 1]);
|
|
}
|
|
|
|
for (ssize_t i = 0; i < start; ++i) {
|
|
EXPECT_EQ(ints[i], original_ints[i]);
|
|
}
|
|
|
|
for (ssize_t i = end + 1; i < static_cast<ssize_t>(ints.size()); ++i) {
|
|
EXPECT_EQ(ints[i], original_ints[i]);
|
|
}
|
|
}
|