diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-06-17 17:28:28 -0500 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-06-17 17:28:28 -0500 |
| commit | 6dec101d43dcbd4195c47d54bd388db1a8d7230e (patch) | |
| tree | 7c336cbed3a93807a34cd4df39b2f92a7d48a141 /src/kernel/qregion.cpp | |
| parent | f27c2533f735d53c6b555f387c6390c0690cc246 (diff) | |
| download | tqt3-6dec101d43dcbd4195c47d54bd388db1a8d7230e.tar.gz tqt3-6dec101d43dcbd4195c47d54bd388db1a8d7230e.zip | |
Automated update from Qt3
Diffstat (limited to 'src/kernel/qregion.cpp')
| -rw-r--r-- | src/kernel/qregion.cpp | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/src/kernel/qregion.cpp b/src/kernel/qregion.cpp index 014f0fad0..deb0ffa43 100644 --- a/src/kernel/qregion.cpp +++ b/src/kernel/qregion.cpp @@ -164,7 +164,7 @@ void TQRegion::exec( const TQByteArray &buffer, int ver ) int test_cnt = 0; #endif while ( !s.eof() ) { - Q_INT32 id; + TQ_INT32 id; if ( s.version() == 1 ) { int id_int; s >> id_int; @@ -210,7 +210,7 @@ void TQRegion::exec( const TQByteArray &buffer, int ver ) } } else if ( id == TQRGN_RECTS ) { // (This is the only form used in TQt 2.0) - Q_UINT32 n; + TQ_UINT32 n; s >> n; TQRect r; for ( int i=0; i<(int)n; i++ ) { @@ -241,22 +241,22 @@ TQDataStream &operator<<( TQDataStream &s, const TQRegion &r ) { TQMemArray<TQRect> a = r.rects(); if ( a.isEmpty() ) { - s << (Q_UINT32)0; + s << (TQ_UINT32)0; } else { if ( s.version() == 1 ) { int i; for ( i=(int)a.size()-1; i>0; i-- ) { - s << (Q_UINT32)(12+i*24); + s << (TQ_UINT32)(12+i*24); s << (int)TQRGN_OR; } for ( i=0; i<(int)a.size(); i++ ) { - s << (Q_UINT32)(4+8) << (int)TQRGN_SETRECT << a[i]; + s << (TQ_UINT32)(4+8) << (int)TQRGN_SETRECT << a[i]; } } else { - s << (Q_UINT32)(4+4+16*a.size()); // 16: storage size of TQRect - s << (Q_INT32)TQRGN_RECTS; - s << (Q_UINT32)a.size(); + s << (TQ_UINT32)(4+4+16*a.size()); // 16: storage size of TQRect + s << (TQ_INT32)TQRGN_RECTS; + s << (TQ_UINT32)a.size(); for ( int i=0; i<(int)a.size(); i++ ) s << a[i]; } |