src/corelib/tools/qmap.h File Reference

#include <QtCore/qatomic.h>
#include <QtCore/qiterator.h>
#include <QtCore/qlist.h>
#include <map>
#include <new>

Include dependency graph for qmap.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	QMapData
struct	QMapData::Node
class	QMap< Key, T >
	The QMap class is a template class that provides a skip-list-based dictionary. More...
struct	QMap< Key, T >::Node
struct	QMap< Key, T >::PayloadNode
class	QMap< Key, T >::iterator
	The QMap::iterator class provides an STL-style non-const iterator for QMap and QMultiMap. More...
class	QMap< Key, T >::const_iterator
	The QMap::const_iterator class provides an STL-style const iterator for QMap and QMultiMap. More...
class	QMultiMap< Key, T >
	The QMultiMap class is a convenience QMap subclass that provides multi-valued maps. More...
Functions
template<class Key>
bool	qMapLessThanKey (const Key &key1, const Key &key2)
template<class Ptr>
bool	qMapLessThanKey (Ptr *key1, Ptr *key2)
template<class Ptr>
bool	qMapLessThanKey (const Ptr *key1, const Ptr *key2)
template<class aKey, class aT>
QDataStream &	operator>> (QDataStream &in, QMap< aKey, aT > &map)

---

Function Documentation

template<class aKey, class aT>

QDataStream& operator>>	(	QDataStream &	in,
		QMap< aKey, aT > &	map
	)

Definition at line 355 of file qdatastream.h.

References QMap< Key, T >::clear(), QMap< Key, T >::d, QMap< Key, T >::detach(), i, QMapData::insertInOrder, QMap< Key, T >::insertMulti(), key, n, QDataStream::Ok, QDataStream::resetStatus(), QDataStream::setStatus(), QDataStream::status(), and value.

{
    QDataStream::Status oldStatus = in.status();
    in.resetStatus();
    map.clear();

    quint32 n;
    in >> n;

    map.detach();
#if !defined(Q_CC_BOR)
    map.d->insertInOrder = true;
#endif
    for (quint32 i = 0; i < n; ++i) {
        if (in.status() != QDataStream::Ok)
            break;

        aKey key;
        aT value;
        in >> key >> value;
        map.insertMulti(key, value);
    }
#if !defined(Q_CC_BOR)
    map.d->insertInOrder = false;
#endif
    if (in.status() != QDataStream::Ok)
        map.clear();
    if (oldStatus != QDataStream::Ok)
        in.setStatus(oldStatus);
    return in;
}

Here is the call graph for this function:

template<class Ptr>

bool qMapLessThanKey	(	const Ptr *	key1,
		const Ptr *	key2
	)			[inline]

Definition at line 94 of file qmap.h.

{
    Q_ASSERT(sizeof(ulong) == sizeof(const Ptr *));
    return reinterpret_cast<ulong>(key1) < reinterpret_cast<ulong>(key2);
}

template<class Ptr>

bool qMapLessThanKey	(	Ptr *	key1,
		Ptr *	key2
	)			[inline]

Definition at line 88 of file qmap.h.

{
    Q_ASSERT(sizeof(ulong) == sizeof(Ptr *));
    return reinterpret_cast<ulong>(key1) < reinterpret_cast<ulong>(key2);
}

template<class Key>

bool qMapLessThanKey	(	const Key &	key1,
		const Key &	key2
	)			[inline]

Definition at line 82 of file qmap.h.

Referenced by QMap< Key, T >::operator==().

{
    return key1 < key2;
}

---