qmap.h File Reference

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

Go to the source code of this file.

Classes
class	QMap< Key, T >
	The QMap class is a template class that provides a skip-list-based dictionary. More...
class	QMap< Key, T >::const_iterator
	The QMap::const_iterator class provides an STL-style const iterator for QMap and QMultiMap. More...
class	QMap< Key, T >::iterator
	The QMap::iterator class provides an STL-style non-const iterator for QMap and QMultiMap. More...
struct	QMapData
struct	QMapData::Node
struct	QMapNode< Key, T >
struct	QMapPayloadNode< Key, T >
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)

Function Documentation

qMapLessThanKey() [1/3]

template<class Key >

bool qMapLessThanKey ( const Key &  key1, const Key &  key2  )

inline

Definition at line 105 of file qmap.h.

Referenced by QMap< int, QFrameInfo >::operator==().

{
    return key1 < key2;
}

qMapLessThanKey() [2/3]

template<class Ptr >

bool qMapLessThanKey ( Ptr *  key1, Ptr *  key2  )

inline

Definition at line 110 of file qmap.h.

{
    Q_ASSERT(sizeof(quintptr) == sizeof(Ptr *));
    return quintptr(key1) < quintptr(key2);
}

qMapLessThanKey() [3/3]

template<class Ptr >

bool qMapLessThanKey ( const Ptr *  key1, const Ptr *  key2  )

inline

Definition at line 116 of file qmap.h.

{
    Q_ASSERT(sizeof(quintptr) == sizeof(const Ptr *));
    return quintptr(key1) < quintptr(key2);
}