-
Notifications
You must be signed in to change notification settings - Fork 1
/
Dom.hpp
230 lines (186 loc) · 4.1 KB
/
Dom.hpp
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
#pragma once
//---------------------------------------------------------------------------//
//
// Dom.hpp
// DOM データ格納クラス
// Copyright (C) 2007-2014 tapetums
//
//---------------------------------------------------------------------------//
template <typename T>
class Dom
{
public:
class iterator
{
private:
Dom* m_dom = nullptr;
private:
iterator() = delete;
public:
iterator(Dom* dom)
{
m_dom = dom;
}
iterator(const iterator& lhs)
{
m_dom = lhs.m_dom;
}
iterator(iterator&& rhs)
{
m_dom = rhs.m_dom;
rhs.m_dom = nullptr;
}
public:
iterator& __stdcall operator =(const iterator& lhs) const
{
m_dom = lhs.m_dom;
return *this;
}
iterator& __stdcall operator =(iterator&& rhs)
{
m_dom = rhs.m_dom;
rhs.m_dom = nullptr;
return *this;
}
bool __stdcall operator ==(const iterator& it) const
{
return (m_dom == it.m_dom);
}
bool __stdcall operator !=(const iterator& it) const
{
return (m_dom != it.m_dom);
}
Dom* __stdcall operator *() const
{
return m_dom;
}
Dom* __stdcall operator ->() const
{
return m_dom;
}
iterator& __stdcall operator ++()
{
m_dom = m_dom->m_next;
return *this;
}
iterator& __stdcall operator --()
{
m_dom = m_dom->m_prev;
return *this;
}
};
public:
T data;
protected:
Dom* m_head;
Dom* m_next;
Dom* m_prev;
Dom* m_parent;
Dom* m_child;
public:
Dom()
{
init();
}
~Dom()
{
clear();
}
private:
Dom(Dom* head, const T& data)
{
m_head = head;
m_next = head;
m_prev = head->m_prev;
m_parent = nullptr;
m_child = nullptr;
this->data = data;
}
void __stdcall init()
{
m_head = this;
m_next = this;
m_prev = this;
m_parent = nullptr;
m_child = nullptr;
}
public:
Dom* __stdcall append(const T& data)
{
if ( this == m_next )
{
m_head = new Dom;
m_head->m_next = this;
m_head->m_prev = this;
m_next = m_head;
m_prev = m_head;
}
const auto dom = new Dom(m_head, data);
m_head->m_prev->m_next = dom;
m_head->m_prev = dom;
return dom;
}
Dom* __stdcall adopt(const T& data)
{
if ( nullptr == m_child )
{
m_child = new Dom;
m_child->m_parent = this;
}
const auto dom = new Dom(m_child, data);
m_child->m_prev->m_next = dom;
m_child->m_prev = dom;
return dom;
}
void __stdcall clear()
{
if ( m_child )
{
m_child->clear();
delete m_child;
m_child = nullptr;
}
auto dom = m_next;
while ( dom != this )
{
const auto next = dom->m_next;
dom->m_next = dom;
delete dom;
dom = next;
}
init();
}
iterator __stdcall remove()
{
if ( this == m_head )
{
return std::move(iterator(this));
}
iterator it(m_next);
m_next->m_prev = m_prev;
m_prev->m_next = m_next;
m_head = this;
m_next = this;
m_prev = this;
return std::move(it);
}
public:
iterator __stdcall begin() const
{
return iterator(m_head->m_next);
}
iterator __stdcall end() const
{
return iterator(m_head);
}
Dom* __stdcall parent() const
{
return m_head->m_parent;
}
Dom* __stdcall child() const
{
return m_child;
}
};
//---------------------------------------------------------------------------//
// Dom.hpp