blob: b4af11418b214f197a815aa91229dc03d898b049 (
plain)
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
|
// Copyright (c) 2003 Charles Samuels <charles@kde.org>
// See the file COPYING for redistribution terms.
#include "tree.h"
#include "selector.h"
#include "oblique.h"
#include <noatun/app.h>
#include <noatun/player.h>
Item::Item(const File &file)
: mFile(file)
{
}
TQString Item::property(const TQString &key, const TQString &def) const
{
if (key == "url")
{
KURL url;
url.setPath(property("file"));
return url.url();
}
TQString str = mFile.property(key);
if (str.isNull()) return def;
return str;
}
void Item::setProperty(const TQString &key, const TQString &property)
{
mFile.setProperty(key, property);
}
void Item::clearProperty(const TQString &key)
{
mFile.clearProperty(key);
}
TQStringList Item::properties() const
{
return mFile.properties();
}
bool Item::isProperty(const TQString &key) const
{
return !mFile.property(key).isNull();
}
bool Item::operator==(const PlaylistItemData &d) const
{
return mFile == static_cast<const Item&>(d).mFile;
}
void Item::remove()
{
mFile.remove();
}
Selector::Selector()
{
}
Selector::~Selector()
{
}
SequentialSelector::SequentialSelector(Tree *tree)
{
mTree = tree;
}
SequentialSelector::~SequentialSelector()
{
}
Item *SequentialSelector::next()
{
TreeItem *current = mTree->current();
if (current)
{
current = current->nextPlayable();
}
else
{
current = mTree->firstChild();
if (current && !current->playable())
{
current = current->nextPlayable();
}
}
setCurrent(current);
if (current && current->file())
return new Item(current->file());
return 0;
}
Item *SequentialSelector::previous()
{
TreeItem *back = mTree->firstChild();
TreeItem *after;
TreeItem *current = mTree->current();
// now we just go forward on back until the item after back is me ;)
// this is terribly unoptimized, but I'm terribly lazy
while (back and (after = back->nextPlayable()) != current)
{
back = after;
}
current = back;
setCurrent(current);
if (current && current->file())
return new Item(current->file());
return 0;
}
Item *SequentialSelector::current()
{
TreeItem *current = mTree->current();
if (!current) return next();
if (current->file())
return new Item(current->file());
return 0;
}
void SequentialSelector::setCurrent(const Item &item)
{
TreeItem *current = mTree->find(item.itemFile());
setCurrent(current);
}
void SequentialSelector::setCurrent(TreeItem *current)
{
if (current)
{
mTree->setCurrent(current);
}
}
RandomSelector::RandomSelector(Tree *tree)
{
mTree = tree;
mPrevious = 0;
}
static TreeItem *randomItem(int &at, TreeItem *item)
{
for ( ; item; item = item->nextSibling())
{
if (item->playable())
{
if (at==0)
return item;
at--;
}
if (TreeItem *i = randomItem(at, item->firstChild()))
{
return i;
}
}
return 0;
}
Item *RandomSelector::next()
{
TreeItem *previous = mTree->current();
if (!mTree->playableItemCount())
{
return 0;
}
for (int tries=15; tries; tries--)
{
int randomIndex = TDEApplication::random() % (mTree->playableItemCount());
TreeItem *nowCurrent = randomItem(randomIndex, mTree->firstChild());
if (!nowCurrent) continue;
setCurrent(nowCurrent, previous);
return new Item(nowCurrent->file());
}
// !!!!
return 0;
}
Item *RandomSelector::previous()
{
if (!mPrevious) return 0;
TreeItem *current = mPrevious;
mTree->setCurrent(current);
return new Item(current->file());
}
Item *RandomSelector::current()
{
TreeItem *current = mTree->current();
if (!current) return 0;
return new Item(current->file());
}
void RandomSelector::setCurrent(const Item &item)
{
setCurrent(mTree->find(item.itemFile()), 0);
}
void RandomSelector::setCurrent(TreeItem *item, TreeItem *previous)
{
mPrevious = previous;
mTree->setCurrent(item);
napp->player()->stop();
napp->player()->play();
}
|
