QMap< Key, T > Class Template Reference

#include <audiodataoutput.h>

Class Description

template<class Key, class T>
class QMap< Key, T >

Definition at line 34 of file audiodataoutput.h.

Inheritance diagram for QMap< Key, T >:

Classes
class	const_iterator
class	iterator

Public Types
typedef iterator	Iterator
typedef const_iterator	ConstIterator
typedef Key	key_type
typedef T	mapped_type
typedef qptrdiff	difference_type
typedef int	size_type

Public Member Functions
	QMap ()
	QMap (const QMap< Key, T > &other)
	~QMap ()
QMap< Key, T > &	operator= (const QMap< Key, T > &other)
void	swap (QMap< Key, T > &other)
	QMap (const typename std::map< Key, T > &other)
std::map< Key, T >	toStdMap () const
bool	operator== (const QMap< Key, T > &other) const
bool	operator!= (const QMap< Key, T > &other) const
int	size () const
bool	isEmpty () const
void	detach ()
bool	isDetached () const
void	setSharable (bool sharable)
bool	isSharedWith (const QMap< Key, T > &other) const
void	setInsertInOrder (bool ordered)
void	clear ()
int	remove (const Key &key)
T	take (const Key &key)
bool	contains (const Key &key) const
const Key	key (const T &value) const
const Key	key (const T &value, const Key &defaultKey) const
const T	value (const Key &key) const
const T	value (const Key &key, const T &defaultValue) const
T &	operator[] (const Key &key)
const T	operator[] (const Key &key) const
QList< Key >	uniqueKeys () const
QList< Key >	keys () const
QList< Key >	keys (const T &value) const
QList< T >	values () const
QList< T >	values (const Key &key) const
int	count (const Key &key) const
iterator	begin ()
const_iterator	begin () const
const_iterator	constBegin () const
iterator	end ()
const_iterator	end () const
const_iterator	constEnd () const
iterator	erase (iterator it)
int	count () const
iterator	find (const Key &key)
const_iterator	find (const Key &key) const
const_iterator	constFind (const Key &key) const
iterator	lowerBound (const Key &key)
const_iterator	lowerBound (const Key &key) const
iterator	upperBound (const Key &key)
const_iterator	upperBound (const Key &key) const
iterator	insert (const Key &key, const T &value)
iterator	insertMulti (const Key &key, const T &value)
QMap< Key, T > &	unite (const QMap< Key, T > &other)
bool	empty () const

Friends
class	iterator
class	const_iterator

Member Typedef Documentation

typedef iterator Iterator

Definition at line 388 of file qmap.h.

typedef const_iterator ConstIterator

Definition at line 389 of file qmap.h.

typedef Key key_type

Definition at line 409 of file qmap.h.

typedef T mapped_type

Definition at line 410 of file qmap.h.

typedef qptrdiff difference_type

Definition at line 411 of file qmap.h.

typedef int size_type

Definition at line 412 of file qmap.h.

Constructor & Destructor Documentation

QMap ( )

inline

Definition at line 182 of file qmap.h.

: d(&QMapData::shared_null) { d->ref.ref(); }

QMap ( const QMap< Key, T > &  other )

inline

Definition at line 183 of file qmap.h.

                                           : d(other.d)
    { d->ref.ref(); if (!d->sharable) detach(); }

~QMap ( )

inline

Definition at line 185 of file qmap.h.

{ if (!d) return; if (!d->ref.deref()) freeData(d); }

QMap ( const typename std::map< Key, T > &  other )

explicit

Member Function Documentation

Q_INLINE_TEMPLATE QMap< Key, T > & operator=

(

const QMap< Key, T > &

other

)

Definition at line 429 of file qmap.h.

{
    if (d != other.d) {
        QMapData* o = other.d;
        o->ref.ref();
        if (!d->ref.deref())
            freeData(d);
        d = o;
        if (!d->sharable)
            detach_helper();
    }
    return *this;
}

void swap ( QMap< Key, T > &  other )

inline

Definition at line 192 of file qmap.h.

{ qSwap(d, other.d); }

