1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/*
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <AK/Assertions.h>
#include <AK/QuickSort.h>
#include <stdlib.h>
#include <sys/types.h>
class SizedObject {
public:
SizedObject() = delete;
SizedObject(void* data, size_t size)
: m_data(data)
, m_size(size)
{
}
void* data() const { return m_data; }
size_t size() const { return m_size; }
private:
void* m_data;
size_t m_size;
};
namespace AK {
template<>
inline void swap(const SizedObject& a, const SizedObject& b)
{
VERIFY(a.size() == b.size());
const size_t size = a.size();
const auto a_data = reinterpret_cast<char*>(a.data());
const auto b_data = reinterpret_cast<char*>(b.data());
for (auto i = 0u; i < size; ++i) {
swap(a_data[i], b_data[i]);
}
}
}
class SizedObjectSlice {
public:
SizedObjectSlice() = delete;
SizedObjectSlice(void* data, size_t element_size)
: m_data(data)
, m_element_size(element_size)
{
}
const SizedObject operator[](size_t index)
{
return { static_cast<char*>(m_data) + index * m_element_size, m_element_size };
}
private:
void* m_data;
size_t m_element_size;
};
void qsort(void* bot, size_t nmemb, size_t size, int (*compar)(const void*, const void*))
{
if (nmemb <= 1) {
return;
}
SizedObjectSlice slice { bot, size };
AK::dual_pivot_quick_sort(slice, 0, nmemb - 1, [=](const SizedObject& a, const SizedObject& b) { return compar(a.data(), b.data()) < 0; });
}
void qsort_r(void* bot, size_t nmemb, size_t size, int (*compar)(const void*, const void*, void*), void* arg)
{
if (nmemb <= 1) {
return;
}
SizedObjectSlice slice { bot, size };
AK::dual_pivot_quick_sort(slice, 0, nmemb - 1, [=](const SizedObject& a, const SizedObject& b) { return compar(a.data(), b.data(), arg) < 0; });
}
|
