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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
/* This file is part of the KDE libraries
Copyright (C) 2001 Carsten Pfeiffer <pfeiffer@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.
*/
#ifndef KSORTABLEVALUELIST_H
#define KSORTABLEVALUELIST_H
#include <tqpair.h>
#include <tqvaluelist.h>
#include "tdelibs_export.h"
/**
* KSortableItem is a TQPair that provides several operators
* for sorting.
* @see KSortableValueList
*/
template<class T, class Key = int> class KSortableItem : public TQPair<Key,T>
{
public:
/**
* Creates a new KSortableItem with the given values.
* @param i the first value
* @param t the second value
*/
KSortableItem( Key i, const T& t ) : TQPair<Key, T>( i, t ) {}
/**
* Creates a new KSortableItem that copies another one.
* @param rhs the other item to copy
*/
KSortableItem( const KSortableItem<T, Key> &rhs )
: TQPair<Key,T>( rhs.first, rhs.second ) {}
/**
* Creates a new KSortableItem with uninitialized values.
*/
KSortableItem() {}
/**
* Assignment operator, just copies the item.
*/
KSortableItem<T, Key> &operator=( const KSortableItem<T, Key>& i ) {
this->first = i.first;
this->second = i.second;
return *this;
}
// operators for sorting
/**
* Compares the two items. This implementation only compares
* the first value.
*/
bool operator> ( const KSortableItem<T, Key>& i2 ) const {
return (i2.first < this->first);
}
/**
* Compares the two items. This implementation only compares
* the first value.
*/
bool operator< ( const KSortableItem<T, Key>& i2 ) const {
return (this->first < i2.first);
}
/**
* Compares the two items. This implementation only compares
* the first value.
*/
bool operator>= ( const KSortableItem<T, Key>& i2 ) const {
return (this->first >= i2.first);
}
/**
* Compares the two items. This implementation only compares
* the first value.
*/
bool operator<= ( const KSortableItem<T, Key>& i2 ) const {
return !(i2.first < this->first);
}
/**
* Compares the two items. This implementation only compares
* the first value.
*/
bool operator== ( const KSortableItem<T, Key>& i2 ) const {
return (this->first == i2.first);
}
/**
* Compares the two items. This implementation only compares
* the first value.
*/
bool operator!= ( const KSortableItem<T, Key>& i2 ) const {
return (this->first != i2.first);
}
/**
* @return the second value
*/
T& value() { return this->second; }
/**
* Returns the second value.
*/
const T& value() const { return this->second; }
/**
* @return the first value.
*/
Key index() const { return this->first; }
};
/**
* KSortableValueList is a special TQValueList for
* KSortableItem. It includes convenience operators
* to get the first value of the KSortableItem and a method
* to sort all items.
*/
template <class T, class Key = int>
class KSortableValueList : public TQValueList<KSortableItem<T, Key> >
{
public:
/**
* Insert a KSortableItem with the given values.
* @param i the first value
* @param t the second value
*/
void insert( Key i, const T& t ) {
TQValueList<KSortableItem<T, Key> >::append( KSortableItem<T, Key>( i, t ) );
}
// add more as you please...
/**
* Returns the first value of the KSortableItem at the given position.
* @return the first value of the KSortableItem
*/
T& operator[]( Key i ) {
return TQValueList<KSortableItem<T, Key> >::operator[]( i ).value();
}
/**
* Returns the first value of the KSortableItem at the given position.
* @return the first value of the KSortableItem
*/
const T& operator[]( Key i ) const {
return TQValueList<KSortableItem<T, Key> >::operator[]( i ).value();
}
/**
* Sorts the KSortableItems.
*/
void sort() {
qHeapSort( *this );
}
};
// template <class T> class KSortableValueListIterator : public TQValueListIterator<KSortableItem<T> >
// {
// };
#endif // KSORTABLEVALUELIST_H
|
