QIntDict(3qt)

NAME
QIntDict - Template class that provides a dictionary based on

#include <qintdict.h>

Inherits QGDict.

  Public Members
QIntDict ( int size=17 )
QIntDict ( const QIntDict<type> & dict )
~QIntDict ()
QIntDict<type>& operator= ( const QIntDict<type> & dict )
virtual uint count () const
uint size () const
bool isEmpty () const
void insert ( long key, const type * item )
void replace ( long key, const type * item )
bool remove ( long key )
type* take ( long key )
type* find ( long key ) const
type* operator[] ( long key ) const
virtual void clear ()
void resize ( uint newsize )
void statistics () const

DESCRIPTION
The QIntDict class is a template class that provides a dictionary based on long keys.

QIntDict is implemented as a template class. Define a template instance QIntDict<X> to create a dictionary that operates on pointers to X, or X*.

A dictionary is a collection that associates an item with a key. The key is used for inserting and looking up an item. QIntDict has long keys.

The dictionary has very fast insertion and lookup.

Example:

    #include <qintdict.h>
    #include <stdio.h>
    void main()
    {
        QIntDict<char> dict;            // maps long ==> char*
        dict.insert( 33, "France" );
        dict.insert(  7, "Russia" );
        dict.insert( 49, "Norway" );
        printf( "%s\n", dict[49] );
        printf( "%s\n", dict[33] );
        printf( "%s\n", dict[7] );
        if ( !dict[39] )
            printf( "39 not defined\n" );
    }

Program output:

        Norway
        France
        Russia
        39 not defined

The dictionary in our example maps long keys to char* items. QIntDict implements the [] operator to lookup an item.

QIntDict is implemented by QGDict as a hash array with a fixed number of entries. Each array entry points to a singly linked list of buckets, in which the dictionary items are stored.

When an item is inserted with a key, the key is converted (hashed) to an integer index into the hash array using the mod operation. The item is inserted before the first bucket in the list of buckets.

Looking up an item is normally very fast. The key is again hashed to an array index. Then QIntDict scans the list of buckets and returns the item found or null if the item was not found. You cannot insert null pointers into a dictionary.

The size of the hash array is very important. In order to get good performance, you should use a suitably large prime number. Suitable means equal to or larger than the maximum expected number of dictionary items.

Items with equal keys are allowed. When inserting two items with the same key, only the last inserted item will be visible (last in, first out) until it is removed.

Example:

    #include <qintdict.h>
    #include <stdio.h>
    void main()
    {
        QIntDict<char> dict;            // maps long ==> char*
        dict.insert( 7, "Russia" );
        dict.insert( 7, "USSR" );
        printf( "%s\n", dict[7] );
        dict.remove( 7 );               // Gorbie was here
        printf( "%s\n", dict[7] );
    }

Program output:

        USSR
        Russia

The QIntDictIterator class can traverse the dictionary contents, but only in an arbitrary order. Multiple iterators may independently traverse the same dictionary.

Calling setAutoDelete(TRUE) for a dictionary tells it to delete items that are removed . The default is to not delete items when they are removed.

When inserting an item into a dictionary, only the pointer is copied, not the item itself. This is called a shallow copy. It is possible to make the dictionary copy all of the item's data (known as a deep copy) when an item is inserted. insert() calls the virtual function QCollection::newItem() for the item to be inserted. Inherit a dictionary and reimplement it if you want deep copies.

When removing a dictionary item, the virtual function QCollection::deleteItem() is called. QIntDict's default implementation is to delete the item if auto-deletion is enabled.

See also QIntDictIterator, QDict, QAsciiDict, QPtrDict and Collection Classes

MEMBER FUNCTION DOCUMENTATION

QIntDict::QIntDict ( const QIntDict<type> & dict )
Constructs a copy of dict.

Each item in dict are inserted into this dictionary. Only the pointers are copied (shallow copy).

QIntDict::QIntDict ( int size=17 )
Constructs a dictionary using an internal hash array with the size size.

Setting size to a suitably large prime number (equal to or greater than the expected number of entries) makes the hash distribution better and hence the loopup faster.

