1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtQml module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** 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 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef VECTOR_H
#define VECTOR_H
#include <vector>
#include <wtf/Assertions.h>
#include <wtf/NotFound.h>
#include <qalgorithms.h>
enum WTF_UnusedOverflowMode {
UnsafeVectorOverflow
};
namespace WTF {
template <typename T, int capacity = 1, int overflowMode = UnsafeVectorOverflow>
class Vector : public std::vector<T> {
public:
Vector() {}
Vector(int initialSize) : std::vector<T>(initialSize) {}
inline void append(const T& value)
{ this->push_back(value); }
template <typename OtherType>
inline void append(const OtherType& other)
{ this->push_back(T(other)); }
inline void append(const Vector<T>& vector)
{
this->insert(this->end(), vector.begin(), vector.end());
}
inline void append(const T* ptr, size_t count)
{
for (size_t i = 0; i < count; ++i)
this->push_back(T(ptr[i]));
}
inline void append(typename std::vector<T>::const_iterator it, size_t count)
{
for (size_t i = 0; i < count; ++i, ++it)
this->push_back(*it);
}
using std::vector<T>::insert;
inline void reserveInitialCapacity(size_t size) { this->reserve(size); }
inline void insert(size_t position, T value)
{ this->insert(this->begin() + position, value); }
inline void grow(size_t size)
{ this->resize(size); }
inline void shrink(size_t size)
{ this->erase(this->begin() + size, this->end()); }
inline void shrinkToFit()
{ this->shrink(this->size()); }
inline void remove(size_t position)
{ this->erase(this->begin() + position); }
inline bool isEmpty() const { return this->empty(); }
inline T &last() { return *(this->begin() + this->size() - 1); }
};
template <typename T, int capacity>
void deleteAllValues(const Vector<T, capacity> &vector)
{
qDeleteAll(vector);
}
}
using WTF::Vector;
using WTF::deleteAllValues;
#endif // VECTOR_H
|
