Chris@147
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
Chris@147
|
2
|
Chris@147
|
3 /*
|
Chris@147
|
4 Sonic Visualiser
|
Chris@147
|
5 An audio file viewer and annotation editor.
|
Chris@147
|
6 Centre for Digital Music, Queen Mary, University of London.
|
Chris@147
|
7 This file copyright 2006 Chris Cannam.
|
Chris@147
|
8
|
Chris@147
|
9 This program is free software; you can redistribute it and/or
|
Chris@147
|
10 modify it under the terms of the GNU General Public License as
|
Chris@147
|
11 published by the Free Software Foundation; either version 2 of the
|
Chris@147
|
12 License, or (at your option) any later version. See the file
|
Chris@147
|
13 COPYING included with this distribution for more information.
|
Chris@147
|
14 */
|
Chris@147
|
15
|
Chris@147
|
16 #ifndef _SPARSE_MODEL_H_
|
Chris@147
|
17 #define _SPARSE_MODEL_H_
|
Chris@147
|
18
|
Chris@150
|
19 #include "Model.h"
|
Chris@420
|
20 #include "TabularModel.h"
|
Chris@147
|
21 #include "base/Command.h"
|
Chris@425
|
22 #include "base/RealTime.h"
|
Chris@1218
|
23 #include "system/System.h"
|
Chris@147
|
24
|
Chris@147
|
25 #include <iostream>
|
Chris@147
|
26
|
Chris@147
|
27 #include <set>
|
Chris@420
|
28 #include <vector>
|
Chris@420
|
29 #include <algorithm>
|
Chris@608
|
30 #include <iterator>
|
Chris@420
|
31
|
Chris@425
|
32 #include <cmath>
|
Chris@425
|
33
|
Chris@147
|
34 #include <QMutex>
|
Chris@147
|
35 #include <QTextStream>
|
Chris@147
|
36
|
Chris@147
|
37 /**
|
Chris@147
|
38 * Model containing sparse data (points with some properties). The
|
Chris@147
|
39 * properties depend on the point type.
|
Chris@147
|
40 */
|
Chris@147
|
41
|
Chris@147
|
42 template <typename PointType>
|
Chris@420
|
43 class SparseModel : public Model,
|
Chris@420
|
44 public TabularModel
|
Chris@147
|
45 {
|
Chris@147
|
46 public:
|
Chris@1040
|
47 SparseModel(sv_samplerate_t sampleRate, int resolution,
|
Chris@1429
|
48 bool notifyOnAdd = true);
|
Chris@147
|
49 virtual ~SparseModel() { }
|
Chris@147
|
50
|
Chris@147
|
51 virtual bool isOK() const { return true; }
|
Chris@1038
|
52 virtual sv_frame_t getStartFrame() const;
|
Chris@1038
|
53 virtual sv_frame_t getEndFrame() const;
|
Chris@1040
|
54 virtual sv_samplerate_t getSampleRate() const { return m_sampleRate; }
|
Chris@147
|
55
|
Chris@147
|
56 // Number of frames of the underlying sample rate that this model
|
Chris@147
|
57 // is capable of resolving to. For example, if m_resolution == 10
|
Chris@147
|
58 // then every point in this model will be at a multiple of 10
|
Chris@147
|
59 // sample frames and should be considered to cover a window ending
|
Chris@147
|
60 // 10 sample frames later.
|
Chris@929
|
61 virtual int getResolution() const {
|
Chris@147
|
62 return m_resolution ? m_resolution : 1;
|
Chris@147
|
63 }
|
Chris@929
|
64 virtual void setResolution(int resolution);
|
Chris@1066
|
65
|
Chris@147
|
66 typedef PointType Point;
|
Chris@147
|
67 typedef std::multiset<PointType,
|
Chris@1429
|
68 typename PointType::OrderComparator> PointList;
|
Chris@147
|
69 typedef typename PointList::iterator PointListIterator;
|
Chris@606
|
70 typedef typename PointList::const_iterator PointListConstIterator;
|
Chris@147
|
71
|
Chris@147
|
72 /**
|
Chris@147
|
73 * Return whether the model is empty or not.
|
Chris@147
|
74 */
|
Chris@147
|
75 virtual bool isEmpty() const;
|
Chris@147
|
76
|
Chris@147
|
77 /**
|
Chris@147
|
78 * Get the total number of points in the model.
|
Chris@147
|
79 */
|
Chris@929
|
80 virtual int getPointCount() const;
|
Chris@147
|
81
|
Chris@147
|
82 /**
|
Chris@459
|
83 * Get all points.
|
Chris@459
|
84 */
|
Chris@459
|
85 virtual const PointList &getPoints() const;
|
Chris@459
|
86
|
Chris@459
|
87 /**
|
Chris@147
|
88 * Get all of the points in this model between the given
|
Chris@147
|
89 * boundaries (in frames), as well as up to two points before and
|
Chris@147
|
90 * after the boundaries. If you need exact boundaries, check the
|
Chris@147
|
91 * point coordinates in the returned list.
|
Chris@147
|
92 */
|
Chris@1038
|
93 virtual PointList getPoints(sv_frame_t start, sv_frame_t end) const;
|
Chris@147
|
94
|
Chris@147
|
95 /**
|
Chris@147
|
96 * Get all points that cover the given frame number, taking the
|
Chris@147
|
97 * resolution of the model into account.
|
Chris@147
|
98 */
|
Chris@1038
|
99 virtual PointList getPoints(sv_frame_t frame) const;
|
Chris@147
|
100
|
Chris@147
|
101 /**
|
Chris@147
|
102 * Return all points that share the nearest frame number prior to
|
Chris@147
|
103 * the given one at which there are any points.
|
Chris@147
|
104 */
|
Chris@1038
|
105 virtual PointList getPreviousPoints(sv_frame_t frame) const;
|
Chris@147
|
106
|
Chris@147
|
107 /**
|
Chris@147
|
108 * Return all points that share the nearest frame number
|
Chris@147
|
109 * subsequent to the given one at which there are any points.
|
Chris@147
|
110 */
|
Chris@1038
|
111 virtual PointList getNextPoints(sv_frame_t frame) const;
|
Chris@147
|
112
|
Chris@147
|
113 /**
|
Chris@147
|
114 * Remove all points.
|
Chris@147
|
115 */
|
Chris@147
|
116 virtual void clear();
|
Chris@147
|
117
|
Chris@147
|
118 /**
|
Chris@147
|
119 * Add a point.
|
Chris@147
|
120 */
|
Chris@147
|
121 virtual void addPoint(const PointType &point);
|
Chris@147
|
122
|
Chris@147
|
123 /**
|
Chris@147
|
124 * Remove a point. Points are not necessarily unique, so this
|
Chris@147
|
125 * function will remove the first point that compares equal to the
|
Chris@147
|
126 * supplied one using Point::Comparator. Other identical points
|
Chris@147
|
127 * may remain in the model.
|
Chris@147
|
128 */
|
Chris@147
|
129 virtual void deletePoint(const PointType &point);
|
Chris@147
|
130
|
Chris@1113
|
131 /**
|
Chris@1113
|
132 * Return true if the given point is found in this model, false
|
Chris@1113
|
133 * otherwise.
|
Chris@1113
|
134 */
|
Chris@1113
|
135 virtual bool containsPoint(const PointType &point);
|
Chris@1113
|
136
|
Chris@297
|
137 virtual bool isReady(int *completion = 0) const {
|
Chris@297
|
138 bool ready = isOK() && (m_completion == 100);
|
Chris@297
|
139 if (completion) *completion = m_completion;
|
Chris@297
|
140 return ready;
|
Chris@297
|
141 }
|
Chris@297
|
142
|
Chris@333
|
143 virtual void setCompletion(int completion, bool update = true);
|
Chris@147
|
144 virtual int getCompletion() const { return m_completion; }
|
Chris@147
|
145
|
Chris@147
|
146 virtual bool hasTextLabels() const { return m_hasTextLabels; }
|
Chris@147
|
147
|
Chris@345
|
148 QString getTypeName() const { return tr("Sparse"); }
|
Chris@345
|
149
|
Chris@407
|
150 virtual QString getXmlOutputType() const { return "sparse"; }
|
Chris@407
|
151
|
Chris@147
|
152 virtual void toXml(QTextStream &out,
|
Chris@147
|
153 QString indent = "",
|
Chris@147
|
154 QString extraAttributes = "") const;
|
Chris@147
|
155
|
Chris@1060
|
156 virtual QString toDelimitedDataString(QString delimiter) const {
|
Chris@1072
|
157 return toDelimitedDataStringWithOptions
|
Chris@1072
|
158 (delimiter, DataExportDefaults);
|
Chris@1060
|
159 }
|
Chris@1060
|
160
|
Chris@1060
|
161 virtual QString toDelimitedDataStringWithOptions(QString delimiter,
|
Chris@1064
|
162 DataExportOptions opts) const {
|
Chris@1064
|
163 return toDelimitedDataStringSubsetWithOptions
|
Chris@1064
|
164 (delimiter, opts,
|
Chris@1451
|
165 std::min(getStartFrame(), sv_frame_t(0)), getEndFrame());
|
Chris@147
|
166 }
|
Chris@147
|
167
|
Chris@1060
|
168 virtual QString toDelimitedDataStringSubset(QString delimiter, sv_frame_t f0, sv_frame_t f1) const {
|
Chris@1072
|
169 return toDelimitedDataStringSubsetWithOptions
|
Chris@1072
|
170 (delimiter, DataExportDefaults, f0, f1);
|
Chris@1060
|
171 }
|
Chris@1060
|
172
|
Chris@1064
|
173 virtual QString toDelimitedDataStringSubsetWithOptions(QString delimiter, DataExportOptions opts, sv_frame_t f0, sv_frame_t f1) const {
|
Chris@1064
|
174 if (opts & DataExportFillGaps) {
|
Chris@1064
|
175 return toDelimitedDataStringSubsetFilled(delimiter, opts, f0, f1);
|
Chris@1064
|
176 } else {
|
Chris@1064
|
177 QString s;
|
Chris@1064
|
178 for (PointListConstIterator i = m_points.begin(); i != m_points.end(); ++i) {
|
Chris@1127
|
179 if (i->frame >= f0 && i->frame < f1) {
|
Chris@1064
|
180 s += i->toDelimitedDataString(delimiter, opts, m_sampleRate) + "\n";
|
Chris@1064
|
181 }
|
Chris@838
|
182 }
|
Chris@1064
|
183 return s;
|
Chris@838
|
184 }
|
Chris@838
|
185 }
|
Chris@838
|
186
|
Chris@147
|
187 /**
|
Chris@147
|
188 * Command to add a point, with undo.
|
Chris@147
|
189 */
|
Chris@147
|
190 class AddPointCommand : public Command
|
Chris@147
|
191 {
|
Chris@147
|
192 public:
|
Chris@1429
|
193 AddPointCommand(SparseModel<PointType> *model,
|
Chris@1429
|
194 const PointType &point,
|
Chris@147
|
195 QString name = "") :
|
Chris@1429
|
196 m_model(model), m_point(point), m_name(name) { }
|
Chris@147
|
197
|
Chris@1429
|
198 virtual QString getName() const {
|
Chris@147
|
199 return (m_name == "" ? tr("Add Point") : m_name);
|
Chris@147
|
200 }
|
Chris@147
|
201
|
Chris@1429
|
202 virtual void execute() { m_model->addPoint(m_point); }
|
Chris@1429
|
203 virtual void unexecute() { m_model->deletePoint(m_point); }
|
Chris@147
|
204
|
Chris@1429
|
205 const PointType &getPoint() const { return m_point; }
|
Chris@147
|
206
|
Chris@147
|
207 private:
|
Chris@1429
|
208 SparseModel<PointType> *m_model;
|
Chris@1429
|
209 PointType m_point;
|
Chris@147
|
210 QString m_name;
|
Chris@147
|
211 };
|
Chris@147
|
212
|
Chris@147
|
213
|
Chris@147
|
214 /**
|
Chris@147
|
215 * Command to remove a point, with undo.
|
Chris@147
|
216 */
|
Chris@147
|
217 class DeletePointCommand : public Command
|
Chris@147
|
218 {
|
Chris@147
|
219 public:
|
Chris@1429
|
220 DeletePointCommand(SparseModel<PointType> *model,
|
Chris@1429
|
221 const PointType &point) :
|
Chris@1429
|
222 m_model(model), m_point(point) { }
|
Chris@147
|
223
|
Chris@1429
|
224 virtual QString getName() const { return tr("Delete Point"); }
|
Chris@147
|
225
|
Chris@1429
|
226 virtual void execute() { m_model->deletePoint(m_point); }
|
Chris@1429
|
227 virtual void unexecute() { m_model->addPoint(m_point); }
|
Chris@147
|
228
|
Chris@1429
|
229 const PointType &getPoint() const { return m_point; }
|
Chris@147
|
230
|
Chris@147
|
231 private:
|
Chris@1429
|
232 SparseModel<PointType> *m_model;
|
Chris@1429
|
233 PointType m_point;
|
Chris@147
|
234 };
|
Chris@147
|
235
|
Chris@147
|
236
|
Chris@147
|
237 /**
|
Chris@147
|
238 * Command to add or remove a series of points, with undo.
|
Chris@147
|
239 * Consecutive add/remove pairs for the same point are collapsed.
|
Chris@147
|
240 */
|
Chris@147
|
241 class EditCommand : public MacroCommand
|
Chris@147
|
242 {
|
Chris@147
|
243 public:
|
Chris@1429
|
244 EditCommand(SparseModel<PointType> *model, QString commandName);
|
Chris@147
|
245
|
Chris@1429
|
246 virtual void addPoint(const PointType &point);
|
Chris@1429
|
247 virtual void deletePoint(const PointType &point);
|
Chris@147
|
248
|
Chris@1429
|
249 /**
|
Chris@1429
|
250 * Stack an arbitrary other command in the same sequence.
|
Chris@1429
|
251 */
|
Chris@1429
|
252 virtual void addCommand(Command *command) { addCommand(command, true); }
|
Chris@147
|
253
|
Chris@1429
|
254 /**
|
Chris@1429
|
255 * If any points have been added or deleted, return this
|
Chris@1429
|
256 * command (so the caller can add it to the command history).
|
Chris@1429
|
257 * Otherwise delete the command and return NULL.
|
Chris@1429
|
258 */
|
Chris@1429
|
259 virtual EditCommand *finish();
|
Chris@147
|
260
|
Chris@147
|
261 protected:
|
Chris@1429
|
262 virtual void addCommand(Command *command, bool executeFirst);
|
Chris@147
|
263
|
Chris@1429
|
264 SparseModel<PointType> *m_model;
|
Chris@147
|
265 };
|
Chris@147
|
266
|
Chris@147
|
267
|
Chris@147
|
268 /**
|
Chris@147
|
269 * Command to relabel a point.
|
Chris@147
|
270 */
|
Chris@147
|
271 class RelabelCommand : public Command
|
Chris@147
|
272 {
|
Chris@147
|
273 public:
|
Chris@1429
|
274 RelabelCommand(SparseModel<PointType> *model,
|
Chris@1429
|
275 const PointType &point,
|
Chris@1429
|
276 QString newLabel) :
|
Chris@1429
|
277 m_model(model), m_oldPoint(point), m_newPoint(point) {
|
Chris@1429
|
278 m_newPoint.label = newLabel;
|
Chris@1429
|
279 }
|
Chris@147
|
280
|
Chris@1429
|
281 virtual QString getName() const { return tr("Re-Label Point"); }
|
Chris@147
|
282
|
Chris@1429
|
283 virtual void execute() {
|
Chris@1429
|
284 m_model->deletePoint(m_oldPoint);
|
Chris@1429
|
285 m_model->addPoint(m_newPoint);
|
Chris@1429
|
286 std::swap(m_oldPoint, m_newPoint);
|
Chris@1429
|
287 }
|
Chris@147
|
288
|
Chris@1429
|
289 virtual void unexecute() { execute(); }
|
Chris@147
|
290
|
Chris@147
|
291 private:
|
Chris@1429
|
292 SparseModel<PointType> *m_model;
|
Chris@1429
|
293 PointType m_oldPoint;
|
Chris@1429
|
294 PointType m_newPoint;
|
Chris@147
|
295 };
|
Chris@147
|
296
|
Chris@420
|
297 /**
|
Chris@420
|
298 * TabularModel methods.
|
Chris@420
|
299 */
|
Chris@420
|
300
|
Chris@420
|
301 virtual int getRowCount() const
|
Chris@420
|
302 {
|
Chris@1038
|
303 return int(m_points.size());
|
Chris@420
|
304 }
|
Chris@420
|
305
|
Chris@1038
|
306 virtual sv_frame_t getFrameForRow(int row) const
|
Chris@420
|
307 {
|
Chris@606
|
308 PointListConstIterator i = getPointListIteratorForRow(row);
|
Chris@420
|
309 if (i == m_points.end()) return 0;
|
Chris@420
|
310 return i->frame;
|
Chris@420
|
311 }
|
Chris@420
|
312
|
Chris@1038
|
313 virtual int getRowForFrame(sv_frame_t frame) const
|
Chris@420
|
314 {
|
Chris@420
|
315 if (m_rows.empty()) rebuildRowVector();
|
Chris@1038
|
316 std::vector<sv_frame_t>::iterator i =
|
Chris@420
|
317 std::lower_bound(m_rows.begin(), m_rows.end(), frame);
|
Chris@1038
|
318 ssize_t row = std::distance(m_rows.begin(), i);
|
Chris@432
|
319 if (i != m_rows.begin() && (i == m_rows.end() || *i != frame)) {
|
Chris@432
|
320 --row;
|
Chris@432
|
321 }
|
Chris@1038
|
322 return int(row);
|
Chris@420
|
323 }
|
Chris@420
|
324
|
Chris@420
|
325 virtual int getColumnCount() const { return 1; }
|
Chris@425
|
326 virtual QVariant getData(int row, int column, int role) const
|
Chris@425
|
327 {
|
Chris@606
|
328 PointListConstIterator i = getPointListIteratorForRow(row);
|
Chris@1254
|
329 if (i == m_points.end()) {
|
Chris@1254
|
330 // cerr << "no iterator for row " << row << " (have " << getRowCount() << " rows)" << endl;
|
Chris@1254
|
331 return QVariant();
|
Chris@1254
|
332 }
|
Chris@425
|
333
|
Chris@1254
|
334 // cerr << "returning data for row " << row << " col " << column << endl;
|
Chris@1254
|
335
|
Chris@425
|
336 switch (column) {
|
Chris@425
|
337 case 0: {
|
Chris@425
|
338 if (role == SortRole) return int(i->frame);
|
Chris@425
|
339 RealTime rt = RealTime::frame2RealTime(i->frame, getSampleRate());
|
Chris@425
|
340 if (role == Qt::EditRole) return rt.toString().c_str();
|
Chris@425
|
341 else return rt.toText().c_str();
|
Chris@425
|
342 }
|
Chris@425
|
343 case 1: return int(i->frame);
|
Chris@425
|
344 }
|
Chris@425
|
345
|
Chris@420
|
346 return QVariant();
|
Chris@420
|
347 }
|
Chris@427
|
348
|
Chris@425
|
349 virtual Command *getSetDataCommand(int row, int column,
|
Chris@425
|
350 const QVariant &value, int role)
|
Chris@425
|
351 {
|
Chris@740
|
352 if (role != Qt::EditRole) return 0;
|
Chris@425
|
353 PointListIterator i = getPointListIteratorForRow(row);
|
Chris@740
|
354 if (i == m_points.end()) return 0;
|
Chris@425
|
355 EditCommand *command = new EditCommand(this, tr("Edit Data"));
|
Chris@425
|
356
|
Chris@425
|
357 Point point(*i);
|
Chris@425
|
358 command->deletePoint(point);
|
Chris@425
|
359
|
Chris@425
|
360 switch (column) {
|
Chris@425
|
361 case 0: point.frame = lrint(value.toDouble() * getSampleRate()); break;
|
Chris@425
|
362 case 1: point.frame = value.toInt(); break;
|
Chris@425
|
363 }
|
Chris@425
|
364
|
Chris@425
|
365 command->addPoint(point);
|
Chris@425
|
366 return command->finish();
|
Chris@425
|
367 }
|
Chris@425
|
368
|
Chris@427
|
369 virtual Command *getInsertRowCommand(int row)
|
Chris@427
|
370 {
|
Chris@427
|
371 EditCommand *command = new EditCommand(this, tr("Insert Data Point"));
|
Chris@427
|
372 Point point(0);
|
Chris@427
|
373 PointListIterator i = getPointListIteratorForRow(row);
|
Chris@427
|
374 if (i == m_points.end() && i != m_points.begin()) --i;
|
Chris@427
|
375 if (i != m_points.end()) point = *i;
|
Chris@427
|
376 command->addPoint(point);
|
Chris@427
|
377 return command->finish();
|
Chris@427
|
378 }
|
Chris@427
|
379
|
Chris@427
|
380 virtual Command *getRemoveRowCommand(int row)
|
Chris@427
|
381 {
|
Chris@427
|
382 PointListIterator i = getPointListIteratorForRow(row);
|
Chris@427
|
383 if (i == m_points.end()) return 0;
|
Chris@978
|
384 EditCommand *command = new EditCommand(this, tr("Delete Data Point"));
|
Chris@427
|
385 command->deletePoint(*i);
|
Chris@427
|
386 return command->finish();
|
Chris@427
|
387 }
|
Chris@427
|
388
|
Chris@147
|
389 protected:
|
Chris@1040
|
390 sv_samplerate_t m_sampleRate;
|
Chris@929
|
391 int m_resolution;
|
Chris@147
|
392 bool m_notifyOnAdd;
|
Chris@1038
|
393 sv_frame_t m_sinceLastNotifyMin;
|
Chris@1038
|
394 sv_frame_t m_sinceLastNotifyMax;
|
Chris@147
|
395 bool m_hasTextLabels;
|
Chris@147
|
396
|
Chris@147
|
397 PointList m_points;
|
Chris@929
|
398 int m_pointCount;
|
Chris@147
|
399 mutable QMutex m_mutex;
|
Chris@147
|
400 int m_completion;
|
Chris@420
|
401
|
Chris@1038
|
402 void getPointIterators(sv_frame_t frame,
|
Chris@420
|
403 PointListIterator &startItr,
|
Chris@608
|
404 PointListIterator &endItr);
|
Chris@1038
|
405 void getPointIterators(sv_frame_t frame,
|
Chris@608
|
406 PointListConstIterator &startItr,
|
Chris@608
|
407 PointListConstIterator &endItr) const;
|
Chris@420
|
408
|
Chris@420
|
409 // This is only used if the model is called on to act in
|
Chris@420
|
410 // TabularModel mode
|
Chris@1038
|
411 mutable std::vector<sv_frame_t> m_rows; // map from row number to frame
|
Chris@1254
|
412
|
Chris@420
|
413 void rebuildRowVector() const
|
Chris@420
|
414 {
|
Chris@420
|
415 m_rows.clear();
|
Chris@608
|
416 for (PointListConstIterator i = m_points.begin(); i != m_points.end(); ++i) {
|
Chris@777
|
417 // std::cerr << "rebuildRowVector: row " << m_rows.size() << " -> " << i->frame << std::endl;
|
Chris@420
|
418 m_rows.push_back(i->frame);
|
Chris@420
|
419 }
|
Chris@420
|
420 }
|
Chris@420
|
421
|
Chris@608
|
422 PointListIterator getPointListIteratorForRow(int row)
|
Chris@420
|
423 {
|
Chris@420
|
424 if (m_rows.empty()) rebuildRowVector();
|
Chris@425
|
425 if (row < 0 || row + 1 > int(m_rows.size())) return m_points.end();
|
Chris@420
|
426
|
Chris@1038
|
427 sv_frame_t frame = m_rows[row];
|
Chris@420
|
428 int indexAtFrame = 0;
|
Chris@420
|
429 int ri = row;
|
Chris@420
|
430 while (ri > 0 && m_rows[ri-1] == m_rows[row]) { --ri; ++indexAtFrame; }
|
Chris@420
|
431 int initialIndexAtFrame = indexAtFrame;
|
Chris@420
|
432
|
Chris@420
|
433 PointListIterator i0, i1;
|
Chris@420
|
434 getPointIterators(frame, i0, i1);
|
Chris@420
|
435 PointListIterator i = i0;
|
Chris@420
|
436
|
Chris@420
|
437 for (i = i0; i != i1; ++i) {
|
Chris@778
|
438 if (i->frame < (int)frame) { continue; }
|
Chris@420
|
439 if (indexAtFrame > 0) { --indexAtFrame; continue; }
|
Chris@420
|
440 return i;
|
Chris@420
|
441 }
|
Chris@420
|
442
|
Chris@420
|
443 if (indexAtFrame > 0) {
|
Chris@420
|
444 std::cerr << "WARNING: SparseModel::getPointListIteratorForRow: No iterator available for row " << row << " (frame = " << frame << ", index at frame = " << initialIndexAtFrame << ", leftover index " << indexAtFrame << ")" << std::endl;
|
Chris@420
|
445 }
|
Chris@420
|
446 return i;
|
Chris@420
|
447 }
|
Chris@608
|
448
|
Chris@608
|
449 PointListConstIterator getPointListIteratorForRow(int row) const
|
Chris@608
|
450 {
|
Chris@608
|
451 if (m_rows.empty()) rebuildRowVector();
|
Chris@608
|
452 if (row < 0 || row + 1 > int(m_rows.size())) return m_points.end();
|
Chris@608
|
453
|
Chris@1038
|
454 sv_frame_t frame = m_rows[row];
|
Chris@608
|
455 int indexAtFrame = 0;
|
Chris@608
|
456 int ri = row;
|
Chris@608
|
457 while (ri > 0 && m_rows[ri-1] == m_rows[row]) { --ri; ++indexAtFrame; }
|
Chris@608
|
458 int initialIndexAtFrame = indexAtFrame;
|
Chris@608
|
459
|
Chris@1254
|
460 // std::cerr << "getPointListIteratorForRow " << row << ": initialIndexAtFrame = " << initialIndexAtFrame << " for frame " << frame << std::endl;
|
Chris@777
|
461
|
Chris@608
|
462 PointListConstIterator i0, i1;
|
Chris@608
|
463 getPointIterators(frame, i0, i1);
|
Chris@608
|
464 PointListConstIterator i = i0;
|
Chris@608
|
465
|
Chris@608
|
466 for (i = i0; i != i1; ++i) {
|
Chris@785
|
467 // std::cerr << "i->frame is " << i->frame << ", wanting " << frame << std::endl;
|
Chris@785
|
468
|
Chris@778
|
469 if (i->frame < (int)frame) { continue; }
|
Chris@608
|
470 if (indexAtFrame > 0) { --indexAtFrame; continue; }
|
Chris@608
|
471 return i;
|
Chris@608
|
472 }
|
Chris@1254
|
473 /*
|
Chris@1254
|
474 if (i == m_points.end()) {
|
Chris@1254
|
475 std::cerr << "returning i at end" << std::endl;
|
Chris@1254
|
476 } else {
|
Chris@1254
|
477 std::cerr << "returning i with i->frame = " << i->frame << std::endl;
|
Chris@1254
|
478 }
|
Chris@1254
|
479 */
|
Chris@608
|
480 if (indexAtFrame > 0) {
|
Chris@608
|
481 std::cerr << "WARNING: SparseModel::getPointListIteratorForRow: No iterator available for row " << row << " (frame = " << frame << ", index at frame = " << initialIndexAtFrame << ", leftover index " << indexAtFrame << ")" << std::endl;
|
Chris@608
|
482 }
|
Chris@608
|
483 return i;
|
Chris@608
|
484 }
|
Chris@1064
|
485
|
Chris@1064
|
486 QString toDelimitedDataStringSubsetFilled(QString delimiter,
|
Chris@1064
|
487 DataExportOptions opts,
|
Chris@1064
|
488 sv_frame_t f0,
|
Chris@1064
|
489 sv_frame_t f1) const {
|
Chris@1064
|
490
|
Chris@1064
|
491 QString s;
|
Chris@1064
|
492 opts &= ~DataExportFillGaps;
|
Chris@1064
|
493
|
Chris@1064
|
494 // find frame time of first point in range (if any)
|
Chris@1064
|
495 sv_frame_t first = f0;
|
Chris@1064
|
496 for (auto &p: m_points) {
|
Chris@1064
|
497 if (p.frame >= f0) {
|
Chris@1064
|
498 first = p.frame;
|
Chris@1064
|
499 break;
|
Chris@1064
|
500 }
|
Chris@1064
|
501 }
|
Chris@1064
|
502
|
Chris@1064
|
503 // project back to first frame time in range according to
|
Chris@1064
|
504 // resolution. e.g. if f0 = 2, first = 9, resolution = 4 then
|
Chris@1064
|
505 // we start at 5 (because 1 is too early and we need to arrive
|
Chris@1064
|
506 // at 9 to match the first actual point). This method is
|
Chris@1064
|
507 // stupid but easy to understand:
|
Chris@1064
|
508 sv_frame_t f = first;
|
Chris@1064
|
509 while (f >= f0 + m_resolution) f -= m_resolution;
|
Chris@1064
|
510
|
Chris@1064
|
511 // now progress, either writing the next point (if within
|
Chris@1064
|
512 // distance) or a default point
|
Chris@1064
|
513 PointListConstIterator itr = m_points.begin();
|
Chris@1064
|
514
|
Chris@1064
|
515 while (f < f1) {
|
Chris@1064
|
516 if (itr != m_points.end() && itr->frame <= f) {
|
Chris@1064
|
517 s += itr->toDelimitedDataString(delimiter, opts, m_sampleRate);
|
Chris@1064
|
518 ++itr;
|
Chris@1064
|
519 } else {
|
Chris@1064
|
520 s += Point(f).toDelimitedDataString(delimiter, opts, m_sampleRate);
|
Chris@1064
|
521 }
|
Chris@1064
|
522 s += "\n";
|
Chris@1064
|
523 f += m_resolution;
|
Chris@1064
|
524 }
|
Chris@1064
|
525
|
Chris@1064
|
526 return s;
|
Chris@1064
|
527 }
|
Chris@147
|
528 };
|
Chris@147
|
529
|
Chris@147
|
530
|
Chris@147
|
531 template <typename PointType>
|
Chris@1040
|
532 SparseModel<PointType>::SparseModel(sv_samplerate_t sampleRate,
|
Chris@929
|
533 int resolution,
|
Chris@147
|
534 bool notifyOnAdd) :
|
Chris@147
|
535 m_sampleRate(sampleRate),
|
Chris@147
|
536 m_resolution(resolution),
|
Chris@147
|
537 m_notifyOnAdd(notifyOnAdd),
|
Chris@147
|
538 m_sinceLastNotifyMin(-1),
|
Chris@147
|
539 m_sinceLastNotifyMax(-1),
|
Chris@147
|
540 m_hasTextLabels(false),
|
Chris@147
|
541 m_pointCount(0),
|
Chris@147
|
542 m_completion(100)
|
Chris@147
|
543 {
|
Chris@147
|
544 }
|
Chris@147
|
545
|
Chris@147
|
546 template <typename PointType>
|
Chris@1038
|
547 sv_frame_t
|
Chris@147
|
548 SparseModel<PointType>::getStartFrame() const
|
Chris@147
|
549 {
|
Chris@147
|
550 QMutexLocker locker(&m_mutex);
|
Chris@1038
|
551 sv_frame_t f = 0;
|
Chris@147
|
552 if (!m_points.empty()) {
|
Chris@1429
|
553 f = m_points.begin()->frame;
|
Chris@147
|
554 }
|
Chris@147
|
555 return f;
|
Chris@147
|
556 }
|
Chris@147
|
557
|
Chris@147
|
558 template <typename PointType>
|
Chris@1038
|
559 sv_frame_t
|
Chris@147
|
560 SparseModel<PointType>::getEndFrame() const
|
Chris@147
|
561 {
|
Chris@147
|
562 QMutexLocker locker(&m_mutex);
|
Chris@1038
|
563 sv_frame_t f = 0;
|
Chris@147
|
564 if (!m_points.empty()) {
|
Chris@1429
|
565 PointListConstIterator i(m_points.end());
|
Chris@1451
|
566 f = (--i)->frame + 1;
|
Chris@147
|
567 }
|
Chris@1451
|
568 return f;
|
Chris@147
|
569 }
|
Chris@147
|
570
|
Chris@147
|
571 template <typename PointType>
|
Chris@147
|
572 bool
|
Chris@147
|
573 SparseModel<PointType>::isEmpty() const
|
Chris@147
|
574 {
|
Chris@147
|
575 return m_pointCount == 0;
|
Chris@147
|
576 }
|
Chris@147
|
577
|
Chris@147
|
578 template <typename PointType>
|
Chris@929
|
579 int
|
Chris@147
|
580 SparseModel<PointType>::getPointCount() const
|
Chris@147
|
581 {
|
Chris@147
|
582 return m_pointCount;
|
Chris@147
|
583 }
|
Chris@147
|
584
|
Chris@147
|
585 template <typename PointType>
|
Chris@459
|
586 const typename SparseModel<PointType>::PointList &
|
Chris@459
|
587 SparseModel<PointType>::getPoints() const
|
Chris@459
|
588 {
|
Chris@459
|
589 return m_points;
|
Chris@459
|
590 }
|
Chris@459
|
591
|
Chris@459
|
592 template <typename PointType>
|
Chris@147
|
593 typename SparseModel<PointType>::PointList
|
Chris@1038
|
594 SparseModel<PointType>::getPoints(sv_frame_t start, sv_frame_t end) const
|
Chris@147
|
595 {
|
Chris@147
|
596 if (start > end) return PointList();
|
Chris@147
|
597 QMutexLocker locker(&m_mutex);
|
Chris@147
|
598
|
Chris@147
|
599 PointType startPoint(start), endPoint(end);
|
Chris@147
|
600
|
Chris@608
|
601 PointListConstIterator startItr = m_points.lower_bound(startPoint);
|
Chris@608
|
602 PointListConstIterator endItr = m_points.upper_bound(endPoint);
|
Chris@147
|
603
|
Chris@147
|
604 if (startItr != m_points.begin()) --startItr;
|
Chris@147
|
605 if (startItr != m_points.begin()) --startItr;
|
Chris@147
|
606 if (endItr != m_points.end()) ++endItr;
|
Chris@147
|
607 if (endItr != m_points.end()) ++endItr;
|
Chris@147
|
608
|
Chris@147
|
609 PointList rv;
|
Chris@147
|
610
|
Chris@608
|
611 for (PointListConstIterator i = startItr; i != endItr; ++i) {
|
Chris@1429
|
612 rv.insert(*i);
|
Chris@147
|
613 }
|
Chris@147
|
614
|
Chris@147
|
615 return rv;
|
Chris@147
|
616 }
|
Chris@147
|
617
|
Chris@147
|
618 template <typename PointType>
|
Chris@147
|
619 typename SparseModel<PointType>::PointList
|
Chris@1038
|
620 SparseModel<PointType>::getPoints(sv_frame_t frame) const
|
Chris@147
|
621 {
|
Chris@608
|
622 PointListConstIterator startItr, endItr;
|
Chris@420
|
623 getPointIterators(frame, startItr, endItr);
|
Chris@147
|
624
|
Chris@147
|
625 PointList rv;
|
Chris@147
|
626
|
Chris@608
|
627 for (PointListConstIterator i = startItr; i != endItr; ++i) {
|
Chris@1429
|
628 rv.insert(*i);
|
Chris@147
|
629 }
|
Chris@147
|
630
|
Chris@147
|
631 return rv;
|
Chris@147
|
632 }
|
Chris@147
|
633
|
Chris@147
|
634 template <typename PointType>
|
Chris@420
|
635 void
|
Chris@1038
|
636 SparseModel<PointType>::getPointIterators(sv_frame_t frame,
|
Chris@420
|
637 PointListIterator &startItr,
|
Chris@608
|
638 PointListIterator &endItr)
|
Chris@608
|
639 {
|
Chris@608
|
640 QMutexLocker locker(&m_mutex);
|
Chris@608
|
641
|
Chris@608
|
642 if (m_resolution == 0) {
|
Chris@608
|
643 startItr = m_points.end();
|
Chris@608
|
644 endItr = m_points.end();
|
Chris@608
|
645 return;
|
Chris@608
|
646 }
|
Chris@608
|
647
|
Chris@1038
|
648 sv_frame_t start = (frame / m_resolution) * m_resolution;
|
Chris@1038
|
649 sv_frame_t end = start + m_resolution;
|
Chris@608
|
650
|
Chris@608
|
651 PointType startPoint(start), endPoint(end);
|
Chris@777
|
652
|
Chris@608
|
653 startItr = m_points.lower_bound(startPoint);
|
Chris@608
|
654 endItr = m_points.upper_bound(endPoint);
|
Chris@608
|
655 }
|
Chris@608
|
656
|
Chris@608
|
657 template <typename PointType>
|
Chris@608
|
658 void
|
Chris@1038
|
659 SparseModel<PointType>::getPointIterators(sv_frame_t frame,
|
Chris@608
|
660 PointListConstIterator &startItr,
|
Chris@608
|
661 PointListConstIterator &endItr) const
|
Chris@420
|
662 {
|
Chris@420
|
663 QMutexLocker locker(&m_mutex);
|
Chris@420
|
664
|
Chris@420
|
665 if (m_resolution == 0) {
|
Chris@785
|
666 // std::cerr << "getPointIterators: resolution == 0, returning end()" << std::endl;
|
Chris@420
|
667 startItr = m_points.end();
|
Chris@420
|
668 endItr = m_points.end();
|
Chris@420
|
669 return;
|
Chris@420
|
670 }
|
Chris@420
|
671
|
Chris@1038
|
672 sv_frame_t start = (frame / m_resolution) * m_resolution;
|
Chris@1038
|
673 sv_frame_t end = start + m_resolution;
|
Chris@420
|
674
|
Chris@420
|
675 PointType startPoint(start), endPoint(end);
|
Chris@420
|
676
|
Chris@777
|
677 // std::cerr << "getPointIterators: start frame " << start << ", end frame " << end << ", m_resolution " << m_resolution << std::endl;
|
Chris@785
|
678
|
Chris@420
|
679 startItr = m_points.lower_bound(startPoint);
|
Chris@420
|
680 endItr = m_points.upper_bound(endPoint);
|
Chris@420
|
681 }
|
Chris@420
|
682
|
Chris@420
|
683 template <typename PointType>
|
Chris@147
|
684 typename SparseModel<PointType>::PointList
|
Chris@1038
|
685 SparseModel<PointType>::getPreviousPoints(sv_frame_t originFrame) const
|
Chris@147
|
686 {
|
Chris@147
|
687 QMutexLocker locker(&m_mutex);
|
Chris@147
|
688
|
Chris@147
|
689 PointType lookupPoint(originFrame);
|
Chris@147
|
690 PointList rv;
|
Chris@147
|
691
|
Chris@608
|
692 PointListConstIterator i = m_points.lower_bound(lookupPoint);
|
Chris@147
|
693 if (i == m_points.begin()) return rv;
|
Chris@147
|
694
|
Chris@147
|
695 --i;
|
Chris@1038
|
696 sv_frame_t frame = i->frame;
|
Chris@147
|
697 while (i->frame == frame) {
|
Chris@1429
|
698 rv.insert(*i);
|
Chris@1429
|
699 if (i == m_points.begin()) break;
|
Chris@1429
|
700 --i;
|
Chris@147
|
701 }
|
Chris@147
|
702
|
Chris@147
|
703 return rv;
|
Chris@147
|
704 }
|
Chris@147
|
705
|
Chris@147
|
706 template <typename PointType>
|
Chris@147
|
707 typename SparseModel<PointType>::PointList
|
Chris@1038
|
708 SparseModel<PointType>::getNextPoints(sv_frame_t originFrame) const
|
Chris@147
|
709 {
|
Chris@147
|
710 QMutexLocker locker(&m_mutex);
|
Chris@147
|
711
|
Chris@147
|
712 PointType lookupPoint(originFrame);
|
Chris@147
|
713 PointList rv;
|
Chris@147
|
714
|
Chris@608
|
715 PointListConstIterator i = m_points.upper_bound(lookupPoint);
|
Chris@147
|
716 if (i == m_points.end()) return rv;
|
Chris@147
|
717
|
Chris@1038
|
718 sv_frame_t frame = i->frame;
|
Chris@147
|
719 while (i != m_points.end() && i->frame == frame) {
|
Chris@1429
|
720 rv.insert(*i);
|
Chris@1429
|
721 ++i;
|
Chris@147
|
722 }
|
Chris@147
|
723
|
Chris@147
|
724 return rv;
|
Chris@147
|
725 }
|
Chris@147
|
726
|
Chris@147
|
727 template <typename PointType>
|
Chris@147
|
728 void
|
Chris@929
|
729 SparseModel<PointType>::setResolution(int resolution)
|
Chris@147
|
730 {
|
Chris@147
|
731 {
|
Chris@1429
|
732 QMutexLocker locker(&m_mutex);
|
Chris@1429
|
733 m_resolution = resolution;
|
Chris@1212
|
734 m_rows.clear();
|
Chris@147
|
735 }
|
Chris@147
|
736 emit modelChanged();
|
Chris@147
|
737 }
|
Chris@147
|
738
|
Chris@147
|
739 template <typename PointType>
|
Chris@147
|
740 void
|
Chris@147
|
741 SparseModel<PointType>::clear()
|
Chris@147
|
742 {
|
Chris@147
|
743 {
|
Chris@1429
|
744 QMutexLocker locker(&m_mutex);
|
Chris@1429
|
745 m_points.clear();
|
Chris@147
|
746 m_pointCount = 0;
|
Chris@1212
|
747 m_rows.clear();
|
Chris@147
|
748 }
|
Chris@147
|
749 emit modelChanged();
|
Chris@147
|
750 }
|
Chris@147
|
751
|
Chris@147
|
752 template <typename PointType>
|
Chris@147
|
753 void
|
Chris@147
|
754 SparseModel<PointType>::addPoint(const PointType &point)
|
Chris@147
|
755 {
|
Chris@1212
|
756 QMutexLocker locker(&m_mutex);
|
Chris@1212
|
757
|
Chris@1212
|
758 m_points.insert(point);
|
Chris@1212
|
759 m_pointCount++;
|
Chris@1212
|
760 if (point.getLabel() != "") m_hasTextLabels = true;
|
Chris@147
|
761
|
Chris@147
|
762 // Even though this model is nominally sparse, there may still be
|
Chris@147
|
763 // too many signals going on here (especially as they'll probably
|
Chris@147
|
764 // be queued from one thread to another), which is why we need the
|
Chris@147
|
765 // notifyOnAdd as an option rather than a necessity (the
|
Chris@147
|
766 // alternative is to notify on setCompletion).
|
Chris@147
|
767
|
Chris@147
|
768 if (m_notifyOnAdd) {
|
Chris@420
|
769 m_rows.clear(); //!!! inefficient
|
Chris@1429
|
770 emit modelChangedWithin(point.frame, point.frame + m_resolution);
|
Chris@147
|
771 } else {
|
Chris@1429
|
772 if (m_sinceLastNotifyMin == -1 ||
|
Chris@1429
|
773 point.frame < m_sinceLastNotifyMin) {
|
Chris@1429
|
774 m_sinceLastNotifyMin = point.frame;
|
Chris@1429
|
775 }
|
Chris@1429
|
776 if (m_sinceLastNotifyMax == -1 ||
|
Chris@1429
|
777 point.frame > m_sinceLastNotifyMax) {
|
Chris@1429
|
778 m_sinceLastNotifyMax = point.frame;
|
Chris@1429
|
779 }
|
Chris@147
|
780 }
|
Chris@147
|
781 }
|
Chris@147
|
782
|
Chris@147
|
783 template <typename PointType>
|
Chris@1113
|
784 bool
|
Chris@1113
|
785 SparseModel<PointType>::containsPoint(const PointType &point)
|
Chris@1113
|
786 {
|
Chris@1212
|
787 QMutexLocker locker(&m_mutex);
|
Chris@1113
|
788
|
Chris@1212
|
789 PointListIterator i = m_points.lower_bound(point);
|
Chris@1212
|
790 typename PointType::Comparator comparator;
|
Chris@1212
|
791 while (i != m_points.end()) {
|
Chris@1212
|
792 if (i->frame > point.frame) break;
|
Chris@1212
|
793 if (!comparator(*i, point) && !comparator(point, *i)) {
|
Chris@1212
|
794 return true;
|
Chris@1212
|
795 }
|
Chris@1212
|
796 ++i;
|
Chris@1113
|
797 }
|
Chris@1113
|
798
|
Chris@1113
|
799 return false;
|
Chris@1113
|
800 }
|
Chris@1113
|
801
|
Chris@1113
|
802 template <typename PointType>
|
Chris@147
|
803 void
|
Chris@147
|
804 SparseModel<PointType>::deletePoint(const PointType &point)
|
Chris@147
|
805 {
|
Chris@1212
|
806 QMutexLocker locker(&m_mutex);
|
Chris@147
|
807
|
Chris@1212
|
808 PointListIterator i = m_points.lower_bound(point);
|
Chris@1212
|
809 typename PointType::Comparator comparator;
|
Chris@1212
|
810 while (i != m_points.end()) {
|
Chris@1212
|
811 if (i->frame > point.frame) break;
|
Chris@1212
|
812 if (!comparator(*i, point) && !comparator(point, *i)) {
|
Chris@1212
|
813 m_points.erase(i);
|
Chris@1212
|
814 m_pointCount--;
|
Chris@1212
|
815 break;
|
Chris@1429
|
816 }
|
Chris@1212
|
817 ++i;
|
Chris@147
|
818 }
|
Chris@1212
|
819
|
Chris@147
|
820 // std::cout << "SparseOneDimensionalModel: emit modelChanged("
|
Chris@1429
|
821 // << point.frame << ")" << std::endl;
|
Chris@420
|
822 m_rows.clear(); //!!! inefficient
|
Chris@931
|
823 emit modelChangedWithin(point.frame, point.frame + m_resolution);
|
Chris@147
|
824 }
|
Chris@147
|
825
|
Chris@147
|
826 template <typename PointType>
|
Chris@147
|
827 void
|
Chris@333
|
828 SparseModel<PointType>::setCompletion(int completion, bool update)
|
Chris@147
|
829 {
|
Chris@301
|
830 // std::cerr << "SparseModel::setCompletion(" << completion << ")" << std::endl;
|
Chris@191
|
831
|
Chris@1212
|
832 QMutexLocker locker(&m_mutex);
|
Chris@1212
|
833
|
Chris@147
|
834 if (m_completion != completion) {
|
Chris@1429
|
835 m_completion = completion;
|
Chris@147
|
836
|
Chris@1429
|
837 if (completion == 100) {
|
Chris@147
|
838
|
Chris@297
|
839 if (!m_notifyOnAdd) {
|
Chris@297
|
840 emit completionChanged();
|
Chris@297
|
841 }
|
Chris@297
|
842
|
Chris@1429
|
843 m_notifyOnAdd = true; // henceforth
|
Chris@420
|
844 m_rows.clear(); //!!! inefficient
|
Chris@1429
|
845 emit modelChanged();
|
Chris@147
|
846
|
Chris@1429
|
847 } else if (!m_notifyOnAdd) {
|
Chris@147
|
848
|
Chris@1429
|
849 if (update &&
|
Chris@333
|
850 m_sinceLastNotifyMin >= 0 &&
|
Chris@1429
|
851 m_sinceLastNotifyMax >= 0) {
|
Chris@420
|
852 m_rows.clear(); //!!! inefficient
|
Chris@1429
|
853 emit modelChangedWithin(m_sinceLastNotifyMin, m_sinceLastNotifyMax);
|
Chris@1429
|
854 m_sinceLastNotifyMin = m_sinceLastNotifyMax = -1;
|
Chris@1429
|
855 } else {
|
Chris@1429
|
856 emit completionChanged();
|
Chris@1429
|
857 }
|
Chris@1429
|
858 } else {
|
Chris@1429
|
859 emit completionChanged();
|
Chris@1429
|
860 }
|
Chris@147
|
861 }
|
Chris@147
|
862 }
|
Chris@147
|
863
|
Chris@147
|
864 template <typename PointType>
|
Chris@147
|
865 void
|
Chris@147
|
866 SparseModel<PointType>::toXml(QTextStream &out,
|
Chris@147
|
867 QString indent,
|
Chris@147
|
868 QString extraAttributes) const
|
Chris@147
|
869 {
|
Chris@777
|
870 // std::cerr << "SparseModel::toXml: extraAttributes = \""
|
Chris@777
|
871 // << extraAttributes.toStdString() << std::endl;
|
Chris@318
|
872
|
Chris@407
|
873 QString type = getXmlOutputType();
|
Chris@407
|
874
|
Chris@147
|
875 Model::toXml
|
Chris@1429
|
876 (out,
|
Chris@147
|
877 indent,
|
Chris@1429
|
878 QString("type=\"%1\" dimensions=\"%2\" resolution=\"%3\" notifyOnAdd=\"%4\" dataset=\"%5\" %6")
|
Chris@407
|
879 .arg(type)
|
Chris@1429
|
880 .arg(PointType(0).getDimensions())
|
Chris@1429
|
881 .arg(m_resolution)
|
Chris@1429
|
882 .arg(m_notifyOnAdd ? "true" : "false")
|
Chris@1429
|
883 .arg(getObjectExportId(&m_points))
|
Chris@1429
|
884 .arg(extraAttributes));
|
Chris@147
|
885
|
Chris@147
|
886 out << indent;
|
Chris@147
|
887 out << QString("<dataset id=\"%1\" dimensions=\"%2\">\n")
|
Chris@1429
|
888 .arg(getObjectExportId(&m_points))
|
Chris@1429
|
889 .arg(PointType(0).getDimensions());
|
Chris@147
|
890
|
Chris@608
|
891 for (PointListConstIterator i = m_points.begin(); i != m_points.end(); ++i) {
|
Chris@314
|
892 i->toXml(out, indent + " ");
|
Chris@147
|
893 }
|
Chris@147
|
894
|
Chris@147
|
895 out << indent;
|
Chris@147
|
896 out << "</dataset>\n";
|
Chris@147
|
897 }
|
Chris@147
|
898
|
Chris@147
|
899 template <typename PointType>
|
Chris@147
|
900 SparseModel<PointType>::EditCommand::EditCommand(SparseModel *model,
|
Chris@147
|
901 QString commandName) :
|
Chris@147
|
902 MacroCommand(commandName),
|
Chris@147
|
903 m_model(model)
|
Chris@147
|
904 {
|
Chris@147
|
905 }
|
Chris@147
|
906
|
Chris@147
|
907 template <typename PointType>
|
Chris@147
|
908 void
|
Chris@147
|
909 SparseModel<PointType>::EditCommand::addPoint(const PointType &point)
|
Chris@147
|
910 {
|
Chris@147
|
911 addCommand(new AddPointCommand(m_model, point), true);
|
Chris@147
|
912 }
|
Chris@147
|
913
|
Chris@147
|
914 template <typename PointType>
|
Chris@147
|
915 void
|
Chris@147
|
916 SparseModel<PointType>::EditCommand::deletePoint(const PointType &point)
|
Chris@147
|
917 {
|
Chris@147
|
918 addCommand(new DeletePointCommand(m_model, point), true);
|
Chris@147
|
919 }
|
Chris@147
|
920
|
Chris@147
|
921 template <typename PointType>
|
Chris@416
|
922 typename SparseModel<PointType>::EditCommand *
|
Chris@147
|
923 SparseModel<PointType>::EditCommand::finish()
|
Chris@147
|
924 {
|
Chris@147
|
925 if (!m_commands.empty()) {
|
Chris@387
|
926 return this;
|
Chris@147
|
927 } else {
|
Chris@147
|
928 delete this;
|
Chris@389
|
929 return 0;
|
Chris@147
|
930 }
|
Chris@147
|
931 }
|
Chris@147
|
932
|
Chris@147
|
933 template <typename PointType>
|
Chris@147
|
934 void
|
Chris@147
|
935 SparseModel<PointType>::EditCommand::addCommand(Command *command,
|
Chris@1429
|
936 bool executeFirst)
|
Chris@147
|
937 {
|
Chris@147
|
938 if (executeFirst) command->execute();
|
Chris@147
|
939
|
Chris@147
|
940 if (!m_commands.empty()) {
|
Chris@1429
|
941 DeletePointCommand *dpc = dynamic_cast<DeletePointCommand *>(command);
|
Chris@1429
|
942 if (dpc) {
|
Chris@1429
|
943 AddPointCommand *apc = dynamic_cast<AddPointCommand *>
|
Chris@1429
|
944 (m_commands[m_commands.size() - 1]);
|
Chris@1429
|
945 typename PointType::Comparator comparator;
|
Chris@1429
|
946 if (apc) {
|
Chris@1429
|
947 if (!comparator(apc->getPoint(), dpc->getPoint()) &&
|
Chris@1429
|
948 !comparator(dpc->getPoint(), apc->getPoint())) {
|
Chris@1429
|
949 deleteCommand(apc);
|
Chris@1429
|
950 return;
|
Chris@1429
|
951 }
|
Chris@1429
|
952 }
|
Chris@1429
|
953 }
|
Chris@147
|
954 }
|
Chris@147
|
955
|
Chris@147
|
956 MacroCommand::addCommand(command);
|
Chris@147
|
957 }
|
Chris@147
|
958
|
Chris@147
|
959
|
Chris@147
|
960 #endif
|
Chris@147
|
961
|
Chris@147
|
962
|
Chris@147
|
963
|