diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-12-28 21:41:52 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-12-28 21:41:52 +0900 |
| commit | 0e9cae00ef660b51955c7c9abfa7eb148d8bfab0 (patch) | |
| tree | 6b46cc5b3ced64b9cba7b1293ada94bf5cfb2125 /src/tools/tqtl.h | |
| parent | 1df9f282051905555d02d43069a2c9ca0cc89270 (diff) | |
| download | tqt-remove/tq-inline-template-define.tar.gz tqt-remove/tq-inline-template-define.zip | |
Remove TQ_INLINE_TEMPLATES define.remove/tq-inline-template-define
inline' is redundant in function template definitions, except for specific template specialization
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'src/tools/tqtl.h')
| -rw-r--r-- | src/tools/tqtl.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/tools/tqtl.h b/src/tools/tqtl.h index 63da09080..858a48ce0 100644 --- a/src/tools/tqtl.h +++ b/src/tools/tqtl.h @@ -149,7 +149,7 @@ inline void tqSwap( T& _value1, T& _value2 ) template <class InputIterator> -TQ_INLINE_TEMPLATES void qBubbleSort( InputIterator b, InputIterator e ) +void qBubbleSort( InputIterator b, InputIterator e ) { // Goto last element; InputIterator last = e; @@ -190,7 +190,7 @@ inline void qBubbleSort( Container &c ) template <class Value> -TQ_INLINE_TEMPLATES void qHeapSortPushDown( Value* heap, int first, int last ) +void qHeapSortPushDown( Value* heap, int first, int last ) { int r = first; while ( r <= last / 2 ) { @@ -219,7 +219,7 @@ TQ_INLINE_TEMPLATES void qHeapSortPushDown( Value* heap, int first, int last ) template <class InputIterator, class Value> -TQ_INLINE_TEMPLATES void qHeapSortHelper( InputIterator b, InputIterator e, Value, uint n ) +void qHeapSortHelper( InputIterator b, InputIterator e, Value, uint n ) { // Create the heap InputIterator insert = b; @@ -250,7 +250,7 @@ TQ_INLINE_TEMPLATES void qHeapSortHelper( InputIterator b, InputIterator e, Valu template <class InputIterator> -TQ_INLINE_TEMPLATES void qHeapSort( InputIterator b, InputIterator e ) +void qHeapSort( InputIterator b, InputIterator e ) { // Empty ? if ( b == e ) @@ -271,7 +271,7 @@ TQ_INLINE_TEMPLATES void qHeapSort( InputIterator b, InputIterator e ) template <class Container> -TQ_INLINE_TEMPLATES void qHeapSort( Container &c ) +void qHeapSort( Container &c ) { if ( c.begin() == c.end() ) return; |