Mercurial > projects > qtd

comparison generator/parser/list.h @ 1:e78566595089

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
initial import
author mandel
date Mon, 11 May 2009 16:01:50 +0000
parents
children 09a0f1d048f2
comparison
equal deleted inserted replaced
0:36fb74dc547d 1:e78566595089
1 /****************************************************************************
2 **
3 ** Copyright (C) 1992-2008 Nokia. All rights reserved.
4 ** Copyright (C) 2002-2005 Roberto Raggi <roberto@kdevelop.org>
5 **
6 ** This file is part of Qt Jambi.
7 **
8 ** * Commercial Usage
9 * Licensees holding valid Qt Commercial licenses may use this file in
10 * accordance with the Qt Commercial License Agreement provided with the
11 * Software or, alternatively, in accordance with the terms contained in
12 * a written agreement between you and Nokia.
13 *
14 *
15 * GNU General Public License Usage
16 * Alternatively, this file may be used under the terms of the GNU
17 * General Public License versions 2.0 or 3.0 as published by the Free
18 * Software Foundation and appearing in the file LICENSE.GPL included in
19 * the packaging of this file. Please review the following information
20 * to ensure GNU General Public Licensing requirements will be met:
21 * http://www.fsf.org/licensing/licenses/info/GPLv2.html and
22 * http://www.gnu.org/copyleft/gpl.html. In addition, as a special
23 * exception, Nokia gives you certain additional rights. These rights
24 * are described in the Nokia Qt GPL Exception version 1.2, included in
25 * the file GPL_EXCEPTION.txt in this package.
26 *
27 * Qt for Windows(R) Licensees
28 * As a special exception, Nokia, as the sole copyright holder for Qt
29 * Designer, grants users of the Qt/Eclipse Integration plug-in the
30 * right for the Qt/Eclipse Integration to link to functionality
31 * provided by Qt Designer and its related libraries.
32 *
33 *
34 * If you are unsure which license is appropriate for your use, please
35 * contact the sales department at qt-sales@nokia.com.
36
37 **
38 ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
39 ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
40 **
41 ****************************************************************************/
42
43
44 #ifndef FASTLIST_H
45 #define FASTLIST_H
46
47 #include "smallobject.h"
48
49 template <typename Tp>
50 struct ListNode
51 {
52 Tp element;
53 int index;
54 mutable const ListNode<Tp> *next;
55
56 static ListNode *create(const Tp &element, pool *p)
57 {
58 ListNode<Tp> *node = new (p->allocate(sizeof(ListNode))) ListNode();
59 node->element = element;
60 node->index = 0;
61 node->next = node;
62
63 return node;
64 }
65
66 static ListNode *create(const ListNode *n1, const Tp &element, pool *p)
67 {
68 ListNode<Tp> *n2 = ListNode::create(element, p);
69
70 n2->index = n1->index + 1;
71 n2->next = n1->next;
72 n1->next = n2;
73
74 return n2;
75 }
76
77 inline ListNode<Tp>() { }
78
79 inline const ListNode<Tp> *at(int index) const
80 {
81 const ListNode<Tp> *node = this;
82 while (index != node->index)
83 node = node->next;
84
85 return node;
86 }
87
88 inline bool hasNext() const
89 { return index < next->index; }
90
91 inline int count() const
92 { return 1 + toBack()->index; }
93
94 inline const ListNode<Tp> *toFront() const
95 { return toBack()->next; }
96
97 inline const ListNode<Tp> *toBack() const
98 {
99 const ListNode<Tp> *node = this;
100 while (node->hasNext())
101 node = node->next;
102
103 return node;
104 }
105 };
106
107 template <class Tp>
108 inline const ListNode<Tp> *snoc(const ListNode<Tp> *list,
109 const Tp &element, pool *p)
110 {
111 if (!list)
112 return ListNode<Tp>::create(element, p);
113
114 return ListNode<Tp>::create(list->toBack(), element, p);
115 }
116
117 #endif // FASTLIST_H
118
119 // kate: space-indent on; indent-width 2; replace-tabs on;
120