blob: 9ee9d852bec2535c77cef36016ee40e13510f383 (
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
72
73
74
|
/*
* Copyright (C) 2008-2012, 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; 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, see <http://www.gnu.org/licenses/>.
*/
template <class T> void CRFSList<T>::InsertFirst (CRFSNode<T> *n)
{
n->next = anchor.next;
n->prev = &anchor;
anchor.next->prev = n;
anchor.next = n;
}
template <class T> void CRFSList<T>::InsertLast (CRFSNode<T> *n)
{
n->next = &anchor;
n->prev = anchor.prev;
anchor.prev->next = n;
anchor.prev = n;
}
template <class T> T *CRFSList<T>::UnlinkFirst (void)
{
CRFSNode<T> *n = First ();
if (!n)
return NULL;
n->Unlink ();
return (T *) n;
}
template <class T> T *CRFSList<T>::UnlinkLast (void)
{
CRFSNode<T> *n = Last ();
if (!n)
return NULL;
n->Unlink ();
return (T *) n;
}
template <class T> T *CRFSList<T>::Next (CRFSNode<T> *n)
{
if (n->next == &anchor)
return NULL;
return (T *) n->next;
}
template <class T> T *CRFSList<T>::Prev (CRFSNode<T> *n)
{
if (n->prev == &anchor)
return NULL;
return (T *) n->prev;
}
template <class T> void CRFSList<T>::Clear ()
{
T *node;
while (node = UnlinkFirst ())
delete node;
}
|
