Home | All Classes | Main Classes | Annotated | Grouped Classes | Functions |

# qmemarray.h

This is the verbatim text of the qmemarray.h include file. It is provided only for illustration; the copyright remains with Trolltech.

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

    #if defined(Q_TEMPLATEDLL)
    // MOC_SKIP_BEGIN
    template class Q_EXPORT QMemArray<int>;
    template class Q_EXPORT QMemArray<bool>;
    // MOC_SKIP_END
    #endif

    #ifndef QT_NO_COMPAT
    #define QArray QMemArray
    #endif

    #endif // QARRAY_H