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
|
/***************************************************************************
* Copyright (C) 2006 by Alan Jones *
* skyphyr@gmail.com *
* *
* 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. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "rssfilter.h"
namespace kt
{
FilterMatch::FilterMatch(int season, int episode, TQString link, TQString time)
{
m_season = season;
m_episode = episode;
m_link = link;
m_time = time;
}
FilterMatch::FilterMatch(const FilterMatch &other)
{
*this = other;
}
FilterMatch &FilterMatch::operator=(const FilterMatch &other)
{
if (&other != this)
{
m_season = other.season();
m_episode = other.episode();
m_link = other.link();
m_time = other.time();
}
return *this;
}
bool FilterMatch::operator==(const FilterMatch &other) const
{
return m_link==other.link() && m_season==other.season() && m_episode==other.episode();
}
RssFilter::RssFilter(TQObject * tqparent) : TQObject(tqparent)
{
m_title = "New";
m_active = false;
m_series = false;
m_sansEpisode = false;
m_minSeason = m_minEpisode = m_maxSeason = m_maxEpisode = 0;
}
RssFilter::RssFilter(TQString title, bool active, TQStringList regExps, bool series, bool sansEpisode,
int minSeason, int minEpisode, int maxSeason, int maxEpisode,
TQValueList<FilterMatch> matches)
{
m_title = title;
m_active = active;
m_regExps = regExps;
m_series = series;
m_sansEpisode = sansEpisode;
m_minSeason = minSeason;
m_minEpisode = minEpisode;
m_maxSeason = maxSeason;
m_maxEpisode = maxEpisode;
m_matches = matches;
}
RssFilter::RssFilter(const RssFilter &other) : TQObject()
{
*this = other;
}
RssFilter &RssFilter::operator=(const RssFilter &other)
{
if (&other != this)
{
m_title = other.title();
m_active = other.active();
m_regExps = other.regExps();
m_series = other.series();
m_sansEpisode = other.sansEpisode();
m_minSeason = other.minSeason();
m_minEpisode = other.minEpisode();
m_maxSeason = other.maxSeason();
m_maxEpisode = other.maxEpisode();
m_matches = other.matches();
}
return *this;
}
void RssFilter::setTitle( const TQString& title )
{
if (m_title != title)
{
m_title = title;
emit titleChanged(title);
}
}
void RssFilter::setActive( bool active )
{
if (m_active != active)
{
m_active = active;
emit activeChanged(active);
}
}
void RssFilter::setRegExps( const TQStringList& regExps )
{
if (regExps != m_regExps)
{
m_regExps = regExps;
emit regExpsChanged(regExps);
}
}
void RssFilter::setSeries( bool series )
{
if (m_series != series)
{
m_series = series;
emit seriesChanged(series);
}
}
void RssFilter::setSansEpisode( bool sansEpisode )
{
if (m_sansEpisode != sansEpisode)
{
m_sansEpisode = sansEpisode;
emit sansEpisodeChanged(sansEpisode);
}
}
void RssFilter::setMinSeason( int minSeason )
{
if (m_minSeason != minSeason)
{
m_minSeason = minSeason;
emit minSeasonChanged(minSeason);
}
}
void RssFilter::setMinEpisode( int minEpisode )
{
if (m_minEpisode != minEpisode)
{
m_minEpisode = minEpisode;
emit minEpisodeChanged(minEpisode);
}
}
void RssFilter::setMaxSeason( int maxSeason )
{
if (m_maxSeason != maxSeason)
{
m_maxSeason = maxSeason;
emit maxSeasonChanged(maxSeason);
}
}
void RssFilter::setMaxEpisode( int maxEpisode )
{
if (m_maxEpisode != maxEpisode)
{
m_maxEpisode = maxEpisode;
emit maxEpisodeChanged(maxEpisode);
}
}
void RssFilter::setMatches( const TQValueList<FilterMatch>& matches )
{
if (matches != m_matches)
{
m_matches = matches;
emit matchesChanged(matches);
}
}
bool RssFilter::episodeInRange(int season, int episode, bool ignoreMatches, bool& alreadyDownloaded)
{
if (m_minSeason > 0)
{
if (season < m_minSeason)
{
return false;
}
if (season == m_minSeason && m_minEpisode > 0)
{
if (episode < m_minEpisode)
{
return false;
}
}
}
if (m_maxSeason > 0)
{
if (season > m_maxSeason)
{
return false;
}
if (season == m_maxSeason && m_maxEpisode > 0)
{
if (episode > m_maxEpisode)
{
return false;
}
}
}
for (int i=0; i<m_matches.count(); i++)
{
//if the episode is already in the matches - don't download it
if ((*m_matches.at(i)).season() == season &&(*m_matches.at(i)).episode() == episode)
{
alreadyDownloaded = true;
return !ignoreMatches;
}
}
return true;
}
bool RssFilter::scanArticle( RssArticle article, bool ignoreMatches, bool saveMatch)
{
if (!m_active && saveMatch)
return false;
TQRegExp regEx;
regEx.setCaseSensitive(false);
if (!m_regExps.count())
return false;
for (int i=0; i<m_regExps.count(); i++)
{
if (m_regExps[i].isEmpty())
continue;
TQString curExp = m_regExps[i];
bool invert=false;
if (curExp.startsWith( "!" ))
{
invert=true;
curExp = curExp.remove( 0, 1);
}
regEx.setPattern(curExp);
if (!invert)
{
if (!article.title().tqcontains(regEx) && !article.link().prettyURL().tqcontains(regEx) && !article.description().tqcontains(regEx) )
{
return false;
}
}
else
{
if (article.title().tqcontains(regEx) || article.link().prettyURL().tqcontains(regEx) || article.description().tqcontains(regEx) )
{
return false;
}
}
}
int season = 0, episode = 0;
bool alreadyDownloaded = false;
if (m_series)
{
TQStringList episodeFormats;
episodeFormats << "s([0-9]{1,2})[de]([0-9]{1,2})[^0-9]" << "[^0-9]([0-9]{1,2})x([0-9]{1,2})[^0-9]" << "[^0-9]([0-9]{1,2})([0-9]{2})[^0-9]";
for (int i=0; i<episodeFormats.count(); i++)
{
regEx.setPattern(*episodeFormats.at(i));
if (regEx.search(article.title()) >= 0)
{
season = (*regEx.tqcapturedTexts().at(1)).toInt();
episode = (*regEx.tqcapturedTexts().at(2)).toInt();
if (!episodeInRange(season,episode,ignoreMatches,alreadyDownloaded))
{
return false;
}
break;
}
if (regEx.search(article.link().prettyURL()) >= 0)
{
season = (*regEx.tqcapturedTexts().at(1)).toInt();
episode = (*regEx.tqcapturedTexts().at(2)).toInt();
if (!episodeInRange(season,episode,ignoreMatches,alreadyDownloaded))
{
return false;
}
break;
}
if (regEx.search(article.description()) >= 0)
{
season = (*regEx.tqcapturedTexts().at(1)).toInt();
episode = (*regEx.tqcapturedTexts().at(2)).toInt();
if (!episodeInRange(season,episode,ignoreMatches,alreadyDownloaded))
{
return false;
}
break;
}
}
if (!m_sansEpisode)
{
if (!season && !episode)
{
//no episode number was found and we're not downloading matches without episode numbers
return false;
}
}
}
if (!alreadyDownloaded && saveMatch)
{
FilterMatch newMatch(season, episode, article.link().prettyURL());
m_matches.append(newMatch);
emit matchesChanged(m_matches);
}
return true;
}
void RssFilter::deleteMatch(const TQString& link)
{
TQValueList<FilterMatch>::iterator it = m_matches.begin();
while (it != m_matches.end())
{
if ((*it).link() == link)
{
it = m_matches.remove(it);
}
else
{
it++;
}
}
}
TQDataStream &operator<<( TQDataStream &out, const FilterMatch &filterMatch )
{
out << filterMatch.season() << filterMatch.episode() << filterMatch.time() << filterMatch.link();
return out;
}
TQDataStream &operator>>( TQDataStream &in, FilterMatch &filterMatch )
{
int season, episode;
TQString time;
TQString link;
in >> season >> episode >> time >> link;
filterMatch = FilterMatch(season, episode, link, time);
return in;
}
TQDataStream &operator<<( TQDataStream &out, const RssFilter &filter )
{
out << filter.title() << int(filter.active()) << filter.regExps() << int(filter.series()) << int(filter.sansEpisode()) << filter.minSeason() << filter.minEpisode() << filter.maxSeason() << filter.maxEpisode() << filter.matches();
return out;
}
TQDataStream &operator>>( TQDataStream &in, RssFilter &filter )
{
TQString title;
int active;
TQStringList regExps;
int series;
int sansEpisode;
int minSeason;
int minEpisode;
int maxSeason;
int maxEpisode;
TQValueList<FilterMatch> matches;
in >> title >> active >> regExps >> series >> sansEpisode >> minSeason >> minEpisode >> maxSeason >> maxEpisode >> matches;
filter = RssFilter(title, active, regExps, series, sansEpisode, minSeason, minEpisode, maxSeason, maxEpisode, matches);
return in;
}
RssFilter::~RssFilter()
{
}
}
|