QIntDict Class Reference

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

#include <qintdict.h>

Inherits QPtrCollection.

List of all member functions.

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

Important Inherited Members

bool autoDelete () const
void setAutoDelete ( bool enable )

Protected Members

virtual QDataStream & read ( QDataStream & s, QPtrCollection::Item & item )
virtual QDataStream & write ( QDataStream & s, QPtrCollection::Item ) const

Detailed Description

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

QMap is an STL-compatible alternative to this class.

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

A dictionary is a collection of key-value pairs. The key is an long used for insertion, removal and lookup. The value is a pointer. Dictionaries provide very fast insertion and lookup.

Example:

    QIntDict<QLineEdit> fields;
    for ( int i = 0; i < 3; i++ )
        fields.insert( i, new QLineEdit( this ) );

    fields[0]->setText( "Homer" );
    fields[1]->setText( "Simpson" );
    fields[2]->setText( "45" );

    QIntDictIterator<char> it( fields ); // See QIntDictIterator
    for ( ; it.current(); ++it )
        cout << it.currentKey() << ": " << it.current()->text() << endl;
    
    for ( int i = 0; i < 3; i++ )
        cout << fields[i]->text() << " "; // Prints "Homer Simpson 45"
    cout << endl;

    fields.remove( 1 ); // Does not delete the line edit
    for ( int i = 0; i < 3; i++ )
        if ( fields[i] )
            cout << fields[i]->text() << " "; // Prints "Homer 45"

See QDict for full details, including the choice of dictionary size, and how deletions are handled.

Member Function Documentation

QIntDict::QIntDict ( int size = 17 )

Constructs a dictionary using an internal hash array of 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 lookup faster.

QIntDict::QIntDict ( const QIntDict<type> & dict )

Constructs a copy of dict.

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

QIntDict::~QIntDict ()

Removes all items from the dictionary and destroys it.

All iterators that access this dictionary will be reset.

bool QPtrCollection::autoDelete () const

Returns the setting of the auto-delete option. The default is FALSE.

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 QPtrCollection.

uint QIntDict::count () const `[virtual]`

Returns the number of items in the dictionary.

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.

void QIntDict::insert ( long key, const type * item )

Insert item item into the dictionary using key key.

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

Null items are not allowed.

bool QIntDict::isEmpty () const

Returns TRUE if the dictionary is empty; otherwise returns FALSE.

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 and 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.

QDataStream & QIntDict::read ( QDataStream & s, QPtrCollection::Item & item ) `[virtual protected]`

Reads a dictionary item from the stream s and returns a reference to the stream.

The default implementation sets item to 0.

bool QIntDict::remove ( long key )

Removes the item associated with key from the dictionary. Returns TRUE if successful; otherwise returns FALSE, e.g. 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's traversing order.

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

Example: table/bigtable/main.cpp.

void QIntDict::replace ( long key, const type * item )

If the dictionary has key key, this key's item is replaced with item. If the dictionary doesn't contain key key, item is inserted into the dictionary using key key.

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.

void QIntDict::resize ( uint newsize )

Changes the size of the hashtable to newsize. The contents of the dictionary are preserved, but all iterators on the dictionary become invalid.

void QPtrCollection::setAutoDelete ( bool enable )

Sets the collection to auto-delete its contents if enable is TRUE and to never delete them if enable is FALSE.

If auto-deleting is turned on, all the items in a collection are deleted when the collection itself is deleted. This is convenient if the collection has the only pointer to the items.

The default setting is FALSE, for safety. If you turn it on, be careful about copying the collection - you might find yourself with two collections deleting the same items.

Note that the auto-delete setting may also affect other functions in subclasses. For example, a subclass that has a remove() function will remove the item from its data structure, and if auto-delete is enabled, will also delete the item.

uint QIntDict::size () const

Returns the size of the internal hash array (as specified in the constructor).

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's traversing order.

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

QDataStream & QIntDict::write ( QDataStream & s, QPtrCollection::Item ) const `[virtual protected]`

Writes a dictionary item to the stream s and returns a reference to the stream.