mirror of
https://github.com/isledecomp/isle.git
synced 2026-01-21 07:11:16 +00:00
d80b387490
* I think the left/right rotates are correct now. Eventually I will rename the members from m_child0/m_child1 to right/left but that ought to be its own commit. * MxAtomId operator= match * Added some more comments as I try to work all this stuff out.
130 lines
2.6 KiB
C++
130 lines
2.6 KiB
C++
#include "mxatomid.h"
|
|
#include "mxomni.h"
|
|
|
|
// OFFSET: LEGO1 0x100acf90
|
|
MxAtomId::MxAtomId(const char *p_str, LookupMode p_mode)
|
|
{
|
|
if (!MxOmni::GetInstance())
|
|
return;
|
|
|
|
if (!AtomIdTree())
|
|
return;
|
|
|
|
TreeValue *value = try_to_open(p_str, p_mode);
|
|
m_internal = value->m_str.GetData();
|
|
value->RefCountInc();
|
|
}
|
|
|
|
// OFFSET: LEGO1 0x100acfd0
|
|
MxAtomId::~MxAtomId()
|
|
{
|
|
Destroy();
|
|
}
|
|
|
|
// OFFSET: LEGO1 0x100acfe0
|
|
void MxAtomId::Destroy()
|
|
{
|
|
if (*m_internal == '\0')
|
|
return;
|
|
|
|
if (!MxOmni::GetInstance())
|
|
return;
|
|
|
|
if (!AtomIdTree())
|
|
return;
|
|
|
|
TreeValue value = TreeValue(m_internal);
|
|
TreeValue *p = &value;
|
|
|
|
// 100ad052
|
|
MxBinaryTree *tree = AtomIdTree();
|
|
TreeNode *root = tree->m_root;
|
|
|
|
// should inline Search but NOT TreeValueCompare
|
|
TreeNode *node = tree->Search(p);
|
|
|
|
TreeNode *ass = node;
|
|
if (node == root->m_parent || TreeValueCompare(p, node->m_value)) {
|
|
ass = root->m_parent;
|
|
}
|
|
|
|
node->m_value->RefCountDec();
|
|
}
|
|
|
|
// OFFSET: LEGO1 0x100ad1c0
|
|
MxAtomId &MxAtomId::operator=(const MxAtomId &atomId)
|
|
{
|
|
if (m_internal)
|
|
Destroy();
|
|
|
|
if (atomId.m_internal && MxOmni::GetInstance() && AtomIdTree()) {
|
|
TreeValue *value = try_to_open(atomId.m_internal, LookupMode_Exact);
|
|
value->RefCountInc();
|
|
}
|
|
|
|
m_internal = atomId.m_internal;
|
|
|
|
return *this;
|
|
}
|
|
|
|
// OFFSET: LEGO1 0x100ad210
|
|
TreeValue *MxAtomId::try_to_open(const char *p_str, LookupMode p_mode)
|
|
{
|
|
TreeValue *value = new TreeValue(p_str);
|
|
TreeNode *node;
|
|
|
|
switch (p_mode) {
|
|
case LookupMode_LowerCase:
|
|
case LookupMode_LowerCase2:
|
|
value->m_str.ToLowerCase();
|
|
break;
|
|
case LookupMode_UpperCase:
|
|
value->m_str.ToUpperCase();
|
|
break;
|
|
}
|
|
|
|
// LAB_100ad2a1
|
|
MxBinaryTree *tree = AtomIdTree();
|
|
// get the closest node that matches the given value
|
|
// should NOT inline
|
|
node = tree->Search(value);
|
|
|
|
TreeNode *t;
|
|
|
|
// is the node an exact match?
|
|
if (tree->m_root == node || TreeValueCompare(value, node->m_value)) {
|
|
t = tree->m_root;
|
|
} else {
|
|
t = node;
|
|
}
|
|
|
|
if (t->m_child0 != AtomIdTree()->m_root) {
|
|
delete value;
|
|
value = node->m_value;
|
|
} else {
|
|
// repeat?
|
|
node = tree->Search(value);
|
|
TreeNode *pOutput;
|
|
|
|
// TODO: this is all wrong, but I wanted to see if
|
|
// just slapping an approximation of the code down would reveal
|
|
// the answer.
|
|
if (AtomIdTree()->m_p2) {
|
|
tree->Insert(&pOutput, pOutput, node, value);
|
|
} else {
|
|
tree->Insert(&pOutput, pOutput, AtomIdTree()->m_root, value);
|
|
}
|
|
|
|
// LAB_100ad42b
|
|
}
|
|
|
|
return value;
|
|
}
|
|
|
|
// OFFSET: LEGO1 0x100ad7e0
|
|
void MxAtomId::Clear()
|
|
{
|
|
Destroy();
|
|
m_internal = NULL;
|
|
}
|