diff options
| author | tpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da> | 2011-04-14 20:16:30 +0000 |
|---|---|---|
| committer | tpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da> | 2011-04-14 20:16:30 +0000 |
| commit | 1c93fca14d9ce37499bcfdf994c660186a0b6f17 (patch) | |
| tree | f2defe163a805a9e34a2142dfde4cdb5e49241e7 /libkcal/recurrencerule.h | |
| parent | 67e29a054cfcb1b0d2fe6b0a316cf6b3eec087b7 (diff) | |
| download | tdepim-1c93fca14d9ce37499bcfdf994c660186a0b6f17.tar.gz tdepim-1c93fca14d9ce37499bcfdf994c660186a0b6f17.zip | |
Enable kdepim compilation under Qt4
This will likely break Qt3 compilation temporarily, which is an unintended side effect.
A third and final kdepim commit will repair Qt3 compilation shortly.
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdepim@1227946 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'libkcal/recurrencerule.h')
| -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 a93062d0..14335a0b 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; } |