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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
/****************************************************************************
**
** 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 QV4UTIL_H
#define QV4UTIL_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/QBitArray>
#include <algorithm>
#include <vector>
QT_BEGIN_NAMESPACE
namespace QV4 {
#if !defined(BROKEN_STD_VECTOR_BOOL_OR_BROKEN_STD_FIND)
// Sanity:
class BitVector
{
std::vector<bool> bits;
public:
BitVector(int size = 0, bool value = false)
: bits(size, value)
{}
void clear()
{ bits = std::vector<bool>(bits.size(), false); }
void reserve(int size)
{ bits.reserve(size); }
int size() const
{
Q_ASSERT(bits.size() < INT_MAX);
return static_cast<int>(bits.size());
}
void resize(int newSize)
{ bits.resize(newSize); }
void resize(int newSize, bool newValue)
{ bits.resize(newSize, newValue); }
void assign(int newSize, bool value)
{ bits.assign(newSize, value); }
int findNext(int start, bool value, bool wrapAround) const
{
// The ++operator of std::vector<bool>::iterator in libc++ has a bug when using it on an
// iterator pointing to the last element. It will not be set to ::end(), but beyond
// that. (It will be set to the first multiple of the native word size that is bigger
// than size().)
//
// See http://llvm.org/bugs/show_bug.cgi?id=19663
//
// The work-around is to calculate the distance, and compare it to the size() to see if it's
// beyond the end, or take the minimum of the distance and the size.
size_t pos = std::distance(bits.begin(),
std::find(bits.begin() + start, bits.end(), value));
if (wrapAround && pos >= static_cast<size_t>(size()))
pos = std::distance(bits.begin(),
std::find(bits.begin(), bits.begin() + start, value));
pos = qMin(pos, static_cast<size_t>(size()));
Q_ASSERT(pos <= static_cast<size_t>(size()));
Q_ASSERT(pos < INT_MAX);
return static_cast<int>(pos);
}
bool at(int idx) const
{ return bits.at(idx); }
void setBit(int idx)
{ bits[idx] = true; }
void clearBit(int idx)
{ bits[idx] = false; }
};
#else // Insanity:
class BitVector
{
QBitArray bits;
public:
BitVector(int size = 0, bool value = false)
: bits(size, value)
{}
void clear()
{ bits = QBitArray(bits.size(), false); }
void reserve(int size)
{ Q_UNUSED(size); }
int size() const
{ return bits.size(); }
void resize(int newSize)
{ bits.resize(newSize); }
void resize(int newSize, bool newValue)
{
int oldSize = bits.size();
bits.resize(newSize);
bits.fill(newValue, oldSize, bits.size());
}
void assign(int newSize, bool value)
{
bits.resize(newSize);
bits.fill(value);
}
int findNext(int start, bool value, bool wrapAround) const
{
for (int i = start, ei = size(); i < ei; ++i) {
if (at(i) == value)
return i;
}
if (wrapAround) {
for (int i = 0, ei = start; i < ei; ++i) {
if (at(i) == value)
return i;
}
}
return size();
}
bool at(int idx) const
{ return bits.at(idx); }
void setBit(int idx)
{ bits[idx] = true; }
void clearBit(int idx)
{ bits[idx] = false; }
};
#endif
}
QT_END_NAMESPACE
#endif // QV4UTIL_H
|
