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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "common/textconsole.h"
#include "titanic/true_talk/tt_node.h"
namespace Titanic {
TTnode::TTnode() : _priorP(nullptr), _nextP(nullptr) {
}
TTnode::~TTnode() {
detach();
}
void TTnode::addNode(TTnode *newNode) {
TTnode *tail = getTail();
tail->_nextP = newNode;
newNode->_priorP = this;
}
void TTnode::detach() {
if (_priorP)
_priorP->_nextP = _nextP;
if (_nextP)
_nextP->_priorP = _priorP;
}
void TTnode::deleteSiblings() {
// Detach current node from prior one, if there is one
if (_priorP)
_priorP->_nextP = nullptr;
// Iterate through the linked chain of nodes, deleting each in turn
for (TTnode *curP = _nextP, *nextP = nullptr; nextP; curP = nextP) {
nextP = curP->_nextP;
delete curP;
}
}
TTnode *TTnode::getTail() {
if (_nextP == nullptr)
return this;
TTnode *node = _nextP;
while (node->_nextP)
node = node->_nextP;
return node;
}
} // End of namespace Titanic
|
