isle/LEGO1/mxlist.h

265 lines
4.9 KiB
C
Raw Normal View History

#ifndef MXLIST_H
#define MXLIST_H
#include "mxcore.h"
2023-10-24 19:38:27 -04:00
#include "mxtypes.h"
2023-10-24 19:24:29 -04:00
template <class T>
class MxList;
template <class T>
class MxListCursor;
template <class T>
2023-10-24 19:38:27 -04:00
class MxListEntry {
public:
2023-10-24 19:38:27 -04:00
MxListEntry() {}
MxListEntry(T p_obj, MxListEntry* p_prev)
{
m_obj = p_obj;
m_prev = p_prev;
m_next = NULL;
}
MxListEntry(T p_obj, MxListEntry* p_prev, MxListEntry* p_next)
{
m_obj = p_obj;
m_prev = p_prev;
m_next = p_next;
}
T GetValue() { return this->m_obj; }
MxListEntry* GetNext() { return m_next; }
MxListEntry* GetPrev() { return m_prev; }
2023-10-24 19:38:27 -04:00
void SetValue(T p_obj) { m_obj = p_obj; }
void SetNext(MxListEntry* p_next) { m_next = p_next; }
void SetPrev(MxListEntry* p_prev) { m_prev = p_prev; }
2023-10-24 19:38:27 -04:00
private:
2023-10-24 19:38:27 -04:00
T m_obj;
MxListEntry* m_prev;
MxListEntry* m_next;
};
// SIZE 0x10
template <class T>
2023-10-24 19:38:27 -04:00
class MxListParent : public MxCore {
public:
2023-10-24 19:38:27 -04:00
MxListParent()
{
m_count = 0;
m_customDestructor = Destroy;
}
virtual ~MxListParent() {}
virtual MxS8 Compare(T, T) { return 0; };
2023-10-24 19:38:27 -04:00
static void Destroy(T){};
protected:
2023-10-24 19:38:27 -04:00
MxU32 m_count; // +0x8
void (*m_customDestructor)(T); // +0xc
};
// SIZE 0x18
template <class T>
2023-10-24 19:38:27 -04:00
class MxList : protected MxListParent<T> {
public:
2023-10-24 19:38:27 -04:00
MxList()
{
m_last = NULL;
m_first = NULL;
}
2023-11-09 10:52:58 -05:00
virtual ~MxList() override;
void Append(T p_obj) { _InsertEntry(p_obj, this->m_last, NULL); };
2023-10-24 19:38:27 -04:00
void DeleteAll();
MxU32 GetCount() { return this->m_count; }
void SetDestroy(void (*p_customDestructor)(T)) { this->m_customDestructor = p_customDestructor; }
friend class MxListCursor<T>;
protected:
2023-10-24 19:38:27 -04:00
MxListEntry<T>* m_first; // +0x10
MxListEntry<T>* m_last; // +0x14
2023-10-24 19:38:27 -04:00
void _DeleteEntry(MxListEntry<T>* match);
2023-10-25 18:02:49 -04:00
MxListEntry<T>* _InsertEntry(T, MxListEntry<T>*, MxListEntry<T>*);
};
template <class T>
2023-10-24 19:38:27 -04:00
class MxListCursor : public MxCore {
public:
2023-10-24 19:38:27 -04:00
MxListCursor(MxList<T>* p_list)
{
m_list = p_list;
m_match = NULL;
}
MxBool Find(T p_obj);
void Detach();
void Destroy();
2023-10-24 19:38:27 -04:00
MxBool Next(T& p_obj);
MxBool Current(T& p_obj);
MxBool Advance();
MxBool HasMatch() { return m_match != NULL; }
2023-10-24 19:38:27 -04:00
void SetValue(T p_obj);
void Head() { m_match = m_list->m_first; }
void Reset() { m_match = NULL; }
void Prepend(T p_newobj);
private:
2023-10-24 19:38:27 -04:00
MxList<T>* m_list;
MxListEntry<T>* m_match;
};
// Unclear purpose
template <class T>
2023-10-24 19:38:27 -04:00
class MxListCursorChild : public MxListCursor<T> {
public:
2023-10-24 19:38:27 -04:00
MxListCursorChild(MxList<T>* p_list) : MxListCursor<T>(p_list) {}
};
// Unclear purpose
template <class T>
2023-10-24 19:38:27 -04:00
class MxListCursorChildChild : public MxListCursorChild<T> {
public:
2023-10-24 19:38:27 -04:00
MxListCursorChildChild(MxList<T>* p_list) : MxListCursorChild<T>(p_list) {}
};
template <class T>
MxList<T>::~MxList()
{
2023-10-24 19:38:27 -04:00
DeleteAll();
}
template <class T>
inline void MxList<T>::DeleteAll()
{
2023-10-24 19:38:27 -04:00
for (MxListEntry<T>* t = m_first;;) {
if (!t)
break;
MxListEntry<T>* next = t->GetNext();
2023-10-24 19:38:27 -04:00
this->m_customDestructor(t->GetValue());
delete t;
t = next;
}
this->m_count = 0;
m_last = NULL;
m_first = NULL;
}
template <class T>
2023-10-25 18:02:49 -04:00
inline MxListEntry<T>* MxList<T>::_InsertEntry(T p_newobj, MxListEntry<T>* p_prev, MxListEntry<T>* p_next)
{
2023-10-24 19:38:27 -04:00
MxListEntry<T>* newEntry = new MxListEntry<T>(p_newobj, p_prev, p_next);
2023-10-24 19:38:27 -04:00
if (p_prev)
p_prev->SetNext(newEntry);
2023-10-24 19:38:27 -04:00
else
this->m_first = newEntry;
2023-10-24 19:38:27 -04:00
if (p_next)
p_next->SetPrev(newEntry);
2023-10-24 19:38:27 -04:00
else
this->m_last = newEntry;
2023-10-24 19:38:27 -04:00
this->m_count++;
2023-10-25 18:02:49 -04:00
return newEntry;
}
template <class T>
2023-10-24 19:38:27 -04:00
inline void MxList<T>::_DeleteEntry(MxListEntry<T>* match)
{
if (match->GetPrev())
match->GetPrev()->SetNext(match->GetNext());
2023-10-24 19:38:27 -04:00
else
m_first = match->GetNext();
if (match->GetNext())
match->GetNext()->SetPrev(match->GetPrev());
2023-10-24 19:38:27 -04:00
else
m_last = match->GetPrev();
2023-10-24 19:38:27 -04:00
delete match;
this->m_count--;
}
template <class T>
inline MxBool MxListCursor<T>::Find(T p_obj)
{
for (m_match = m_list->m_first; m_match && m_list->Compare(m_match->GetValue(), p_obj);
m_match = m_match->GetNext())
2023-10-24 19:38:27 -04:00
;
2023-10-24 19:38:27 -04:00
return m_match != NULL;
}
template <class T>
inline void MxListCursor<T>::Detach()
{
2023-10-24 19:38:27 -04:00
m_list->_DeleteEntry(m_match);
m_match = NULL;
}
template <class T>
inline void MxListCursor<T>::Destroy()
{
if (m_match) {
m_list->m_customDestructor(m_match->GetValue());
Detach();
}
}
template <class T>
inline MxBool MxListCursor<T>::Next(T& p_obj)
{
2023-10-24 19:38:27 -04:00
if (!m_match)
m_match = m_list->m_first;
else
m_match = m_match->GetNext();
2023-10-24 19:38:27 -04:00
if (m_match)
p_obj = m_match->GetValue();
2023-10-24 19:38:27 -04:00
return m_match != NULL;
}
template <class T>
inline MxBool MxListCursor<T>::Current(T& p_obj)
{
if (m_match)
p_obj = m_match->GetValue();
return m_match != NULL;
}
template <class T>
inline MxBool MxListCursor<T>::Advance()
{
if (!m_match)
m_match = m_list->m_first;
else
m_match = m_match->GetNext();
return m_match != NULL;
}
template <class T>
inline void MxListCursor<T>::SetValue(T p_obj)
{
2023-10-24 19:38:27 -04:00
if (m_match)
m_match->SetValue(p_obj);
}
template <class T>
inline void MxListCursor<T>::Prepend(T p_newobj)
{
if (m_match)
m_list->_InsertEntry(p_newobj, m_match->GetPrev(), m_match);
}
#endif // MXLIST_H