| 1 | /**************************************************************************** | 
|---|
| 2 | ** $Id: qintdict.h 2 2005-11-16 15:49:26Z dmik $ | 
|---|
| 3 | ** | 
|---|
| 4 | ** Definition of QIntDict template class | 
|---|
| 5 | ** | 
|---|
| 6 | ** Created : 940624 | 
|---|
| 7 | ** | 
|---|
| 8 | ** Copyright (C) 1992-2000 Trolltech AS.  All rights reserved. | 
|---|
| 9 | ** | 
|---|
| 10 | ** This file is part of the tools module of the Qt GUI Toolkit. | 
|---|
| 11 | ** | 
|---|
| 12 | ** This file may be distributed under the terms of the Q Public License | 
|---|
| 13 | ** as defined by Trolltech AS of Norway and appearing in the file | 
|---|
| 14 | ** LICENSE.QPL included in the packaging of this file. | 
|---|
| 15 | ** | 
|---|
| 16 | ** This file may be distributed and/or modified under the terms of the | 
|---|
| 17 | ** GNU General Public License version 2 as published by the Free Software | 
|---|
| 18 | ** Foundation and appearing in the file LICENSE.GPL included in the | 
|---|
| 19 | ** packaging of this file. | 
|---|
| 20 | ** | 
|---|
| 21 | ** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition | 
|---|
| 22 | ** licenses may use this file in accordance with the Qt Commercial License | 
|---|
| 23 | ** Agreement provided with the Software. | 
|---|
| 24 | ** | 
|---|
| 25 | ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE | 
|---|
| 26 | ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. | 
|---|
| 27 | ** | 
|---|
| 28 | ** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for | 
|---|
| 29 | **   information about Qt Commercial License Agreements. | 
|---|
| 30 | ** See http://www.trolltech.com/qpl/ for QPL licensing information. | 
|---|
| 31 | ** See http://www.trolltech.com/gpl/ for GPL licensing information. | 
|---|
| 32 | ** | 
|---|
| 33 | ** Contact info@trolltech.com if any conditions of this licensing are | 
|---|
| 34 | ** not clear to you. | 
|---|
| 35 | ** | 
|---|
| 36 | **********************************************************************/ | 
|---|
| 37 |  | 
|---|
| 38 | #ifndef QINTDICT_H | 
|---|
| 39 | #define QINTDICT_H | 
|---|
| 40 |  | 
|---|
| 41 | #ifndef QT_H | 
|---|
| 42 | #include "qgdict.h" | 
|---|
| 43 | #endif // QT_H | 
|---|
| 44 |  | 
|---|
| 45 | template<class type> | 
|---|
| 46 | class QIntDict | 
|---|
| 47 | #ifdef Q_QDOC | 
|---|
| 48 | : public QPtrCollection | 
|---|
| 49 | #else | 
|---|
| 50 | : public QGDict | 
|---|
| 51 | #endif | 
|---|
| 52 | { | 
|---|
| 53 | public: | 
|---|
| 54 | QIntDict(int size=17) : QGDict(size,IntKey,0,0) {} | 
|---|
| 55 | QIntDict( const QIntDict<type> &d ) : QGDict(d) {} | 
|---|
| 56 | ~QIntDict()                          { clear(); } | 
|---|
| 57 | QIntDict<type> &operator=(const QIntDict<type> &d) | 
|---|
| 58 | { return (QIntDict<type>&)QGDict::operator=(d); } | 
|---|
| 59 | uint  count()   const               { return QGDict::count(); } | 
|---|
| 60 | uint  size()    const               { return QGDict::size(); } | 
|---|
| 61 | bool  isEmpty() const               { return QGDict::count() == 0; } | 
|---|
| 62 | void  insert( long k, const type *d ) | 
|---|
| 63 | { QGDict::look_int(k,(Item)d,1); } | 
|---|
| 64 | void  replace( long k, const type *d ) | 
|---|
| 65 | { QGDict::look_int(k,(Item)d,2); } | 
|---|
| 66 | bool  remove( long k )              { return QGDict::remove_int(k); } | 
|---|
| 67 | type *take( long k )                { return (type*)QGDict::take_int(k); } | 
|---|
| 68 | type *find( long k ) const | 
|---|
| 69 | { return (type *)((QGDict*)this)->QGDict::look_int(k,0,0); } | 
|---|
| 70 | type *operator[]( long k ) const | 
|---|
| 71 | { return (type *)((QGDict*)this)->QGDict::look_int(k,0,0); } | 
|---|
| 72 | void  clear()                       { QGDict::clear(); } | 
|---|
| 73 | void  resize( uint n )              { QGDict::resize(n); } | 
|---|
| 74 | void  statistics() const            { QGDict::statistics(); } | 
|---|
| 75 |  | 
|---|
| 76 | #ifdef Q_QDOC | 
|---|
| 77 | protected: | 
|---|
| 78 | virtual QDataStream& read( QDataStream &, QPtrCollection::Item & ); | 
|---|
| 79 | virtual QDataStream& write( QDataStream &, QPtrCollection::Item ) const; | 
|---|
| 80 | #endif | 
|---|
| 81 |  | 
|---|
| 82 | private: | 
|---|
| 83 | void  deleteItem( Item d ); | 
|---|
| 84 | }; | 
|---|
| 85 |  | 
|---|
| 86 | #if !defined(Q_BROKEN_TEMPLATE_SPECIALIZATION) | 
|---|
| 87 | template<> inline void QIntDict<void>::deleteItem( QPtrCollection::Item ) | 
|---|
| 88 | { | 
|---|
| 89 | } | 
|---|
| 90 | #endif | 
|---|
| 91 |  | 
|---|
| 92 | template<class type> inline void QIntDict<type>::deleteItem( QPtrCollection::Item d ) | 
|---|
| 93 | { | 
|---|
| 94 | if ( del_item ) delete (type*)d; | 
|---|
| 95 | } | 
|---|
| 96 |  | 
|---|
| 97 | template<class type> | 
|---|
| 98 | class QIntDictIterator : public QGDictIterator | 
|---|
| 99 | { | 
|---|
| 100 | public: | 
|---|
| 101 | QIntDictIterator(const QIntDict<type> &d) :QGDictIterator((QGDict &)d) {} | 
|---|
| 102 | ~QIntDictIterator()        {} | 
|---|
| 103 | uint  count()   const     { return dict->count(); } | 
|---|
| 104 | bool  isEmpty() const     { return dict->count() == 0; } | 
|---|
| 105 | type *toFirst()           { return (type *)QGDictIterator::toFirst(); } | 
|---|
| 106 | operator type *()  const  { return (type *)QGDictIterator::get(); } | 
|---|
| 107 | type *current()    const  { return (type *)QGDictIterator::get(); } | 
|---|
| 108 | long  currentKey() const  { return QGDictIterator::getKeyInt(); } | 
|---|
| 109 | type *operator()()        { return (type *)QGDictIterator::operator()(); } | 
|---|
| 110 | type *operator++()        { return (type *)QGDictIterator::operator++(); } | 
|---|
| 111 | type *operator+=(uint j)  { return (type *)QGDictIterator::operator+=(j);} | 
|---|
| 112 | }; | 
|---|
| 113 |  | 
|---|
| 114 | #define Q_DEFINED_QINTDICT | 
|---|
| 115 | #include "qwinexport.h" | 
|---|
| 116 | #endif // QINTDICT_H | 
|---|