UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-25 16:50:50 +01:00
Code Issues Packages Projects Releases Wiki Activity

Implement some tree methods

Browse Source
This commit is contained in:
Léa Saviot
2018-06-20 14:17:55 +02:00
parent a301de1378
commit 3777304adb
4 changed files with 56 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
tree_node.cpp
View File

@@ -2,12 +2,31 @@
#include "expression_node.h"
void TreeNode::release() {
printf("release of %d\n", m_identifier);
printf("releasing of %d(%p)\n", m_identifier, this);
m_referenceCounter--;
if (m_referenceCounter == 0) {
#if 0
for (TreeNode * child : directChildren()) {
// BUG FIXME
// Here, if we end up delete-ing the node
// then the 'next child' is wrong...
child->release();
}
#endif
if (numberOfChildren() != 0) {
int lastIdentifier = lastDescendant()->identifier();
TreeNode * child = this;
do {
bool childWillBeDeleted = (child->m_referenceCounter == 1);
child->release();
if (!childWillBeDeleted) {
printf("Incrementing iterator\n");
child = child->next();
} else {
printf("Keeping iterator\n");
}
} while (child->identifier() != lastIdentifier);
}
printf("DELETE %d(%p)\n", m_identifier, this);
delete this;