| 1 |
/**************************************************************************** |
| 2 |
** |
| 3 |
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
| 4 |
** All rights reserved. |
| 5 |
** Contact: Nokia Corporation (qt-info@nokia.com) |
| 6 |
** |
| 7 |
** This file is part of the QtCore module of the Qt Toolkit. |
| 8 |
** |
| 9 |
** $QT_BEGIN_LICENSE:LGPL$ |
| 10 |
** No Commercial Usage |
| 11 |
** This file contains pre-release code and may not be distributed. |
| 12 |
** You may use this file in accordance with the terms and conditions |
| 13 |
** contained in the Technology Preview License Agreement accompanying |
| 14 |
** this package. |
| 15 |
** |
| 16 |
** GNU Lesser General Public License Usage |
| 17 |
** Alternatively, this file may be used under the terms of the GNU Lesser |
| 18 |
** General Public License version 2.1 as published by the Free Software |
| 19 |
** Foundation and appearing in the file LICENSE.LGPL included in the |
| 20 |
** packaging of this file. Please review the following information to |
| 21 |
** ensure the GNU Lesser General Public License version 2.1 requirements |
| 22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
| 23 |
** |
| 24 |
** In addition, as a special exception, Nokia gives you certain additional |
| 25 |
** rights. These rights are described in the Nokia Qt LGPL Exception |
| 26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
| 27 |
** |
| 28 |
** If you have questions regarding the use of this file, please contact |
| 29 |
** Nokia at qt-info@nokia.com. |
| 30 |
** |
| 31 |
** |
| 32 |
** |
| 33 |
** |
| 34 |
** |
| 35 |
** |
| 36 |
** |
| 37 |
** |
| 38 |
** $QT_END_LICENSE$ |
| 39 |
** |
| 40 |
****************************************************************************/ |
| 41 |
|
| 42 |
#ifndef QDATASTREAM_H |
| 43 |
#define QDATASTREAM_H |
| 44 |
|
| 45 |
#include <QtCore/qiodevice.h> |
| 46 |
#include <QtCore/qglobal.h> |
| 47 |
|
| 48 |
#ifdef Status |
| 49 |
#error qdatastream.h must be included before any header file that defines Status |
| 50 |
#endif |
| 51 |
|
| 52 |
QT_BEGIN_HEADER |
| 53 |
|
| 54 |
QT_BEGIN_NAMESPACE |
| 55 |
|
| 56 |
QT_MODULE(Core) |
| 57 |
|
| 58 |
class QByteArray; |
| 59 |
class QIODevice; |
| 60 |
|
| 61 |
template <typename T> class QList; |
| 62 |
template <typename T> class QLinkedList; |
| 63 |
template <typename T> class QVector; |
| 64 |
template <typename T> class QSet; |
| 65 |
template <class Key, class T> class QHash; |
| 66 |
template <class Key, class T> class QMap; |
| 67 |
|
| 68 |
class QDataStreamPrivate; |
| 69 |
|
| 70 |
#ifndef QT_NO_DATASTREAM |
| 71 |
class Q_CORE_EXPORT QDataStream |
| 72 |
{ |
| 73 |
public: |
| 74 |
enum Version { |
| 75 |
Qt_1_0 = 1, |
| 76 |
Qt_2_0 = 2, |
| 77 |
Qt_2_1 = 3, |
| 78 |
Qt_3_0 = 4, |
| 79 |
Qt_3_1 = 5, |
| 80 |
Qt_3_3 = 6, |
| 81 |
Qt_4_0 = 7, |
| 82 |
Qt_4_1 = Qt_4_0, |
| 83 |
Qt_4_2 = 8, |
| 84 |
Qt_4_3 = 9, |
| 85 |
Qt_4_4 = 10, |
| 86 |
Qt_4_5 = 11 |
| 87 |
#if QT_VERSION >= 0x040600 |
| 88 |
#error Add the datastream version for this Qt version |
| 89 |
, Qt_4_6 = Qt_4_5 |
| 90 |
#endif |
| 91 |
}; |
| 92 |
|
| 93 |
enum ByteOrder { |
| 94 |
BigEndian = QSysInfo::BigEndian, |
| 95 |
LittleEndian = QSysInfo::LittleEndian |
| 96 |
}; |
| 97 |
|
| 98 |
enum Status { |
| 99 |
Ok, |
| 100 |
ReadPastEnd, |
| 101 |
ReadCorruptData |
| 102 |
}; |
| 103 |
|
| 104 |
QDataStream(); |
| 105 |
explicit QDataStream(QIODevice *); |
| 106 |
#ifdef QT3_SUPPORT |
| 107 |
QDataStream(QByteArray *, int mode); |
| 108 |
#endif |
| 109 |
QDataStream(QByteArray *, QIODevice::OpenMode flags); |
| 110 |
QDataStream(const QByteArray &); |
| 111 |
virtual ~QDataStream(); |
| 112 |
|
| 113 |
QIODevice *device() const; |
| 114 |
void setDevice(QIODevice *); |
| 115 |
void unsetDevice(); |
| 116 |
|
| 117 |
bool atEnd() const; |
| 118 |
#ifdef QT3_SUPPORT |
| 119 |
inline QT3_SUPPORT bool eof() const { return atEnd(); } |
| 120 |
#endif |
| 121 |
|
| 122 |
Status status() const; |
| 123 |
void setStatus(Status status); |
| 124 |
void resetStatus(); |
| 125 |
|
| 126 |
ByteOrder byteOrder() const; |
| 127 |
void setByteOrder(ByteOrder); |
| 128 |
|
| 129 |
int version() const; |
| 130 |
void setVersion(int); |
| 131 |
|
| 132 |
QDataStream &operator>>(qint8 &i); |
| 133 |
QDataStream &operator>>(quint8 &i); |
| 134 |
QDataStream &operator>>(qint16 &i); |
| 135 |
QDataStream &operator>>(quint16 &i); |
| 136 |
QDataStream &operator>>(qint32 &i); |
| 137 |
QDataStream &operator>>(quint32 &i); |
| 138 |
QDataStream &operator>>(qint64 &i); |
| 139 |
QDataStream &operator>>(quint64 &i); |
| 140 |
|
| 141 |
QDataStream &operator>>(bool &i); |
| 142 |
QDataStream &operator>>(float &f); |
| 143 |
QDataStream &operator>>(double &f); |
| 144 |
QDataStream &operator>>(char *&str); |
| 145 |
|
| 146 |
QDataStream &operator<<(qint8 i); |
| 147 |
QDataStream &operator<<(quint8 i); |
| 148 |
QDataStream &operator<<(qint16 i); |
| 149 |
QDataStream &operator<<(quint16 i); |
| 150 |
QDataStream &operator<<(qint32 i); |
| 151 |
QDataStream &operator<<(quint32 i); |
| 152 |
QDataStream &operator<<(qint64 i); |
| 153 |
QDataStream &operator<<(quint64 i); |
| 154 |
QDataStream &operator<<(bool i); |
| 155 |
QDataStream &operator<<(float f); |
| 156 |
QDataStream &operator<<(double f); |
| 157 |
QDataStream &operator<<(const char *str); |
| 158 |
|
| 159 |
QDataStream &readBytes(char *&, uint &len); |
| 160 |
int readRawData(char *, int len); |
| 161 |
|
| 162 |
QDataStream &writeBytes(const char *, uint len); |
| 163 |
int writeRawData(const char *, int len); |
| 164 |
|
| 165 |
int skipRawData(int len); |
| 166 |
|
| 167 |
#ifdef QT3_SUPPORT |
| 168 |
inline QT3_SUPPORT QDataStream &readRawBytes(char *str, uint len) |
| 169 |
{ readRawData(str, static_cast<int>(len)); return *this; } |
| 170 |
inline QT3_SUPPORT QDataStream &writeRawBytes(const char *str, uint len) |
| 171 |
{ writeRawData(str, static_cast<int>(len)); return *this; } |
| 172 |
inline QT3_SUPPORT bool isPrintableData() const { return false; } |
| 173 |
inline QT3_SUPPORT void setPrintableData(bool) {} |
| 174 |
#endif |
| 175 |
|
| 176 |
private: |
| 177 |
Q_DISABLE_COPY(QDataStream) |
| 178 |
|
| 179 |
QDataStreamPrivate *d; |
| 180 |
|
| 181 |
QIODevice *dev; |
| 182 |
bool owndev; |
| 183 |
bool noswap; |
| 184 |
ByteOrder byteorder; |
| 185 |
int ver; |
| 186 |
Status q_status; |
| 187 |
}; |
| 188 |
|
| 189 |
|
| 190 |
/***************************************************************************** |
| 191 |
QDataStream inline functions |
| 192 |
*****************************************************************************/ |
| 193 |
|
| 194 |
inline QIODevice *QDataStream::device() const |
| 195 |
{ return dev; } |
| 196 |
|
| 197 |
inline QDataStream::ByteOrder QDataStream::byteOrder() const |
| 198 |
{ return byteorder; } |
| 199 |
|
| 200 |
inline int QDataStream::version() const |
| 201 |
{ return ver; } |
| 202 |
|
| 203 |
inline void QDataStream::setVersion(int v) |
| 204 |
{ ver = v; } |
| 205 |
|
| 206 |
inline QDataStream &QDataStream::operator>>(quint8 &i) |
| 207 |
{ return *this >> reinterpret_cast<qint8&>(i); } |
| 208 |
|
| 209 |
inline QDataStream &QDataStream::operator>>(quint16 &i) |
| 210 |
{ return *this >> reinterpret_cast<qint16&>(i); } |
| 211 |
|
| 212 |
inline QDataStream &QDataStream::operator>>(quint32 &i) |
| 213 |
{ return *this >> reinterpret_cast<qint32&>(i); } |
| 214 |
|
| 215 |
inline QDataStream &QDataStream::operator>>(quint64 &i) |
| 216 |
{ return *this >> reinterpret_cast<qint64&>(i); } |
| 217 |
|
| 218 |
inline QDataStream &QDataStream::operator<<(quint8 i) |
| 219 |
{ return *this << qint8(i); } |
| 220 |
|
| 221 |
inline QDataStream &QDataStream::operator<<(quint16 i) |
| 222 |
{ return *this << qint16(i); } |
| 223 |
|
| 224 |
inline QDataStream &QDataStream::operator<<(quint32 i) |
| 225 |
{ return *this << qint32(i); } |
| 226 |
|
| 227 |
inline QDataStream &QDataStream::operator<<(quint64 i) |
| 228 |
{ return *this << qint64(i); } |
| 229 |
|
| 230 |
template <typename T> |
| 231 |
QDataStream& operator>>(QDataStream& s, QList<T>& l) |
| 232 |
{ |
| 233 |
l.clear(); |
| 234 |
quint32 c; |
| 235 |
s >> c; |
| 236 |
for(quint32 i = 0; i < c; ++i) |
| 237 |
{ |
| 238 |
T t; |
| 239 |
s >> t; |
| 240 |
l.append(t); |
| 241 |
if (s.atEnd()) |
| 242 |
break; |
| 243 |
} |
| 244 |
return s; |
| 245 |
} |
| 246 |
|
| 247 |
template <typename T> |
| 248 |
QDataStream& operator<<(QDataStream& s, const QList<T>& l) |
| 249 |
{ |
| 250 |
s << quint32(l.size()); |
| 251 |
for (int i = 0; i < l.size(); ++i) |
| 252 |
s << l.at(i); |
| 253 |
return s; |
| 254 |
} |
| 255 |
|
| 256 |
template <typename T> |
| 257 |
QDataStream& operator>>(QDataStream& s, QLinkedList<T>& l) |
| 258 |
{ |
| 259 |
l.clear(); |
| 260 |
quint32 c; |
| 261 |
s >> c; |
| 262 |
for(quint32 i = 0; i < c; ++i) |
| 263 |
{ |
| 264 |
T t; |
| 265 |
s >> t; |
| 266 |
l.append(t); |
| 267 |
if (s.atEnd()) |
| 268 |
break; |
| 269 |
} |
| 270 |
return s; |
| 271 |
} |
| 272 |
|
| 273 |
template <typename T> |
| 274 |
QDataStream& operator<<(QDataStream& s, const QLinkedList<T>& l) |
| 275 |
{ |
| 276 |
s << quint32(l.size()); |
| 277 |
typename QLinkedList<T>::ConstIterator it = l.constBegin(); |
| 278 |
for(; it != l.constEnd(); ++it) |
| 279 |
s << *it; |
| 280 |
return s; |
| 281 |
} |
| 282 |
|
| 283 |
template<typename T> |
| 284 |
QDataStream& operator>>(QDataStream& s, QVector<T>& v) |
| 285 |
{ |
| 286 |
v.clear(); |
| 287 |
quint32 c; |
| 288 |
s >> c; |
| 289 |
v.resize(c); |
| 290 |
for(quint32 i = 0; i < c; ++i) { |
| 291 |
T t; |
| 292 |
s >> t; |
| 293 |
v[i] = t; |
| 294 |
} |
| 295 |
return s; |
| 296 |
} |
| 297 |
|
| 298 |
template<typename T> |
| 299 |
QDataStream& operator<<(QDataStream& s, const QVector<T>& v) |
| 300 |
{ |
| 301 |
s << quint32(v.size()); |
| 302 |
for (typename QVector<T>::const_iterator it = v.begin(); it != v.end(); ++it) |
| 303 |
s << *it; |
| 304 |
return s; |
| 305 |
} |
| 306 |
|
| 307 |
template <typename T> |
| 308 |
QDataStream &operator>>(QDataStream &in, QSet<T> &set) |
| 309 |
{ |
| 310 |
set.clear(); |
| 311 |
quint32 c; |
| 312 |
in >> c; |
| 313 |
for (quint32 i = 0; i < c; ++i) { |
| 314 |
T t; |
| 315 |
in >> t; |
| 316 |
set << t; |
| 317 |
if (in.atEnd()) |
| 318 |
break; |
| 319 |
} |
| 320 |
return in; |
| 321 |
} |
| 322 |
|
| 323 |
template <typename T> |
| 324 |
QDataStream& operator<<(QDataStream &out, const QSet<T> &set) |
| 325 |
{ |
| 326 |
out << quint32(set.size()); |
| 327 |
typename QSet<T>::const_iterator i = set.constBegin(); |
| 328 |
while (i != set.constEnd()) { |
| 329 |
out << *i; |
| 330 |
++i; |
| 331 |
} |
| 332 |
return out; |
| 333 |
} |
| 334 |
|
| 335 |
template <class Key, class T> |
| 336 |
Q_OUTOFLINE_TEMPLATE QDataStream &operator>>(QDataStream &in, QHash<Key, T> &hash) |
| 337 |
{ |
| 338 |
QDataStream::Status oldStatus = in.status(); |
| 339 |
in.resetStatus(); |
| 340 |
hash.clear(); |
| 341 |
|
| 342 |
quint32 n; |
| 343 |
in >> n; |
| 344 |
|
| 345 |
for (quint32 i = 0; i < n; ++i) { |
| 346 |
if (in.status() != QDataStream::Ok) |
| 347 |
break; |
| 348 |
|
| 349 |
Key k; |
| 350 |
T t; |
| 351 |
in >> k >> t; |
| 352 |
hash.insertMulti(k, t); |
| 353 |
} |
| 354 |
|
| 355 |
if (in.status() != QDataStream::Ok) |
| 356 |
hash.clear(); |
| 357 |
if (oldStatus != QDataStream::Ok) |
| 358 |
in.setStatus(oldStatus); |
| 359 |
return in; |
| 360 |
} |
| 361 |
|
| 362 |
template <class Key, class T> |
| 363 |
Q_OUTOFLINE_TEMPLATE QDataStream &operator<<(QDataStream &out, const QHash<Key, T>& hash) |
| 364 |
{ |
| 365 |
out << quint32(hash.size()); |
| 366 |
typename QHash<Key, T>::ConstIterator it = hash.end(); |
| 367 |
typename QHash<Key, T>::ConstIterator begin = hash.begin(); |
| 368 |
while (it != begin) { |
| 369 |
--it; |
| 370 |
out << it.key() << it.value(); |
| 371 |
} |
| 372 |
return out; |
| 373 |
} |
| 374 |
#ifdef qdoc |
| 375 |
template <class Key, class T> |
| 376 |
Q_OUTOFLINE_TEMPLATE QDataStream &operator>>(QDataStream &in, QMap<Key, T> &map) |
| 377 |
#else |
| 378 |
template <class aKey, class aT> |
| 379 |
Q_OUTOFLINE_TEMPLATE QDataStream &operator>>(QDataStream &in, QMap<aKey, aT> &map) |
| 380 |
#endif |
| 381 |
{ |
| 382 |
QDataStream::Status oldStatus = in.status(); |
| 383 |
in.resetStatus(); |
| 384 |
map.clear(); |
| 385 |
|
| 386 |
quint32 n; |
| 387 |
in >> n; |
| 388 |
|
| 389 |
map.detach(); |
| 390 |
map.setInsertInOrder(true); |
| 391 |
for (quint32 i = 0; i < n; ++i) { |
| 392 |
if (in.status() != QDataStream::Ok) |
| 393 |
break; |
| 394 |
|
| 395 |
aKey key; |
| 396 |
aT value; |
| 397 |
in >> key >> value; |
| 398 |
map.insertMulti(key, value); |
| 399 |
} |
| 400 |
map.setInsertInOrder(false); |
| 401 |
if (in.status() != QDataStream::Ok) |
| 402 |
map.clear(); |
| 403 |
if (oldStatus != QDataStream::Ok) |
| 404 |
in.setStatus(oldStatus); |
| 405 |
return in; |
| 406 |
} |
| 407 |
|
| 408 |
template <class Key, class T> |
| 409 |
Q_OUTOFLINE_TEMPLATE QDataStream &operator<<(QDataStream &out, const QMap<Key, T> &map) |
| 410 |
{ |
| 411 |
out << quint32(map.size()); |
| 412 |
typename QMap<Key, T>::ConstIterator it = map.end(); |
| 413 |
typename QMap<Key, T>::ConstIterator begin = map.begin(); |
| 414 |
while (it != begin) { |
| 415 |
--it; |
| 416 |
out << it.key() << it.value(); |
| 417 |
} |
| 418 |
return out; |
| 419 |
} |
| 420 |
|
| 421 |
#endif // QT_NO_DATASTREAM |
| 422 |
|
| 423 |
QT_END_NAMESPACE |
| 424 |
|
| 425 |
QT_END_HEADER |
| 426 |
|
| 427 |
#endif // QDATASTREAM_H |