Added old abandoned KDE3 version of koffice

git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/koffice@1077364 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

1 files changed, 87 insertions, 0 deletions

diff --git a/lib/kofficecore/tests/priorityqueue_test.cpp b/lib/kofficecore/tests/priorityqueue_test.cpp
new file mode 100644
index 00000000..d2c7eafd
--- /dev/null
+++ b/lib/kofficecore/tests/priorityqueue_test.cpp
@@ -0,0 +1,87 @@
+/* This file is part of the KDE project
+   Copyright (C) 2001 Werner Trobin <trobin@kde.org>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library 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., 51 Franklin Street, Fifth Floor,
+ * Boston, MA 02110-1301, USA.
+*/
+
+#include <priorityqueue.h>
+#include <kdebug.h>
+#include <qptrlist.h>
+#include <qasciidict.h>
+#include <stdlib.h>
+#include <time.h>
+
+struct Node {
+    Node( unsigned int key ) : m_key( key ), m_index( 0 ) {}
+
+    unsigned int key() const { return m_key; }
+    void setKey( unsigned int key ) { m_key = key; }
+
+    int index() const { return m_index; }
+    void setIndex( int i ) { m_index = i; }
+private:
+    unsigned int m_key;
+    int m_index;
+};
+
+static const char* const keys[] = { "one",  "two", "three",  "four", "five",
+                                    "six", "seven", "eight", "nine", "ten",
+                                    "eleven", "twelve", 0 };
+
+int main( int /*argc*/, char **/*argv*/ )
+{
+    QPtrList<Node> list;
+    list.setAutoDelete( true );
+    QAsciiDict<Node> dict;
+
+    KOffice::PriorityQueue<Node> queue;
+
+    srand( time( 0 ) );
+    for ( int i = 0; i < 12; ++i ) {
+        Node *n = new Node( rand() % 20 );
+        list.append( n );
+        queue.insert( n );
+        // Check whether the AsciiDict CTOR is okay
+        Node *n2 = new Node( *n );
+        dict.insert( keys[ i ], n2 );
+    }
+
+    kdDebug() << "##### Queue 1: " << endl;
+    queue.dump();
+
+    kdDebug() << "##### Queue 2: " << endl;
+    KOffice::PriorityQueue<Node> queue2( dict );
+    queue2.dump();
+
+    Node *n = list.at( 6 );
+    kdDebug() << "##### Decreasing node: " << n->key() << " at " << n->index() << endl;
+    n->setKey( 2 );
+    queue.keyDecreased( n );
+    queue.dump();
+
+    n = list.at( 2 );
+    kdDebug() << "##### Decreasing node: " << n->key() << " at " << n->index() << endl;
+    n->setKey( 0 );
+    queue.keyDecreased( n );
+    queue.dump();
+
+    n = queue.extractMinimum();
+    while ( n ) {
+        queue.dump();
+        n = queue.extractMinimum();
+    }
+    return 0;
+}