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
|
/****************************************************************************
**
** Copyright (C) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the Qt Script Generator project on Qt Labs.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef FASTLIST_H
#define FASTLIST_H
#include "smallobject.h"
template <typename Tp>
struct ListNode
{
Tp element;
int index;
mutable const ListNode<Tp> *next;
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;
}
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 ListNode<Tp>() { }
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 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>
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
// kate: space-indent on; indent-width 2; replace-tabs on;
|
