Sophie

Sophie

distrib > Mandriva > 8.2 > i586 > media > contrib > by-pkgid > 112b0974ad288f6cd55bf971ee6026a9 > files > 1526

libqt3-devel-3.0.2-2mdk.i586.rpm

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- /tmp/qt-3.0-reggie-28534/qt-x11-free-3.0.2/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"><!--
h3.fn,span.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$
**
** Definition of QMemArray template/macro class
**
** Created : 930906
**
** 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 QMEMARRAY_H
#define QMEMARRAY_H

#ifndef QT_H
#include "qgarray.h"
#endif // QT_H


template&lt;class type&gt; class Q_EXPORT QMemArray : public QGArray
{
public:
    typedef type* Iterator;
    typedef const type* ConstIterator;
    typedef type ValueType;

protected:
    QMemArray( int, int ) : QGArray( 0, 0 ) {}

public:
    QMemArray() {}
    QMemArray( int size ) : QGArray(size*sizeof(type)) {}
    QMemArray( const QMemArray&lt;type&gt; &amp;a ) : QGArray(a) {}
   ~QMemArray() {}
    QMemArray&lt;type&gt; &amp;operator=(const QMemArray&lt;type&gt; &amp;a)
				{ return (QMemArray&lt;type&gt;&amp;)QGArray::assign(a); }
    type *data()    const	{ return (type *)QGArray::data(); }
    uint  nrefs()   const	{ return QGArray::nrefs(); }
    uint  size()    const	{ return QGArray::size()/sizeof(type); }
    uint  count()   const	{ return size(); }
    bool  isEmpty() const	{ return QGArray::size() == 0; }
    bool  isNull()  const	{ return QGArray::data() == 0; }
    bool  resize( uint size )	{ return QGArray::resize(size*sizeof(type)); }
    bool  truncate( uint pos )	{ return QGArray::resize(pos*sizeof(type)); }
    bool  fill( const type &amp;d, int size = -1 )
	{ return QGArray::fill((char*)&amp;d,size,sizeof(type) ); }
    void  detach()		{ QGArray::detach(); }
    QMemArray&lt;type&gt;   copy() const
	{ QMemArray&lt;type&gt; tmp; return tmp.duplicate(*this); }
    QMemArray&lt;type&gt;&amp; assign( const QMemArray&lt;type&gt;&amp; a )
	{ return (QMemArray&lt;type&gt;&amp;)QGArray::assign(a); }
    QMemArray&lt;type&gt;&amp; assign( const type *a, uint n )
	{ return (QMemArray&lt;type&gt;&amp;)QGArray::assign((char*)a,n*sizeof(type)); }
    QMemArray&lt;type&gt;&amp; duplicate( const QMemArray&lt;type&gt;&amp; a )
	{ return (QMemArray&lt;type&gt;&amp;)QGArray::duplicate(a); }
    QMemArray&lt;type&gt;&amp; duplicate( const type *a, uint n )
	{ return (QMemArray&lt;type&gt;&amp;)QGArray::duplicate((char*)a,n*sizeof(type)); }
    QMemArray&lt;type&gt;&amp; setRawData( const type *a, uint n )
	{ return (QMemArray&lt;type&gt;&amp;)QGArray::setRawData((char*)a,
						     n*sizeof(type)); }
    void resetRawData( const type *a, uint n )
	{ QGArray::resetRawData((char*)a,n*sizeof(type)); }
    int	 find( const type &amp;d, uint i=0 ) const
	{ return QGArray::find((char*)&amp;d,i,sizeof(type)); }
    int	 contains( const type &amp;d ) const
	{ return QGArray::contains((char*)&amp;d,sizeof(type)); }
    void sort() { QGArray::sort(sizeof(type)); }
    int  bsearch( const type &amp;d ) const
	{ return QGArray::bsearch((const char*)&amp;d,sizeof(type)); }
    type&amp; operator[]( int i ) const
	{ return (type &amp;)(*(type *)QGArray::at(i*sizeof(type))); }
    type&amp; at( uint i ) const
	{ return (type &amp;)(*(type *)QGArray::at(i*sizeof(type))); }
	 operator const type*() const { return (const type *)QGArray::data(); }
    bool operator==( const QMemArray&lt;type&gt; &amp;a ) const { return isEqual(a); }
    bool operator!=( const QMemArray&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(); }
};

#if defined(Q_TEMPLATEDLL)
// MOC_SKIP_BEGIN
template class Q_EXPORT QMemArray&lt;int&gt;;
template class Q_EXPORT QMemArray&lt;bool&gt;;
// MOC_SKIP_END
#endif

#ifndef QT_NO_COMPAT
#define QArray QMemArray
#endif

#endif // QARRAY_H
</pre>
<!-- eof -->
<p><address><hr><div align=center>
<table width=100% cellspacing=0 border=0><tr>
<td>Copyright &copy; 2001 
<a href="http://www.trolltech.com">Trolltech</a><td><a href="http://www.trolltech.com/trademarks.html">Trademarks</a>
<td align=right><div align=right>Qt version 3.0.2</div>
</table></div></address></body>
</html>