You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tqt3/doc/html/qmemarray-h.html

167 lines
7.0 KiB

<!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&nbsp;Classes</font></a>
| <a href="mainclasses.html">
<font color="#004faf">Main&nbsp;Classes</font></a>
| <a href="annotated.html">
<font color="#004faf">Annotated</font></a>
| <a href="groups.html">
<font color="#004faf">Grouped&nbsp;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 requirements 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&lt;class type&gt;
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&lt;type&gt; &amp;a ) : TQGArray(a) {}
~TQMemArray() {}
TQMemArray&lt;type&gt; &amp;operator=(const TQMemArray&lt;type&gt; &amp;a)
{ return (TQMemArray&lt;type&gt;&amp;)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 &amp;d, int size = -1 )
{ return TQGArray::fill((char*)&amp;d,size,sizeof(type) ); }
void detach() { TQGArray::detach(); }
TQMemArray&lt;type&gt; copy() const
{ TQMemArray&lt;type&gt; tmp; return tmp.duplicate(*this); }
TQMemArray&lt;type&gt;&amp; assign( const TQMemArray&lt;type&gt;&amp; a )
{ return (TQMemArray&lt;type&gt;&amp;)TQGArray::assign(a); }
TQMemArray&lt;type&gt;&amp; assign( const type *a, uint n )
{ return (TQMemArray&lt;type&gt;&amp;)TQGArray::assign((char*)a,n*sizeof(type)); }
TQMemArray&lt;type&gt;&amp; duplicate( const TQMemArray&lt;type&gt;&amp; a )
{ return (TQMemArray&lt;type&gt;&amp;)TQGArray::duplicate(a); }
TQMemArray&lt;type&gt;&amp; duplicate( const type *a, uint n )
{ return (TQMemArray&lt;type&gt;&amp;)TQGArray::duplicate((char*)a,n*sizeof(type)); }
TQMemArray&lt;type&gt;&amp; setRawData( const type *a, uint n )
{ return (TQMemArray&lt;type&gt;&amp;)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 &amp;d, uint i=0 ) const
{ return TQGArray::find((char*)&amp;d,i,sizeof(type)); }
int contains( const type &amp;d ) const
{ return TQGArray::contains((char*)&amp;d,sizeof(type)); }
void sort() { TQGArray::sort(sizeof(type)); }
int bsearch( const type &amp;d ) const
{ return TQGArray::bsearch((const char*)&amp;d,sizeof(type)); }
// ### TQt 4.0: maybe provide uint overload as work-around for MSVC bug
type&amp; operator[]( int i ) const
{ return (type &amp;)(*(type *)TQGArray::at(i*sizeof(type))); }
type&amp; at( uint i ) const
{ return (type &amp;)(*(type *)TQGArray::at(i*sizeof(type))); }
operator const type*() const { return (const type *)TQGArray::data(); }
bool operator==( const TQMemArray&lt;type&gt; &amp;a ) const { return isEqual(a); }
bool operator!=( const TQMemArray&lt;type&gt; &amp;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 &copy; 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>