# qqueue.h

This is the verbatim text of the qqueue.h include file. It is is provided only for illustration; the copyright remains with Troll Tech.

    /****************************************************************************
    ** $Id: qqueue.h,v 2.3.2.2 1998/08/27 08:14:01 hanord Exp $
    **
    ** Definition of QQueue template/macro class
    **
    ** Created : 920917
    **
    ** Copyright (C) 1992-1999 Troll Tech AS.  All rights reserved.
    **
    ** This file is part of Qt Free Edition, version 1.45.
    **
    ** See the file LICENSE included in the distribution for the usage
    ** and distribution terms, or http://www.troll.no/free-license.html.
    **
    ** IMPORTANT NOTE: You may NOT copy this file or any part of it into
    ** your own programs or libraries.
    **
    ** Please see http://www.troll.no/pricing.html for information about
    ** Qt Professional Edition, which is this same library but with a
    ** license which allows creation of commercial/proprietary software.
    **
    *****************************************************************************/

    #ifndef QQUEUE_H
    #define QQUEUE_H

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

    #if defined(USE_MACROCLASS)

    #include "qgeneric.h"

    #if !defined(name2)
    #define name2(a,b)    name2_xx(a,b)
    #define name2_xx(a,b) a##b
    #endif

    #if defined(DEFAULT_MACROCLASS)
    #define QQueuedeclare QQueueMdeclare
    #define QQueue QQueueM
    #endif
    #define QQueueM(type) name2(QQueueM_,type)

    #define QQueueMdeclare(type)                                                  \
    class Q_EXPORTM QQueueM(type) : private QGList                                \
    {                                                                             \
    public:                                                                       \
        QQueueM(type)()                     {}                                    \
        QQueueM(type)( const QQueueM(type) &q ) : QGList(q) {}                    \
       ~QQueueM(type)()                     { clear(); }                          \
        QQueueM(type)& operator=(const QQueueM(type) &q)                          \
                            { return (QQueueM(type)&)QGList::operator=(q); }      \
        bool  autoDelete() const            { return QCollection::autoDelete(); } \
        void  setAutoDelete( bool del )     { QCollection::setAutoDelete(del); }  \
        uint  count()   const               { return QGList::count(); }           \
        bool  isEmpty() const               { return QGList::count() == 0; }      \
        void  enqueue( const type *d )      { QGList::append(GCI(d)); }           \
        type *dequeue()                     { return (type *)QGList::takeFirst();}\
        bool  remove()                      { return QGList::removeFirst(); }     \
        void  clear()                       { QGList::clear(); }                  \
        type *head()    const               { return (type *)QGList::cfirst(); }  \
              operator type *() const       { return (type *)QGList::cfirst(); }  \
        type *current() const               { return (type *)QGList::cfirst(); }  \
    private:                                                                      \
        void  deleteItem( GCI d ) { if ( del_item ) delete (type *)d; }           \
    }

    #endif // USE_MACROCLASS

    #if defined(USE_TEMPLATECLASS)

    #if defined(DEFAULT_TEMPLATECLASS)
    #undef  QQueue
    #define QQueue QQueueT
    #endif

    template<class type> class Q_EXPORT QQueueT : private QGList
    {
    public:
        QQueueT()                           {}
        QQueueT( const QQueueT<type> &q ) : QGList(q) {}
       ~QQueueT()                           { clear(); }
        QQueueT<type>& operator=(const QQueueT<type> &q)
                            { return (QQueueT<type>&)QGList::operator=(q); }
        bool  autoDelete() const            { return QCollection::autoDelete(); }
        void  setAutoDelete( bool del )     { QCollection::setAutoDelete(del); }
        uint  count()   const               { return QGList::count(); }
        bool  isEmpty() const               { return QGList::count() == 0; }
        void  enqueue( const type *d )      { QGList::append(GCI(d)); }
        type *dequeue()                     { return (type *)QGList::takeFirst();}
        bool  remove()                      { return QGList::removeFirst(); }
        void  clear()                       { QGList::clear(); }
        type *head()    const               { return (type *)QGList::cfirst(); }
              operator type *() const       { return (type *)QGList::cfirst(); }
        type *current() const               { return (type *)QGList::cfirst(); }
    private:
        void  deleteItem( GCI d ) { if ( del_item ) delete (type *)d; }
    };

    #endif // USE_TEMPLATECLASS

    #endif // QQUEUE_H