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
|
/* 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 "glk/archetype/linked_list.h"
#include "glk/archetype/misc.h"
namespace Glk {
namespace Archetype {
void new_list(ListType &the_list) {
the_list = (ListType)malloc(sizeof(NodeType));
add_bytes(sizeof(NodeType));
the_list->key = 0;
the_list->data = nullptr;
the_list->next = nullptr;
}
void dispose_list(ListType &the_list) {
NodePtr theNode, axe;
for (theNode = the_list->next; theNode != the_list; ) {
axe = theNode;
theNode = theNode->next;
add_bytes(-(int)sizeof(*axe));
free(axe);
}
}
bool iterate_list(ListType &the_list, NodePtr index) {
if (index == nullptr)
index = the_list->next;
else
index = index->next;
return index != the_list;
}
void append_to_list(ListType &the_list, NodePtr the_node) {
the_list->data = the_node->data;
the_list->key = the_node->key;
the_node->next = the_list->next;
the_list->next = the_node;
the_list = the_node;
}
NodePtr index_list(ListType &the_list, int number) {
int i = 0;
NodePtr p = the_list->next;
while (i < number && p != the_list) {
p = p->next;
++i;
}
return (p == the_list) ? nullptr : p;
}
void insert_item(ListType &the_list, NodePtr the_item) {
NodePtr p;
for (p = the_list; p->next != the_list && p->next->key > the_item->key; p = p->next) {}
the_item->next = p->next;
p->next = the_item;
}
NodePtr find_item(ListType &the_list, int the_key) {
NodePtr p;
for (p = the_list->next; p != the_list && the_key < p->key; p = p->next) {}
return (p == the_list || the_key != p->key) ? nullptr : p;
}
} // End of namespace Archetype
} // End of namespace Glk
|
