blob: 304a04cd8195c912de6171ad4026e69a18b2f731 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
#pragma once
#include "KingSystem/Utils/Container/StrTreeMap.h"
namespace ksys::act {
class BaseProc;
class BaseProcMapNode final : public util::StrTreeMapNode {
public:
explicit BaseProcMapNode(BaseProc* proc) : mProc(proc) {}
~BaseProcMapNode() override;
void erase_() override {
unlink_();
StrTreeMapNode::erase_();
mInserted = false;
mPrev = mNext = nullptr;
}
util::StrTreeMapKey& key() { return mKey; }
const util::StrTreeMapKey& key() const { return mKey; }
BaseProc* proc() const { return mProc; }
BaseProcMapNode* prev() const { return mPrev; }
BaseProcMapNode* next() const { return mNext; }
void add(BaseProcMapNode* node);
bool isInserted() const { return mInserted; }
void setInserted() { mInserted = true; }
private:
void unlink_() {
if (mPrev)
mPrev->mNext = mNext;
if (mNext)
mNext->mPrev = mPrev;
}
BaseProc* mProc = nullptr;
BaseProcMapNode* mPrev = nullptr;
BaseProcMapNode* mNext = nullptr;
bool mInserted = false;
};
class BaseProcMap : public util::StrTreeMap<BaseProcMapNode> {
public:
void insert(BaseProcMapNode* node);
void erase(BaseProcMapNode* node) {
auto prev = node->prev();
auto next = node->next();
if (prev)
node->erase_();
else if (next)
StrTreeMap::insert(next);
else
StrTreeMap::erase(node->key());
}
};
} // namespace ksys::act
|
