Eneboo - Documentación para desarrolladores
|
#include <qmap.h>
Tipos públicos | |
typedef Key | key_type |
typedef T | mapped_type |
typedef QPair< const key_type, mapped_type > | value_type |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef ptrdiff_t | difference_type |
typedef size_t | size_type |
typedef QMapIterator< Key, T > | iterator |
typedef QMapConstIterator< Key, T > | const_iterator |
typedef QPair< iterator, bool > | insert_pair |
typedef QMapIterator< Key, T > | Iterator |
typedef QMapConstIterator< Key, T > | ConstIterator |
typedef T | ValueType |
typedef QMapPrivate< Key, T > | Priv |
typedef Key | key_type |
typedef T | mapped_type |
typedef QPair< const key_type, mapped_type > | value_type |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef ptrdiff_t | difference_type |
typedef size_t | size_type |
typedef QMapIterator< Key, T > | iterator |
typedef QMapConstIterator< Key, T > | const_iterator |
typedef QPair< iterator, bool > | insert_pair |
typedef QMapIterator< Key, T > | Iterator |
typedef QMapConstIterator< Key, T > | ConstIterator |
typedef T | ValueType |
typedef QMapPrivate< Key, T > | Priv |
Métodos públicos | |
QMap () | |
QMap (const QMap< Key, T > &m) | |
QMap (const std::map< Key, T > &m) | |
~QMap () | |
QMap< Key, T > & | operator= (const QMap< Key, T > &m) |
QMap< Key, T > & | operator= (const std::map< Key, T > &m) |
iterator | begin () |
iterator | end () |
const_iterator | begin () const |
const_iterator | end () const |
const_iterator | constBegin () const |
const_iterator | constEnd () const |
iterator | replace (const Key &k, const T &v) |
size_type | size () const |
bool | empty () const |
QPair< iterator, bool > | insert (const value_type &x) |
void | erase (iterator it) |
void | erase (const key_type &k) |
size_type | count (const key_type &k) const |
T & | operator[] (const Key &k) |
void | clear () |
iterator | find (const Key &k) |
const_iterator | find (const Key &k) const |
const T & | operator[] (const Key &k) const |
bool | contains (const Key &k) const |
size_type | count () const |
QValueList< Key > | keys () const |
QValueList< T > | values () const |
bool | isEmpty () const |
iterator | insert (const Key &key, const T &value, bool overwrite=TRUE) |
void | remove (iterator it) |
void | remove (const Key &k) |
QMap () | |
QMap (const QMap< Key, T > &m) | |
QMap (const std::map< Key, T > &m) | |
~QMap () | |
QMap< Key, T > & | operator= (const QMap< Key, T > &m) |
QMap< Key, T > & | operator= (const std::map< Key, T > &m) |
iterator | begin () |
iterator | end () |
const_iterator | begin () const |
const_iterator | end () const |
const_iterator | constBegin () const |
const_iterator | constEnd () const |
iterator | replace (const Key &k, const T &v) |
size_type | size () const |
bool | empty () const |
QPair< iterator, bool > | insert (const value_type &x) |
void | erase (iterator it) |
void | erase (const key_type &k) |
size_type | count (const key_type &k) const |
T & | operator[] (const Key &k) |
void | clear () |
iterator | find (const Key &k) |
const_iterator | find (const Key &k) const |
const T & | operator[] (const Key &k) const |
bool | contains (const Key &k) const |
size_type | count () const |
QValueList< Key > | keys () const |
QValueList< T > | values () const |
bool | isEmpty () const |
iterator | insert (const Key &key, const T &value, bool overwrite=TRUE) |
void | remove (iterator it) |
void | remove (const Key &k) |
Métodos protegidos | |
void | detach () |
void | detach () |
Atributos protegidos | |
Priv * | sh |
Amigas | |
class | QDeepCopy< QMap< Key, T > > |
typedef QMapConstIterator<Key,T> QMap< Key, T >::const_iterator |
typedef QMapConstIterator<Key,T> QMap< Key, T >::const_iterator |
typedef const value_type* QMap< Key, T >::const_pointer |
typedef const value_type* QMap< Key, T >::const_pointer |
typedef const value_type& QMap< Key, T >::const_reference |
typedef const value_type& QMap< Key, T >::const_reference |
typedef QMapConstIterator< Key, T > QMap< Key, T >::ConstIterator |
typedef QMapConstIterator< Key, T > QMap< Key, T >::ConstIterator |
typedef ptrdiff_t QMap< Key, T >::difference_type |
typedef ptrdiff_t QMap< Key, T >::difference_type |
typedef QPair<iterator,bool> QMap< Key, T >::insert_pair |
typedef QPair<iterator,bool> QMap< Key, T >::insert_pair |
typedef QMapIterator< Key, T > QMap< Key, T >::Iterator |
typedef QMapIterator<Key,T> QMap< Key, T >::iterator |
typedef QMapIterator<Key,T> QMap< Key, T >::iterator |
typedef QMapIterator< Key, T > QMap< Key, T >::Iterator |
typedef T QMap< Key, T >::mapped_type |
typedef T QMap< Key, T >::mapped_type |
typedef value_type* QMap< Key, T >::pointer |
typedef value_type* QMap< Key, T >::pointer |
typedef QMapPrivate< Key, T > QMap< Key, T >::Priv |
typedef QMapPrivate< Key, T > QMap< Key, T >::Priv |
typedef value_type& QMap< Key, T >::reference |
typedef value_type& QMap< Key, T >::reference |
typedef QPair<const key_type, mapped_type> QMap< Key, T >::value_type |
typedef QPair<const key_type, mapped_type> QMap< Key, T >::value_type |
const_iterator QMap< Key, T >::begin | ( | ) | const [inline] |
const_iterator QMap< Key, T >::begin | ( | ) | const [inline] |
Q_INLINE_TEMPLATES void QMap< Key, T >::clear | ( | void | ) |
void QMap< Key, T >::clear | ( | ) |
const_iterator QMap< Key, T >::constBegin | ( | ) | const [inline] |
const_iterator QMap< Key, T >::constBegin | ( | ) | const [inline] |
const_iterator QMap< Key, T >::constEnd | ( | ) | const [inline] |
const_iterator QMap< Key, T >::constEnd | ( | ) | const [inline] |
Q_INLINE_TEMPLATES Q_TYPENAME QMap< Key, T >::size_type QMap< Key, T >::count | ( | const key_type & | k | ) | const |
void QMap< Key, T >::detach | ( | ) | [inline, protected] |
Helpers
void QMap< Key, T >::detach | ( | ) | [inline, protected] |
Helpers
const_iterator QMap< Key, T >::end | ( | ) | const [inline] |
const_iterator QMap< Key, T >::end | ( | ) | const [inline] |
const_iterator QMap< Key, T >::find | ( | const Key & | k | ) | const [inline] |
const_iterator QMap< Key, T >::find | ( | const Key & | k | ) | const [inline] |
QPair<iterator,bool> QMap< Key, T >::insert | ( | const value_type & | x | ) |
QPair<iterator,bool> QMap< Key, T >::insert | ( | const value_type & | x | ) |
Q_INLINE_TEMPLATES Q_TYPENAME QMap< Key, T >::iterator QMap< Key, T >::insert | ( | const Key & | key, |
const T & | value, | ||
bool | overwrite = TRUE |
||
) |
iterator QMap< Key, T >::insert | ( | const Key & | key, |
const T & | value, | ||
bool | overwrite = TRUE |
||
) |
QValueList<Key> QMap< Key, T >::keys | ( | ) | const [inline] |
QValueList<Key> QMap< Key, T >::keys | ( | ) | const [inline] |
QMap<Key,T>& QMap< Key, T >::operator= | ( | const std::map< Key, T > & | m | ) | [inline] |
QMap<Key,T>& QMap< Key, T >::operator= | ( | const std::map< Key, T > & | m | ) | [inline] |
Q_INLINE_TEMPLATES QMap< Key, T > & QMap< Key, T >::operator= | ( | const QMap< Key, T > & | m | ) |
Q_INLINE_TEMPLATES T & QMap< Key, T >::operator[] | ( | const Key & | k | ) |
const T& QMap< Key, T >::operator[] | ( | const Key & | k | ) | const [inline] |
T& QMap< Key, T >::operator[] | ( | const Key & | k | ) |
const T& QMap< Key, T >::operator[] | ( | const Key & | k | ) | const [inline] |
Q_INLINE_TEMPLATES void QMap< Key, T >::remove | ( | const Key & | k | ) |
void QMap< Key, T >::remove | ( | const Key & | k | ) |
iterator QMap< Key, T >::replace | ( | const Key & | k, |
const T & | v | ||
) | [inline] |
iterator QMap< Key, T >::replace | ( | const Key & | k, |
const T & | v | ||
) | [inline] |
QValueList<T> QMap< Key, T >::values | ( | ) | const [inline] |
QValueList<T> QMap< Key, T >::values | ( | ) | const [inline] |