QIntDict::~QIntDict ()
Removes all items from the dictionary and destroys it.

All iterators that access this dictionary will be reset.

See also setAutoDelete().

void QIntDict::clear () [virtual]
Removes all items from the dictionary.

The removed items are deleted if auto-deletion is enabled.

All dictionary iterators that access this dictionary will be reset.

See also remove(), take() and setAutoDelete().

Reimplemented from QCollection.

uint QIntDict::count () const [virtual]
Returns the number of items in the dictionary.

See also isEmpty().

Reimplemented from QCollection.

type * QIntDict::find ( long key ) const
Returns the item associated with key, or null if the key does not exist in the dictionary.

This function uses an internal hashing algorithm to optimize lookup.

If there are two or more items with equal keys, then the last inserted of these will be found.

Equivalent to the [] operator.

See also operator[]().

void QIntDict::insert ( long key, const type * item )
Inserts the key with the item into the dictionary.

The key does not have to be a unique dictionary key. If multiple items are inserted with the same key, only the last item will be visible.

Null items are not allowed.

See also replace().

bool QIntDict::isEmpty () const
Returns TRUE if the dictionary is empty, i.e. count() == 0. Returns FALSE otherwise.

See also count().

QIntDict<type> & QIntDict::operator= ( const QIntDict<type> & dict )
Assigns dict to this dictionary and returns a reference to this dictionary.

This dictionary is first cleared, then each item in dict is inserted into this dictionary. Only the pointers are copied (shallow copy), unless newItem() has been reimplemented.

type * QIntDict::operator[] ( long key ) const
Returns the item associated with key, or null if the key does not exist in the dictionary.

This function uses an internal hashing algorithm to optimize lookup.

If there are two or more items with equal keys, then the last inserted of these will be found.

Equivalent to the find() function.

See also find().

bool QIntDict::remove ( long key )
Removes the item associated with key from the dictionary. Returns TRUE if successful, or FALSE if the key does not exist in the dictionary.

If there are two or more items with equal keys, then the last inserted of these will be removed.

The removed item is deleted if auto-deletion is enabled.

All dictionary iterators that refer to the removed item will be set to point to the next item in the dictionary traversing order.

See also take(), clear() and setAutoDelete().

void QIntDict::replace ( long key, const type * item )
Replaces an item which has a key equal to key with item.

If the item does not already exist, it will be inserted.

Null items are not allowed.

Equivalent to:

    QIntDict<char> dict;
        ...
    if ( dict.find(key) )
        dict.remove( key );
    dict.insert( key, item );

If there are two or more items with equal keys, then the last inserted of these will be replaced.

See also insert().

void QIntDict::resize ( uint newsize )
Changes the size of the hashtable the newsize. The contents of the dictionary are preserved, but all iterators on the dictionary become invalid.

uint QIntDict::size () const
Returns the size of the internal hash array (as specified in the constructor).

See also count().

void QIntDict::statistics () const
Debugging-only function that prints out the dictionary distribution using qDebug().

type * QIntDict::take ( long key )
Takes the item associated with key out of the dictionary without deleting it (even if auto-deletion is enabled).

If there are two or more items with equal keys, then the last inserted of these will be taken.

Returns a pointer to the item taken out, or null if the key does not exist in the dictionary.

All dictionary iterators that refer to the taken item will be set to point to the next item in the dictionary traversing order.

See also remove(), clear() and setAutoDelete().

SEE ALSO
http://doc.trolltech.com/qintdict.html http://www.trolltech.com/faq/tech.html

COPYRIGHT
Copyright 1992-2001 Trolltech AS, http://www.trolltech.com. See the license file included in the distribution for a complete license statement.

AUTHOR
Generated automatically from the source code.

BUGS
If you find a bug in Qt, please report it as described in http://doc.trolltech.com/bughowto.html. Good bug reports make our job much simpler. Thank you.

In case of content or formattting problems with this manual page, please report them to qt-bugs@trolltech.com. Please include the name of the manual page (qintdict.3qt) and the Qt version (2.3.1).