summaryrefslogtreecommitdiffstatshomepage
path: root/3rdparty/bx/src/sort.cpp
blob: 31ad8c795f4190199195ee45ab2a1f53d72eac19 (plain) (blame)
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
/*
 * Copyright 2010-2022 Branimir Karadzic. All rights reserved.
 * License: https://github.com/bkaradzic/bx/blob/master/LICENSE
 */

#include <bx/sort.h>

namespace bx
{
	static void quickSortR(void* _pivot, void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		if (2 > _num)
		{
			return;
		}

		memCopy(_pivot, _data, _stride);

		uint8_t* data = (uint8_t*)_data;

		uint32_t ll = 0;
		uint32_t gg = 1;

		for (uint32_t ii = 1; ii < _num;)
		{
			int32_t result = _fn(&data[ii*_stride], _pivot);
			if (0 > result)
			{
				swap(&data[ll*_stride], &data[ii*_stride], _stride);
				++ll;
			}
			else if (0 == result)
			{
				swap(&data[gg*_stride], &data[ii*_stride], _stride);
				++gg;
				++ii;
			}
			else
			{
				++ii;
			}
		}

		quickSortR(_pivot, &data[0         ], ll,      _stride, _fn);
		quickSortR(_pivot, &data[gg*_stride], _num-gg, _stride, _fn);
	}

	void quickSort(void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		uint8_t* pivot = (uint8_t*)alloca(_stride);
		quickSortR(pivot, _data, _num, _stride, _fn);
	}

	bool isSorted(const void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		const uint8_t* data = (uint8_t*)_data;

		for (uint32_t ii = 1; ii < _num; ++ii)
		{
			int32_t result = _fn(&data[(ii-1)*_stride], &data[ii*_stride]);

			if (0 < result)
			{
				return false;
			}
		}

		return true;
	}

	uint32_t unique(void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		if (0 == _num)
		{
			return 0;
		}

		uint8_t* data = (uint8_t*)_data;

		uint32_t last = 0;

		for (uint32_t ii = 1; ii < _num; ++ii)
		{
			int32_t result = _fn(&data[last*_stride], &data[ii*_stride]);
			BX_ASSERT(0 >= result, "Performing unique on non-sorted array (ii %d, last %d)!", ii, last);

			if (0 > result)
			{
				last++;
				swap(&data[last*_stride], &data[ii*_stride], _stride);
			}
		}

		return last+1;
	}

	uint32_t lowerBound(const void* _key, const void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		uint32_t offset = 0;
		const uint8_t* data = (uint8_t*)_data;

		for (uint32_t ll = _num; offset < ll;)
		{
			const uint32_t idx = (offset + ll) / 2;

			int32_t result = _fn(_key, &data[idx * _stride]);

			if (result <= 0)
			{
				ll = idx;
			}
			else
			{
				offset = idx + 1;
			}
		}

		return offset;
	}

	uint32_t upperBound(const void* _key, const void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		uint32_t offset = 0;
		const uint8_t* data = (uint8_t*)_data;

		for (uint32_t ll = _num; offset < ll;)
		{
			const uint32_t idx = (offset + ll) / 2;

			int32_t result = _fn(_key, &data[idx * _stride]);

			if (result < 0)
			{
				ll = idx;
			}
			else
			{
				offset = idx + 1;
			}
		}

		return offset;
	}

	int32_t binarySearch(const void* _key, const void* _data, uint32_t _num, uint32_t _stride, const ComparisonFn _fn)
	{
		uint32_t offset = 0;
		const uint8_t* data = (uint8_t*)_data;

		for (uint32_t ll = _num; offset < ll;)
		{
			const uint32_t idx = (offset + ll) / 2;

			int32_t result = _fn(_key, &data[idx * _stride]);

			if (result < 0)
			{
				ll = idx;
			}
			else if (result > 0)
			{
				offset = idx + 1;
			}
			else
			{
				return idx;
			}
		}

		return ~offset;
	}

} // namespace bx