/**************************************************************************** ** ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/ ** ** This file is part of the QtQml module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** GNU Lesser General Public License Usage ** 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. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU General ** Public License version 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 the GNU General ** Public License version 3.0 requirements will be met: ** http://www.gnu.org/copyleft/gpl.html. ** ** Other Usage ** Alternatively, this file may be used in accordance with the terms and ** conditions contained in a signed written agreement between you and Nokia. ** ** ** ** ** ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QFINITESTACK_P_H #define QFINITESTACK_P_H // // W A R N I N G // ------------- // // This file is not part of the Qt API. It exists purely as an // implementation detail. This header file may change from version to // version without notice, or even be removed. // // We mean it. // #include QT_BEGIN_NAMESPACE template struct QFiniteStack { inline QFiniteStack(); inline ~QFiniteStack(); inline void deallocate(); inline void allocate(int size); inline bool isEmpty() const; inline const T &top() const; inline T &top(); inline void push(const T &o); inline T pop(); inline int count() const; inline const T &at(int index) const; inline T &operator[](int index); private: T *_array; int _alloc; int _size; }; template QFiniteStack::QFiniteStack() : _array(0), _alloc(0), _size(0) { } template QFiniteStack::~QFiniteStack() { deallocate(); } template bool QFiniteStack::isEmpty() const { return _size == 0; } template const T &QFiniteStack::top() const { return _array[_size - 1]; } template T &QFiniteStack::top() { return _array[_size - 1]; } template void QFiniteStack::push(const T &o) { if (QTypeInfo::isComplex) { new (_array + _size++) T(o); } else { _array[_size++] = o; } } template T QFiniteStack::pop() { --_size; if (QTypeInfo::isComplex) { T rv = _array[_size]; (_array + _size)->~T(); return rv; } else { return _array[_size]; } } template int QFiniteStack::count() const { return _size; } template const T &QFiniteStack::at(int index) const { return _array[index]; } template T &QFiniteStack::operator[](int index) { return _array[index]; } template void QFiniteStack::allocate(int size) { Q_ASSERT(_array == 0); Q_ASSERT(_alloc == 0); Q_ASSERT(_size == 0); if (!size) return; _array = (T *)qMalloc(size * sizeof(T)); _alloc = size; } template void QFiniteStack::deallocate() { if (QTypeInfo::isComplex) { T *i = _array + _size; while (i != _array) (--i)->~T(); } qFree(_array); _array = 0; _alloc = 0; _size = 0; } QT_END_NAMESPACE #endif // QFINITESTACK_P_H