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
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Copyright (C) 2002-2005 Roberto Raggi <roberto@kdevelop.org>
** Contact: https://www.qt.io/licensing/
**
** This file is part of PySide2.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
** $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), strideof(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;
|
