#include <queue>
#include <msp/core/maputils.h>
#include <msp/strings/format.h>
+#include <msp/strings/utils.h>
#include "layout.h"
#include "route.h"
#include "track.h"
namespace R2C2 {
+string bad_route::get_message(RouteValidityMask valid)
+{
+ const char *reasons[3];
+ unsigned i = 0;
+ if(!(valid&1))
+ reasons[i++] = "unlinked";
+ else if(!(valid&2))
+ reasons[i++] = "branching";
+ else if(!(valid&4))
+ reasons[i++] = "not smooth";
+ return join(reasons, reasons+i, ", ");
+}
+
+
Route::Route(Layout &l):
layout(l),
temporary(false)
if(!tracks.empty())
{
- unsigned valid = check_validity(trk);
- if(!(valid&1))
- throw Exception("Not linked to existing tracks");
- else if(!(valid&2))
- throw Exception("Branching routes not allowed");
- else if(!(valid&4))
- throw Exception("Route must be smooth");
+ RouteValidityMask valid = check_validity(trk);
+ if(valid!=ROUTE_VALID)
+ throw bad_route(valid);
}
tracks.insert(&trk);
while(!pending.empty())
{
- bool found = false;
+ RouteValidityMask valid = ROUTE_INVALID;
for(set<Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
- if(tracks.empty() || check_validity(**i)==7)
+ if(tracks.empty() || (valid=check_validity(**i))==ROUTE_VALID)
{
tracks.insert(*i);
pending.erase(*i);
- found = true;
break;
}
- if(!found)
- throw Exception("Could not add all tracks to route");
+ if(valid!=ROUTE_VALID)
+ throw bad_route(valid);
}
update_turnouts();
st.push_back((DataFile::Statement("turnout"), i->first, i->second));
}
-unsigned Route::check_validity(Track &trk) const
+RouteValidityMask Route::check_validity(Track &trk) const
{
- unsigned result = 4;
+ unsigned result = ROUTE_SMOOTH;
const vector<Track *> &links = trk.get_links();
for(vector<Track *>::const_iterator i=links.begin(); i!=links.end(); ++i)
{
continue;
// Linked to an existing track - good
- result |= 1;
+ result |= ROUTE_LINKED;
if(unsigned tid = (*i)->get_turnout_id())
{
{
// Linking to a turnout with path set is only good if we're continuing that path
if(ep.paths&(1<<path))
- result |= 2;
+ result |= ROUTE_LINEAR;
}
else
{
const TrackType::Endpoint &ep2 = (*i)->get_type().get_endpoint(j);
if(!(ep.paths&ep2.paths))
// Impossible path through the turnout - not good
- result &= 3;
+ result &= ~ROUTE_SMOOTH;
}
// Only good if at most one other track is linked to the turnout
if(count<=1)
- result |= 2;
+ result |= ROUTE_LINEAR;
}
}
else
// Linked to something linear - good
- result |= 2;
+ result |= ROUTE_LINEAR;
}
- return result;
+ return static_cast<RouteValidityMask>(result);
}
void Route::track_removed(Track &t)
class TrackIter;
class Zone;
+enum RouteValidityMask
+{
+ ROUTE_INVALID = 0,
+ ROUTE_LINKED = 1,
+ ROUTE_LINEAR = 2,
+ ROUTE_SMOOTH = 4,
+ ROUTE_VALID = 7
+};
+
+class bad_route: public std::logic_error
+{
+public:
+ bad_route(RouteValidityMask m): std::logic_error(get_message(m)) { }
+ virtual ~bad_route() throw() { }
+
+private:
+ static std::string get_message(RouteValidityMask);
+};
+
+
class Route: public sigc::trackable
{
public:
bool has_track(Track &) const;
void save(std::list<Msp::DataFile::Statement> &) const;
private:
- unsigned check_validity(Track &) const;
+ RouteValidityMask check_validity(Track &) const;
void track_removed(Track &);
public: