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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
/*
Sonic Visualiser
An audio file viewer and annotation editor.
Centre for Digital Music, Queen Mary, University of London.
This file copyright 2006 QMUL.
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. See the file
COPYING included with this distribution for more information.
*/
#include "SubdividingMenu.h"
#include <iostream>
#include "base/Debug.h"
namespace sv {
using std::set;
using std::map;
//#define DEBUG_SUBDIVIDING_MENU 1
SubdividingMenu::SubdividingMenu(int lowerLimit, int upperLimit,
QWidget *parent) :
QMenu(parent),
m_lowerLimit(lowerLimit ? lowerLimit : 14),
m_upperLimit(upperLimit ? upperLimit : (m_lowerLimit * 5) / 2),
m_entriesSet(false)
{
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu: constructed without title" << endl;
#endif
}
SubdividingMenu::SubdividingMenu(const QString &title, int lowerLimit,
int upperLimit, QWidget *parent) :
QMenu(title, parent),
m_lowerLimit(lowerLimit ? lowerLimit : 14),
m_upperLimit(upperLimit ? upperLimit : (m_lowerLimit * 5) / 2),
m_entriesSet(false)
{
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu: constructed with title \""
<< title << "\"" << endl;
#endif
}
SubdividingMenu::~SubdividingMenu()
{
for (map<QString, QObject *>::iterator i = m_pendingEntries.begin();
i != m_pendingEntries.end(); ++i) {
delete i->second;
}
}
void
SubdividingMenu::setEntries(const std::set<QString> &entries)
{
m_entriesSet = true;
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::setEntries(" << title() << "): "
<< entries.size() << " entries" << endl;
#endif
int total = int(entries.size());
if (total < m_upperLimit) return;
int count = 0;
QMenu *chunkMenu = new QMenu();
chunkMenu->setTearOffEnabled(isTearOffEnabled());
QString firstNameInChunk;
QChar firstInitialInChunk;
bool discriminateStartInitial = false;
// Re-sort using locale-aware comparator
auto comparator = [](QString s1, QString s2) -> bool {
return QString::localeAwareCompare(s1, s2) < 0;
};
set<QString, decltype(comparator)> sortedEntries(comparator);
sortedEntries.insert(entries.begin(), entries.end());
for (auto j = sortedEntries.begin(); j != sortedEntries.end(); ++j) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::setEntries: entry is: " << j->toStdString() << endl;
#endif
m_nameToChunkMenuMap[*j] = chunkMenu;
auto k = j;
++k;
QChar initial = (*j)[0].toUpper();
if (count == 0) {
firstNameInChunk = *j;
firstInitialInChunk = initial;
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "starting new chunk at initial " << initial << endl;
#endif
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "count = "<< count << ", upper limit = " << m_upperLimit << endl;
#endif
bool lastInChunk = (k == sortedEntries.end() ||
(count >= m_lowerLimit-1 &&
(count == m_upperLimit ||
(*k)[0].toUpper() != initial)));
++count;
if (lastInChunk) {
bool discriminateEndInitial = (k != sortedEntries.end() &&
(*k)[0].toUpper() == initial);
bool initialsEqual = (firstInitialInChunk == initial);
QString from = QString("%1").arg(firstInitialInChunk);
if (discriminateStartInitial ||
(discriminateEndInitial && initialsEqual)) {
from = firstNameInChunk.left(3);
}
QString to = QString("%1").arg(initial);
if (discriminateEndInitial ||
(discriminateStartInitial && initialsEqual)) {
to = j->left(3);
}
QString menuText;
if (from == to) menuText = from;
else menuText = tr("%1 - %2").arg(from).arg(to);
discriminateStartInitial = discriminateEndInitial;
chunkMenu->setTitle(menuText);
QMenu::addMenu(chunkMenu);
chunkMenu = new QMenu();
chunkMenu->setTearOffEnabled(isTearOffEnabled());
count = 0;
}
}
if (count == 0) delete chunkMenu;
}
void
SubdividingMenu::entriesAdded()
{
if (m_entriesSet) {
SVCERR << "ERROR: SubdividingMenu::entriesAdded: setEntries was also called -- should use one mechanism or the other, but not both" << endl;
return;
}
set<QString> entries;
for (auto i: m_pendingEntries) {
entries.insert(i.first);
}
setEntries(entries);
// Re-sort using locale-aware comparator (setEntries will do this
// again, for the set passed to it, but we need the same sorting
// for the subsequent loop in this function as well)
auto comparator = [](QString s1, QString s2) -> bool {
return QString::localeAwareCompare(s1, s2) < 0;
};
set<QString, decltype(comparator)> sortedEntries(comparator);
for (auto i: m_pendingEntries) {
sortedEntries.insert(i.first);
}
for (QString entry: sortedEntries) {
QObject *obj = m_pendingEntries[entry];
QMenu *menu = dynamic_cast<QMenu *>(obj);
if (menu) {
addMenu(entry, menu);
continue;
}
QAction *action = dynamic_cast<QAction *>(obj);
if (action) {
addAction(entry, action);
continue;
}
}
m_pendingEntries.clear();
}
void
SubdividingMenu::addAction(QAction *action)
{
QString name = action->text();
if (!m_entriesSet) {
m_pendingEntries[name] = action;
return;
}
if (m_nameToChunkMenuMap.find(name) == m_nameToChunkMenuMap.end()) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addAction(" << title() << " | " << name << "): not found in name-to-chunk map, adding to main menu" << endl;
#endif
QMenu::addAction(action);
return;
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addAction(" << title() << " | " << name << "): found in name-to-chunk map for menu " << m_nameToChunkMenuMap[name]->title() << endl;
#endif
m_nameToChunkMenuMap[name]->addAction(action);
}
QAction *
SubdividingMenu::addAction(const QString &name)
{
if (!m_entriesSet) {
QAction *action = new QAction(name, this);
m_pendingEntries[name] = action;
return action;
}
if (m_nameToChunkMenuMap.find(name) == m_nameToChunkMenuMap.end()) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addAction(" << title() << " | " << name << "): not found in name-to-chunk map, adding to main menu" << endl;
#endif
return QMenu::addAction(name);
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addAction(" << title() << " | " << name << "): found in name-to-chunk map for menu " << m_nameToChunkMenuMap[name]->title() << endl;
#endif
return m_nameToChunkMenuMap[name]->addAction(name);
}
void
SubdividingMenu::addAction(const QString &name, QAction *action)
{
if (!m_entriesSet) {
m_pendingEntries[name] = action;
return;
}
if (m_nameToChunkMenuMap.find(name) == m_nameToChunkMenuMap.end()) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addAction(" << title() << " | " << name << "): not found in name-to-chunk map, adding to main menu" << endl;
#endif
QMenu::addAction(action);
return;
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addAction(" << title() << " | " << name << "): found in name-to-chunk map for menu " << m_nameToChunkMenuMap[name]->title() << endl;
#endif
m_nameToChunkMenuMap[name]->addAction(action);
}
void
SubdividingMenu::addMenu(QMenu *menu)
{
QString name = menu->title();
if (!m_entriesSet) {
m_pendingEntries[name] = menu;
return;
}
if (m_nameToChunkMenuMap.find(name) == m_nameToChunkMenuMap.end()) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addMenu(" << title() << " | " << name << "): not found in name-to-chunk map, adding to main menu" << endl;
#endif
QMenu::addMenu(menu);
return;
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addMenu(" << title() << " | " << name << "): found in name-to-chunk map for menu " << m_nameToChunkMenuMap[name]->title() << endl;
#endif
m_nameToChunkMenuMap[name]->addMenu(menu);
}
QMenu *
SubdividingMenu::addMenu(const QString &name)
{
if (!m_entriesSet) {
QMenu *menu = new QMenu(name, this);
menu->setTearOffEnabled(isTearOffEnabled());
m_pendingEntries[name] = menu;
return menu;
}
if (m_nameToChunkMenuMap.find(name) == m_nameToChunkMenuMap.end()) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addMenu(" << title() << " | " << name << "): not found in name-to-chunk map, adding to main menu" << endl;
#endif
return QMenu::addMenu(name);
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addMenu(" << title() << " | " << name << "): found in name-to-chunk map for menu " << m_nameToChunkMenuMap[name]->title() << endl;
#endif
return m_nameToChunkMenuMap[name]->addMenu(name);
}
void
SubdividingMenu::addMenu(const QString &name, QMenu *menu)
{
if (!m_entriesSet) {
m_pendingEntries[name] = menu;
return;
}
if (m_nameToChunkMenuMap.find(name) == m_nameToChunkMenuMap.end()) {
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addMenu(" << title() << " | " << name << "): not found in name-to-chunk map, adding to main menu" << endl;
#endif
QMenu::addMenu(menu);
return;
}
#ifdef DEBUG_SUBDIVIDING_MENU
cerr << "SubdividingMenu::addMenu(" << title() << " | " << name << "): found in name-to-chunk map for menu " << m_nameToChunkMenuMap[name]->title() << endl;
#endif
m_nameToChunkMenuMap[name]->addMenu(menu);
}
} // end namespace sv
|
