Mercurial > projects > qtd
view generator/parser/list.h @ 14:5015aede8edd
insert() for QPolygons
author | eldar |
---|---|
date | Thu, 14 May 2009 15:53:32 +0000 |
parents | e78566595089 |
children | 09a0f1d048f2 |
line wrap: on
line source
/**************************************************************************** ** ** Copyright (C) 1992-2008 Nokia. All rights reserved. ** Copyright (C) 2002-2005 Roberto Raggi <roberto@kdevelop.org> ** ** This file is part of Qt Jambi. ** ** * Commercial Usage * Licensees holding valid Qt Commercial licenses may use this file in * accordance with the Qt Commercial License Agreement provided with the * Software or, alternatively, in accordance with the terms contained in * a written agreement between you and Nokia. * * * GNU General Public License Usage * Alternatively, this file may be used under the terms of the GNU * General Public License versions 2.0 or 3.0 as published by the Free * Software Foundation and appearing in the file LICENSE.GPL included in * the packaging of this file. Please review the following information * to ensure GNU General Public Licensing requirements will be met: * http://www.fsf.org/licensing/licenses/info/GPLv2.html and * http://www.gnu.org/copyleft/gpl.html. In addition, as a special * exception, Nokia gives you certain additional rights. These rights * are described in the Nokia Qt GPL Exception version 1.2, included in * the file GPL_EXCEPTION.txt in this package. * * Qt for Windows(R) Licensees * As a special exception, Nokia, as the sole copyright holder for Qt * Designer, grants users of the Qt/Eclipse Integration plug-in the * right for the Qt/Eclipse Integration to link to functionality * provided by Qt Designer and its related libraries. * * * If you are unsure which license is appropriate for your use, please * contact the sales department at qt-sales@nokia.com. ** ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ** ****************************************************************************/ #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;