diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-02-13 17:43:39 -0600 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-02-13 17:43:39 -0600 |
| commit | 359640943bcf155faa9a067dde9e00a123276290 (patch) | |
| tree | fb3d55ea5e18949042fb0064123fb73d2b1eb932 /src/tools/qglist.cpp | |
| parent | a829bcdc533e154000803d517200d32fe762e85c (diff) | |
| download | tqt3-359640943bcf155faa9a067dde9e00a123276290.tar.gz tqt3-359640943bcf155faa9a067dde9e00a123276290.zip | |
Automated update from Qt3
Diffstat (limited to 'src/tools/qglist.cpp')
| -rw-r--r-- | src/tools/qglist.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/tools/qglist.cpp b/src/tools/qglist.cpp index c9f14102b..b67b11540 100644 --- a/src/tools/qglist.cpp +++ b/src/tools/qglist.cpp @@ -386,7 +386,7 @@ void TQGList::inSort( TQPtrCollection::Item d ) void TQGList::prepend( TQPtrCollection::Item d ) { register TQLNode *n = new TQLNode( newItem(d) ); - Q_CHECK_PTR( n ); + TQ_CHECK_PTR( n ); n->prev = 0; if ( (n->next = firstNode) ) // list is not empty firstNode->prev = n; @@ -405,7 +405,7 @@ void TQGList::prepend( TQPtrCollection::Item d ) void TQGList::append( TQPtrCollection::Item d ) { register TQLNode *n = new TQLNode( newItem(d) ); - Q_CHECK_PTR( n ); + TQ_CHECK_PTR( n ); n->next = 0; if ( (n->prev = lastNode) ) // list is not empty lastNode->next = n; @@ -435,7 +435,7 @@ bool TQGList::insertAt( uint index, TQPtrCollection::Item d ) return FALSE; TQLNode *prevNode = nextNode->prev; register TQLNode *n = new TQLNode( newItem(d) ); - Q_CHECK_PTR( n ); + TQ_CHECK_PTR( n ); nextNode->prev = n; prevNode->next = n; n->prev = prevNode; // link new node into list @@ -1025,11 +1025,11 @@ TQDataStream &TQGList::read( TQDataStream &s ) while ( num-- ) { // read all items Item d; read( s, d ); - Q_CHECK_PTR( d ); + TQ_CHECK_PTR( d ); if ( !d ) // no memory break; TQLNode *n = new TQLNode( d ); - Q_CHECK_PTR( n ); + TQ_CHECK_PTR( n ); if ( !n ) // no memory break; n->next = 0; @@ -1102,7 +1102,7 @@ TQGListIterator::TQGListIterator( const TQGList &l ) curNode = list->firstNode; // set to first node if ( !list->iterators ) { list->iterators = new TQGListIteratorList; // create iterator list - Q_CHECK_PTR( list->iterators ); + TQ_CHECK_PTR( list->iterators ); } list->iterators->add( this ); // attach iterator to list } |