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
|
/* -*- 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-2008 Chris Cannam and 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.
*/
#ifndef _INTERVAL_MODEL_H_
#define _INTERVAL_MODEL_H_
#include "SparseValueModel.h"
#include "base/RealTime.h"
/**
* Model containing sparse data (points with some properties) of which
* the properties include a duration and an arbitrary float value.
* The other properties depend on the point type.
*/
template <typename PointType>
class IntervalModel : public SparseValueModel<PointType>
{
public:
IntervalModel(sv_samplerate_t sampleRate, int resolution,
bool notifyOnAdd = true) :
SparseValueModel<PointType>(sampleRate, resolution, notifyOnAdd)
{ }
IntervalModel(sv_samplerate_t sampleRate, int resolution,
float valueMinimum, float valueMaximum,
bool notifyOnAdd = true) :
SparseValueModel<PointType>(sampleRate, resolution,
valueMinimum, valueMaximum,
notifyOnAdd)
{ }
/**
* PointTypes have a duration, so this returns all points that span any
* of the given range (as well as the usual additional few before
* and after). Consequently this can be very slow (optimised data
* structures still to be done!).
*/
virtual typename SparseValueModel<PointType>::PointList getPoints(sv_frame_t start, sv_frame_t end) const;
/**
* PointTypes have a duration, so this returns all points that span the
* given frame. Consequently this can be very slow (optimised
* data structures still to be done!).
*/
virtual typename SparseValueModel<PointType>::PointList getPoints(sv_frame_t frame) const;
virtual const typename SparseModel<PointType>::PointList &getPoints() const {
return SparseModel<PointType>::getPoints();
}
/**
* TabularModel methods.
*/
virtual QVariant getData(int row, int column, int role) const
{
if (column < 2) {
return SparseValueModel<PointType>::getData
(row, column, role);
}
typename SparseModel<PointType>::PointList::const_iterator i
= SparseModel<PointType>::getPointListIteratorForRow(row);
if (i == SparseModel<PointType>::m_points.end()) return QVariant();
switch (column) {
case 2:
if (role == Qt::EditRole || role == TabularModel::SortRole) return i->value;
else return QString("%1 %2").arg(i->value).arg
(IntervalModel<PointType>::getScaleUnits());
case 3: return int(i->duration); //!!! could be better presented
default: return QVariant();
}
}
virtual Command *getSetDataCommand(int row, int column, const QVariant &value, int role)
{
typedef IntervalModel<PointType> I;
if (column < 2) {
return SparseValueModel<PointType>::getSetDataCommand
(row, column, value, role);
}
if (role != Qt::EditRole) return 0;
typename I::PointList::const_iterator i
= I::getPointListIteratorForRow(row);
if (i == I::m_points.end()) return 0;
typename I::EditCommand *command = new typename I::EditCommand
(this, I::tr("Edit Data"));
PointType point(*i);
command->deletePoint(point);
switch (column) {
// column cannot be 0 or 1, those cases were handled above
case 2: point.value = float(value.toDouble()); break;
case 3: point.duration = value.toInt(); break;
}
command->addPoint(point);
return command->finish();
}
virtual bool isColumnTimeValue(int column) const
{
// NB duration is not a "time value" -- that's for columns
// whose sort ordering is exactly that of the frame time
return (column < 2);
}
};
template <typename PointType>
typename SparseValueModel<PointType>::PointList
IntervalModel<PointType>::getPoints(sv_frame_t start, sv_frame_t end) const
{
typedef IntervalModel<PointType> I;
if (start > end) return typename I::PointList();
QMutex &mutex(I::m_mutex);
QMutexLocker locker(&mutex);
PointType endPoint(end);
typename I::PointListConstIterator endItr = I::m_points.upper_bound(endPoint);
if (endItr != I::m_points.end()) ++endItr;
if (endItr != I::m_points.end()) ++endItr;
typename I::PointList rv;
for (typename I::PointListConstIterator i = endItr; i != I::m_points.begin(); ) {
--i;
if (i->frame < start) {
if (i->frame + i->duration >= start) {
rv.insert(*i);
}
} else if (i->frame <= end) {
rv.insert(*i);
}
}
return rv;
}
template <typename PointType>
typename SparseValueModel<PointType>::PointList
IntervalModel<PointType>::getPoints(sv_frame_t frame) const
{
typedef IntervalModel<PointType> I;
QMutex &mutex(I::m_mutex);
QMutexLocker locker(&mutex);
if (I::m_resolution == 0) return typename I::PointList();
sv_frame_t start = (frame / I::m_resolution) * I::m_resolution;
sv_frame_t end = start + I::m_resolution;
PointType endPoint(end);
typename I::PointListConstIterator endItr = I::m_points.upper_bound(endPoint);
typename I::PointList rv;
for (typename I::PointListConstIterator i = endItr; i != I::m_points.begin(); ) {
--i;
if (i->frame < start) {
if (i->frame + i->duration >= start) {
rv.insert(*i);
}
} else if (i->frame <= end) {
rv.insert(*i);
}
}
return rv;
}
#endif
|
