X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Flibmarklin%2Froute.cpp;h=6dc7ae51e13350efe01269c06c199fde829675f8;hb=2bb6ce8ada216c0b2caa48f4639d03f2c581098e;hp=7ecd473694926ea306067f1993e03ad16b08a0cf;hpb=e39a3bb041867d6b469bb26278ea0b05ebea0277;p=r2c2.git

diff --git a/source/libmarklin/route.cpp b/source/libmarklin/route.cpp
index 7ecd473..6dc7ae5 100644
--- a/source/libmarklin/route.cpp
+++ b/source/libmarklin/route.cpp
@@ -10,6 +10,7 @@ Distributed under the GPL
 #include "layout.h"
 #include "route.h"
 #include "track.h"
+#include "trackiter.h"
 #include "tracktype.h"
 
 using namespace std;
@@ -19,11 +20,11 @@ namespace {
 
 using namespace Marklin;
 
-typedef std::pair<const Track *, unsigned> Key;
+typedef std::pair<Track *, unsigned> Key;
 
 struct Node
 {
-	const Track *track;
+	Track *track;
 	unsigned ep;
 	Node *prev;
 	float dist;
@@ -32,11 +33,11 @@ struct Node
 		track(0), ep(0), prev(0), dist(0)
 	{ }
 
-	Node(const Track &t, unsigned e):
+	Node(Track &t, unsigned e):
 		track(&t), ep(e), prev(0), dist(0)
 	{ }
 
-	Node(const Track &t, unsigned e, Node &r, float d):
+	Node(Track &t, unsigned e, Node &r, float d):
 		track(&t), ep(e), prev(&r), dist(prev->dist+d)
 	{ }
 
@@ -46,24 +47,24 @@ struct Node
 
 struct TrackMatch
 {
-	const Track &track;
+	Track &track;
 
-	TrackMatch(const Track &t): track(t) { }
+	TrackMatch(Track &t): track(t) { }
 
-	bool operator()(const Track &t) const { return &t==&track; }
+	bool operator()(Track &t) const { return &t==&track; }
 };
 
-struct TrackInRoute
+struct TrackInSet
 {
-	const Route &route;
+	const set<Track *> &tracks;
 
-	TrackInRoute(const Route &r): route(r) { }
+	TrackInSet(const set<Track *> &t): tracks(t) { }
 
-	bool operator()(const Track &t) const { return route.get_tracks().count(&t); }
+	bool operator()(Track &t) const { return tracks.count(&t); }
 };
 
 template<typename Pred>
-list<const Track *> dijkstra(const Track &from, unsigned ep, const Pred &goal)
+list<Track *> dijkstra(Track &from, unsigned ep, const Pred &goal)
 {
 	map<Key, Node> track_nodes;
 	priority_queue<Node> nodes;
@@ -112,24 +113,23 @@ list<const Track *> dijkstra(const Track &from, unsigned ep, const Pred &goal)
 	if(!final)
 		throw InvalidParameterValue("Could not find a route");
 
-	list<const Track *> result;
+	list<Track *> result;
 	for(Node *node=final; node; node=node->prev)
 		result.push_front(node->track);
 
 	return result;
 }
 
-unsigned count = 0;
-
 template<typename Pred>
-Route *create_route(const Track &from, unsigned ep, const Pred &goal)
+Route *create_route(Track &from, unsigned ep, const Pred &goal)
 {
-	list<const Track *> tracks = dijkstra(from, ep, goal);
+	list<Track *> tracks = dijkstra(from, ep, goal);
 
-	Route *route = new Route(from.get_layout(), format("-%d-", ++count));
-	for(list<const Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
+	Route *route = new Route(from.get_layout());
+	for(list<Track *>::iterator i=tracks.begin(); i!=tracks.end(); ++i)
 		route->add_track(**i);
 
+	route->set_name("Pathfinder");
 	route->set_temporary(true);
 
 	return route;
@@ -140,9 +140,8 @@ Route *create_route(const Track &from, unsigned ep, const Pred &goal)
 
 namespace Marklin {
 
-Route::Route(Layout &l, const string &n):
+Route::Route(Layout &l):
 	layout(l),
-	name(n),
 	temporary(false)
 {
 	layout.add_route(*this);
@@ -154,11 +153,83 @@ Route::~Route()
 	layout.remove_route(*this);
 }
 
+void Route::set_name(const string &n)
+{
+	name = n;
+	signal_name_changed.emit(name);
+}
+
 void Route::set_temporary(bool t)
 {
 	temporary = t;
 }
 
+void Route::set_turnout(unsigned addr, unsigned path)
+{
+	if(!addr)
+		throw InvalidParameterValue("Invalid turnout address");
+	map<unsigned, int>::iterator i = turnouts.find(addr);
+	if(i==turnouts.end())
+		throw KeyError("Turnout is not in this route");
+	if(i->second>=0 && path!=static_cast<unsigned>(i->second))
+		throw InvalidState("Setting conflicts with route");
+	i->second = path;
+}
+
+void Route::update_turnouts()
+{
+	set<unsigned> found;
+	for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
+		if(unsigned tid = (*i)->get_turnout_id())
+		{
+			found.insert(tid);
+
+			const vector<Endpoint> &endpoints = (*i)->get_type().get_endpoints();
+			const vector<Track *> &links = (*i)->get_links();
+
+			// Build a combined path mask from linked endpoints
+			unsigned mask = 15;
+			for(unsigned j=0; j<endpoints.size(); ++j)
+			{
+				if(!tracks.count(links[j]))
+					continue;
+
+				if(unsigned tid2 = links[j]->get_turnout_id())
+				{
+					const Endpoint &ep = links[j]->get_type().get_endpoints()[links[j]->get_endpoint_by_link(**i)];
+					int p = get_turnout(tid2);
+					if(p>=0 && !(ep.paths&(1<<p)))
+					{
+						// The linked track is a turnout and has a path which is incompatible with this endpoint
+						mask &= ~endpoints[j].paths;
+						continue;
+					}
+				}
+				mask &= endpoints[j].paths;
+			}
+
+			if(mask && !(mask&(mask-1)))
+			{
+				// Exactly one possible choice, set the path accordingly
+				unsigned path = 0;
+				for(; (mask && !(mask&1)); mask>>=1, ++path) ;
+				turnouts[tid] = path;
+			}
+			else if(!turnouts.count(tid))
+				// More than one possible choice, and no existing entry - set as undecided
+				turnouts[tid] = -1;
+		}
+
+	// Remove any turnouts that do not exist in the route
+	for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
+	{
+		if(!found.count(i->first))
+			turnouts.erase(i++);
+		else
+			++i;
+	}
+}
+
 int Route::get_turnout(unsigned id) const
 {
 	map<unsigned, int>::const_iterator i = turnouts.find(id);
@@ -167,7 +238,7 @@ int Route::get_turnout(unsigned id) const
 	return -1;
 }
 
-void Route::add_track(const Track &trk)
+void Route::add_track(Track &trk)
 {
 	if(tracks.count(&trk))
 		return;
@@ -187,17 +258,17 @@ void Route::add_track(const Track &trk)
 	update_turnouts();
 }
 
-void Route::add_tracks(const set<const Track *> &trks)
+void Route::add_tracks(const set<Track *> &trks)
 {
-	set<const Track *> pending;
-	for(set<const Track *>::const_iterator i=trks.begin(); i!=trks.end(); ++i)
+	set<Track *> pending;
+	for(set<Track *>::const_iterator i=trks.begin(); i!=trks.end(); ++i)
 		if(!tracks.count(*i))
 			pending.insert(*i);
 
 	while(!pending.empty())
 	{
 		bool found = false;
-		for(set<const Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
+		for(set<Track *>::const_iterator i=pending.begin(); i!=pending.end(); ++i)
 			if(tracks.empty() || check_validity(**i)==7)
 			{
 				tracks.insert(*i);
@@ -213,70 +284,49 @@ void Route::add_tracks(const set<const Track *> &trks)
 	update_turnouts();
 }
 
-void Route::save(list<DataFile::Statement> &st) const
+void Route::add_track_chain(Track &start, unsigned ep, const TurnoutMap &trnts)
 {
-	for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
-		st.push_back((DataFile::Statement("turnout"), i->first, i->second));
-}
+	TrackIter iter(&start, ep);
+	while(iter)
+	{
+		if(iter->get_type().is_dead_end())
+			break;
 
-void Route::update_turnouts()
-{
-	set<unsigned> found;
-	for(set<const Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
-		if(unsigned tid=(*i)->get_turnout_id())
+		if(has_track(*iter))
+			break;
+
+		int path = 0;
+		if(iter->get_turnout_id())
 		{
-			found.insert(tid);
+			TurnoutMap::const_iterator i = trnts.find(iter->get_turnout_id());
+			if(i==trnts.end())
+				break;
 
-			const vector<Endpoint> &endpoints = (*i)->get_type().get_endpoints();
-			const vector<Track *> &links = (*i)->get_links();
+			path = i->second;
+		}
 
-			// Build a combined path mask from linked endpoints
-			unsigned mask = 15;
-			for(unsigned j=0; j<endpoints.size(); ++j)
-			{
-				if(!tracks.count(links[j]))
-					continue;
+		add_track(*iter);
 
-				if(unsigned tid2=links[j]->get_turnout_id())
-				{
-					const Endpoint &ep = links[j]->get_type().get_endpoints()[links[j]->get_endpoint_by_link(**i)];
-					int p = get_turnout(tid2);
-					if(p>=0 && !(ep.paths&(1<<p)))
-					{
-						// The linked track is a turnout and has a path which is incompatible with this endpoint
-						mask &= ~endpoints[j].paths;
-						continue;
-					}
-				}
-				mask &= endpoints[j].paths;
-			}
+		iter = iter.next(path);
+	}
+}
 
-			if(mask && !(mask&(mask-1)))
-			{
-				// Exactly one possible choice, set the path accordingly
-				unsigned path = 0;
-				for(; (mask && !(mask&1)); mask>>=1, ++path) ;
-				turnouts[tid] = path;
-			}
-			else if(!turnouts.count(tid))
-				// More than one possible choice, and no existing entry - set as undecided
-				turnouts[tid] = -1;
-		}
+bool Route::has_track(Track &t) const
+{
+	return tracks.count(&t);
+}
 
-	// Remove any turnouts that do not exist in the route
-	for(map<unsigned, int>::iterator i=turnouts.begin(); i!=turnouts.end();)
-	{
-		if(!found.count(i->first))
-			turnouts.erase(i++);
-		else
-			++i;
-	}
+void Route::save(list<DataFile::Statement> &st) const
+{
+	st.push_back((DataFile::Statement("name"), name));
+	for(map<unsigned, int>::const_iterator i=turnouts.begin(); i!=turnouts.end(); ++i)
+		st.push_back((DataFile::Statement("turnout"), i->first, i->second));
 }
 
-unsigned Route::check_validity(const Track &trk) const
+unsigned Route::check_validity(Track &trk) const
 {
 	unsigned result = 4;
-	for(set<const Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
+	for(set<Track *>::const_iterator i=tracks.begin(); i!=tracks.end(); ++i)
 	{
 		int epi=(*i)->get_endpoint_by_link(trk);
 		if(epi>=0)
@@ -330,26 +380,62 @@ void Route::track_removed(Track &t)
 	tracks.erase(&t);
 }
 
-Route *Route::find(const Track &from, unsigned ep, const Track &to)
+Route *Route::find(Track &from, unsigned ep, Track &to)
 {
 	return create_route(from, ep, TrackMatch(to));
 }
 
-Route *Route::find(const Track &from, unsigned ep, const Route &to)
+Route *Route::find(Track &from, unsigned ep, const Route &to)
 {
-	return create_route(from, ep, TrackInRoute(to));
+	return create_route(from, ep, TrackInSet(to.get_tracks()));
+}
+
+Route *Route::find(Track &from, unsigned ep, const set<Track *> &to)
+{
+	return create_route(from, ep, TrackInSet(to));
 }
 
 
 Route::Loader::Loader(Route &r):
 	DataFile::BasicLoader<Route>(r)
 {
+	add("name",    &Route::name);
 	add("turnout", &Loader::turnout);
 }
 
+void Route::Loader::finish()
+{
+	const set<Track *> &ltracks = obj.layout.get_tracks();
+	for(set<Track *>::const_iterator i=ltracks.begin(); i!=ltracks.end(); ++i)
+	{
+		unsigned tid = (*i)->get_turnout_id();
+		if(!tid)
+			continue;
+
+		TurnoutMap::iterator j = turnouts.find(tid);
+		if(j==turnouts.end())
+			continue;
+
+		unsigned path_mask = 1<<j->second;
+		const vector<Endpoint> &eps = (*i)->get_type().get_endpoints();
+		for(unsigned k=0; k<eps.size(); ++k)
+			if(eps[k].paths&path_mask)
+			{
+				Track *link = (*i)->get_link(k);
+				if(!obj.tracks.count(link))
+					obj.add_track_chain(*link, link->get_endpoint_by_link(**i), turnouts);
+				if(!obj.tracks.count(*i))
+					obj.add_track_chain(**i, k, turnouts);
+				break;
+			}
+
+		break;
+	}
+}
+
 void Route::Loader::turnout(unsigned id, unsigned path)
 {
-	obj.turnouts[id] = path;
+	turnouts[id] = path;
 }
 
 } // namespace Marklin