Q_OUTOFLINE_TEMPLATE std::map< Key, T > toStdMap

(

)

const

Definition at line 959 of file qmap.h.

{
    std::map<Key, T> map;
    const_iterator it = end();
    while (it != begin()) {
        --it;
        map.insert(std::pair<Key, T>(it.key(), it.value()));
    }
    return map;
}

Q_OUTOFLINE_TEMPLATE bool operator==

(

const QMap< Key, T > &

other

)

const

Definition at line 925 of file qmap.h.

{
    if (size() != other.size())
        return false;
    if (d == other.d)
        return true;

    const_iterator it1 = begin();
    const_iterator it2 = other.begin();

    while (it1 != end()) {
        if (!(it1.value() == it2.value()) || qMapLessThanKey(it1.key(), it2.key()) || qMapLessThanKey(it2.key(), it1.key()))
            return false;
        ++it2;
        ++it1;
    }
    return true;
}

bool operator!= ( const QMap< Key, T > &  other ) const

inline

Definition at line 199 of file qmap.h.

{ return !(*this == other); }

int size ( ) const

inline

Definition at line 201 of file qmap.h.

{ return d->size; }

bool isEmpty ( ) const

inline

Definition at line 203 of file qmap.h.

{ return d->size == 0; }

void detach ( )

inline

Definition at line 205 of file qmap.h.

{ if (d->ref != 1) detach_helper(); }

bool isDetached ( ) const

inline

Definition at line 206 of file qmap.h.

{ return d->ref == 1; }

void setSharable ( bool  sharable )

inline

Definition at line 207 of file qmap.h.

{ if (!sharable) detach(); d->sharable = sharable; }

bool isSharedWith ( const QMap< Key, T > &  other ) const

inline

Definition at line 208 of file qmap.h.

{ return d == other.d; }

void setInsertInOrder ( bool  ordered )

inline

Definition at line 209 of file qmap.h.

{ d->insertInOrder = ordered; }

Q_INLINE_TEMPLATE void clear

(

)

Definition at line 444 of file qmap.h.

{
    *this = QMap<Key, T>();
}

Q_OUTOFLINE_TEMPLATE int remove

(

const Key &

key

)

Definition at line 662 of file qmap.h.

{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *cur = e;
    QMapData::Node *next = e;
    int oldSize = d->size;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
            cur = next;
        update[i] = cur;
    }

    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
        bool deleteNext = true;
        do {
            cur = next;
            next = cur->forward[0];
            deleteNext = (next != e && !qMapLessThanKey<Key>(concrete(cur)->key, concrete(next)->key));
            concrete(cur)->key.~Key();
            concrete(cur)->value.~T();
            d->node_delete(update, payload(), cur);
        } while (deleteNext);
    }
    return oldSize - d->size;
}

Q_OUTOFLINE_TEMPLATE T take

(

const Key &

key

)

Definition at line 692 of file qmap.h.

{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *cur = e;
    QMapData::Node *next = e;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
            cur = next;
        update[i] = cur;
    }

    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
        T t = concrete(next)->value;
        concrete(next)->key.~Key();
        concrete(next)->value.~T();
        d->node_delete(update, payload(), next);
        return t;
    }
    return T();
}

Q_INLINE_TEMPLATE bool contains

(

const Key &

key

)

const

Definition at line 553 of file qmap.h.

{
    return findNode(akey) != e;
}

Q_OUTOFLINE_TEMPLATE const Key key

(

const T &

value

)

const

Definition at line 844 of file qmap.h.

{
    return key(avalue, Key());
}

Q_OUTOFLINE_TEMPLATE const Key key	(	const T &	value,
		const Key &	defaultKey
	)		const

Definition at line 850 of file qmap.h.

{
    const_iterator i = begin();
    while (i != end()) {
        if (i.value() == avalue)
            return i.key();
        ++i;
    }

    return defaultKey;
}

Q_INLINE_TEMPLATE const T value

(

const Key &

key

)

const

Definition at line 499 of file qmap.h.

{
    QMapData::Node *node;
    if (d->size == 0 || (node = findNode(akey)) == e) {
        return T();
    } else {
        return concrete(node)->value;
    }
}

Q_INLINE_TEMPLATE const T value	(	const Key &	key,
		const T &	defaultValue
	)		const

Definition at line 510 of file qmap.h.

{
    QMapData::Node *node;
    if (d->size == 0 || (node = findNode(akey)) == e) {
        return adefaultValue;
    } else {
        return concrete(node)->value;
    }
}

Q_INLINE_TEMPLATE T & operator[]

(

const Key &

key

)

Definition at line 527 of file qmap.h.

{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *node = mutableFindNode(update, akey);
    if (node == e)
        node = node_create(d, update, akey, T());
    return concrete(node)->value;
}

Q_INLINE_TEMPLATE const T operator[]

(

const Key &

key

)

const

Definition at line 521 of file qmap.h.

{
    return value(akey);
}

Q_OUTOFLINE_TEMPLATE QList< Key > uniqueKeys

(

)

const

Definition at line 798 of file qmap.h.

{
    QList<Key> res;
    res.reserve(size()); // May be too much, but assume short lifetime
    const_iterator i = begin();
    if (i != end()) {
        for (;;) {
            const Key &aKey = i.key();
            res.append(aKey);
            do {
                if (++i == end())
                    goto break_out_of_outer_loop;
            } while (!(aKey < i.key()));   // loop while (key == i.key())
        }
    }
break_out_of_outer_loop:
    return res;
}

Q_OUTOFLINE_TEMPLATE QList< Key > keys

(

)

const

Definition at line 818 of file qmap.h.

{
    QList<Key> res;
    res.reserve(size());
    const_iterator i = begin();
    while (i != end()) {
        res.append(i.key());
        ++i;
    }
    return res;
}

Q_OUTOFLINE_TEMPLATE QList< Key > keys

(

const T &

value

)

const

Definition at line 831 of file qmap.h.

{
    QList<Key> res;
    const_iterator i = begin();
    while (i != end()) {
        if (i.value() == avalue)
            res.append(i.key());
        ++i;
    }
    return res;
}

Q_OUTOFLINE_TEMPLATE QList< T > values

(

)

const

Definition at line 863 of file qmap.h.

{
    QList<T> res;
    res.reserve(size());
    const_iterator i = begin();
    while (i != end()) {
        res.append(i.value());
        ++i;
    }
    return res;
}

Q_OUTOFLINE_TEMPLATE QList< T > values

(

const Key &

key

)

const

Definition at line 876 of file qmap.h.

{
    QList<T> res;
    QMapData::Node *node = findNode(akey);
    if (node != e) {
        do {
            res.append(concrete(node)->value);
            node = node->forward[0];
        } while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key));
    }
    return res;
}

Q_INLINE_TEMPLATE int count

(

const Key &

key

)

const

Definition at line 539 of file qmap.h.

{
    int cnt = 0;
    QMapData::Node *node = findNode(akey);
    if (node != e) {
        do {
            ++cnt;
            node = node->forward[0];
        } while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key));
    }
    return cnt;
}

iterator begin ( )

inline

Definition at line 372 of file qmap.h.

{ detach(); return iterator(e->forward[0]); }

const_iterator begin ( ) const

inline

Definition at line 373 of file qmap.h.

{ return const_iterator(e->forward[0]); }

const_iterator constBegin ( ) const

inline

Definition at line 374 of file qmap.h.

{ return const_iterator(e->forward[0]); }

iterator end ( )

inline

Definition at line 375 of file qmap.h.

                          {
        detach();
        return iterator(e);
    }

const_iterator end ( ) const

inline

Definition at line 379 of file qmap.h.

{ return const_iterator(e); }

const_iterator constEnd ( ) const

inline

Definition at line 380 of file qmap.h.

{ return const_iterator(e); }

Q_OUTOFLINE_TEMPLATE QMap< Key, T >::iterator erase

(

iterator

it

)

Definition at line 717 of file qmap.h.

