Blame qtools/qvaluelist.h

Packit 1c1d7e
/****************************************************************************
Packit 1c1d7e
** 
Packit 1c1d7e
**
Packit 1c1d7e
** Definition of QValueList class
Packit 1c1d7e
**
Packit 1c1d7e
** Created : 990406
Packit 1c1d7e
**
Packit 1c1d7e
** Copyright (C) 1992-2000 Trolltech AS.  All rights reserved.
Packit 1c1d7e
**
Packit 1c1d7e
** This file is part of the tools module of the Qt GUI Toolkit.
Packit 1c1d7e
**
Packit 1c1d7e
** This file may be distributed under the terms of the Q Public License
Packit 1c1d7e
** as defined by Trolltech AS of Norway and appearing in the file
Packit 1c1d7e
** LICENSE.QPL included in the packaging of this file.
Packit 1c1d7e
**
Packit 1c1d7e
** This file may be distributed and/or modified under the terms of the
Packit 1c1d7e
** GNU General Public License version 2 as published by the Free Software
Packit 1c1d7e
** Foundation and appearing in the file LICENSE.GPL included in the
Packit 1c1d7e
** packaging of this file.
Packit 1c1d7e
**
Packit 1c1d7e
** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition
Packit 1c1d7e
** licenses may use this file in accordance with the Qt Commercial License
Packit 1c1d7e
** Agreement provided with the Software.
Packit 1c1d7e
**
Packit 1c1d7e
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
Packit 1c1d7e
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
Packit 1c1d7e
**
Packit 1c1d7e
** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for
Packit 1c1d7e
**   information about Qt Commercial License Agreements.
Packit 1c1d7e
** See http://www.trolltech.com/qpl/ for QPL licensing information.
Packit 1c1d7e
** See http://www.trolltech.com/gpl/ for GPL licensing information.
Packit 1c1d7e
**
Packit 1c1d7e
** Contact info@trolltech.com if any conditions of this licensing are
Packit 1c1d7e
** not clear to you.
Packit 1c1d7e
**
Packit 1c1d7e
**********************************************************************/
Packit 1c1d7e
Packit 1c1d7e
#ifndef QVALUELIST_H
Packit 1c1d7e
#define QVALUELIST_H
Packit 1c1d7e
Packit 1c1d7e
#ifndef QT_H
Packit 1c1d7e
#include "qshared.h"
Packit 1c1d7e
#include "qdatastream.h"
Packit 1c1d7e
#endif // QT_H
Packit 1c1d7e
Packit 1c1d7e
#if defined(_CC_MSVC_)
Packit 1c1d7e
#pragma warning(disable:4284) // "return type for operator -> is not a UDT"
Packit 1c1d7e
#endif
Packit 1c1d7e
Packit 1c1d7e
template <class T>
Packit 1c1d7e
class Q_EXPORT QValueListNode
Packit 1c1d7e
{
Packit 1c1d7e
public:
Packit 1c1d7e
    QValueListNode( const T& t ) : data( t ) { }
Packit 1c1d7e
    QValueListNode() { }
Packit 1c1d7e
#if defined(Q_TEMPLATEDLL)
Packit 1c1d7e
    // Workaround MS bug in memory de/allocation in DLL vs. EXE 
Packit 1c1d7e
    virtual ~QValueListNode() { }
Packit 1c1d7e
#endif
Packit 1c1d7e
Packit 1c1d7e
    QValueListNode<T>* next;
Packit 1c1d7e
    QValueListNode<T>* prev;
Packit 1c1d7e
    T data;
Packit 1c1d7e
};
Packit 1c1d7e
Packit 1c1d7e
template<class T>
Packit 1c1d7e
class Q_EXPORT QValueListIterator
Packit 1c1d7e
{
Packit 1c1d7e
 public:
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Typedefs
Packit 1c1d7e
     */
Packit 1c1d7e
    typedef QValueListNode<T>* NodePtr;
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Variables
Packit 1c1d7e
     */
Packit 1c1d7e
    NodePtr node;
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Functions
Packit 1c1d7e
     */
Packit 1c1d7e
    QValueListIterator() : node( 0 ) {}
Packit 1c1d7e
    QValueListIterator( NodePtr p ) : node( p ) {}
Packit 1c1d7e
    QValueListIterator( const QValueListIterator<T>& it ) : node( it.node ) {}
Packit 1c1d7e
Packit 1c1d7e
    bool operator==( const QValueListIterator<T>& it ) const { return node == it.node; }
Packit 1c1d7e
    bool operator!=( const QValueListIterator<T>& it ) const { return node != it.node; }
Packit 1c1d7e
    const T& operator*() const { return node->data; }
Packit 1c1d7e
    T& operator*() { return node->data; }
Packit 1c1d7e
Packit 1c1d7e
    // Compilers are too dumb to understand this for QValueList<int>
Packit 1c1d7e
    //T* operator->() const { return &(node->data); }
Packit 1c1d7e
Packit 1c1d7e
    QValueListIterator<T>& operator++() {
Packit 1c1d7e
	node = node->next;
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueListIterator<T> operator++(int) {
Packit 1c1d7e
	QValueListIterator<T> tmp = *this;
Packit 1c1d7e
	node = node->next;
Packit 1c1d7e
	return tmp;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueListIterator<T>& operator--() {
Packit 1c1d7e
	node = node->prev;
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueListIterator<T> operator--(int) {
Packit 1c1d7e
	QValueListIterator<T> tmp = *this;
Packit 1c1d7e
	node = node->prev;
Packit 1c1d7e
	return tmp;
Packit 1c1d7e
    }
Packit 1c1d7e
};
Packit 1c1d7e
Packit 1c1d7e
template<class T>
Packit 1c1d7e
class Q_EXPORT QValueListConstIterator
Packit 1c1d7e
{
Packit 1c1d7e
 public:
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Typedefs
Packit 1c1d7e
     */
Packit 1c1d7e
    typedef QValueListNode<T>* NodePtr;
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Variables
Packit 1c1d7e
     */
Packit 1c1d7e
    NodePtr node;
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Functions
Packit 1c1d7e
     */
Packit 1c1d7e
    QValueListConstIterator() : node( 0 ) {}
Packit 1c1d7e
    QValueListConstIterator( NodePtr p ) : node( p ) {}
Packit 1c1d7e
    QValueListConstIterator( const QValueListConstIterator<T>& it ) : node( it.node ) {}
Packit 1c1d7e
    QValueListConstIterator( const QValueListIterator<T>& it ) : node( it.node ) {}
Packit 1c1d7e
Packit 1c1d7e
    bool operator==( const QValueListConstIterator<T>& it ) const { return node == it.node; }
Packit 1c1d7e
    bool operator!=( const QValueListConstIterator<T>& it ) const { return node != it.node; }
Packit 1c1d7e
    const T& operator*() const { return node->data; }
Packit 1c1d7e
Packit 1c1d7e
    // Compilers are too dumb to understand this for QValueList<int>
Packit 1c1d7e
    //const T* operator->() const { return &(node->data); }
Packit 1c1d7e
Packit 1c1d7e
    QValueListConstIterator<T>& operator++() {
Packit 1c1d7e
	node = node->next;
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueListConstIterator<T> operator++(int) {
Packit 1c1d7e
	QValueListConstIterator<T> tmp = *this;
Packit 1c1d7e
	node = node->next;
Packit 1c1d7e
	return tmp;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueListConstIterator<T>& operator--() {
Packit 1c1d7e
	node = node->prev;
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueListConstIterator<T> operator--(int) {
Packit 1c1d7e
	QValueListConstIterator<T> tmp = *this;
Packit 1c1d7e
	node = node->prev;
Packit 1c1d7e
	return tmp;
Packit 1c1d7e
    }
Packit 1c1d7e
};
Packit 1c1d7e
Packit 1c1d7e
template <class T>
Packit 1c1d7e
class Q_EXPORT QValueListPrivate : public QShared
Packit 1c1d7e
{
Packit 1c1d7e
public:
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Typedefs
Packit 1c1d7e
     */
Packit 1c1d7e
    typedef QValueListIterator<T> Iterator;
Packit 1c1d7e
    typedef QValueListConstIterator<T> ConstIterator;
Packit 1c1d7e
    typedef QValueListNode<T> Node;
Packit 1c1d7e
    typedef QValueListNode<T>* NodePtr;
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Functions
Packit 1c1d7e
     */
Packit 1c1d7e
    QValueListPrivate() { node = new Node; node->next = node->prev = node; nodes = 0; }
Packit 1c1d7e
    QValueListPrivate( const QValueListPrivate<T>& _p ) : QShared() {
Packit 1c1d7e
	node = new Node; node->next = node->prev = node; nodes = 0;
Packit 1c1d7e
	Iterator b( _p.node->next );
Packit 1c1d7e
	Iterator e( _p.node );
Packit 1c1d7e
	Iterator i( node );
Packit 1c1d7e
	while( b != e )
Packit 1c1d7e
	    insert( i, *b++ );
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    void derefAndDelete() // ### hack to get around hp-cc brain damage
Packit 1c1d7e
    {
Packit 1c1d7e
	if ( deref() )
Packit 1c1d7e
	    delete this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
#if defined(Q_TEMPLATEDLL)
Packit 1c1d7e
    // Workaround MS bug in memory de/allocation in DLL vs. EXE 
Packit 1c1d7e
    virtual
Packit 1c1d7e
#endif
Packit 1c1d7e
    ~QValueListPrivate() {
Packit 1c1d7e
	NodePtr p = node->next;
Packit 1c1d7e
	while( p != node ) {
Packit 1c1d7e
	    NodePtr x = p->next;
Packit 1c1d7e
	    delete p;
Packit 1c1d7e
	    p = x;
Packit 1c1d7e
	}
Packit 1c1d7e
	delete node;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    Iterator insert( Iterator it, const T& x ) {
Packit 1c1d7e
	NodePtr p = new Node( x );
Packit 1c1d7e
	p->next = it.node;
Packit 1c1d7e
	p->prev = it.node->prev;
Packit 1c1d7e
	it.node->prev->next = p;
Packit 1c1d7e
	it.node->prev = p;
Packit 1c1d7e
	nodes++;
Packit 1c1d7e
	return p;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    Iterator remove( Iterator it ) {
Packit 1c1d7e
	ASSERT ( it.node != node );
Packit 1c1d7e
	NodePtr next = it.node->next;
Packit 1c1d7e
	NodePtr prev = it.node->prev;
Packit 1c1d7e
	prev->next = next;
Packit 1c1d7e
	next->prev = prev;
Packit 1c1d7e
	delete it.node;
Packit 1c1d7e
	nodes--;
Packit 1c1d7e
	return Iterator( next );
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    NodePtr find( NodePtr start, const T& x ) const {
Packit 1c1d7e
	ConstIterator first( start );
Packit 1c1d7e
	ConstIterator last( node );
Packit 1c1d7e
	while( first != last) {
Packit 1c1d7e
	    if ( *first == x )
Packit 1c1d7e
		return first.node;
Packit 1c1d7e
	    ++first;
Packit 1c1d7e
	}
Packit 1c1d7e
	return last.node;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    int findIndex( NodePtr start, const T& x ) const {
Packit 1c1d7e
	ConstIterator first( start );
Packit 1c1d7e
	ConstIterator last( node );
Packit 1c1d7e
	int pos = 0;
Packit 1c1d7e
	while( first != last) {
Packit 1c1d7e
	    if ( *first == x )
Packit 1c1d7e
		return pos;
Packit 1c1d7e
	    ++first;
Packit 1c1d7e
	    ++pos;
Packit 1c1d7e
	}
Packit 1c1d7e
	return -1;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    uint contains( const T& x ) const {
Packit 1c1d7e
	uint result = 0;
Packit 1c1d7e
	Iterator first = Iterator( node->next );
Packit 1c1d7e
	Iterator last = Iterator( node );
Packit 1c1d7e
	while( first != last) {
Packit 1c1d7e
	    if ( *first == x )
Packit 1c1d7e
		++result;
Packit 1c1d7e
	    ++first;
Packit 1c1d7e
	}
Packit 1c1d7e
	return result;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    void remove( const T& x ) {
Packit 1c1d7e
	Iterator first = Iterator( node->next );
Packit 1c1d7e
	Iterator last = Iterator( node );
Packit 1c1d7e
	while( first != last) {
Packit 1c1d7e
	    if ( *first == x )
Packit 1c1d7e
		first = remove( first );
Packit 1c1d7e
	    else
Packit 1c1d7e
		++first;
Packit 1c1d7e
	}
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    NodePtr at( uint i ) const {
Packit 1c1d7e
	ASSERT( i <= nodes );
Packit 1c1d7e
	NodePtr p = node->next;
Packit 1c1d7e
	for( uint x = 0; x < i; ++x )
Packit 1c1d7e
	    p = p->next;
Packit 1c1d7e
	return p;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    void clear() {
Packit 1c1d7e
	nodes = 0;
Packit 1c1d7e
	NodePtr p = node->next;
Packit 1c1d7e
	while( p != node ) {
Packit 1c1d7e
	    NodePtr next = p->next;
Packit 1c1d7e
	    delete p;
Packit 1c1d7e
	    p = next;
Packit 1c1d7e
	}
Packit 1c1d7e
	node->next = node->prev = node;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    NodePtr node;
Packit 1c1d7e
    uint nodes;
Packit 1c1d7e
};
Packit 1c1d7e
Packit 1c1d7e
template <class T>
Packit 1c1d7e
class Q_EXPORT QValueList
Packit 1c1d7e
{
Packit 1c1d7e
public:
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Typedefs
Packit 1c1d7e
     */
Packit 1c1d7e
    typedef QValueListIterator<T> Iterator;
Packit 1c1d7e
    typedef QValueListConstIterator<T> ConstIterator;
Packit 1c1d7e
    typedef T ValueType;
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * API
Packit 1c1d7e
     */
Packit 1c1d7e
    QValueList() { sh = new QValueListPrivate<T>; }
Packit 1c1d7e
    QValueList( const QValueList<T>& l ) { sh = l.sh; sh->ref(); }
Packit 1c1d7e
    ~QValueList() { sh->derefAndDelete(); }
Packit 1c1d7e
Packit 1c1d7e
    QValueList<T>& operator= ( const QValueList<T>& l )
Packit 1c1d7e
    {
Packit 1c1d7e
	l.sh->ref();
Packit 1c1d7e
	sh->derefAndDelete();
Packit 1c1d7e
	sh = l.sh;
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueList<T> operator+ ( const QValueList<T>& l ) const
Packit 1c1d7e
    {
Packit 1c1d7e
	QValueList<T> l2( *this );
Packit 1c1d7e
	for( ConstIterator it = l.begin(); it != l.end(); ++it )
Packit 1c1d7e
	    l2.append( *it );
Packit 1c1d7e
	return l2;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    QValueList<T>& operator+= ( const QValueList<T>& l )
Packit 1c1d7e
    {
Packit 1c1d7e
	for( ConstIterator it = l.begin(); it != l.end(); ++it )
Packit 1c1d7e
	    append( *it );
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    bool operator== ( const QValueList<T>& l ) const
Packit 1c1d7e
    {
Packit 1c1d7e
	if ( count() != l.count() )
Packit 1c1d7e
	    return FALSE;
Packit 1c1d7e
	ConstIterator it2 = begin();
Packit 1c1d7e
	ConstIterator it = l.begin();
Packit 1c1d7e
	for( ; it != l.end(); ++it, ++it2 )
Packit 1c1d7e
	    if ( !( *it == *it2 ) )
Packit 1c1d7e
		return FALSE;
Packit 1c1d7e
	return TRUE;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
    bool operator!= ( const QValueList<T>& l ) const { return !( *this == l ); }
Packit 1c1d7e
Packit 1c1d7e
    Iterator begin() { detach(); return Iterator( sh->node->next ); }
Packit 1c1d7e
    ConstIterator begin() const { return ConstIterator( sh->node->next ); }
Packit 1c1d7e
    Iterator end() { detach(); return Iterator( sh->node ); }
Packit 1c1d7e
    ConstIterator end() const { return ConstIterator( sh->node ); }
Packit 1c1d7e
    Iterator fromLast() { detach(); return Iterator( sh->node->prev ); }
Packit 1c1d7e
    ConstIterator fromLast() const { return ConstIterator( sh->node->prev ); }
Packit 1c1d7e
Packit 1c1d7e
    bool isEmpty() const { return ( sh->nodes == 0 ); }
Packit 1c1d7e
Packit 1c1d7e
    Iterator insert( Iterator it, const T& x ) { detach(); return sh->insert( it, x ); }
Packit 1c1d7e
Packit 1c1d7e
    Iterator append( const T& x ) { detach(); return sh->insert( end(), x ); }
Packit 1c1d7e
    Iterator prepend( const T& x ) { detach(); return sh->insert( begin(), x ); }
Packit 1c1d7e
Packit 1c1d7e
    Iterator remove( Iterator it ) { detach(); return sh->remove( it ); }
Packit 1c1d7e
    void remove( const T& x ) { detach(); sh->remove( x ); }
Packit 1c1d7e
Packit 1c1d7e
    T& first() { detach(); return sh->node->next->data; }
Packit 1c1d7e
    const T& first() const { return sh->node->next->data; }
Packit 1c1d7e
    T& last() { detach(); return sh->node->prev->data; }
Packit 1c1d7e
    const T& last() const { return sh->node->prev->data; }
Packit 1c1d7e
Packit 1c1d7e
    T& operator[] ( uint i ) { detach(); return sh->at(i)->data; }
Packit 1c1d7e
    const T& operator[] ( uint i ) const { return sh->at(i)->data; }
Packit 1c1d7e
    Iterator at( uint i ) { detach(); return Iterator( sh->at(i) ); }
Packit 1c1d7e
    ConstIterator at( uint i ) const { return ConstIterator( sh->at(i) ); }
Packit 1c1d7e
    Iterator find ( const T& x ) { detach(); return Iterator( sh->find( sh->node->next, x) ); }
Packit 1c1d7e
    ConstIterator find ( const T& x ) const { return ConstIterator( sh->find( sh->node->next, x) ); }
Packit 1c1d7e
    Iterator find ( Iterator it, const T& x ) { detach(); return Iterator( sh->find( it.node, x ) ); }
Packit 1c1d7e
    ConstIterator find ( ConstIterator it, const T& x ) const { return ConstIterator( sh->find( it.node, x ) ); }
Packit 1c1d7e
    int findIndex( const T& x ) const { return sh->findIndex( sh->node->next, x) ; }
Packit 1c1d7e
    uint contains( const T& x ) const { return sh->contains( x ); }
Packit 1c1d7e
Packit 1c1d7e
    uint count() const { return sh->nodes; }
Packit 1c1d7e
Packit 1c1d7e
    void clear() { if ( sh->count == 1 ) sh->clear(); else { sh->deref(); sh = new QValueListPrivate<T>; } }
Packit 1c1d7e
Packit 1c1d7e
Packit 1c1d7e
    QValueList<T>& operator+= ( const T& x )
Packit 1c1d7e
    {
Packit 1c1d7e
	append( x );
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
    QValueList<T>& operator<< ( const T& x )
Packit 1c1d7e
    {
Packit 1c1d7e
	append( x );
Packit 1c1d7e
	return *this;
Packit 1c1d7e
    }
Packit 1c1d7e
Packit 1c1d7e
Packit 1c1d7e
protected:
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Helpers
Packit 1c1d7e
     */
Packit 1c1d7e
    void detach() { if ( sh->count > 1 ) { sh->deref(); sh = new QValueListPrivate<T>( *sh ); } }
Packit 1c1d7e
Packit 1c1d7e
    /**
Packit 1c1d7e
     * Variables
Packit 1c1d7e
     */
Packit 1c1d7e
    QValueListPrivate<T>* sh;
Packit 1c1d7e
};
Packit 1c1d7e
Packit 1c1d7e
#ifndef QT_NO_DATASTREAM
Packit 1c1d7e
template<class T>
Packit 1c1d7e
inline QDataStream& operator>>( QDataStream& s, QValueList<T>& l )
Packit 1c1d7e
{
Packit 1c1d7e
    l.clear();
Packit 1c1d7e
    Q_UINT32 c;
Packit 1c1d7e
    s >> c;
Packit 1c1d7e
    for( Q_UINT32 i = 0; i < c; ++i )
Packit 1c1d7e
    {
Packit 1c1d7e
	T t;
Packit 1c1d7e
	s >> t;
Packit 1c1d7e
	l.append( t );
Packit 1c1d7e
    }
Packit 1c1d7e
    return s;
Packit 1c1d7e
}
Packit 1c1d7e
Packit 1c1d7e
template<class T>
Packit 1c1d7e
inline QDataStream& operator<<( QDataStream& s, const QValueList<T>& l )
Packit 1c1d7e
{
Packit 1c1d7e
    s << (Q_UINT32)l.count();
Packit 1c1d7e
    QValueListConstIterator<T> it = l.begin();
Packit 1c1d7e
    for( ; it != l.end(); ++it )
Packit 1c1d7e
	s << *it;
Packit 1c1d7e
    return s;
Packit 1c1d7e
}
Packit 1c1d7e
#endif // QT_NO_DATASTREAM
Packit 1c1d7e
#endif // QVALUELIST_H