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/qgvector.cpp | |
| parent | a829bcdc533e154000803d517200d32fe762e85c (diff) | |
| download | tqt3-359640943bcf155faa9a067dde9e00a123276290.tar.gz tqt3-359640943bcf155faa9a067dde9e00a123276290.zip | |
Automated update from Qt3
Diffstat (limited to 'src/tools/qgvector.cpp')
| -rw-r--r-- | src/tools/qgvector.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/tools/qgvector.cpp b/src/tools/qgvector.cpp index b53e41721..90bb88e07 100644 --- a/src/tools/qgvector.cpp +++ b/src/tools/qgvector.cpp @@ -176,7 +176,7 @@ TQGVector::TQGVector( uint size ) // create vectors with nullptrs return; } vec = NEW(Item,len); - Q_CHECK_PTR( vec ); + TQ_CHECK_PTR( vec ); memset( (void*)vec, 0, len*sizeof(Item) ); // fill with nulls } @@ -190,11 +190,11 @@ TQGVector::TQGVector( const TQGVector &a ) // make copy of other vector return; } vec = NEW( Item, len ); - Q_CHECK_PTR( vec ); + TQ_CHECK_PTR( vec ); for ( uint i = 0; i < len; i++ ) { if ( a.vec[i] ) { vec[i] = newItem( a.vec[i] ); - Q_CHECK_PTR( vec[i] ); + TQ_CHECK_PTR( vec[i] ); } else { vec[i] = 0; } @@ -219,11 +219,11 @@ TQGVector& TQGVector::operator=( const TQGVector &v ) return *this; } vec = NEW( Item, len ); - Q_CHECK_PTR( vec ); + TQ_CHECK_PTR( vec ); for ( uint i = 0; i < len; i++ ) { if ( v.vec[i] ) { vec[i] = newItem( v.vec[i] ); - Q_CHECK_PTR( vec[i] ); + TQ_CHECK_PTR( vec[i] ); } else { vec[i] = 0; } @@ -246,7 +246,7 @@ bool TQGVector::insert( uint index, Item d ) // insert item at index } if ( d ) { vec[index] = newItem( d ); - Q_CHECK_PTR( vec[index] ); + TQ_CHECK_PTR( vec[index] ); numItems++; return vec[index] != 0; } else { @@ -560,7 +560,7 @@ TQDataStream &TQGVector::read( TQDataStream &s ) // read vector from stream for (uint i=0; i<num; i++) { // read all items Item d; read( s, d ); - Q_CHECK_PTR( d ); + TQ_CHECK_PTR( d ); if ( !d ) // no memory break; vec[i] = d; |