diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-12-28 21:31:28 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-12-28 21:31:28 +0900 |
| commit | 23bea66601638a5642aed97e01f25efebcf5d534 (patch) | |
| tree | d5383fdf985d3c375f3caf8668058ffb760b3037 | |
| parent | f46ce19b775ac2363dfac0679a606c91b0d52f5e (diff) | |
| download | tdepim-remove/tq-inline-template-define.tar.gz tdepim-remove/tq-inline-template-define.zip | |
'inline' is redundant in function template definitions, except for specific template specializationremove/tq-inline-template-define
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
| -rw-r--r-- | libkcal/recurrencerule.h | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/libkcal/recurrencerule.h b/libkcal/recurrencerule.h index 4d813907..ca63e801 100644 --- a/libkcal/recurrencerule.h +++ b/libkcal/recurrencerule.h @@ -30,7 +30,7 @@ #include "libkcal_export.h" template <class T> -TQ_INLINE_TEMPLATES void qSortUnique( TQValueList<T> &lst ) +void qSortUnique( TQValueList<T> &lst ) { qHeapSort( lst ); if ( lst.isEmpty() ) return; @@ -51,7 +51,7 @@ TQ_INLINE_TEMPLATES void qSortUnique( TQValueList<T> &lst ) } template <class T> -TQ_INLINE_TEMPLATES int findGE( const TQValueList<T> &lst, const T &value, int start ) +int findGE( const TQValueList<T> &lst, const T &value, int start ) { // Do a binary search to find the first item >= value int st = start - 1; @@ -69,7 +69,7 @@ TQ_INLINE_TEMPLATES int findGE( const TQValueList<T> &lst, const T &value, int s } template <class T> -TQ_INLINE_TEMPLATES int findGT( const TQValueList<T> &lst, const T &value, int start ) +int findGT( const TQValueList<T> &lst, const T &value, int start ) { // Do a binary search to find the first item > value int st = start - 1; @@ -87,7 +87,7 @@ TQ_INLINE_TEMPLATES int findGT( const TQValueList<T> &lst, const T &value, int s } template <class T> -TQ_INLINE_TEMPLATES int findLE( const TQValueList<T> &lst, const T &value, int start ) +int findLE( const TQValueList<T> &lst, const T &value, int start ) { // Do a binary search to find the last item <= value int st = start - 1; @@ -104,7 +104,7 @@ TQ_INLINE_TEMPLATES int findLE( const TQValueList<T> &lst, const T &value, int s } template <class T> -TQ_INLINE_TEMPLATES int findLT( const TQValueList<T> &lst, const T &value, int start ) +int findLT( const TQValueList<T> &lst, const T &value, int start ) { // Do a binary search to find the last item < value int st = start - 1; @@ -121,7 +121,7 @@ TQ_INLINE_TEMPLATES int findLT( const TQValueList<T> &lst, const T &value, int s } template <class T> -TQ_INLINE_TEMPLATES int findSorted( const TQValueList<T> &lst, const T &value, int start ) +int findSorted( const TQValueList<T> &lst, const T &value, int start ) { // Do a binary search to find the item == value int st = start - 1; @@ -138,7 +138,7 @@ TQ_INLINE_TEMPLATES int findSorted( const TQValueList<T> &lst, const T &value, i } template <class T> -TQ_INLINE_TEMPLATES int removeSorted( TQValueList<T> &lst, const T &value, int start ) +int removeSorted( TQValueList<T> &lst, const T &value, int start ) { int i = findSorted( lst, value, start ); if ( i >= 0 ) { @@ -148,7 +148,7 @@ TQ_INLINE_TEMPLATES int removeSorted( TQValueList<T> &lst, const T &value, int s } template <class T> -TQ_INLINE_TEMPLATES bool containsSorted( const TQValueList<T> &lst, const T &value ) +bool containsSorted( const TQValueList<T> &lst, const T &value ) { return findSorted( lst, value, 0 ) >= 0; } |