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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
|
/***************************************************************************
begin : Sun Feb 17 2002
copyright : (C) 2002 - 2004 by Scott Wheeler
email : wheeler@kde.org
***************************************************************************/
/***************************************************************************
* *
* 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. *
* *
***************************************************************************/
#include <config.h>
#include <kdebug.h>
#include <kaction.h>
#include <kiconloader.h>
#include "playlistitem.h"
#include "collectionlist.h"
#include "musicbrainzquery.h"
#include "tag.h"
#include "actioncollection.h"
#include "ktrm.h"
#include "coverinfo.h"
#include "tagtransactionmanager.h"
PlaylistItemList PlaylistItem::m_playingItems; // static
static void startMusicBrainzQuery(const FileHandle &file)
{
#if HAVE_MUSICBRAINZ
// This deletes itself when finished.
new MusicBrainzLookup(file);
#else
Q_UNUSED(file)
#endif
}
////////////////////////////////////////////////////////////////////////////////
// PlaylistItem public methods
////////////////////////////////////////////////////////////////////////////////
PlaylistItem::~PlaylistItem()
{
// Although this isn't the most efficient way to accomplish the task of
// stopping playback when deleting the item being played, it has the
// stark advantage of working reliably. I'll tell anyone who tries to
// optimize this, the timing issues can be *hard*. -- mpyne
m_collectionItem->removeChildItem(this);
if(m_playingItems.find(this) != m_playingItems.end()) {
m_playingItems.remove(this);
if(m_playingItems.isEmpty())
playlist()->setPlaying(0);
}
if(m_watched)
Pointer::clear(this);
}
void PlaylistItem::setFile(const FileHandle &file)
{
m_collectionItem->updateCollectionDict(d->fileHandle.absFilePath(), file.absFilePath());
d->fileHandle = file;
refresh();
}
void PlaylistItem::setFile(const TQString &file)
{
TQString oldPath = d->fileHandle.absFilePath();
d->fileHandle.setFile(file);
m_collectionItem->updateCollectionDict(oldPath, d->fileHandle.absFilePath());
refresh();
}
FileHandle PlaylistItem::file() const
{
return d->fileHandle;
}
const TQPixmap *PlaylistItem::pixmap(int column) const
{
static TQPixmap image(SmallIcon("image"));
static TQPixmap playing(UserIcon("playing"));
int offset = playlist()->columnOffset();
if((column - offset) == CoverColumn && d->fileHandle.coverInfo()->hasCover())
return ℑ
if(column == playlist()->leftColumn() &&
m_playingItems.contains(const_cast<PlaylistItem *>(this)))
return &playing;
return KListViewItem::pixmap(column);
}
TQString PlaylistItem::text(int column) const
{
if(!d->fileHandle.tag())
return TQString();
int offset = playlist()->columnOffset();
switch(column - offset) {
case TrackColumn:
return d->fileHandle.tag()->title();
case ArtistColumn:
return d->fileHandle.tag()->artist();
case AlbumColumn:
return d->fileHandle.tag()->album();
case CoverColumn:
return TQString();
case TrackNumberColumn:
return d->fileHandle.tag()->track() > 0
? TQString::number(d->fileHandle.tag()->track())
: TQString();
case GenreColumn:
return d->fileHandle.tag()->genre();
case YearColumn:
return d->fileHandle.tag()->year() > 0
? TQString::number(d->fileHandle.tag()->year())
: TQString();
case LengthColumn:
return d->fileHandle.tag()->lengthString();
case BitrateColumn:
return TQString::number(d->fileHandle.tag()->bitrate());
case CommentColumn:
return d->fileHandle.tag()->comment();
case FileNameColumn:
return d->fileHandle.fileInfo().fileName();
case FullPathColumn:
return d->fileHandle.fileInfo().absFilePath();
default:
return KListViewItem::text(column);
}
}
void PlaylistItem::setText(int column, const TQString &text)
{
int offset = playlist()->columnOffset();
if(column - offset >= 0 && column + offset <= lastColumn()) {
KListViewItem::setText(column, TQString());
return;
}
KListViewItem::setText(column, text);
playlist()->slotWeightDirty(column);
}
void PlaylistItem::setPlaying(bool playing, bool master)
{
m_playingItems.remove(this);
if(playing) {
if(master)
m_playingItems.prepend(this);
else
m_playingItems.append(this);
}
else {
// This is a tricky little recursion, but it
// in fact does clear the list.
if(!m_playingItems.isEmpty())
m_playingItems.front()->setPlaying(false);
}
listView()->triggerUpdate();
}
void PlaylistItem::setSelected(bool selected)
{
playlist()->markItemSelected(this, selected);
KListViewItem::setSelected(selected);
}
void PlaylistItem::guessTagInfo(TagGuesser::Type type)
{
switch(type) {
case TagGuesser::FileName:
{
TagGuesser guesser(d->fileHandle.absFilePath());
Tag *tag = TagTransactionManager::duplicateTag(d->fileHandle.tag());
if(!guesser.title().isNull())
tag->setTitle(guesser.title());
if(!guesser.artist().isNull())
tag->setArtist(guesser.artist());
if(!guesser.album().isNull())
tag->setAlbum(guesser.album());
if(!guesser.track().isNull())
tag->setTrack(guesser.track().toInt());
if(!guesser.comment().isNull())
tag->setComment(guesser.comment());
TagTransactionManager::instance()->changeTagOnItem(this, tag);
break;
}
case TagGuesser::MusicBrainz:
startMusicBrainzQuery(d->fileHandle);
break;
}
}
Playlist *PlaylistItem::playlist() const
{
return static_cast<Playlist *>(listView());
}
TQValueVector<int> PlaylistItem::cachedWidths() const
{
return d->cachedWidths;
}
void PlaylistItem::refresh()
{
m_collectionItem->refresh();
}
void PlaylistItem::refreshFromDisk()
{
d->fileHandle.refresh();
refresh();
}
void PlaylistItem::clear()
{
playlist()->clearItem(this);
}
////////////////////////////////////////////////////////////////////////////////
// PlaylistItem protected methods
////////////////////////////////////////////////////////////////////////////////
PlaylistItem::PlaylistItem(CollectionListItem *item, Playlist *parent) :
KListViewItem(parent),
d(0),
m_watched(0)
{
setup(item);
}
PlaylistItem::PlaylistItem(CollectionListItem *item, Playlist *parent, TQListViewItem *after) :
KListViewItem(parent, after),
d(0),
m_watched(0)
{
setup(item);
}
// This constructor should only be used by the CollectionList subclass.
PlaylistItem::PlaylistItem(CollectionList *parent) :
KListViewItem(parent),
m_watched(0)
{
d = new Data;
m_collectionItem = static_cast<CollectionListItem *>(this);
setDragEnabled(true);
}
void PlaylistItem::paintCell(TQPainter *p, const TQColorGroup &cg, int column, int width, int align)
{
if(!m_playingItems.contains(this))
return KListViewItem::paintCell(p, cg, column, width, align);
TQColorGroup tqcolorGroup = cg;
TQColor base = tqcolorGroup.base();
TQColor selection = tqcolorGroup.highlight();
int r = (base.red() + selection.red()) / 2;
int b = (base.blue() + selection.blue()) / 2;
int g = (base.green() + selection.green()) / 2;
TQColor c(r, g, b);
tqcolorGroup.setColor(TQColorGroup::Base, c);
TQListViewItem::paintCell(p, tqcolorGroup, column, width, align);
}
int PlaylistItem::compare(TQListViewItem *item, int column, bool ascending) const
{
// reimplemented from TQListViewItem
int offset = playlist()->columnOffset();
if(!item)
return 0;
PlaylistItem *playlistItem = static_cast<PlaylistItem *>(item);
// The following statments first check to see if you can sort based on the
// specified column. If the values for the two PlaylistItems are the same
// in that column it then trys to sort based on columns 1, 2, 3 and 0,
// (artist, album, track number, track name) in that order.
int c = compare(this, playlistItem, column, ascending);
if(c != 0)
return c;
else {
// Loop through the columns doing comparisons until something is differnt.
// If all else is the same, compare the track name.
int last = playlist()->isColumnVisible(AlbumColumn + offset) ? TrackNumberColumn : ArtistColumn;
for(int i = ArtistColumn; i <= last; i++) {
if(playlist()->isColumnVisible(i + offset)) {
c = compare(this, playlistItem, i, ascending);
if(c != 0)
return c;
}
}
return compare(this, playlistItem, TrackColumn + offset, ascending);
}
}
int PlaylistItem::compare(const PlaylistItem *firstItem, const PlaylistItem *secondItem, int column, bool) const
{
int offset = playlist()->columnOffset();
if(column < 0 || column > lastColumn() + offset)
return 0;
if(column < offset) {
TQString first = firstItem->text(column).lower();
TQString second = secondItem->text(column).lower();
return first.localeAwareCompare(second);
}
switch(column - offset) {
case TrackNumberColumn:
if(firstItem->d->fileHandle.tag()->track() > secondItem->d->fileHandle.tag()->track())
return 1;
else if(firstItem->d->fileHandle.tag()->track() < secondItem->d->fileHandle.tag()->track())
return -1;
else
return 0;
break;
case LengthColumn:
if(firstItem->d->fileHandle.tag()->seconds() > secondItem->d->fileHandle.tag()->seconds())
return 1;
else if(firstItem->d->fileHandle.tag()->seconds() < secondItem->d->fileHandle.tag()->seconds())
return -1;
else
return 0;
break;
case BitrateColumn:
if(firstItem->d->fileHandle.tag()->bitrate() > secondItem->d->fileHandle.tag()->bitrate())
return 1;
else if(firstItem->d->fileHandle.tag()->bitrate() < secondItem->d->fileHandle.tag()->bitrate())
return -1;
else
return 0;
break;
case CoverColumn:
if(firstItem->d->fileHandle.coverInfo()->hasCover() == secondItem->d->fileHandle.coverInfo()->hasCover())
return 0;
else if (firstItem->d->fileHandle.coverInfo()->hasCover())
return -1;
else
return 1;
break;
default:
return strcoll(firstItem->d->local8Bit[column - offset],
secondItem->d->local8Bit[column - offset]);
}
}
bool PlaylistItem::isValid() const
{
return bool(d->fileHandle.tag());
}
////////////////////////////////////////////////////////////////////////////////
// PlaylistItem private methods
////////////////////////////////////////////////////////////////////////////////
void PlaylistItem::setup(CollectionListItem *item)
{
m_collectionItem = item;
d = item->d;
item->addChildItem(this);
setDragEnabled(true);
}
////////////////////////////////////////////////////////////////////////////////
// PlaylistItem::Pointer implementation
////////////////////////////////////////////////////////////////////////////////
TQMap<PlaylistItem *, TQValueList<PlaylistItem::Pointer *> > PlaylistItem::Pointer::m_map; // static
PlaylistItem::Pointer::Pointer(PlaylistItem *item) :
m_item(item)
{
if(!m_item)
return;
m_item->m_watched = true;
m_map[m_item].append(this);
}
PlaylistItem::Pointer::Pointer(const Pointer &p) :
m_item(p.m_item)
{
m_map[m_item].append(this);
}
PlaylistItem::Pointer::~Pointer()
{
if(!m_item)
return;
m_map[m_item].remove(this);
if(m_map[m_item].isEmpty()) {
m_map.remove(m_item);
m_item->m_watched = false;
}
}
PlaylistItem::Pointer &PlaylistItem::Pointer::operator=(PlaylistItem *item)
{
if(item == m_item)
return *this;
if(m_item) {
m_map[m_item].remove(this);
if(m_map[m_item].isEmpty()) {
m_map.remove(m_item);
m_item->m_watched = false;
}
}
if(item) {
m_map[item].append(this);
item->m_watched = true;
}
m_item = item;
return *this;
}
void PlaylistItem::Pointer::clear(PlaylistItem *item) // static
{
if(!item)
return;
TQValueList<Pointer *> l = m_map[item];
for(TQValueList<Pointer *>::Iterator it = l.begin(); it != l.end(); ++it)
(*it)->m_item = 0;
m_map.remove(item);
item->m_watched = false;
}
|