mirror of
https://github.com/RGBCube/serenity
synced 2025-07-26 08:57:34 +00:00
LibC: Remove unused data member in the qsort() implementation
This commit is contained in:
parent
50bca8fcef
commit
8a5ce41065
1 changed files with 3 additions and 5 deletions
|
@ -64,9 +64,8 @@ inline void swap(const SizedObject& a, const SizedObject& b)
|
||||||
class SizedObjectSlice {
|
class SizedObjectSlice {
|
||||||
public:
|
public:
|
||||||
SizedObjectSlice() = delete;
|
SizedObjectSlice() = delete;
|
||||||
SizedObjectSlice(void* data, size_t num_elements, size_t element_size)
|
SizedObjectSlice(void* data, size_t element_size)
|
||||||
: m_data(data)
|
: m_data(data)
|
||||||
, m_num_elements(num_elements)
|
|
||||||
, m_element_size(element_size)
|
, m_element_size(element_size)
|
||||||
{
|
{
|
||||||
}
|
}
|
||||||
|
@ -77,7 +76,6 @@ public:
|
||||||
|
|
||||||
private:
|
private:
|
||||||
void* m_data;
|
void* m_data;
|
||||||
size_t m_num_elements;
|
|
||||||
size_t m_element_size;
|
size_t m_element_size;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -87,7 +85,7 @@ void qsort(void* bot, size_t nmemb, size_t size, int (*compar)(const void*, cons
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
SizedObjectSlice slice { bot, nmemb, size };
|
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; });
|
AK::dual_pivot_quick_sort(slice, 0, nmemb - 1, [=](const SizedObject& a, const SizedObject& b) { return compar(a.data(), b.data()) < 0; });
|
||||||
}
|
}
|
||||||
|
@ -98,7 +96,7 @@ void qsort_r(void* bot, size_t nmemb, size_t size, int (*compar)(const void*, co
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
SizedObjectSlice slice { bot, nmemb, size };
|
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; });
|
AK::dual_pivot_quick_sort(slice, 0, nmemb - 1, [=](const SizedObject& a, const SizedObject& b) { return compar(a.data(), b.data(), arg) < 0; });
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue