QHash< Key, T > Class Template Reference

#include <qcontainerfwd.h>

Class Description

template<class Key, class T>
class QHash< Key, T >

Definition at line 54 of file qcontainerfwd.h.

Inheritance diagram for QHash< Key, T >:

Classes
class	const_iterator
class	iterator

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

Public Member Functions
	QHash ()
	QHash (const QHash< Key, T > &other)
	~QHash ()
QHash< Key, T > &	operator= (const QHash< Key, T > &other)
void	swap (QHash< Key, T > &other)
bool	operator== (const QHash< Key, T > &other) const
bool	operator!= (const QHash< Key, T > &other) const
int	size () const
bool	isEmpty () const
int	capacity () const
void	reserve (int size)
void	squeeze ()
void	detach ()
bool	isDetached () const
void	setSharable (bool sharable)
bool	isSharedWith (const QHash< Key, T > &other) const
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	insert (const Key &key, const T &value)
iterator	insertMulti (const Key &key, const T &value)
QHash< Key, T > &	unite (const QHash< Key, T > &other)
bool	empty () const

Friends
class	iterator
class	const_iterator

Member Typedef Documentation

typedef iterator Iterator

Definition at line 473 of file qhash.h.

typedef const_iterator ConstIterator

Definition at line 474 of file qhash.h.

typedef T mapped_type

Definition at line 484 of file qhash.h.

typedef Key key_type

Definition at line 485 of file qhash.h.

typedef qptrdiff difference_type

Definition at line 486 of file qhash.h.

typedef int size_type

Definition at line 487 of file qhash.h.

Constructor & Destructor Documentation

QHash ( )

inline

Definition at line 281 of file qhash.h.

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

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

inline

Definition at line 282 of file qhash.h.

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

~QHash ( )

inline

Definition at line 283 of file qhash.h.

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

Member Function Documentation

Q_INLINE_TEMPLATE QHash< Key, T > & operator=

(

const QHash< Key, T > &

other

)

Definition at line 591 of file qhash.h.

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

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

inline

Definition at line 290 of file qhash.h.

{ qSwap(d, other.d); }

Q_OUTOFLINE_TEMPLATE bool operator==

(

const QHash< Key, T > &

other

)

const

Definition at line 898 of file qhash.h.

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

    const_iterator it = begin();

    while (it != end()) {
        const Key &akey = it.key();

        const_iterator it2 = other.find(akey);
        do {
            if (it2 == other.end() || !(it2.key() == akey))
                return false;
            if (!QTypeInfo<T>::isDummy && !(it.value() == it2.value()))
                return false;
            ++it;
            ++it2;
        } while (it != end() && it.key() == akey);
    }
    return true;
}

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

inline

Definition at line 293 of file qhash.h.

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

int size ( ) const

inline

Definition at line 295 of file qhash.h.

{ return d->size; }

bool isEmpty ( ) const

inline

Definition at line 297 of file qhash.h.

{ return d->size == 0; }

int capacity ( ) const

inline

Definition at line 299 of file qhash.h.

{ return d->numBuckets; }

Q_INLINE_TEMPLATE void reserve

(

int

size

)

Definition at line 846 of file qhash.h.

{
    detach();
    d->rehash(-qMax(asize, 1));
}

void squeeze ( )

inline

Definition at line 301 of file qhash.h.

{ reserve(1); }

void detach ( )

inline

Definition at line 303 of file qhash.h.

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

bool isDetached ( ) const

inline

Definition at line 304 of file qhash.h.

{ return d->ref == 1; }

void setSharable ( bool  sharable )

inline

Definition at line 305 of file qhash.h.

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

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

inline

Definition at line 306 of file qhash.h.

{ return d == other.d; }

Q_INLINE_TEMPLATE void clear

(

)

Definition at line 574 of file qhash.h.

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

Q_OUTOFLINE_TEMPLATE int remove

(

const Key &

key

)

Definition at line 784 of file qhash.h.

{
    if (isEmpty()) // prevents detaching shared null
        return 0;
    detach();

    int oldSize = d->size;
    Node **node = findNode(akey);
    if (*node != e) {
        bool deleteNext = true;
        do {
            Node *next = (*node)->next;
            deleteNext = (next != e && next->key == (*node)->key);
            deleteNode(*node);
            *node = next;
            --d->size;
        } while (deleteNext);
        d->hasShrunk();
    }
    return oldSize - d->size;
}

Q_OUTOFLINE_TEMPLATE T take

(

const Key &

key

)

Definition at line 807 of file qhash.h.

{
    if (isEmpty()) // prevents detaching shared null
        return T();
    detach();

    Node **node = findNode(akey);
    if (*node != e) {
        T t = (*node)->value;
        Node *next = (*node)->next;
        deleteNode(*node);
        *node = next;
        --d->size;
        d->hasShrunk();
        return t;
    }
    return T();
}

Q_INLINE_TEMPLATE bool contains

(

const Key &

key

)

const

Definition at line 872 of file qhash.h.

{
    return *findNode(akey) != e;
}

Q_OUTOFLINE_TEMPLATE const Key key

(

const T &

value

)

const

Definition at line 674 of file qhash.h.

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

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

Definition at line 680 of file qhash.h.

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

    return defaultValue;
}

Q_INLINE_TEMPLATE const T value

(

const Key &

key

)

const

Definition at line 606 of file qhash.h.

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

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

Definition at line 617 of file qhash.h.

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

Q_INLINE_TEMPLATE T & operator[]

(

const Key &

key

)

Definition at line 738 of file qhash.h.

{
    detach();

    uint h;
    Node **node = findNode(akey, &h);
    if (*node == e) {
        if (d->willGrow())
            node = findNode(akey, &h);
        return createNode(h, akey, T(), node)->value;
    }
    return (*node)->value;
}

Q_INLINE_TEMPLATE const T operator[]

(

const Key &

key

)

const

Definition at line 732 of file qhash.h.

{
    return value(akey);
}

Q_OUTOFLINE_TEMPLATE QList< Key > uniqueKeys

(

)

const

Definition at line 628 of file qhash.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());
        }
    }
break_out_of_outer_loop:
    return res;
}

Q_OUTOFLINE_TEMPLATE QList< Key > keys

(

)

const

Definition at line 648 of file qhash.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 661 of file qhash.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 693 of file qhash.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 706 of file qhash.h.

{
    QList<T> res;
    Node *node = *findNode(akey);
    if (node != e) {
        do {
            res.append(node->value);
        } while ((node = node->next) != e && node->key == akey);
    }
    return res;
}

Q_OUTOFLINE_TEMPLATE int count

(

const Key &

key

)

const

Definition at line 719 of file qhash.h.

{
    int cnt = 0;
    Node *node = *findNode(akey);
    if (node != e) {
        do {
            ++cnt;
        } while ((node = node->next) != e && node->key == akey);
    }
    return cnt;
}

iterator begin ( )

inline

Definition at line 464 of file qhash.h.

{ detach(); return iterator(d->firstNode()); }

const_iterator begin ( ) const

inline

Definition at line 465 of file qhash.h.

{ return const_iterator(d->firstNode()); }

const_iterator constBegin ( ) const

inline

Definition at line 466 of file qhash.h.

{ return const_iterator(d->firstNode()); }

iterator end ( )

inline

Definition at line 467 of file qhash.h.

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

const_iterator end ( ) const

inline

Definition at line 468 of file qhash.h.

{ return const_iterator(e); }

const_iterator constEnd ( ) const

inline

Definition at line 469 of file qhash.h.

{ return const_iterator(e); }

Q_OUTOFLINE_TEMPLATE QHash< Key, T >::iterator erase

(

iterator

it

)

Definition at line 827 of file qhash.h.

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

    iterator ret = it;
    ++ret;

    Node *node = it;
    Node **node_ptr = reinterpret_cast<Node **>(&d->buckets[node->h % d->numBuckets]);
    while (*node_ptr != node)
        node_ptr = &(*node_ptr)->next;
    *node_ptr = node->next;
    deleteNode(node);
    --d->size;
    return ret;
}

int count ( ) const

inline

Definition at line 475 of file qhash.h.

{ return d->size; }

Q_INLINE_TEMPLATE QHash< Key, T >::iterator find

(

const Key &

key

)

Definition at line 865 of file qhash.h.

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

Q_INLINE_TEMPLATE QHash< Key, T >::const_iterator find

(

const Key &

key

)

const

Definition at line 853 of file qhash.h.

{
    return const_iterator(*findNode(akey));
}

Q_INLINE_TEMPLATE QHash< Key, T >::const_iterator constFind

(

const Key &

key

)

const

Definition at line 859 of file qhash.h.

{
    return const_iterator(*findNode(akey));
}

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

Definition at line 753 of file qhash.h.

{
    detach();

    uint h;
    Node **node = findNode(akey, &h);
    if (*node == e) {
        if (d->willGrow())
            node = findNode(akey, &h);
        return iterator(createNode(h, akey, avalue, node));
    }

    if (!QTypeInfo<T>::isDummy)
        (*node)->value = avalue;
    return iterator(*node);
}

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

Definition at line 772 of file qhash.h.

{
    detach();
    d->willGrow();

    uint h;
    Node **nextNode = findNode(akey, &h);
    return iterator(createNode(h, akey, avalue, nextNode));
}

Q_INLINE_TEMPLATE QHash< Key, T > & unite

(

const QHash< Key, T > &

other

)

Definition at line 556 of file qhash.h.

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

bool empty ( ) const

inline

Definition at line 489 of file qhash.h.

{ return isEmpty(); }

Friends And Related Function Documentation

friend class iterator

friend

Definition at line 393 of file qhash.h.

friend class const_iterator

friend

Definition at line 461 of file qhash.h.

Member Data Documentation

QHashData* d

Definition at line 264 of file qhash.h.

QHashNode<Key, T>* e

Definition at line 265 of file qhash.h.

---

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

• QtCore/qcontainerfwd.h
• QtCore/qhash.h