Files
wii-ipl/include/utility/iplTree.h
2025-04-07 01:01:59 +01:00

98 lines
3.8 KiB
C++

#ifndef IPL_TREE_NODE_H
#define IPL_TREE_NODE_H
namespace ipl {
namespace utility {
class Tree {
public:
Tree();
virtual ~Tree() {}; // 0x08
virtual Tree* getParent() { return mpParent; } // 0x0C
virtual Tree* getChild() { return mpChild; } // 0x10
virtual Tree* getNext() { return mpNext; } // 0x14
virtual Tree* getPrev() { return mpPrev; } // 0x18
void attach(Tree* tree);
void insert(Tree* tree, Tree* childTree);
void detach();
static Tree* empty() { return (Tree*)0; }
class iterator {
typedef Tree value_type;
typedef value_type* pointer;
typedef value_type& reference;
public:
explicit inline iterator(pointer ptr) : mPtr(ptr) {}
virtual reference operator*() { return *mPtr; }
pointer operator->() { return mPtr; }
pointer getPtr() { return (pointer)mPtr; }
iterator& operator++() { next(); return *this; }
inline void next() {
if (mPtr->getChild()) {
mPtr = mPtr->getChild();
}
else {
if (mPtr->getNext()) {
mPtr = mPtr->getNext();
}
else {
while (1) {
if (!mPtr->getNext()) {
break;
}
mPtr = mPtr->getNext();
}
mPtr = mPtr->getParent();
}
}
}
protected:
pointer mPtr;
};
class reverse_iterator {
typedef Tree value_type;
typedef value_type* pointer;
typedef value_type& reference;
public:
explicit inline reverse_iterator(pointer ptr) : mPtr(ptr) { reverse(); }
virtual reference operator*() { return (reference)*mPtr; }
pointer operator->() { return (pointer)mPtr; }
pointer getPtr() { return (pointer)mPtr; }
inline void reverse() {
while (mPtr->getChild()) {
mPtr = mPtr->getChild();
while (mPtr->getNext()) {
mPtr = mPtr->getNext();
}
}
}
protected:
pointer mPtr;
};
protected:
Tree* mpParent; // 0x04
Tree* mpChild; // 0x08
Tree* mpNext; // 0x0C
Tree* mpPrev; // 0x10
};
}
}
#endif // IPL_TREE_NODE_H