+#include <msp/strings/format.h>
#include <msp/strings/utils.h>
#include "layout.h"
#include "track.h"
#include "trackchain.h"
+using namespace std;
+using namespace Msp;
+
namespace R2C2 {
TrackChain::TrackChain(Layout &l):
layout.signal_object_removed.connect(sigc::mem_fun(this, &TrackChain::object_removed));
}
+void TrackChain::set_name(const string &n)
+{
+ name = n;
+ signal_name_changed.emit(name);
+}
+
void TrackChain::add_track(Track &track)
{
if(tracks.count(&track))
tracks.insert(&track);
update_ends(track);
on_track_added(track);
+ signal_track_added.emit(track);
}
void TrackChain::add_tracks(const TrackSet &trks)
for(TrackSet::iterator i=pending.begin(); i!=pending.end(); ++i)
if((valid=check_validity(**i))==VALID)
{
- tracks.insert(*i);
- update_ends(**i);
- on_track_added(**i);
+ Track *t = *i;
pending.erase(i);
+ tracks.insert(t);
+ update_ends(*t);
+ on_track_added(*t);
+ signal_track_added.emit(*t);
break;
}
return tracks.count(&t);
}
+TrackIter TrackChain::iter_for(Track &t, Direction d) const
+{
+ if(!tracks.count(&t))
+ return TrackIter();
+ else if(d==UNSPECIFIED)
+ return TrackIter(&t, 0);
+ else
+ return TrackIter();
+}
+
+TrackIter TrackChain::get_end(unsigned i) const
+{
+ if(i>=2)
+ throw out_of_range("TrackChain::get_end");
+
+ if(!ends[0])
+ return TrackIter();
+ else if(i==1 && !ends[1])
+ return ends[0].reverse();
+ else
+ return ends[i];
+}
+
+bool TrackChain::is_loop() const
+{
+ return !tracks.empty() && !ends[0] && !ends[1];
+}
+
void TrackChain::object_removed(Object &obj)
{
if(Track *track = dynamic_cast<Track *>(&obj))
+ {
tracks.erase(track);
/* TODO If the track was in the middle of the chain, keep only the
longest fragment */
+ signal_track_removed.emit(*track);
+ }
+}
+
+
+void operator<<(LexicalConverter &conv, TrackChain::Direction dir)
+{
+ switch(dir)
+ {
+ case TrackChain::UNSPECIFIED: conv.result("UNSPECIFIED"); return;
+ case TrackChain::UP: conv.result("UP"); return;
+ case TrackChain::DOWN: conv.result("DOWN"); return;
+ default: throw lexical_error(format("conversion of Direction(%d) to string", static_cast<int>(dir)));
+ }
+}
+
+void operator>>(const LexicalConverter &conv, TrackChain::Direction &dir)
+{
+ const string &str = conv.get();
+ if(str=="UNSPECIFIED")
+ dir = TrackChain::UNSPECIFIED;
+ else if(str=="UP")
+ dir = TrackChain::UP;
+ else if(str=="DOWN")
+ dir = TrackChain::DOWN;
+ else
+ throw lexical_error(format("conversion of '%s' to Direction", str));
}
} // namespace R2C2