|
1 /**************************************************************************** |
|
2 ** |
|
3 ** |
|
4 ** Definition of QVector template/macro class |
|
5 ** |
|
6 ** Created : 930907 |
|
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 QVECTOR_H |
|
39 #define QVECTOR_H |
|
40 |
|
41 #ifndef QT_H |
|
42 #include "qgvector.h" |
|
43 #endif // QT_H |
|
44 |
|
45 |
|
46 template<class type> class QVector : public QGVector |
|
47 { |
|
48 public: |
|
49 QVector() {} |
|
50 QVector( uint size ) : QGVector(size) {} |
|
51 QVector( const QVector<type> &v ) : QGVector(v) {} |
|
52 ~QVector() { clear(); } |
|
53 QVector<type> &operator=(const QVector<type> &v) |
|
54 { return (QVector<type>&)QGVector::operator=(v); } |
|
55 type **data() const { return (type **)QGVector::data(); } |
|
56 uint size() const { return QGVector::size(); } |
|
57 uint count() const { return QGVector::count(); } |
|
58 bool isEmpty() const { return QGVector::count() == 0; } |
|
59 bool isNull() const { return QGVector::size() == 0; } |
|
60 bool resize( uint size ) { return QGVector::resize(size); } |
|
61 bool insert( uint i, const type *d){ return QGVector::insert(i,(Item)d); } |
|
62 bool remove( uint i ) { return QGVector::remove(i); } |
|
63 type *take( uint i ) { return (type *)QGVector::take(i); } |
|
64 void clear() { QGVector::clear(); } |
|
65 bool fill( const type *d, int size=-1 ) |
|
66 { return QGVector::fill((Item)d,size);} |
|
67 void sort() { QGVector::sort(); } |
|
68 int bsearch( const type *d ) const{ return QGVector::bsearch((Item)d); } |
|
69 int findRef( const type *d, uint i=0 ) const |
|
70 { return QGVector::findRef((Item)d,i);} |
|
71 int find( const type *d, uint i= 0 ) const |
|
72 { return QGVector::find((Item)d,i); } |
|
73 uint containsRef( const type *d ) const |
|
74 { return QGVector::containsRef((Item)d); } |
|
75 uint contains( const type *d ) const |
|
76 { return QGVector::contains((Item)d); } |
|
77 type *operator[]( int i ) const { return (type *)QGVector::at(i); } |
|
78 type *at( uint i ) const { return (type *)QGVector::at(i); } |
|
79 void toList( QGList *list ) const { QGVector::toList(list); } |
|
80 private: |
|
81 void deleteItem( Item d ) { if ( del_item ) delete (type *)d; } |
|
82 }; |
|
83 |
|
84 |
|
85 #endif // QVECTOR_H |