From 5eeb8f5749586b9aae2996d2143e300388d15611 Mon Sep 17 00:00:00 2001 From: Mikko Rasa Date: Sat, 12 Apr 2014 22:32:03 +0300 Subject: [PATCH] Replace waits with a more robust sequencing system --- source/libr2c2/trainrouteplanner.cpp | 51 +++++++++++++----- source/libr2c2/trainrouteplanner.h | 13 ++++- source/libr2c2/trainrouter.cpp | 81 ++++++++++++++++++++++------ source/libr2c2/trainrouter.h | 16 ++++-- 4 files changed, 125 insertions(+), 36 deletions(-) diff --git a/source/libr2c2/trainrouteplanner.cpp b/source/libr2c2/trainrouteplanner.cpp index 581bd03..69a3bbe 100644 --- a/source/libr2c2/trainrouteplanner.cpp +++ b/source/libr2c2/trainrouteplanner.cpp @@ -75,17 +75,15 @@ void TrainRoutePlanner::create_routes(const RoutingStep &goal) i->track_history[j] = 0; } + map sequenced_tracks; + unsigned sequence = steps.size(); for(const RoutingStep *i=&goal; i; i=i->prev) - { for(vector::const_iterator j=i->trains.begin(); j!=i->trains.end(); ++j) { Track **history = j->info->track_history; if(j->track.track()==history[0]) continue; - if(j->state==WAITING || j->state==BLOCKED) - j->info->waits.push_front(&*j); - Route *route = j->info->routes.front(); if(route->has_track(*j->track)) { @@ -102,8 +100,28 @@ void TrainRoutePlanner::create_routes(const RoutingStep &goal) for(unsigned k=2; k>0; --k) history[k] = history[k-1]; history[0] = j->track.track(); + + bool waitable = j->track.endpoint().paths!=j->track->get_type().get_paths(); + map::iterator k = sequenced_tracks.find(j->track.track()); + if(k!=sequenced_tracks.end()) + { + if(!k->second->preceding) + { + k->second->preceding = j->info; + k->second->sequence_in = sequence; + } + j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence)); + if(waitable) + k->second = &j->info->sequence.front(); + --sequence; + } + else if(waitable) + { + j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence)); + sequenced_tracks[j->track.track()] = &j->info->sequence.front(); + --sequence; + } } - } for(vector::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i) { @@ -115,18 +133,25 @@ void TrainRoutePlanner::create_routes(const RoutingStep &goal) i->router->add_route(**j); } - const TrainRoutingState *current_wait = 0; - for(list::const_iterator j=i->waits.begin(); j!=i->waits.end(); ++j) - if(!current_wait || (*j)->track.track()!=current_wait->track.track()) - { - Block &block = (*j)->track.next()->get_block(); - i->router->add_wait(block, 0); - current_wait = *j; - } + for(list::iterator j=i->sequence.begin(); j!=i->sequence.end(); ++j) + { + if(j->preceding && j->preceding!=&*i) + i->router->add_sequence_point(j->track->get_block(), *j->preceding->train, j->sequence_in, j->sequence_out); + else + i->router->add_sequence_point(j->track->get_block(), j->sequence_out); + } } } +TrainRoutePlanner::SequencingInfo::SequencingInfo(Track *t, unsigned o): + track(t), + preceding(0), + sequence_in(0), + sequence_out(o) +{ } + + TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t): train(&t), speed(train->get_maximum_speed()), diff --git a/source/libr2c2/trainrouteplanner.h b/source/libr2c2/trainrouteplanner.h index 57d2de5..c6ca741 100644 --- a/source/libr2c2/trainrouteplanner.h +++ b/source/libr2c2/trainrouteplanner.h @@ -18,6 +18,17 @@ class TrainRoutePlanner { private: struct TrainRoutingState; + struct TrainRoutingInfo; + + struct SequencingInfo + { + Track *track; + TrainRoutingInfo *preceding; + unsigned sequence_in; + unsigned sequence_out; + + SequencingInfo(Track *, unsigned); + }; struct TrainRoutingInfo { @@ -26,7 +37,7 @@ private: TrainRouter *router; std::list routes; Track *track_history[3]; - std::list waits; + std::list sequence; TrainRoutingInfo(Train &); }; diff --git a/source/libr2c2/trainrouter.cpp b/source/libr2c2/trainrouter.cpp index 9a86263..8b3433c 100644 --- a/source/libr2c2/trainrouter.cpp +++ b/source/libr2c2/trainrouter.cpp @@ -70,6 +70,9 @@ bool TrainRouter::set_route(const Route *r) destination = 0; waypoints.clear(); } + sequence_points.clear(); + pending_sequence_checks.clear(); + current_sequence = 0; train.refresh_blocks_from(*fncb); @@ -91,14 +94,6 @@ bool TrainRouter::add_route(const Route &r) return true; } -void TrainRouter::add_wait(Block &block, Train *tr) -{ - Wait wait; - wait.block = █ - wait.train = tr; - waits.push_back(wait); -} - const Route *TrainRouter::get_route() const { if(routes.empty()) @@ -106,6 +101,19 @@ const Route *TrainRouter::get_route() const return routes.front(); } +void TrainRouter::add_sequence_point(Block &b, unsigned o) +{ + sequence_points.push_back(SequencePoint(b, o)); +} + +void TrainRouter::add_sequence_point(Block &b, Train &t, unsigned i, unsigned o) +{ + SequencePoint sp(b, o); + sp.preceding_train = &t; + sp.sequence_in = i; + sequence_points.push_back(sp); +} + void TrainRouter::set_destination(const TrackChain &d) { destination = &d; @@ -196,6 +204,15 @@ void TrainRouter::tick(const Time::TimeDelta &dt) if(update_pending) create_plans(train.get_layout()); + for(list::iterator i=pending_sequence_checks.begin(); i!=pending_sequence_checks.end(); ++i) + if((*i)->preceding_train->get_ai_of_type()->get_current_sequence()>=(*i)->sequence_in) + { + (*i)->preceding_train = 0; + if(*i==&sequence_points.front()) + train.stop_at(0); + } + pending_sequence_checks.clear(); + if(arriving==1 && !train.get_speed()) { signal_arrived.emit(destination); @@ -223,12 +240,36 @@ void TrainRouter::block_reserved(Block &block, Train *t) { if(t!=&train) { - if(!waits.empty() && waits.front().block==&block) + if(!t) + return; + + TrainRouter *other_router = 0; + for(list::iterator i=sequence_points.begin(); i!=sequence_points.end(); ++i) + if(i->block==&block && i->preceding_train==t) + { + if(!other_router) + other_router = t->get_ai_of_type(); + if(other_router->get_current_sequence()>=i->sequence_in) + { + i->preceding_train = 0; + if(i==sequence_points.begin()) + train.stop_at(0); + } + else + pending_sequence_checks.push_back(&*i); + } + + return; + } + + if(!sequence_points.empty()) + { + SequencePoint &sp = sequence_points.front(); + if(sp.block==&block) { - train.stop_at(0); - waits.pop_front(); + current_sequence = sp.sequence_out; + sequence_points.pop_front(); } - return; } BlockIter b_iter = t->get_block_allocator().iter_for(block); @@ -254,8 +295,12 @@ void TrainRouter::block_reserved(Block &block, Train *t) return; } - if(!waits.empty() && waits.front().block==b_iter_next.block()) - train.stop_at(&block); + if(!sequence_points.empty()) + { + SequencePoint &sp = sequence_points.front(); + if(sp.preceding_train && sp.block==b_iter_next.block()) + train.stop_at(&block); + } } } @@ -406,9 +451,11 @@ void TrainRouter::create_plans(Layout &layout) } -TrainRouter::Wait::Wait(): - block(0), - train(0) +TrainRouter::SequencePoint::SequencePoint(Block &b, unsigned o): + block(&b), + preceding_train(0), + sequence_in(0), + sequence_out(o) { } diff --git a/source/libr2c2/trainrouter.h b/source/libr2c2/trainrouter.h index c1b6977..6f697f9 100644 --- a/source/libr2c2/trainrouter.h +++ b/source/libr2c2/trainrouter.h @@ -29,12 +29,14 @@ public: sigc::signal signal_waypoint_reached; private: - struct Wait + struct SequencePoint { Block *block; - Train *train; + Train *preceding_train; + unsigned sequence_in; + unsigned sequence_out; - Wait(); + SequencePoint(Block &, unsigned); }; typedef std::list RouteList; @@ -45,7 +47,9 @@ private: const TrackChain *destination; std::vector waypoints; std::vector metrics; - std::list waits; + std::list sequence_points; + std::list pending_sequence_checks; + unsigned current_sequence; Msp::Time::TimeDelta delay; bool update_pending; @@ -59,8 +63,10 @@ public: bool set_route(const Route *); bool add_route(const Route &); - void add_wait(Block &, Train *); const Route *get_route() const; + void add_sequence_point(Block &, unsigned); + void add_sequence_point(Block &, Train &, unsigned, unsigned); + unsigned get_current_sequence() const { return current_sequence; } void set_destination(const TrackChain &); const TrackChain *get_destination() const { return destination; } -- 2.43.0