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
172
173
174
|
/***************************************************************************
gui_list_helper.h
-------------------
begin : Son Sep 26 2004
copyright : (C) 2004 by Martin Witte
email : witte@kawo1.rwth-aachen.de
***************************************************************************/
/***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#ifndef _KRADIO_LIBKRADIO_GUI_GUI_LIST_HELPER_H_
#define _KRADIO_LIBKRADIO_GUI_GUI_LIST_HELPER_H_
#include <tqmap.h>
#include <tqvaluelist.h>
template <class TLIST> class GUISimpleListHelper
{
public:
GUISimpleListHelper(TLIST *list) : m_List(list) {}
~GUISimpleListHelper() {}
void setData(const TQValueList<TQString> &data);
TQString getCurrentText() const { return m_List->currentText(); }
void setCurrentText(const TQString &s) { m_List->setCurrentItem(m_revData.contains(s) ? m_revData[s] : 0); }
int count() const { return m_revData.count(); }
bool contains(const TQString &id) const { return m_revData.contains(id); }
protected:
TLIST *m_List;
TQMap<TQString, int> m_revData;
};
template <class TLIST>
void GUISimpleListHelper<TLIST>::setData(const TQValueList<TQString> &data)
{
m_List->clear();
m_revData.clear();
TQValueListConstIterator<TQString> it = data.begin();
TQValueListConstIterator<TQString> end = data.end();
for (int i = 0; it != end; ++it, ++i) {
m_revData[*it] = i;
m_List->insertItem(*it);
}
}
template <class TLIST, class TID> class GUIListHelper
{
public:
enum SORT_KEY { SORT_BY_ID, SORT_BY_DESCR };
GUIListHelper(TLIST *list, SORT_KEY skey);
GUIListHelper(TLIST *list, const TQMap<TID, TQString> &data, SORT_KEY skey);
~GUIListHelper();
void setData(const TQMap<TID, TQString> &data);
void setCurrentItem(const TID &) const;
const TID &getCurrentItem() const;
int count() const { return m_Index2ID.count(); }
bool contains(const TID &id) const { return m_ID2Index.contains(id); }
protected:
SORT_KEY m_skey;
TLIST *m_List;
TQMap<int, TID> m_Index2ID;
TQMap<TID, int> m_ID2Index;
TQMap<TID, TQString> m_ID2Description;
struct THelpData {
TID id;
TQString descr;
SORT_KEY skey;
THelpData() : id(), descr(), skey(SORT_BY_ID) {}
THelpData(TID _id, const TQString &_descr, SORT_KEY _skey)
: id(_id),
descr(_descr),
skey(_skey)
{}
bool operator > (const THelpData &d) { return (skey == SORT_BY_ID) ? id > d.id : descr > d.descr; }
bool operator < (const THelpData &d) { return (skey == SORT_BY_ID) ? id < d.id : descr < d.descr; }
};
};
template <class TLIST, class TID>
GUIListHelper<TLIST, TID>::GUIListHelper(TLIST *list, SORT_KEY skey)
: m_skey(skey),
m_List(list)
{
}
template <class TLIST, class TID>
GUIListHelper<TLIST, TID>::GUIListHelper(TLIST *list, const TQMap<TID, TQString> &data, SORT_KEY skey)
: m_skey(skey),
m_List(list)
{
setData(data);
}
template <class TLIST, class TID>
GUIListHelper<TLIST, TID>::~GUIListHelper()
{
}
template <class TLIST, class TID>
void GUIListHelper<TLIST, TID>::setData (const TQMap<TID, TQString> &data)
{
m_List->clear();
m_ID2Description = data;
TQValueList<THelpData> help_list;
TQMapConstIterator<TID, TQString> end = data.end();
for (TQMapConstIterator<TID, TQString> it = data.begin(); it != end; ++it) {
help_list.push_back(THelpData(it.key(), *it, m_skey));
}
qHeapSort(help_list);
m_Index2ID.clear();
m_ID2Index.clear();
int idx = 0;
TQValueListIterator<THelpData> end_hlp = help_list.end();
for (TQValueListIterator<THelpData> it = help_list.begin(); it != end_hlp; ++it, ++idx) {
m_Index2ID.insert(idx, (*it).id);
m_ID2Index.insert((*it).id, idx);
m_List->insertItem((*it).descr);
}
}
template <class TLIST, class TID>
void GUIListHelper<TLIST, TID>::setCurrentItem(const TID &id) const
{
if (m_ID2Index.contains(id))
m_List->setCurrentItem(m_ID2Index[id]);
else
m_List->setCurrentItem(0);
}
template <class TLIST, class TID>
const TID &GUIListHelper<TLIST, TID>::getCurrentItem() const
{
int idx = m_List->currentItem();
return m_Index2ID[idx];
}
#endif
|
