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
|
// Copyright (C) 2018 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#ifndef QPODVECTOR_P_H
#define QPODVECTOR_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/private/qglobal_p.h>
#include <QDebug>
QT_BEGIN_NAMESPACE
template<class T, int Increment>
class QPODVector
{
public:
QPODVector()
: m_count(0), m_capacity(0), m_data(nullptr) {}
~QPODVector() { if (m_data) ::free(m_data); }
const T &at(int idx) const {
return m_data[idx];
}
T &operator[](int idx) {
return m_data[idx];
}
void clear() {
m_count = 0;
}
void prepend(const T &v) {
insert(0, v);
}
void append(const T &v) {
insert(m_count, v);
}
void insert(int idx, const T &v) {
if (m_count == m_capacity) {
m_capacity += Increment;
m_data = (T *)realloc(static_cast<void *>(m_data), m_capacity * sizeof(T));
}
int moveCount = m_count - idx;
if (moveCount)
::memmove(static_cast<void *>(m_data + idx + 1), static_cast<const void *>(m_data + idx), moveCount * sizeof(T));
m_count++;
m_data[idx] = v;
}
void reserve(int count) {
if (count >= m_capacity) {
m_capacity = (count + (Increment-1)) & (0xFFFFFFFF - Increment + 1);
m_data = (T *)realloc(static_cast<void *>(m_data), m_capacity * sizeof(T));
}
}
void insertBlank(int idx, int count) {
int newSize = m_count + count;
reserve(newSize);
int moveCount = m_count - idx;
if (moveCount)
::memmove(static_cast<void *>(m_data + idx + count), static_cast<const void *>(m_data + idx),
moveCount * sizeof(T));
m_count = newSize;
}
void remove(int idx, int count = 1) {
int moveCount = m_count - (idx + count);
if (moveCount)
::memmove(static_cast<void *>(m_data + idx), static_cast<const void *>(m_data + idx + count),
moveCount * sizeof(T));
m_count -= count;
}
void removeOne(const T &v) {
int idx = 0;
while (idx < m_count) {
if (m_data[idx] == v) {
remove(idx);
return;
}
++idx;
}
}
int find(const T &v) {
for (int idx = 0; idx < m_count; ++idx)
if (m_data[idx] == v)
return idx;
return -1;
}
bool contains(const T &v) {
return find(v) != -1;
}
int count() const {
return m_count;
}
void copyAndClear(QPODVector<T,Increment> &other) {
if (other.m_data) ::free(other.m_data);
other.m_count = m_count;
other.m_capacity = m_capacity;
other.m_data = m_data;
m_count = 0;
m_capacity = 0;
m_data = nullptr;
}
QPODVector<T,Increment> &operator<<(const T &v) { append(v); return *this; }
private:
QPODVector(const QPODVector &);
QPODVector &operator=(const QPODVector &);
int m_count;
int m_capacity;
T *m_data;
};
QT_END_NAMESPACE
#endif
|
