blob: 8d2caff7782c598809b42cde7475c8ec06853411 (
plain)
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/****************************************************************************
**
** Copyright (C) 2021 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtQml module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:COMM$
**
** 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 The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** $QT_END_LICENSE$
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
**
****************************************************************************/
#ifndef QQMLJSFIXEDPOOLARRAY_P_H
#define QQMLJSFIXEDPOOLARRAY_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 <QtCore/qglobal.h>
#include <private/qqmljsmemorypool_p.h>
QT_BEGIN_NAMESPACE
namespace QQmlJS {
template <typename T>
class FixedPoolArray
{
T *data;
int count = 0;
public:
FixedPoolArray()
: data(nullptr)
{}
FixedPoolArray(MemoryPool *pool, int size)
{ allocate(pool, size); }
void allocate(MemoryPool *pool, int size)
{
count = size;
data = reinterpret_cast<T*>(pool->allocate(count * sizeof(T)));
}
void allocate(MemoryPool *pool, const QVector<T> &vector)
{
count = vector.count();
data = reinterpret_cast<T*>(pool->allocate(count * sizeof(T)));
if (QTypeInfo<T>::isComplex) {
for (int i = 0; i < count; ++i)
new (data + i) T(vector.at(i));
} else {
memcpy(data, static_cast<const void*>(vector.constData()), count * sizeof(T));
}
}
template <typename Container>
void allocate(MemoryPool *pool, const Container &container)
{
count = container.count();
data = reinterpret_cast<T*>(pool->allocate(count * sizeof(T)));
typename Container::ConstIterator it = container.constBegin();
for (int i = 0; i < count; ++i)
new (data + i) T(*it++);
}
int size() const
{ return count; }
const T &at(int index) const {
Q_ASSERT(index >= 0 && index < count);
return data[index];
}
T &at(int index) {
Q_ASSERT(index >= 0 && index < count);
return data[index];
}
T &operator[](int index) {
return at(index);
}
int indexOf(const T &value) const {
for (int i = 0; i < count; ++i)
if (data[i] == value)
return i;
return -1;
}
const T *begin() const { return data; }
const T *end() const { return data + count; }
T *begin() { return data; }
T *end() { return data + count; }
};
} // namespace QQmlJS
QT_END_NAMESPACE
#endif // QQMLJSFIXEDPOOLARRAY_P_H
|
