#include <QtCore/qscopedpointer.h>
#include <QtCore/qiodevice.h>
#include <QtCore/qglobal.h>
Go to the source code of this file.
|
template<typename T > |
QDataStream & | operator<< (QDataStream &s, const QList< T > &l) |
|
template<typename T > |
QDataStream & | operator<< (QDataStream &s, const QLinkedList< T > &l) |
|
template<typename T > |
QDataStream & | operator<< (QDataStream &s, const QVector< T > &v) |
|
template<typename T > |
QDataStream & | operator<< (QDataStream &out, const QSet< T > &set) |
|
template<class Key , class T > |
Q_OUTOFLINE_TEMPLATE QDataStream & | operator<< (QDataStream &out, const QHash< Key, T > &hash) |
|
template<class Key , class T > |
Q_OUTOFLINE_TEMPLATE QDataStream & | operator<< (QDataStream &out, const QMap< Key, T > &map) |
|
template<typename T > |
QDataStream & | operator>> (QDataStream &s, QList< T > &l) |
|
template<typename T > |
QDataStream & | operator>> (QDataStream &s, QLinkedList< T > &l) |
|
template<typename T > |
QDataStream & | operator>> (QDataStream &s, QVector< T > &v) |
|
template<typename T > |
QDataStream & | operator>> (QDataStream &in, QSet< T > &set) |
|
template<class Key , class T > |
Q_OUTOFLINE_TEMPLATE QDataStream & | operator>> (QDataStream &in, QHash< Key, T > &hash) |
|
template<class Key , class T > |
Q_OUTOFLINE_TEMPLATE QDataStream & | operator>> (QDataStream &in, QMap< Key, T > &map) |
|
◆ operator<<() [1/6]
Definition at line 261 of file qdatastream.h.
264 for (
int i = 0; i < l.
size(); ++i)
const T & at(int i) const
Returns the item at index position i in the list.
int size() const
Returns the number of items in the list.
◆ operator<<() [2/6]
Definition at line 287 of file qdatastream.h.
const_iterator constBegin() const
Returns a const STL-style iterator pointing to the first item in the list.
#define it(className, varName)
const_iterator constEnd() const
Returns a const STL-style iterator pointing to the imaginary item after the last item in the list...
The QLinkedList::const_iterator class provides an STL-style const iterator for QLinkedList.
int size() const
Returns the number of items in the list.
◆ operator<<() [3/6]
Definition at line 312 of file qdatastream.h.
#define it(className, varName)
iterator end()
Returns an STL-style iterator pointing to the imaginary item after the last item in the vector...
iterator begin()
Returns an STL-style iterator pointing to the first item in the vector.
const T * const_iterator
The QVector::const_iterator typedef provides an STL-style const iterator for QVector and QStack...
int size() const
Returns the number of items in the vector.
◆ operator<<() [4/6]
◆ operator<<() [5/6]
template<class Key , class T >
Definition at line 376 of file qdatastream.h.
381 while (it != begin) {
383 out << it.key() << it.value();
The QHash::const_iterator class provides an STL-style const iterator for QHash and QMultiHash...
#define it(className, varName)
int size() const
Returns the number of items in the hash.
iterator end()
Returns an STL-style iterator pointing to the imaginary item after the last item in the hash...
iterator begin()
Returns an STL-style iterator pointing to the first item in the hash.
◆ operator<<() [6/6]
template<class Key , class T >
Definition at line 422 of file qdatastream.h.
427 while (it != begin) {
429 out << it.key() << it.value();
#define it(className, varName)
int size() const
Returns the number of (key, value) pairs in the map.
iterator begin()
Returns an STL-style iterator pointing to the first item in the map.
The QMap::const_iterator class provides an STL-style const iterator for QMap and QMultiMap.
iterator end()
Returns an STL-style iterator pointing to the imaginary item after the last item in the map...
◆ operator>>() [1/6]
Definition at line 243 of file qdatastream.h.
bool atEnd() const
Returns true if the I/O device has reached the end position (end of the stream or file) or if there i...
void append(const T &t)
Inserts value at the end of the list.
void clear()
Removes all items from the list.
void reserve(int size)
Reserve space for alloc elements.
◆ operator>>() [2/6]
Definition at line 270 of file qdatastream.h.
void clear()
Removes all the items in the list.
bool atEnd() const
Returns true if the I/O device has reached the end position (end of the stream or file) or if there i...
void append(const T &)
Inserts value at the end of the list.
◆ operator>>() [3/6]
Definition at line 297 of file qdatastream.h.
void resize(int size)
Sets the size of the vector to size.
void clear()
Removes all the elements from the vector and releases the memory used by the vector.
◆ operator>>() [4/6]
Definition at line 321 of file qdatastream.h.
bool atEnd() const
Returns true if the I/O device has reached the end position (end of the stream or file) or if there i...
◆ operator>>() [5/6]
template<class Key , class T >
Definition at line 349 of file qdatastream.h.
358 for (
quint32 i = 0; i < n; ++i) {
Status status() const
Returns the status of the data stream.
void clear()
Removes all items from the hash.
Status
This enum describes the current status of the data stream.
void setStatus(Status status)
Sets the status of the data stream to the status given.
void resetStatus()
Resets the status of the data stream.
iterator insertMulti(const Key &key, const T &value)
Inserts a new item with the key and a value of value.
◆ operator>>() [6/6]
template<class Key , class T >
Definition at line 389 of file qdatastream.h.
404 for (
quint32 i = 0; i < n; ++i) {
Status status() const
Returns the status of the data stream.
void setInsertInOrder(bool ordered)
Status
This enum describes the current status of the data stream.
void setStatus(Status status)
Sets the status of the data stream to the status given.
iterator insertMulti(const Key &key, const T &value)
Inserts a new item with the key key and a value of value.
void detach()
Detaches this map from any other maps with which it may share data.
void resetStatus()
Resets the status of the data stream.
void clear()
Removes all items from the map.