1 /****************************************************************************
3 ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
4 ** All rights reserved.
5 ** Contact: Nokia Corporation (qt-info@nokia.com)
7 ** This file is part of the QtDeclarative module of the Qt Toolkit.
9 ** $QT_BEGIN_LICENSE:LGPL$
10 ** GNU Lesser General Public License Usage
11 ** This file may be used under the terms of the GNU Lesser General Public
12 ** License version 2.1 as published by the Free Software Foundation and
13 ** appearing in the file LICENSE.LGPL included in the packaging of this
14 ** file. Please review the following information to ensure the GNU Lesser
15 ** General Public License version 2.1 requirements will be met:
16 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
18 ** In addition, as a special exception, Nokia gives you certain additional
19 ** rights. These rights are described in the Nokia Qt LGPL Exception
20 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
22 ** GNU General Public License Usage
23 ** Alternatively, this file may be used under the terms of the GNU General
24 ** Public License version 3.0 as published by the Free Software Foundation
25 ** and appearing in the file LICENSE.GPL included in the packaging of this
26 ** file. Please review the following information to ensure the GNU General
27 ** Public License version 3.0 requirements will be met:
28 ** http://www.gnu.org/copyleft/gpl.html.
31 ** Alternatively, this file may be used in accordance with the terms and
32 ** conditions contained in a signed written agreement between you and Nokia.
40 ****************************************************************************/
42 #ifndef QFINITESTACK_P_H
43 #define QFINITESTACK_P_H
49 // This file is not part of the Qt API. It exists purely as an
50 // implementation detail. This header file may change from version to
51 // version without notice, or even be removed.
56 #include <QtCore/qglobal.h>
62 inline QFiniteStack();
63 inline ~QFiniteStack();
65 inline void deallocate();
66 inline void allocate(int size);
68 inline bool isEmpty() const;
69 inline const T &top() const;
71 inline void push(const T &o);
73 inline int count() const;
74 inline const T &at(int index) const;
75 inline T &operator[](int index);
83 QFiniteStack<T>::QFiniteStack()
84 : _array(0), _alloc(0), _size(0)
89 QFiniteStack<T>::~QFiniteStack()
95 bool QFiniteStack<T>::isEmpty() const
101 const T &QFiniteStack<T>::top() const
103 return _array[_size - 1];
107 T &QFiniteStack<T>::top()
109 return _array[_size - 1];
113 void QFiniteStack<T>::push(const T &o)
115 if (QTypeInfo<T>::isComplex) {
116 new (_array + _size++) T(o);
123 T QFiniteStack<T>::pop()
127 if (QTypeInfo<T>::isComplex) {
128 T rv = _array[_size];
129 (_array + _size)->~T();
132 return _array[_size];
137 int QFiniteStack<T>::count() const
143 const T &QFiniteStack<T>::at(int index) const
145 return _array[index];
149 T &QFiniteStack<T>::operator[](int index)
151 return _array[index];
155 void QFiniteStack<T>::allocate(int size)
157 Q_ASSERT(_array == 0);
158 Q_ASSERT(_alloc == 0);
159 Q_ASSERT(_size == 0);
163 _array = (T *)qMalloc(size * sizeof(T));
168 void QFiniteStack<T>::deallocate()
170 if (QTypeInfo<T>::isComplex) {
171 T *i = _array + _size;
185 #endif // QFINITESTACK_P_H