-
Notifications
You must be signed in to change notification settings - Fork 1.3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Reduced and improved functionality of QList
- operations on current index and node (next(), prev(), last(), first()) have been removed. - access to internal nodes has been removed. - old QList has been renamed to QInternalList for use inside qtools only. - added type safe compare, new, and delete operations (compareValues(), newValue(), deleteValue()). - add compareValues also to QDict for consistency. - changed doxygen's implementation to comply with the new QList and QDict interface.
- Loading branch information
Dimitri van Heesch
committed
Dec 30, 2013
1 parent
744d1ca
commit 6e51abf
Showing
70 changed files
with
1,087 additions
and
962 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,139 @@ | ||
| /**************************************************************************** | ||
| ** | ||
| ** | ||
| ** Definition of QList template/macro class | ||
| ** | ||
| ** Created : 920701 | ||
| ** | ||
| ** 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 QINTERNALLIST_H | ||
| #define QINTERNALLIST_H | ||
|
|
||
| #ifndef QT_H | ||
| #include "qglist.h" | ||
| #endif // QT_H | ||
|
|
||
|
|
||
| template<class type> class Q_EXPORT QInternalList : public QGList | ||
| { | ||
| public: | ||
| QInternalList() {} | ||
| QInternalList( const QInternalList<type> &l ) : QGList(l) {} | ||
| ~QInternalList() { clear(); } | ||
| QInternalList<type> &operator=(const QInternalList<type> &l) | ||
| { return (QInternalList<type>&)QGList::operator=(l); } | ||
| bool operator==( const QInternalList<type> &list ) const | ||
| { return QGList::operator==( list ); } | ||
| uint count() const { return QGList::count(); } | ||
| bool isEmpty() const { return QGList::count() == 0; } | ||
| bool insert( uint i, const type *d){ return QGList::insertAt(i,(QCollection::Item)d); } | ||
| void inSort( const type *d ) { QGList::inSort((QCollection::Item)d); } | ||
| void prepend( const type *d ) { QGList::insertAt(0,(QCollection::Item)d); } | ||
| void append( const type *d ) { QGList::append((QCollection::Item)d); } | ||
| bool remove( uint i ) { return QGList::removeAt(i); } | ||
| bool remove() { return QGList::remove((QCollection::Item)0); } | ||
| bool remove( const type *d ) { return QGList::remove((QCollection::Item)d); } | ||
| bool removeRef( const type *d ) { return QGList::removeRef((QCollection::Item)d); } | ||
| void removeNode( QLNode *n ) { QGList::removeNode(n); } | ||
| bool removeFirst() { return QGList::removeFirst(); } | ||
| bool removeLast() { return QGList::removeLast(); } | ||
| type *take( uint i ) { return (type *)QGList::takeAt(i); } | ||
| type *take() { return (type *)QGList::take(); } | ||
| type *takeNode( QLNode *n ) { return (type *)QGList::takeNode(n); } | ||
| void clear() { QGList::clear(); } | ||
| void sort() { QGList::sort(); } | ||
| int find( const type *d ) { return QGList::find((QCollection::Item)d); } | ||
| int findNext( const type *d ) { return QGList::find((QCollection::Item)d,FALSE); } | ||
| int findRef( const type *d ) { return QGList::findRef((QCollection::Item)d); } | ||
| int findNextRef( const type *d ){ return QGList::findRef((QCollection::Item)d,FALSE);} | ||
| uint contains( const type *d ) const { return QGList::contains((QCollection::Item)d); } | ||
| uint containsRef( const type *d ) const | ||
| { return QGList::containsRef((QCollection::Item)d); } | ||
| type *at( uint i ) { return (type *)QGList::at(i); } | ||
| int at() const { return QGList::at(); } | ||
| type *current() const { return (type *)QGList::get(); } | ||
| QLNode *currentNode() const { return QGList::currentNode(); } | ||
| type *getFirst() const { return (type *)QGList::cfirst(); } | ||
| type *getLast() const { return (type *)QGList::clast(); } | ||
| type *first() { return (type *)QGList::first(); } | ||
| type *last() { return (type *)QGList::last(); } | ||
| type *next() { return (type *)QGList::next(); } | ||
| type *prev() { return (type *)QGList::prev(); } | ||
| void toVector( QGVector *vec )const{ QGList::toVector(vec); } | ||
| private: | ||
| void deleteItem( QCollection::Item d ); | ||
| }; | ||
|
|
||
| #if defined(Q_DELETING_VOID_UNDEFINED) | ||
| template<> inline void QInternalList<void>::deleteItem( QCollection::Item ) | ||
| { | ||
| } | ||
| #endif | ||
|
|
||
| template<class type> inline void QInternalList<type>::deleteItem( QCollection::Item d ) | ||
| { | ||
| if ( del_item ) delete (type *)d; | ||
| } | ||
|
|
||
|
|
||
| template<class type> class Q_EXPORT QInternalListIterator : public QGListIterator | ||
| { | ||
| public: | ||
| QInternalListIterator(const QInternalList<type> &l) :QGListIterator((QGList &)l) {} | ||
| ~QInternalListIterator() {} | ||
| uint count() const { return list->count(); } | ||
| bool isEmpty() const { return list->count() == 0; } | ||
| bool atFirst() const { return QGListIterator::atFirst(); } | ||
| bool atLast() const { return QGListIterator::atLast(); } | ||
| type *toFirst() { return (type *)QGListIterator::toFirst(); } | ||
| type *toLast() { return (type *)QGListIterator::toLast(); } | ||
| operator type *() const { return (type *)QGListIterator::get(); } | ||
| type *operator*() { return (type *)QGListIterator::get(); } | ||
|
|
||
| // No good, since QList<char> (ie. QStrList fails... | ||
| // | ||
| // MSVC++ gives warning | ||
| // Sunpro C++ 4.1 gives error | ||
| // type *operator->() { return (type *)QGListIterator::get(); } | ||
|
|
||
| type *current() const { return (type *)QGListIterator::get(); } | ||
| type *operator()() { return (type *)QGListIterator::operator()();} | ||
| type *operator++() { return (type *)QGListIterator::operator++(); } | ||
| type *operator+=(uint j) { return (type *)QGListIterator::operator+=(j);} | ||
| type *operator--() { return (type *)QGListIterator::operator--(); } | ||
| type *operator-=(uint j) { return (type *)QGListIterator::operator-=(j);} | ||
| QInternalListIterator<type>& operator=(const QInternalListIterator<type>&it) | ||
| { QGListIterator::operator=(it); return *this; } | ||
| }; | ||
|
|
||
|
|
||
| #endif // QINTERNALLIST_H |
Oops, something went wrong.