1
/****************************************************************************
3
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
4
** Contact: http://www.qt-project.org/legal
6
** This file is part of the plugins of the Qt Toolkit.
8
** $QT_BEGIN_LICENSE:LGPL$
9
** Commercial License Usage
10
** Licensees holding valid commercial Qt licenses may use this file in
11
** accordance with the commercial license agreement provided with the
12
** Software or, alternatively, in accordance with the terms contained in
13
** a written agreement between you and Digia. For licensing terms and
14
** conditions see http://qt.digia.com/licensing. For further information
15
** use the contact form at http://qt.digia.com/contact-us.
17
** GNU Lesser General Public License Usage
18
** Alternatively, this file may be used under the terms of the GNU Lesser
19
** General Public License version 2.1 as published by the Free Software
20
** Foundation and appearing in the file LICENSE.LGPL included in the
21
** packaging of this file. Please review the following information to
22
** ensure the GNU Lesser General Public License version 2.1 requirements
23
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
25
** In addition, as a special exception, Digia gives you certain additional
26
** rights. These rights are described in the Digia Qt LGPL Exception
27
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
29
** GNU General Public License Usage
30
** Alternatively, this file may be used under the terms of the GNU
31
** General Public License version 3.0 as published by the Free Software
32
** Foundation and appearing in the file LICENSE.GPL included in the
33
** packaging of this file. Please review the following information to
34
** ensure the GNU General Public License version 3.0 requirements will be
35
** met: http://www.gnu.org/copyleft/gpl.html.
40
****************************************************************************/
45
#include <QtCore/QtAlgorithms>
49
/* A simple, non-shared array. */
56
enum { initialSize = 5 };
58
typedef T* const_iterator;
60
explicit Array(size_t size= 0) : data(0), m_capacity(0), m_size(0)
61
{ if (size) resize(size); }
62
~Array() { delete [] data; }
65
inline size_t size() const { return m_size; }
66
inline const_iterator begin() const { return data; }
67
inline const_iterator end() const { return data + m_size; }
69
inline void append(const T &value)
71
const size_t oldSize = m_size;
73
data[oldSize] = value;
76
inline void resize(size_t size)
79
reserve(size > 1 ? size + size / 2 : size_t(initialSize));
83
void reserve(size_t capacity)
85
if (capacity > m_capacity) {
86
const T *oldData = data;
87
data = new T[capacity];
89
qCopy(oldData, oldData + m_size, data);
92
m_capacity = capacity;