blob: 6ddc95c6c44c18f3f89a2d3708c18ca551559cff (
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
64
65
66
67
68
69
70
71
|
/*
* Copyright (C) 2008, OctaneSnail <os@v12pwr.com>
*
* 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; version 2 of the License.
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#ifndef LIST_H
#define LIST_H
template <class T> class List;
template <class T> class Node
{
friend class List<T>;
public:
Node (void) : next (NULL), prev (NULL) { }
void Unlink (void)
{
next->prev = prev;
prev->next = next;
}
private:
Node (Node *next, Node *prev) : next (next), prev (prev) { }
Node *next;
Node *prev;
};
template <class T> class List
{
public:
List (bool auto_clear = false) : anchor (&anchor, &anchor), clear (auto_clear) { }
~List () { if (clear) Clear (); }
bool IsEmpty (void) { return anchor.next == &anchor; }
T *First (void) { return Next (&anchor); }
T *Last (void) { return Prev (&anchor); }
void InsertFirst (Node<T> *n);
void InsertLast (Node<T> *n);
T *UnlinkFirst (void);
T *UnlinkLast (void);
T *Next (Node<T> *n);
T *Prev (Node<T> *n);
void Clear (void);
private:
Node<T> anchor;
bool clear;
};
#include "List.cpp"
#endif // LIST_H
|
