1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
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 <tqptrlist.h>
#include <tqasciidict.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*/ )
{
TQPtrList<Node> list;
list.setAutoDelete( true );
TQAsciiDict<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;
}
|
