1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/****************************************************************************
**
** Definition of TQDict template class
**
** Created : 920821
**
** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the tools module of the TQt GUI Toolkit.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free TQt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing retquirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at sales@trolltech.com.
**
** This file may be used under the terms of the Q Public License as
** defined by Trolltech ASA and appearing in the file LICENSE.TQPL
** included in the packaging of this file. Licensees holding valid TQt
** Commercial licenses may use this file in accordance with the TQt
** Commercial License Agreement provided with the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#ifndef TQDICT_H
#define TQDICT_H
#ifndef QT_H
#include "qgdict.h"
#endif // QT_H
template<class type>
class TQDict
#ifdef Q_QDOC
: public TQPtrCollection
#else
: public TQGDict
#endif
{
public:
TQDict( int size = 17, bool caseSensitive = TRUE )
: TQGDict( size, StringKey, caseSensitive, FALSE ) { }
TQDict( const TQDict<type> &d ) : TQGDict( d ) { }
~TQDict() { clear(); }
TQDict<type> &operator=(const TQDict<type> &d)
{ return (TQDict<type>&)TQGDict::operator=(d); }
uint count() const { return TQGDict::count(); }
uint size() const { return TQGDict::size(); }
bool isEmpty() const { return TQGDict::count() == 0; }
void insert( const TQString &k, const type *d )
{ TQGDict::look_string(k,(Item)d,1); }
void replace( const TQString &k, const type *d )
{ TQGDict::look_string(k,(Item)d,2); }
bool remove( const TQString &k ) { return TQGDict::remove_string(k); }
type *take( const TQString &k ) { return (type *)TQGDict::take_string(k); }
type *find( const TQString &k ) const
{ return (type *)((TQGDict*)this)->TQGDict::look_string(k,0,0); }
type *operator[]( const TQString &k ) const
{ return (type *)((TQGDict*)this)->TQGDict::look_string(k,0,0); }
void clear() { TQGDict::clear(); }
void resize( uint n ) { TQGDict::resize(n); }
void statistics() const { TQGDict::statistics(); }
#ifdef Q_QDOC
protected:
virtual TQDataStream& read( TQDataStream &, TQPtrCollection::Item & );
virtual TQDataStream& write( TQDataStream &, TQPtrCollection::Item ) const;
#endif
private:
void deleteItem( Item d );
};
#if !defined(Q_BROKEN_TEMPLATE_SPECIALIZATION)
template<> inline void TQDict<void>::deleteItem( Item )
{
}
#endif
template<class type> inline void TQDict<type>::deleteItem( TQPtrCollection::Item d )
{
if ( del_item ) delete (type *)d;
}
template<class type>
class TQDictIterator : public TQGDictIterator
{
public:
TQDictIterator(const TQDict<type> &d) : TQGDictIterator((TQGDict &)d) { }
~TQDictIterator() {}
uint count() const { return dict->count(); }
bool isEmpty() const { return dict->count() == 0; }
type *toFirst() { return (type *)TQGDictIterator::toFirst(); }
operator type *() const { return (type *)TQGDictIterator::get(); }
type *operator*() { return (type *)TQGDictIterator::get(); }
type *current() const { return (type *)TQGDictIterator::get(); }
TQString currentKey() const{ return TQGDictIterator::getKeyString(); }
type *operator()() { return (type *)TQGDictIterator::operator()(); }
type *operator++() { return (type *)TQGDictIterator::operator++(); }
type *operator+=(uint j) { return (type *)TQGDictIterator::operator+=(j); }
};
#define Q_DEFINED_QDICT
#include "qwinexport.h"
#endif // TQDICT_H
|
