|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the Qt3Support module of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #ifndef Q3INTCACHE_H |
|
43 #define Q3INTCACHE_H |
|
44 |
|
45 #include <Qt3Support/q3gcache.h> |
|
46 |
|
47 QT_BEGIN_HEADER |
|
48 |
|
49 QT_BEGIN_NAMESPACE |
|
50 |
|
51 QT_MODULE(Qt3SupportLight) |
|
52 |
|
53 template<class type> |
|
54 class Q3IntCache |
|
55 #ifdef qdoc |
|
56 : public Q3PtrCollection |
|
57 #else |
|
58 : public Q3GCache |
|
59 #endif |
|
60 { |
|
61 public: |
|
62 Q3IntCache( const Q3IntCache<type> &c ) : Q3GCache(c) {} |
|
63 Q3IntCache( int maxCost=100, int size=17 ) |
|
64 : Q3GCache( maxCost, size, IntKey, false, false ) {} |
|
65 ~Q3IntCache() { clear(); } |
|
66 Q3IntCache<type> &operator=( const Q3IntCache<type> &c ) |
|
67 { return (Q3IntCache<type>&)Q3GCache::operator=(c); } |
|
68 int maxCost() const { return Q3GCache::maxCost(); } |
|
69 int totalCost() const { return Q3GCache::totalCost(); } |
|
70 void setMaxCost( int m) { Q3GCache::setMaxCost(m); } |
|
71 uint count() const { return Q3GCache::count(); } |
|
72 uint size() const { return Q3GCache::size(); } |
|
73 bool isEmpty() const { return Q3GCache::count() == 0; } |
|
74 bool insert( long k, const type *d, int c=1, int p=0 ) |
|
75 { return Q3GCache::insert_other((const char*)k,(Item)d,c,p); } |
|
76 bool remove( long k ) |
|
77 { return Q3GCache::remove_other((const char*)k); } |
|
78 type *take( long k ) |
|
79 { return (type *)Q3GCache::take_other((const char*)k);} |
|
80 void clear() { Q3GCache::clear(); } |
|
81 type *find( long k, bool ref=true ) const |
|
82 { return (type *)Q3GCache::find_other( (const char*)k,ref);} |
|
83 type *operator[]( long k ) const |
|
84 { return (type *)Q3GCache::find_other( (const char*)k); } |
|
85 void statistics() const { Q3GCache::statistics(); } |
|
86 private: |
|
87 void deleteItem( Item d ); |
|
88 }; |
|
89 |
|
90 #if !defined(Q_BROKEN_TEMPLATE_SPECIALIZATION) |
|
91 template<> inline void Q3IntCache<void>::deleteItem( Q3PtrCollection::Item ) |
|
92 { |
|
93 } |
|
94 #endif |
|
95 |
|
96 template<class type> inline void Q3IntCache<type>::deleteItem( Q3PtrCollection::Item d ) |
|
97 { |
|
98 if ( del_item ) delete (type *)d; |
|
99 } |
|
100 |
|
101 template<class type> |
|
102 class Q3IntCacheIterator : public Q3GCacheIterator |
|
103 { |
|
104 public: |
|
105 Q3IntCacheIterator( const Q3IntCache<type> &c ) |
|
106 : Q3GCacheIterator( (Q3GCache &)c ) {} |
|
107 Q3IntCacheIterator( const Q3IntCacheIterator<type> &ci ) |
|
108 : Q3GCacheIterator((Q3GCacheIterator &)ci) {} |
|
109 Q3IntCacheIterator<type> &operator=( const Q3IntCacheIterator<type>&ci ) |
|
110 { return ( Q3IntCacheIterator<type>&)Q3GCacheIterator::operator=( ci );} |
|
111 uint count() const { return Q3GCacheIterator::count(); } |
|
112 bool isEmpty() const { return Q3GCacheIterator::count() == 0; } |
|
113 bool atFirst() const { return Q3GCacheIterator::atFirst(); } |
|
114 bool atLast() const { return Q3GCacheIterator::atLast(); } |
|
115 type *toFirst() { return (type *)Q3GCacheIterator::toFirst(); } |
|
116 type *toLast() { return (type *)Q3GCacheIterator::toLast(); } |
|
117 operator type *() const { return (type *)Q3GCacheIterator::get(); } |
|
118 type *current() const { return (type *)Q3GCacheIterator::get(); } |
|
119 long currentKey() const { return (long)Q3GCacheIterator::getKeyInt();} |
|
120 type *operator()() { return (type *)Q3GCacheIterator::operator()();} |
|
121 type *operator++() { return (type *)Q3GCacheIterator::operator++(); } |
|
122 type *operator+=(uint j) { return (type *)Q3GCacheIterator::operator+=(j);} |
|
123 type *operator--() { return (type *)Q3GCacheIterator::operator--(); } |
|
124 type *operator-=(uint j) { return (type *)Q3GCacheIterator::operator-=(j);} |
|
125 }; |
|
126 |
|
127 QT_END_NAMESPACE |
|
128 |
|
129 QT_END_HEADER |
|
130 |
|
131 #endif // Q3INTCACHE_H |