X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Flibr2c2%2Ftrainrouteplanner.h;h=e3d3770c52a113bf8f4bcb6c813bb381fc899fba;hb=3dd660ffad729fbd6e75e6401f5c7f27b9013faf;hp=726ebe4229e5fb9d7a3b931bff9e1d8602e5c9f3;hpb=1c072afdb1866ba397ee8e6155f5f68c6c7ab4da;p=r2c2.git

diff --git a/source/libr2c2/trainrouteplanner.h b/source/libr2c2/trainrouteplanner.h
index 726ebe4..e3d3770 100644
--- a/source/libr2c2/trainrouteplanner.h
+++ b/source/libr2c2/trainrouteplanner.h
@@ -3,8 +3,10 @@
 
 #include <list>
 #include <vector>
+#include <msp/core/thread.h>
 #include <msp/time/timedelta.h>
 #include "trackiter.h"
+#include "trainrouter.h"
 
 namespace R2C2 {
 
@@ -12,19 +14,32 @@ class Layout;
 class Route;
 class Track;
 class Train;
-class TrainRouter;
 
 class TrainRoutePlanner
 {
+public:
+	enum Result
+	{
+		PENDING,
+		COMPLETE,
+		FAILED
+	};
+
 private:
 	struct TrainRoutingState;
 
 	struct TrainRoutingInfo
 	{
 		Train *train;
+		float speed;
+		Block *first_noncritical;
 		TrainRouter *router;
-		Route *route;
-		std::list<TrainRoutingState *> waits;
+		std::vector<TrainRouter::Waypoint> waypoints;
+		std::vector<const TrainRouteMetric *> metrics;
+		bool has_duration;
+		std::list<Route *> routes;
+		Track *track_history[2];
+		std::list<TrainRouter::SequencePoint> sequence;
 
 		TrainRoutingInfo(Train &);
 	};
@@ -54,51 +69,96 @@ private:
 	{
 		TrainRoutingInfo *info;
 		TrackIter track;
-		unsigned path;
+		unsigned char path;
+		bool critical;
 		OccupiedTrack *occupied_tracks;
 		float offset;
 		float back_offset;
 		TrainState state;
+		Msp::Time::TimeDelta delay;
+		Msp::Time::TimeDelta duration;
+		unsigned waypoint;
+		float distance_traveled;
+		float remaining_estimate;
+		Msp::Time::TimeDelta wait_time;
+		int blocked_by;
 
 		TrainRoutingState(TrainRoutingInfo &);
 		TrainRoutingState(const TrainRoutingState &);
 		~TrainRoutingState();
 
 		Msp::Time::TimeDelta get_time_to_next_track() const;
-		bool is_occupied(Track &) const;
+		bool is_occupying(Track &) const;
+		bool check_arrival();
 		void advance(float);
+		void advance(const Msp::Time::TimeDelta &);
 		void advance_track(unsigned);
+		void update_estimate();
+		bool is_viable() const;
 	};
 
 	struct RoutingStep
 	{
 		Msp::Time::TimeDelta time;
+		Msp::Time::TimeDelta penalty;
+		Msp::Time::TimeDelta cost_estimate;
 		std::vector<TrainRoutingState> trains;
-		RoutingStep *prev;
+		const RoutingStep *prev;
 
 		RoutingStep();
-		RoutingStep(RoutingStep *);
+		RoutingStep(const RoutingStep *);
 
+		void create_successors(std::list<RoutingStep> &) const;
+		bool update_states();
+		bool check_deadlocks() const;
+		int get_occupant(Track &) const;
+		int find_next_train() const;
 		void advance(const Msp::Time::TimeDelta &);
+		void update_estimate();
+		bool is_viable() const;
 		bool is_goal() const;
 
 		bool operator<(const RoutingStep &) const;
 	};
 
+	class PlanningThread: public Msp::Thread
+	{
+	private:
+		TrainRoutePlanner &planner;
+
+	public:
+		PlanningThread(TrainRoutePlanner &);
+
+	private:
+		virtual void main();
+	};
+
 	std::vector<TrainRoutingInfo> routed_trains;
 	std::list<RoutingStep> steps;
+	std::list<RoutingStep> queue;
+	const RoutingStep *goal;
+	Msp::Time::TimeDelta timeout;
+	Result result;
+	PlanningThread *thread;
 
 public:
 	TrainRoutePlanner(Layout &);
-
-	void plan();
+	~TrainRoutePlanner();
+
+	void set_timeout(const Msp::Time::TimeDelta &);
+	Result plan();
+	void plan_async();
+	Result check();
+	Result get_result() const { return result; }
+	const std::list<Route *> &get_routes_for(const Train &) const;
+	const std::list<TrainRouter::SequencePoint> &get_sequence_for(const Train &) const;
 private:
-	bool update_states(RoutingStep &);
-	int find_next_train(RoutingStep &);
-	void add_steps(RoutingStep &, unsigned);
-	void add_waiting_step(RoutingStep &, unsigned);
-	void add_steps(RoutingStep &, TrainRoutingState &train);
-	void create_routes(RoutingStep &);
+	const TrainRoutingInfo &get_train_info(const Train &) const;
+	const RoutingStep &get_step();
+	void prepare_plan();
+	void create_plan();
+	void add_steps(const RoutingStep &);
+	void finalize_plan();
 };
 
 } // namespace R2C2