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
|
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
/*
Rosegarden
A MIDI and audio sequencer and musical notation editor.
This program is Copyright 2000-2008
Guillaume Laurent <[email protected]>,
Chris Cannam <[email protected]>,
Richard Bown <[email protected]>
The moral rights of Guillaume Laurent, Chris Cannam, and Richard
Bown to claim authorship of this work have been asserted.
Other copyrights also apply to some parts of this work. Please
see the AUTHORS file and individual file headers for details.
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.
*/
#include "SegmentJoinCommand.h"
#include "base/Composition.h"
#include "base/Event.h"
#include "base/NotationTypes.h"
#include "base/Segment.h"
#include "base/Selection.h"
#include <qstring.h>
namespace Rosegarden
{
SegmentJoinCommand::SegmentJoinCommand(SegmentSelection &
segments) :
KNamedCommand(getGlobalName()),
m_newSegment(0),
m_detached(false) // true if the old segments are detached, not the new
{
for (SegmentSelection::iterator i = segments.begin();
i != segments.end(); ++i)
{
m_oldSegments.push_back(*i);
}
assert(m_oldSegments.size() > 0);
}
SegmentJoinCommand::~SegmentJoinCommand()
{
if (m_detached) {
for (unsigned int i = 0; i < m_oldSegments.size(); ++i) {
delete m_oldSegments[i];
}
} else {
delete m_newSegment;
}
}
void
SegmentJoinCommand::execute()
{
Composition *composition = m_oldSegments[0]->getComposition();
if (!composition) {
std::cerr
<< "SegmentJoinCommand::execute: ERROR: old segments are not in composition!"
<< std::endl;
return ;
}
// we normalize rests in any overlapping areas
timeT overlapStart = 0, overlapEnd = 0;
bool haveOverlap = false;
if (!m_newSegment) {
m_newSegment = new Segment(*m_oldSegments[0]);
// that duplicated segment 0; now do the rest
for (unsigned int i = 1; i < m_oldSegments.size(); ++i) {
Segment *s = m_oldSegments[i];
timeT start = s->getStartTime(), end = s->getEndMarkerTime();
timeT os = 0, oe = 0;
bool haveOverlapHere = false;
if (start < m_newSegment->getEndMarkerTime() &&
end > m_newSegment->getStartTime()) {
haveOverlapHere = true;
os = std::max(start, m_newSegment->getStartTime());
oe = std::min(end, m_newSegment->getEndMarkerTime());
std::cerr << "overlap here, os = " << os << ", oe = " << oe << std::endl;
}
if (haveOverlapHere) {
if (haveOverlap) {
overlapStart = std::min(overlapStart, os);
overlapEnd = std::max(overlapEnd, oe);
} else {
overlapStart = os;
overlapEnd = oe;
haveOverlap = true;
}
}
if (start > m_newSegment->getEndMarkerTime()) {
m_newSegment->setEndMarkerTime(start);
}
for (Segment::iterator si = s->begin();
s->isBeforeEndMarker(si); ++si) {
// weed out duplicate clefs and keys
if ((*si)->isa(Clef::EventType)) {
try {
Clef newClef(**si);
if (m_newSegment->getClefAtTime
((*si)->getAbsoluteTime() + 1) == newClef) {
continue;
}
} catch (...) { }
}
if ((*si)->isa(Key::EventType)) {
try {
Key newKey(**si);
if (m_newSegment->getKeyAtTime
((*si)->getAbsoluteTime() + 1) == newKey) {
continue;
}
} catch (...) { }
}
m_newSegment->insert(new Event(**si));
}
if (end > m_newSegment->getEndMarkerTime()) {
m_newSegment->setEndMarkerTime(end);
}
}
}
composition->addSegment(m_newSegment);
if (haveOverlap) {
m_newSegment->normalizeRests(overlapStart, overlapEnd);
}
for (unsigned int i = 0; i < m_oldSegments.size(); ++i) {
composition->detachSegment(m_oldSegments[i]);
}
m_detached = true;
}
void
SegmentJoinCommand::unexecute()
{
for (unsigned int i = 0; i < m_oldSegments.size(); ++i) {
m_newSegment->getComposition()->addSegment(m_oldSegments[i]);
}
m_newSegment->getComposition()->detachSegment(m_newSegment);
m_detached = false;
}
}
|
