|
|
/****************************************************************************
|
|
|
**
|
|
|
** 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;
|
|
|
|
|
|
|
