git_clone/thorvg
1
0
Fork 0
mirror of https://github.com/thorvg/thorvg.git synced 2025-06-07 21:23:32 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 5

common/array: ++neat code

Browse source 
no logical changes
This commit is contained in:
Hermet Park 2025-05-14 01:29:46 +09:00
parent 7e8743e8fe
commit cd12618529
1 changed files with 15 additions and 22 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

37
src/common/tvgArray.h
View file

@ -95,6 +95,13 @@ struct Array
return data[idx];
}
void operator=(const Array& rhs)
{
reserve(rhs.count);
if (rhs.count > 0) memcpy(data, rhs.data, sizeof(T) * rhs.count);
count = rhs.count;
}
const T* begin() const
{
return data;
@ -157,17 +164,9 @@ struct Array
return count == 0;
}
template<class COMPARE>
void sort()
template<class COMPARE> void sort()
{
qsort<COMPARE>(data, 0, static_cast<int32_t>(count) - 1);
}
void operator=(const Array& rhs)
{
reserve(rhs.count);
if (rhs.count > 0) memcpy(data, rhs.data, sizeof(T) * rhs.count);
count = rhs.count;
qsort<COMPARE>(data, 0, count - 1);
}
~Array()
@ -177,23 +176,17 @@ struct Array
private:
template<class COMPARE>
void qsort(T* arr, int32_t low, int32_t high)
void qsort(T* arr, uint32_t low, uint32_t high)
{
if (low < high) {
int32_t i = low;
int32_t j = high;
T tmp = arr[low];
auto i = low;
auto j = high;
auto tmp = arr[low];
while (i < j) {
while (i < j && !COMPARE{}(arr[j], tmp)) --j;
if (i < j) {
arr[i] = arr[j];
++i;
}
if (i < j) arr[i++] = arr[j];
while (i < j && COMPARE{}(arr[i], tmp)) ++i;
if (i < j) {
arr[j] = arr[i];
--j;
}
if (i < j) arr[j--] = arr[i];
}
arr[i] = tmp;
qsort<COMPARE>(arr, low, i - 1);