Add generic sorting implementation based on QVector

for Contact and Todo

1 files changed, 138 insertions, 0 deletions

diff --git a/libopie2/opiepim/private/opimsortvector.h b/libopie2/opiepim/private/opimsortvector.h
new file mode 100644
index 0000000..6c21339
--- a/dev/null
+++ b/libopie2/opiepim/private/opimsortvector.h
@@ -0,0 +1,138 @@
+/*
+                             This file is part of the Opie Project
+                             Copyright (C) 2004 Holger Freyther <freyther@handhelds.org>
+              =.             Copyright (C) The Opie Team <opie-devel@handhelds.org>
+            .=l.
+           .>+-=
+ _;:,     .>    :=|.         This program is free software; you can
+.> <`_,   >  .   <=          redistribute it and/or  modify it under
+:`=1 )Y*s>-.--   :           the terms of the GNU Library General Public
+.="- .-=="i,     .._         License as published by the Free Software
+ - .   .-<_>     .<>         Foundation; either version 2 of the License,
+     ._= =}       :          or (at your option) any later version.
+    .%`+i>       _;_.
+    .i_,=:_.      -<s.       This program is distributed in the hope that
+     +  .  -:.       =       it will be useful,  but WITHOUT ANY WARRANTY;
+    : ..    .:,     . . .    without even the implied warranty of
+    =_        +     =;=|`    MERCHANTABILITY or FITNESS FOR A
+  _.=:.       :    :=>`:     PARTICULAR PURPOSE. See the GNU
+..}^=.=       =       ;      Library General Public License for more
+++=   -.     .`     .:       details.
+ :     =  ...= . :.=-
+ -.   .:....=;==+<;          You should have received a copy of the GNU
+  -_. . .   )=.  =           Library General Public License along with
+    --        :-=`           this library; see the file COPYING.LIB.
+                             If not, write to the Free Software Foundation,
+                             Inc., 59 Temple Place - Suite 330,
+                             Boston, MA 02111-1307, USA.
+*/
+
+#ifndef OPIE_PIM_SORT_VECTOR_H
+#define OPIE_PIM_SORT_VECTOR_H
+
+#include <opie2/opimglobal.h>
+
+#include <qvector.h>
+
+namespace Opie {
+namespace Internal {
+template<class T>
+struct OPimSortVectorContainer {
+    T item;
+};
+
+template<class T>
+class  OPimSortVector : public QVector<OPimSortVectorContainer<T> > {
+    typedef OPimSortVectorContainer<T> VectorItem;
+public:
+    OPimSortVector( uint size, bool asc, int sort );
+    int compareItems( QCollection::Item d1, QCollection::Item d2 );
+    bool insert( uint, const T& t );
+    UID uidAt( uint i )const;
+
+protected:
+    int testString( const QString&, const QString& )const;
+    int testDate( const QDate&, const QDate& )const;
+protected:
+    bool sortAscending()const;
+    int  sortOrder()const;
+
+private:
+    bool m_ascending : 1;
+    int m_sort;
+    virtual int compareItems( const T& item1, const T& item2 ) = 0;
+};
+
+template<class T>
+OPimSortVector<T>::OPimSortVector( uint size, bool asc, int sort )
+    : QVector<VectorItem>( size ), m_ascending( asc ),
+      m_sort( sort ) {
+    this->setAutoDelete( true );
+}
+
+/**
+ * Returns:
+ *       0 if item1 == item2
+ *
+ *   non-zero if item1 != item2
+ *
+ *   This function returns int rather than bool so that reimplementations
+ *   can return one of three values and use it to sort by:
+ *
+ *   0 if item1 == item2
+ *
+ *   > 0 (positive integer) if item1 > item2
+ *
+ *   < 0 (negative integer) if item1 < item2
+ *
+ */
+template<class T>
+int OPimSortVector<T>::compareItems( QCollection::Item d1, QCollection::Item d2 ) {
+    return compareItems( ((VectorItem*)d1)->item,
+                         ((VectorItem*)d2)->item );
+}
+
+template<class T>
+bool OPimSortVector<T>::sortAscending()const {
+    return m_ascending;
+}
+
+template<class T>
+int OPimSortVector<T>::sortOrder()const {
+    return m_sort;
+}
+
+template<class T>
+bool OPimSortVector<T>::insert( uint i, const T& record ) {
+    VectorItem *item = new VectorItem;
+    item->item = record;
+    return QVector<VectorItem>::insert( i, item );
+}
+
+template<class T>
+UID OPimSortVector<T>::uidAt( uint index )const {
+    return this->at( index )->item.uid();
+}
+
+template<class T>
+inline int OPimSortVector<T>::testString( const QString& left,
+                                          const QString& right )const {
+    return QString::compare( left, right );
+}
+
+template<class T>
+inline int OPimSortVector<T>::testDate( const QDate& left,
+                                        const QDate& right )const {
+    int ret = 0;
+    if ( !left .isValid() ) ret++;
+    if ( !right.isValid() ) ret--;
+
+    if ( left.isValid() && right.isValid() )
+        ret += left < right ? -1 : 1;
+
+    return ret;
+}
+}
+}
+
+#endif