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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- /home/espenr/tmp/qt-3.3.8-espenr-2499/qt-x11-free-3.3.8/include/qmemarray.h:1 -->
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>qmemarray.h Include File</title>
<style type="text/css"><!--
fn { margin-left: 1cm; text-indent: -1cm; }
a:link { color: #004faf; text-decoration: none }
a:visited { color: #672967; text-decoration: none }
body { background: #ffffff; color: black; }
--></style>
</head>
<body>
<table border="0" cellpadding="0" cellspacing="0" width="100%">
<tr bgcolor="#E5E5E5">
<td valign=center>
<a href="index.html">
<font color="#004faf">Home</font></a>
| <a href="classes.html">
<font color="#004faf">All Classes</font></a>
| <a href="mainclasses.html">
<font color="#004faf">Main Classes</font></a>
| <a href="annotated.html">
<font color="#004faf">Annotated</font></a>
| <a href="groups.html">
<font color="#004faf">Grouped Classes</font></a>
| <a href="functions.html">
<font color="#004faf">Functions</font></a>
</td>
<td align="right" valign="center"><img src="logo32.png" align="right" width="64" height="32" border="0"></td></tr></table><h1 align=center>qmemarray.h</h1>
<p>This is the verbatim text of the qmemarray.h include file. It is provided only for illustration; the copyright remains with Trolltech.
<hr>
<pre>
/****************************************************************************
** $Id: qt/qmemarray.h 3.3.8 edited Jan 11 14:38 $
**
** Definition of TQMemArray template/macro class
**
** Created : 930906
**
** Copyright (C) 1992-2007 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 file LICENSE.GPL 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 TQMEMARRAY_H
#define TQMEMARRAY_H
#ifndef QT_H
#include "qgarray.h"
#endif // QT_H
template<class type>
class TQMemArray : public TQGArray
{
public:
typedef type* Iterator;
typedef const type* ConstIterator;
typedef type ValueType;
protected:
TQMemArray( int, int ) : TQGArray( 0, 0 ) {}
public:
TQMemArray() {}
TQMemArray( int size ) : TQGArray(size*sizeof(type)) {} // ### 4.0 Q_EXPLICIT
TQMemArray( const TQMemArray<type> &a ) : TQGArray(a) {}
~TQMemArray() {}
TQMemArray<type> &operator=(const TQMemArray<type> &a)
{ return (TQMemArray<type>&)TQGArray::assign(a); }
type *data() const { return (type *)TQGArray::data(); }
uint nrefs() const { return TQGArray::nrefs(); }
uint size() const { return TQGArray::size()/sizeof(type); }
uint count() const { return size(); }
bool isEmpty() const { return TQGArray::size() == 0; }
bool isNull() const { return TQGArray::data() == 0; }
bool resize( uint size ) { return TQGArray::resize(size*sizeof(type)); }
bool resize( uint size, Optimization optim ) { return TQGArray::resize(size*sizeof(type), optim); }
bool truncate( uint pos ) { return TQGArray::resize(pos*sizeof(type)); }
bool fill( const type &d, int size = -1 )
{ return TQGArray::fill((char*)&d,size,sizeof(type) ); }
void detach() { TQGArray::detach(); }
TQMemArray<type> copy() const
{ TQMemArray<type> tmp; return tmp.duplicate(*this); }
TQMemArray<type>& assign( const TQMemArray<type>& a )
{ return (TQMemArray<type>&)TQGArray::assign(a); }
TQMemArray<type>& assign( const type *a, uint n )
{ return (TQMemArray<type>&)TQGArray::assign((char*)a,n*sizeof(type)); }
TQMemArray<type>& duplicate( const TQMemArray<type>& a )
{ return (TQMemArray<type>&)TQGArray::duplicate(a); }
TQMemArray<type>& duplicate( const type *a, uint n )
{ return (TQMemArray<type>&)TQGArray::duplicate((char*)a,n*sizeof(type)); }
TQMemArray<type>& setRawData( const type *a, uint n )
{ return (TQMemArray<type>&)TQGArray::setRawData((char*)a,
n*sizeof(type)); }
void resetRawData( const type *a, uint n )
{ TQGArray::resetRawData((char*)a,n*sizeof(type)); }
int find( const type &d, uint i=0 ) const
{ return TQGArray::find((char*)&d,i,sizeof(type)); }
int contains( const type &d ) const
{ return TQGArray::contains((char*)&d,sizeof(type)); }
void sort() { TQGArray::sort(sizeof(type)); }
int bsearch( const type &d ) const
{ return TQGArray::bsearch((const char*)&d,sizeof(type)); }
// ### TQt 4.0: maybe provide uint overload as work-around for MSVC bug
type& operator[]( int i ) const
{ return (type &)(*(type *)TQGArray::at(i*sizeof(type))); }
type& at( uint i ) const
{ return (type &)(*(type *)TQGArray::at(i*sizeof(type))); }
operator const type*() const { return (const type *)TQGArray::data(); }
bool operator==( const TQMemArray<type> &a ) const { return isEqual(a); }
bool operator!=( const TQMemArray<type> &a ) const { return !isEqual(a); }
Iterator begin() { return data(); }
Iterator end() { return data() + size(); }
ConstIterator begin() const { return data(); }
ConstIterator end() const { return data() + size(); }
};
#ifndef QT_NO_COMPAT
#define TQArray TQMemArray
#endif
#define Q_DEFINED_QMEMARRAY
#include "qwinexport.h"
#endif // TQARRAY_H
</pre>
<!-- eof -->
<p><address><hr><div align=center>
<table width=100% cellspacing=0 border=0><tr>
<td>Copyright © 2007
<a href="troll.html">Trolltech</a><td align=center><a href="trademarks.html">Trademarks</a>
<td align=right><div align=right>TQt 3.3.8</div>
</table></div></address></body>
</html>
|
