blob: 36f0be7f76a499250844df525d32c6f5516bb296 (
plain)
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
|
/****************************************************************************
**
**
** Definition of QVector template/macro class
**
** Created : 930907
**
** Copyright (C) 1992-2000 Trolltech AS. All rights reserved.
**
** This file is part of the tools module of the Qt GUI Toolkit.
**
** This file may be distributed under the terms of the Q Public License
** as defined by Trolltech AS of Norway and appearing in the file
** LICENSE.QPL included in the packaging of this file.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition
** licenses may use this file in accordance with the Qt Commercial License
** Agreement provided with the Software.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for
** information about Qt Commercial License Agreements.
** See http://www.trolltech.com/qpl/ for QPL licensing information.
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#ifndef QVECTOR_H
#define QVECTOR_H
#ifndef QT_H
#include "qgvector.h"
#endif // QT_H
template<class type> class QVector : public QGVector
{
public:
QVector() {}
QVector( uint size ) : QGVector(size) {}
QVector( const QVector<type> &v ) : QGVector(v) {}
~QVector() { clear(); }
QVector<type> &operator=(const QVector<type> &v)
{ return (QVector<type>&)QGVector::operator=(v); }
type **data() const { return (type **)QGVector::data(); }
uint size() const { return QGVector::size(); }
uint count() const { return QGVector::count(); }
bool isEmpty() const { return QGVector::count() == 0; }
bool isNull() const { return QGVector::size() == 0; }
bool resize( uint size ) { return QGVector::resize(size); }
bool insert( uint i, const type *d){ return QGVector::insert(i,(Item)d); }
bool remove( uint i ) { return QGVector::remove(i); }
type *take( uint i ) { return (type *)QGVector::take(i); }
void clear() { QGVector::clear(); }
bool fill( const type *d, int size=-1 )
{ return QGVector::fill((Item)d,size);}
void sort() { QGVector::sort(); }
int bsearch( const type *d ) const{ return QGVector::bsearch((Item)d); }
int findRef( const type *d, uint i=0 ) const
{ return QGVector::findRef((Item)d,i);}
int find( const type *d, uint i= 0 ) const
{ return QGVector::find((Item)d,i); }
uint containsRef( const type *d ) const
{ return QGVector::containsRef((Item)d); }
uint contains( const type *d ) const
{ return QGVector::contains((Item)d); }
type *operator[]( int i ) const { return (type *)QGVector::at(i); }
type *at( uint i ) const { return (type *)QGVector::at(i); }
void toList( QGList *list ) const { QGVector::toList(list); }
private:
void deleteItem( Item d ) { if ( del_item ) delete (type *)d; }
};
#endif // QVECTOR_H
|
