1
0
mirror of https://github.com/cookiengineer/audacity synced 2025-10-26 00:03:52 +02:00

Define and use copy and move for TrackList, simplifying recording code

This commit is contained in:
Paul Licameli
2016-03-07 06:43:42 -05:00
parent 72705e8f31
commit aee12f5755
3 changed files with 70 additions and 27 deletions

View File

@@ -713,6 +713,49 @@ TrackList::TrackList(bool destructorDeletesTracks)
tail = NULL;
}
TrackList::TrackList(const TrackList &that)
{
DoAssign(that);
}
TrackList& TrackList::operator= (const TrackList &that)
{
if (this != &that) {
this->Clear(mDestructorDeletesTracks);
DoAssign(that);
}
return *this;
}
TrackList::TrackList(TrackList &&that)
{
Swap(that);
}
TrackList &TrackList::operator= (TrackList &&that)
{
if (this != &that) {
this->Clear(mDestructorDeletesTracks);
Swap(that);
}
return *this;
}
void TrackList::DoAssign(const TrackList &that)
{
mDestructorDeletesTracks = true;
TrackListConstIterator it(&that);
for (const Track *track = it.First(); track; track = it.Next())
Add(track->Duplicate());
}
void TrackList::Swap(TrackList &that)
{
std::swap(mDestructorDeletesTracks, that.mDestructorDeletesTracks);
std::swap(head, that.head);
std::swap(tail, that.tail);
}
TrackList::~TrackList()
{
Clear(mDestructorDeletesTracks);
@@ -1025,7 +1068,7 @@ bool TrackList::CanMoveDown(Track * t) const
// The complication is that the tracks are stored in a single
// linked list, and pairs of tracks are marked only by a flag
// in one of the tracks.
void TrackList::Swap(TrackListNode * s1, TrackListNode * s2)
void TrackList::SwapNodes(TrackListNode * s1, TrackListNode * s2)
{
Track *link;
Track *source[4];
@@ -1092,7 +1135,7 @@ bool TrackList::MoveUp(Track * t)
if (t) {
Track *p = GetPrev(t, true);
if (p) {
Swap((TrackListNode *)p->GetNode(), (TrackListNode *)t->GetNode());
SwapNodes((TrackListNode *)p->GetNode(), (TrackListNode *)t->GetNode());
return true;
}
}
@@ -1105,7 +1148,7 @@ bool TrackList::MoveDown(Track * t)
if (t) {
Track *n = GetNext(t, true);
if (n) {
Swap((TrackListNode *)t->GetNode(), (TrackListNode *)n->GetNode());
SwapNodes((TrackListNode *)t->GetNode(), (TrackListNode *)n->GetNode());
return true;
}
}