reHLDS/ReGameDLL_CS
2
0
Fork 0
mirror of https://github.com/s1lentq/ReGameDLL_CS.git synced 2024-12-27 23:25:41 +03:00
Code Issues Packages Projects Releases Wiki Activity

utlarray.h add sort methods

Browse Source
This commit is contained in:
s1lentq 2023-12-13 19:01:25 +07:00
parent 34e56f61f2
commit e6d25ba159
1 changed files with 48 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
regamedll/public/utlarray.h
View File

@ -20,6 +20,8 @@
#include "tier0/platform.h"
#include "tier0/dbg.h"
#include <algorithm>
#define FOR_EACH_ARRAY(vecName, iteratorName)\
for (int iteratorName = 0; (vecName).IsUtlArray && iteratorName < (vecName).Count(); iteratorName++)
@ -71,6 +73,15 @@ public:
bool HasElement(const T &src) const;
// sort using std:: and expecting a "<" function to be defined for the type
void Sort();
void Sort(bool (*pfnLessFunc)(const T &src1, const T &src2));
void Sort(int (__cdecl *pfnCompare)(const T *, const T *));
// sort using std:: with a predicate. e.g. [] -> bool (const T &a, const T &b) const { return a < b; }
template <class F>
void SortPredicate(F &&predicate);
protected:
T m_Memory[MAX_SIZE];
};
@ -180,6 +191,43 @@ inline int CUtlArray<T, MAX_SIZE>::InvalidIndex()
return -1;
}
// Sort methods
template <typename T, size_t MAX_SIZE>
void CUtlArray<T, MAX_SIZE>::Sort()
{
std::sort(Base(), Base() + Count());
}
template <typename T, size_t MAX_SIZE>
void CUtlArray<T, MAX_SIZE>::Sort(bool (*pfnLessFunc)(const T &src1, const T &src2))
{
std::sort(Base(), Base() + Count(),
[pfnLessFunc](const T &a, const T &b) -> bool
{
if (&a == &b)
return false;
return (*pfnLessFunc)(a, b);
});
}
template <typename T, size_t MAX_SIZE>
void CUtlArray<T, MAX_SIZE>::Sort(int (__cdecl *pfnCompare)(const T *, const T *))
{
typedef int (__cdecl *QSortCompareFunc_t)(const void *, const void *);
if (Count() <= 1)
return;
qsort(Base(), Count(), sizeof(T), (QSortCompareFunc_t)(pfnCompare));
}
template <typename T, size_t MAX_SIZE>
template <class F>
void CUtlArray<T, MAX_SIZE>::SortPredicate(F &&predicate)
{
std::sort(Base(), Base() + Count(), predicate);
}
template <typename T, size_t MAX_SIZE>
void CUtlArray<T, MAX_SIZE>::CopyArray(const T *pArray, size_t count)
{