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
|
/* This file is part of KDevelop
Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef LISTNODE_H
#define LISTNODE_H
#include <kdebug.h>
/**
* @brief An intrusive list of AST nodes.
* @note ListNodes inside AST nodes are NOT guaranteed to start from the beginning, call toFront.
*/
template <typename Tp>
class ListNode
{
public:
Tp element;
int index;
mutable const ListNode<Tp> *next;
template<class pool>
static ListNode *create(const Tp &element, pool *p)
{
ListNode<Tp> *node = new (p->allocate(sizeof(ListNode))) ListNode();
node->element = element;
node->index = 0;
node->next = node;
return node;
}
template<class pool>
static ListNode *create(const ListNode *n1, const Tp &element, pool *p)
{
ListNode<Tp> *n2 = ListNode::create(element, p);
n2->index = n1->index + 1;
n2->next = n1->next;
n1->next = n2;
return n2;
}
inline const ListNode<Tp> *at(int index) const
{
const ListNode<Tp> *node = this;
while (index != node->index)
node = node->next;
return node;
}
inline bool hasNext() const
{ return ( next && index < next->index ); }
inline int count() const
{ return 1 + toBack()->index; }
inline const ListNode<Tp> *toFront() const
{ return toBack()->next; }
inline const ListNode<Tp> *toBack() const
{
const ListNode<Tp> *node = this;
while (node->hasNext())
node = node->next;
return node;
}
};
template <class Tp,class pool>
inline const ListNode<Tp> *snoc(const ListNode<Tp> *list,
const Tp &element, pool *p)
{
if (!list)
return ListNode<Tp>::create(element, p);
return ListNode<Tp>::create(list->toBack(), element, p);
}
#endif // FASTLIST_H
|
