diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2023-09-06 12:45:31 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2023-09-07 15:14:50 +0900 |
| commit | 926102a455014e6ab308aaced19e32eed7ed4414 (patch) | |
| tree | e067ab2b73341043cc70aa9c109e300357576e98 /src/tools/ntqtl.h | |
| parent | e0a3cab4467dccdd57a8cba57656be53ae192a51 (diff) | |
| download | tqt3-926102a455014e6ab308aaced19e32eed7ed4414.tar.gz tqt3-926102a455014e6ab308aaced19e32eed7ed4414.zip | |
Replace various Q_* and QT_* defines with TQ_* and TQT_*
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'src/tools/ntqtl.h')
| -rw-r--r-- | src/tools/ntqtl.h | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/tools/ntqtl.h b/src/tools/ntqtl.h index a282b9c9c..6a47802b0 100644 --- a/src/tools/ntqtl.h +++ b/src/tools/ntqtl.h @@ -149,7 +149,7 @@ inline void tqSwap( T& _value1, T& _value2 ) template <class InputIterator> -Q_INLINE_TEMPLATES void qBubbleSort( InputIterator b, InputIterator e ) +TQ_INLINE_TEMPLATES void qBubbleSort( InputIterator b, InputIterator e ) { // Goto last element; InputIterator last = e; @@ -190,7 +190,7 @@ inline void qBubbleSort( Container &c ) template <class Value> -Q_INLINE_TEMPLATES void qHeapSortPushDown( Value* heap, int first, int last ) +TQ_INLINE_TEMPLATES void qHeapSortPushDown( Value* heap, int first, int last ) { int r = first; while ( r <= last / 2 ) { @@ -219,7 +219,7 @@ Q_INLINE_TEMPLATES void qHeapSortPushDown( Value* heap, int first, int last ) template <class InputIterator, class Value> -Q_INLINE_TEMPLATES void qHeapSortHelper( InputIterator b, InputIterator e, Value, uint n ) +TQ_INLINE_TEMPLATES void qHeapSortHelper( InputIterator b, InputIterator e, Value, uint n ) { // Create the heap InputIterator insert = b; @@ -250,7 +250,7 @@ Q_INLINE_TEMPLATES void qHeapSortHelper( InputIterator b, InputIterator e, Value template <class InputIterator> -Q_INLINE_TEMPLATES void qHeapSort( InputIterator b, InputIterator e ) +TQ_INLINE_TEMPLATES void qHeapSort( InputIterator b, InputIterator e ) { // Empty ? if ( b == e ) @@ -271,7 +271,7 @@ Q_INLINE_TEMPLATES void qHeapSort( InputIterator b, InputIterator e ) template <class Container> -Q_INLINE_TEMPLATES void qHeapSort( Container &c ) +TQ_INLINE_TEMPLATES void qHeapSort( Container &c ) { if ( c.begin() == c.end() ) return; @@ -291,7 +291,7 @@ public: } TQBackInsertIterator<Container>& - operator=( const Q_TYPENAME Container::value_type &value ) + operator=( const TQ_TYPENAME Container::value_type &value ) { container->push_back( value ); return *this; |