{
    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *cur = e;
    QMapData::Node *next = e;

    if (it == iterator(e))
        return it;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, it.key()))
            cur = next;
        update[i] = cur;
    }

    while (next != e) {
        cur = next;
        next = cur->forward[0];
        if (cur == it) {
            concrete(cur)->key.~Key();
            concrete(cur)->value.~T();
            d->node_delete(update, payload(), cur);
            return iterator(next);
        }

        for (int i = 0; i <= d->topLevel; ++i) {
            if (update[i]->forward[i] != cur)
                break;
            update[i] = cur;
        }
    }
    return end();
}

int count ( ) const

inline

Definition at line 390 of file qmap.h.

{ return d->size; }

Q_INLINE_TEMPLATE QMap< Key, T >::iterator find

(

const Key &

key

)

Definition at line 618 of file qmap.h.

{
    detach();
    return iterator(findNode(akey));
}

Q_INLINE_TEMPLATE QMap< Key, T >::const_iterator find

(

const Key &

key

)

const

Definition at line 606 of file qmap.h.

{
    return const_iterator(findNode(akey));
}

Q_INLINE_TEMPLATE QMap< Key, T >::const_iterator constFind

(

const Key &

key

)

const

Definition at line 612 of file qmap.h.

{
    return const_iterator(findNode(akey));
}

Q_INLINE_TEMPLATE QMap< Key, T >::iterator lowerBound

(

const Key &

key

)

Definition at line 899 of file qmap.h.

{
    detach();
    return static_cast<QMapData::Node *>(const_cast<const QMap *>(this)->lowerBound(akey));
}

Q_INLINE_TEMPLATE QMap< Key, T >::const_iterator lowerBound

(

const Key &

key

)

const

Definition at line 891 of file qmap.h.

{
    QMapData::Node *update[QMapData::LastLevel + 1];
    mutableFindNode(update, akey);
    return const_iterator(update[0]->forward[0]);
}

Q_INLINE_TEMPLATE QMap< Key, T >::iterator upperBound

(

const Key &

key

)

Definition at line 918 of file qmap.h.

{
    detach();
    return static_cast<QMapData::Node *>(const_cast<const QMap *>(this)->upperBound(akey));
}

Q_INLINE_TEMPLATE QMap< Key, T >::const_iterator upperBound

(

const Key &

key

)

const

Definition at line 907 of file qmap.h.

{
    QMapData::Node *update[QMapData::LastLevel + 1];
    mutableFindNode(update, akey);
    QMapData::Node *node = update[0]->forward[0];
    while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key))
        node = node->forward[0];
    return const_iterator(node);
}

Q_INLINE_TEMPLATE QMap< Key, T >::iterator insert	(	const Key &	key,
		const T &	value
	)

Definition at line 559 of file qmap.h.

{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *node = mutableFindNode(update, akey);
    if (node == e) {
        node = node_create(d, update, akey, avalue);
    } else {
        concrete(node)->value = avalue;
    }
    return iterator(node);
}

Q_INLINE_TEMPLATE QMap< Key, T >::iterator insertMulti	(	const Key &	key,
		const T &	value
	)

Definition at line 595 of file qmap.h.

{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    mutableFindNode(update, akey);
    return iterator(node_create(d, update, akey, avalue));
}

Q_INLINE_TEMPLATE QMap< Key, T > & unite

(

const QMap< Key, T > &

other

)

Definition at line 625 of file qmap.h.

{
    QMap<Key, T> copy(other);
    const_iterator it = copy.constEnd();
    const const_iterator b = copy.constBegin();
    while (it != b) {
        --it;
        insertMulti(it.key(), it.value());
    }
    return *this;
}

bool empty ( ) const

inline

Definition at line 413 of file qmap.h.

{ return isEmpty(); }

Friends And Related Function Documentation

friend class iterator

friend

Definition at line 299 of file qmap.h.

friend class const_iterator

friend

Definition at line 369 of file qmap.h.

Member Data Documentation

QMapData* d

Definition at line 165 of file qmap.h.

QMapData::Node* e

Definition at line 166 of file qmap.h.

---

The documentation for this class was generated from the following files:

• phonon/audiodataoutput.h
• QtCore/qmap.h