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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
/*[]---------------------------------------------------[]*/
/*| |*/
/*| list.c - bidirectional list class |*/
/*| |*/
/*| |*/
/*| Author: Alexander Gelfenbain |*/
/*[]---------------------------------------------------[]*/
#include <rtl/alloc.h>
#include <assert.h>
#include "list.h"
/*- private data types */
struct lnode {
struct lnode *next;
struct lnode *prev;
void *value;
};
struct list_ {
lnode *head, *tail, *cptr;
size_t aCount;
list_destructor eDtor;
};
/*- private methods */
static lnode *newNode(void *el)
{
lnode *ptr = static_cast<lnode *>(rtl_allocateMemory(sizeof(lnode)));
assert(ptr != nullptr);
ptr->value = el;
return ptr;
}
static lnode *appendPrim(list pThis, void *el)
{
lnode *ptr = newNode(el);
lnode **flink, *blink;
if (pThis->tail != nullptr) {
flink = &(pThis->tail->next);
blink = pThis->tail;
} else {
flink = &pThis->head;
blink = nullptr;
pThis->cptr = ptr; /*- list was empty - set current to this element */
}
*flink = ptr;
pThis->tail = ptr;
ptr->prev = blink;
ptr->next = nullptr;
pThis->aCount++;
return ptr;
}
/*- public methods */
list listNewEmpty() /*- default ctor */
{
list pThis = static_cast<list>(rtl_allocateMemory(sizeof(struct list_)));
assert(pThis != nullptr);
pThis->aCount = 0;
pThis->eDtor = nullptr;
pThis->head = pThis->tail = pThis->cptr = nullptr;
return pThis;
}
void listDispose(list pThis) /*- dtor */
{
assert(pThis != nullptr);
listClear(pThis);
rtl_freeMemory(pThis);
}
void listSetElementDtor(list pThis, list_destructor f)
{
assert(pThis != nullptr);
pThis->eDtor = f;
}
/* calling this function on an empty list is a run-time error */
void *listCurrent(list pThis)
{
assert(pThis != nullptr);
assert(pThis->cptr != nullptr);
return pThis->cptr->value;
}
int listCount(list pThis)
{
assert(pThis != nullptr);
return pThis->aCount;
}
int listIsEmpty(list pThis)
{
assert(pThis != nullptr);
return pThis->aCount == 0;
}
int listNext(list pThis)
{
return listSkipForward(pThis, 1);
}
int listSkipForward(list pThis, int n)
{
int m = 0;
assert(pThis != nullptr);
if (pThis->cptr == nullptr) return 0;
while (n != 0) {
if (pThis->cptr->next == nullptr) break;
pThis->cptr = pThis->cptr->next;
n--;
m++;
}
return m;
}
int listToFirst(list pThis)
{
assert(pThis != nullptr);
if (pThis->cptr != pThis->head) {
pThis->cptr = pThis->head;
return 1;
}
return 0;
}
int listToLast(list pThis)
{
assert(pThis != nullptr);
if (pThis->cptr != pThis->tail) {
pThis->cptr = pThis->tail;
return 1;
}
return 0;
}
list listAppend(list pThis, void *el)
{
assert(pThis != nullptr);
appendPrim(pThis, el);
return pThis;
}
list listRemove(list pThis)
{
lnode *ptr = nullptr;
if (pThis->cptr == nullptr) return pThis;
if (pThis->cptr->next != nullptr) {
ptr = pThis->cptr->next;
pThis->cptr->next->prev = pThis->cptr->prev;
} else {
pThis->tail = pThis->cptr->prev;
}
if (pThis->cptr->prev != nullptr) {
if (ptr == nullptr) ptr = pThis->cptr->prev;
pThis->cptr->prev->next = pThis->cptr->next;
} else {
pThis->head = pThis->cptr->next;
}
if (pThis->eDtor) pThis->eDtor(pThis->cptr->value); /* call the dtor callback */
rtl_freeMemory(pThis->cptr);
pThis->aCount--;
pThis->cptr = ptr;
return pThis;
}
list listClear(list pThis)
{
lnode *node = pThis->head, *ptr;
while (node) {
ptr = node->next;
if (pThis->eDtor) pThis->eDtor(node->value); /* call the dtor callback */
rtl_freeMemory(node);
pThis->aCount--;
node = ptr;
}
pThis->head = pThis->tail = pThis->cptr = nullptr;
assert(pThis->aCount == 0);
return pThis;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
