mirror of
https://github.com/cemu-project/Cemu.git
synced 2025-12-16 04:36:59 +00:00
74 lines
1 KiB
C++
74 lines
1 KiB
C++
#pragma once
|
|
|
|
#include<array>
|
|
|
|
template<typename T, uint32 maxElements, bool checkMaxSize = true>
|
|
class FixedSizeList
|
|
{
|
|
public:
|
|
std::array<T, maxElements> m_elementArray;
|
|
int count = 0;
|
|
|
|
void add(T n)
|
|
{
|
|
if (checkMaxSize && count >= maxElements)
|
|
return;
|
|
m_elementArray[count] = n;
|
|
count++;
|
|
}
|
|
|
|
void addUnique(T n)
|
|
{
|
|
if (checkMaxSize && count >= maxElements)
|
|
return;
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
if (m_elementArray[i] == n)
|
|
return;
|
|
}
|
|
m_elementArray[count] = n;
|
|
count++;
|
|
}
|
|
|
|
void remove(T n)
|
|
{
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
if (m_elementArray[i] == n)
|
|
{
|
|
m_elementArray[i] = m_elementArray[count - 1];
|
|
count--;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
bool containsAndRemove(T n)
|
|
{
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
if (m_elementArray[i] == n)
|
|
{
|
|
m_elementArray[i] = m_elementArray[count - 1];
|
|
count--;
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
sint32 find(T n)
|
|
{
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
if (m_elementArray[i] == n)
|
|
{
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
private:
|
|
};
|
|
|