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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** 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 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://www.qtsoftware.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QDATABUFFER_P_H
#define QDATABUFFER_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists for the convenience
// of other Qt classes. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include "QtCore/qbytearray.h"
QT_BEGIN_NAMESPACE
template <typename Type> class QDataBuffer
{
public:
QDataBuffer(int res = 64)
{
capacity = res;
buffer = (Type*) qMalloc(capacity * sizeof(Type));
siz = 0;
}
~QDataBuffer()
{
qFree(buffer);
}
inline void reset() { siz = 0; }
inline bool isEmpty() const { return siz==0; }
inline int size() const { return siz; }
inline Type *data() const { return buffer; }
inline Type &at(int i) { Q_ASSERT(i >= 0 && i < siz); return buffer[i]; }
inline const Type &at(int i) const { Q_ASSERT(i >= 0 && i < siz); return buffer[i]; }
inline const Type &last() const { Q_ASSERT(!isEmpty()); return buffer[siz-1]; }
inline const Type &first() const { Q_ASSERT(!isEmpty()); return buffer[0]; }
inline void add(const Type &t) {
reserve(siz + 1);
buffer[siz] = t;
++siz;
}
inline void resize(int size) {
reserve(size);
siz = size;
}
inline void reserve(int size) {
if (size > capacity) {
while (capacity < size)
capacity *= 2;
buffer = (Type*) qRealloc(buffer, capacity * sizeof(Type));
}
}
inline void shrink(int size) {
capacity = size;
buffer = (Type*) qRealloc(buffer, capacity * sizeof(Type));
}
inline void swap(QDataBuffer<Type> &other) {
qSwap(capacity, other.capacity);
qSwap(siz, other.siz);
qSwap(buffer, other.buffer);
}
inline void insertBlank(int pos, int count) {
Q_ASSERT(pos >= 0);
Q_ASSERT(pos < siz);
reserve(siz + count);
for (int i = siz - pos - 1; i >= 0; --i)
buffer[pos + count + i] = buffer[pos + i];
siz += count;
}
inline void removeAndShift(int pos, int count) {
Q_ASSERT(pos >= 0);
Q_ASSERT(pos < siz);
for (int i=pos; i<siz-count; ++i)
buffer[i] = buffer[i+count];
siz -= count;
}
inline QDataBuffer &operator<<(const Type &t) { add(t); return *this; }
private:
int capacity;
int siz;
Type *buffer;
};
QT_END_NAMESPACE
#endif // QDATABUFFER_P_H
|
