summaryrefslogtreecommitdiffstats
path: root/libkcal/recurrencerule.h
diff options
context:
space:
mode:
Diffstat (limited to 'libkcal/recurrencerule.h')
-rw-r--r--libkcal/recurrencerule.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/libkcal/recurrencerule.h b/libkcal/recurrencerule.h
index a93062d08..14335a0b6 100644
--- a/libkcal/recurrencerule.h
+++ b/libkcal/recurrencerule.h
@@ -30,7 +30,7 @@
#include "libkcal_export.h"
template <class T>
-Q_INLINE_TEMPLATES void qSortUnique( TQValueList<T> &lst )
+TQ_INLINE_TEMPLATES void qSortUnique( TQValueList<T> &lst )
{
qHeapSort( lst );
if ( lst.isEmpty() ) return;
@@ -51,7 +51,7 @@ Q_INLINE_TEMPLATES void qSortUnique( TQValueList<T> &lst )
}
template <class T>
-Q_INLINE_TEMPLATES int findGE( const TQValueList<T> &lst, const T &value, int start )
+TQ_INLINE_TEMPLATES 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 @@ Q_INLINE_TEMPLATES int findGE( const TQValueList<T> &lst, const T &value, int st
}
template <class T>
-Q_INLINE_TEMPLATES int findGT( const TQValueList<T> &lst, const T &value, int start )
+TQ_INLINE_TEMPLATES 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 @@ Q_INLINE_TEMPLATES int findGT( const TQValueList<T> &lst, const T &value, int st
}
template <class T>
-Q_INLINE_TEMPLATES int findLE( const TQValueList<T> &lst, const T &value, int start )
+TQ_INLINE_TEMPLATES 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 @@ Q_INLINE_TEMPLATES int findLE( const TQValueList<T> &lst, const T &value, int st
}
template <class T>
-Q_INLINE_TEMPLATES int findLT( const TQValueList<T> &lst, const T &value, int start )
+TQ_INLINE_TEMPLATES 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 @@ Q_INLINE_TEMPLATES int findLT( const TQValueList<T> &lst, const T &value, int st
}
template <class T>
-Q_INLINE_TEMPLATES int findSorted( const TQValueList<T> &lst, const T &value, int start )
+TQ_INLINE_TEMPLATES 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 @@ Q_INLINE_TEMPLATES int findSorted( const TQValueList<T> &lst, const T &value, in
}
template <class T>
-Q_INLINE_TEMPLATES int removeSorted( TQValueList<T> &lst, const T &value, int start )
+TQ_INLINE_TEMPLATES int removeSorted( TQValueList<T> &lst, const T &value, int start )
{
int i = findSorted( lst, value, start );
if ( i >= 0 ) {
@@ -148,7 +148,7 @@ Q_INLINE_TEMPLATES int removeSorted( TQValueList<T> &lst, const T &value, int st
}
template <class T>
-Q_INLINE_TEMPLATES bool containsSorted( const TQValueList<T> &lst, const T &value )
+TQ_INLINE_TEMPLATES bool containsSorted( const TQValueList<T> &lst, const T &value )
{
return findSorted( lst, value, 0 ) >= 0;
}