mirrors/isle
1
0
Fork 0
mirror of https://github.com/isledecomp/isle.git synced 2025-12-10 08:03:13 +00:00
Code Issues Packages Projects Releases Wiki Activity

Reorganize sources and files (#414)

Browse Source 
* Reorganize sources

* Refactor

* Remove relative paths

* Renames

* Fix gitignore

* Remove stuff

* Try fixing format script

* Fix format

* Fix format

* Fix naming script

* Test format

* Fix format
This commit is contained in:
Christian Semmler
2024-01-08 04:58:49 -05:00
committed by GitHub
parent 6a85e62406
commit c47206617d
447 changed files with 347 additions and 346 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
LEGO1/omni/include/mxatomidcounter.h Normal file
View File

@@ -0,0 +1,46 @@
#ifndef MXATOMIDCOUNTER_H
#define MXATOMIDCOUNTER_H
#include "mxstl/stlcompat.h"
#include "mxstring.h"
// Counts the number of existing MxAtomId objects based
// on the matching char* string. A <map> seems fit for purpose here:
// We have an MxString as a key and MxU16 as the value.
// And yet a <set> is the best match. The malloc in MxOmni::Create
// for the _Nil node asks for more bytes than a regular node if a <map>
// is used, but all nodes are 20 bytes wide with a <set>.
// Also: the increment/decrement methods suggest a custom type was used
// for the combined key_value_pair, which doesn't seem possible with <map>.
// SIZE 0x14
class MxAtomIdCounter {
public:
// always inlined
MxAtomIdCounter(const char* p_str)
{
m_key = p_str;
m_value = 0;
}
void Inc();
void Dec();
inline MxString* GetKey() { return &m_key; };
inline MxU16 GetValue() { return m_value; };
private:
MxString m_key;
MxU16 m_value;
};
struct MxAtomIdCounterCompare {
// FUNCTION: LEGO1 0x100ad120
int operator()(MxAtomIdCounter* const& p_val0, MxAtomIdCounter* const& p_val1) const
{
return strcmp(p_val0->GetKey()->GetData(), p_val1->GetKey()->GetData()) > 0;
}
};
class MxAtomIdCounterSet : public set<MxAtomIdCounter*, MxAtomIdCounterCompare> {};
#endif // MXATOMIDCOUNTER_H