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
|
/* smplayer, GUI front-end for mplayer.
Copyright (C) 2006-2018 Ricardo Villalba <rvm@escomposlinux.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.
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "chapters.h"
Chapters::Chapters() {
clear();
}
Chapters::~Chapters() {
}
void Chapters::clear() {
cm.clear();
}
void Chapters::addName(int ID, QString name) {
cm[ID].setName(name);
cm[ID].setID(ID);
}
void Chapters::addStart(int ID, double start) {
cm[ID].setStart(start);
cm[ID].setID(ID);
}
void Chapters::addEnd(int ID, double end) {
cm[ID].setEnd(end);
cm[ID].setID(ID);
}
void Chapters::addID(int ID) {
cm[ID].setID(ID);
}
int Chapters::numItems() {
return cm.count();
}
bool Chapters::existsItemAt(int n) {
return ((n > 0) && (n < numItems()));
}
ChapterData Chapters::itemAt(int n) {
return cm.values()[n];
}
ChapterData Chapters::item(int ID) {
return cm[ID];
}
ChapterData Chapters::itemFromTime(double sec)
{
QMapIterator<int, ChapterData> i(cm);
while(i.hasNext()) {
i.next();
ChapterData d = i.value();
if(d.start() <= sec && d.end() >= sec)
return d;
}
return cm[-1];
}
ChapterData Chapters::itemAfterTime(double sec)
{
QMapIterator<int, ChapterData> i(cm);
int ID = -1;
double min_time = 1.7976931348623158e+308;
while(i.hasNext()) {
i.next();
ChapterData d = i.value();
if(d.start() > sec && d.start() < min_time)
{
ID = d.ID();
min_time = d.start();
}
}
return cm[ID];
}
ChapterData Chapters::itemBeforeTime(double sec)
{
QMapIterator<int, ChapterData> i(cm);
int ID = -1;
double max_time = 0;
while(i.hasNext()) {
i.next();
ChapterData d = i.value();
if(d.end() < sec && d.end() > max_time)
{
ID = d.ID();
max_time = d.end();
}
}
return cm[ID];
}
int Chapters::find(int ID) {
for (int n=0; n < numItems(); n++) {
if (itemAt(n).ID() == ID) return n;
}
return -1;
}
void Chapters::list() {
QMapIterator<int, ChapterData> i(cm);
while (i.hasNext()) {
i.next();
ChapterData d = i.value();
qDebug("Chapters::list: item %d: ID: %d name: '%s' start: %g end: %g",
i.key(), d.ID(), d.name().toUtf8().constData(), d.start(), d.end() );
}
}
|
