mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-01-23 17:52:26 -05:00
35c0a6c54d
As many macros as possible are moved to Macros.h, while the macros to create a test case are moved to TestCase.h. TestCase is now the only user-facing header for creating a test case. TestSuite and its helpers have moved into a .cpp file. Instead of requiring a TEST_MAIN macro to be instantiated into the test file, a TestMain.cpp file is provided instead that will be linked against each test. This has the side effect that, if we wanted to have test cases split across multiple files, it's as simple as adding them all to the same executable. The test main should be portable to kernel mode as well, so if there's a set of tests that should be run in self-test mode in kernel space, we can accomodate that. A new serenity_test CMake function streamlines adding a new test with arguments for the test source file, subdirectory under /usr/Tests to install the test application and an optional list of libraries to link against the test application. To accomodate future test where the provided TestMain.cpp is not suitable (e.g. test-js), a CUSTOM_MAIN parameter can be passed to the function to not link against the boilerplate main function.
100 lines
2.6 KiB
C++
100 lines
2.6 KiB
C++
/*
|
|
* Copyright (c) 2020, the SerenityOS developers.
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibTest/TestCase.h>
|
|
|
|
#include <AK/Checked.h>
|
|
#include <AK/Noncopyable.h>
|
|
#include <AK/QuickSort.h>
|
|
#include <AK/StdLibExtras.h>
|
|
|
|
TEST_CASE(sorts_without_copy)
|
|
{
|
|
struct NoCopy {
|
|
AK_MAKE_NONCOPYABLE(NoCopy);
|
|
|
|
public:
|
|
NoCopy() = default;
|
|
NoCopy(NoCopy&&) = default;
|
|
|
|
NoCopy& operator=(NoCopy&&) = default;
|
|
|
|
int value { 0 };
|
|
};
|
|
|
|
Array<NoCopy, 64> array;
|
|
|
|
// Test the dual pivot quick sort.
|
|
for (size_t i = 0; i < 64; ++i)
|
|
array[i].value = (64 - i) % 32 + 32;
|
|
|
|
dual_pivot_quick_sort(array, 0, array.size() - 1, [](auto& a, auto& b) { return a.value < b.value; });
|
|
|
|
for (size_t i = 0; i < 63; ++i)
|
|
EXPECT(array[i].value <= array[i + 1].value);
|
|
|
|
// Test the single pivot quick sort.
|
|
for (size_t i = 0; i < 64; ++i)
|
|
array[i].value = (64 - i) % 32 + 32;
|
|
|
|
AK::single_pivot_quick_sort(array.begin(), array.end(), [](auto& a, auto& b) { return a.value < b.value; });
|
|
|
|
for (size_t i = 0; i < 63; ++i)
|
|
EXPECT(array[i].value <= array[i + 1].value);
|
|
}
|
|
|
|
// This test case may fail to construct a worst-case input if the pivot choice
|
|
// of the underlying quick_sort no longer matches the one used here.
|
|
// So it provides no strong guarantees about the properties of quick_sort.
|
|
TEST_CASE(maximum_stack_depth)
|
|
{
|
|
const int size = 256;
|
|
int* data = new int[size];
|
|
|
|
for (int i = 0; i < size; i++) {
|
|
data[i] = i;
|
|
}
|
|
|
|
// Construct the data in such a way that the assumed pivot choice
|
|
// of (size / 2) causes the partitions to be of worst case size.
|
|
for (int i = 0; i < size / 2; i++) {
|
|
swap(data[i], data[i + (size - i) / 2]);
|
|
}
|
|
|
|
// Measure the depth of the call stack through the less_than argument
|
|
// of quick_sort as it gets copied for each recursive call.
|
|
struct DepthMeasurer {
|
|
int& max_depth;
|
|
int depth { 0 };
|
|
DepthMeasurer(int& max_depth)
|
|
: max_depth(max_depth)
|
|
{
|
|
}
|
|
DepthMeasurer(const DepthMeasurer& obj)
|
|
: max_depth(obj.max_depth)
|
|
{
|
|
depth = obj.depth + 1;
|
|
if (depth > max_depth) {
|
|
max_depth = depth;
|
|
}
|
|
}
|
|
bool operator()(int& a, int& b)
|
|
{
|
|
return a < b;
|
|
}
|
|
};
|
|
|
|
int max_depth = 0;
|
|
DepthMeasurer measurer(max_depth);
|
|
AK::single_pivot_quick_sort(data, data + size, measurer);
|
|
|
|
EXPECT(max_depth <= 64);
|
|
|
|
for (int i = 0; i < size; i++)
|
|
EXPECT(data[i] == i);
|
|
|
|
delete[] data;
|
|
}
|