source/libmarklin/block.cpp

   1 /* $Id$
   2
   3 This file is part of the MSP Märklin suite
   4 Copyright © 2006-2010  Mikkosoft Productions, Mikko Rasa
   5 Distributed under the GPL
   6 */
   7
   8 #include <algorithm>
   9 #include "block.h"
  10 #include "layout.h"
  11 #include "route.h"
  12 #include "trackiter.h"
  13 #include "tracktype.h"
  14
  15 using namespace std;
  16 using namespace Msp;
  17
  18 namespace Marklin {
  19
  20 Block::Block(Layout &l, Track &start):
  21         layout(l),
  22         id(0),
  23         sensor_id(start.get_sensor_id()),
  24         turnout_id(start.get_turnout_id()),
  25         train(0)
  26 {
  27         tracks.insert(&start);
  28         start.set_block(this);
  29
  30         list<Track *> queue;
  31         queue.push_back(&start);
  32
  33         while(!queue.empty())
  34         {
  35                 Track *track = queue.front();
  36                 queue.erase(queue.begin());
  37
  38                 const vector<Track *> &links = track->get_links();
  39                 for(unsigned i=0; i<links.size(); ++i)
  40                         if(links[i] && !tracks.count(links[i]))
  41                         {
  42                                 if(links[i]->get_sensor_id()==sensor_id && links[i]->get_turnout_id()==turnout_id)
  43                                 {
  44                                         queue.push_back(links[i]);
  45                                         tracks.insert(links[i]);
  46                                         links[i]->set_block(this);
  47                                 }
  48                                 else
  49                                         endpoints.push_back(Endpoint(track, i));
  50                         }
  51         }
  52
  53         determine_id();
  54
  55         for(unsigned i=0; i<endpoints.size(); ++i)
  56         {
  57                 unsigned path = 1<<i;
  58                 endpoints[i].paths |= path;
  59                 set<Track *> visited;
  60                 find_paths(*endpoints[i].track, endpoints[i].track_ep, path, visited);
  61         }
  62
  63         layout.add_block(*this);
  64 }
  65
  66 Block::~Block()
  67 {
  68         set<Track *> trks = tracks;
  69         tracks.clear();
  70         for(set<Track *>::iterator i=trks.begin(); i!=trks.end(); ++i)
  71                 (*i)->set_block(0);
  72
  73         for(vector<Endpoint>::iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
  74                 if(Block *blk = i->link)
  75                 {
  76                         i->link = 0;
  77                         blk->break_link(*this);
  78                 }
  79
  80         layout.remove_block(*this);
  81 }
  82
  83 bool Block::has_track(Track &t) const
  84 {
  85         return tracks.count(&t);
  86 }
  87
  88 int Block::get_endpoint_by_link(Block &other) const
  89 {
  90         for(unsigned i=0; i<endpoints.size(); ++i)
  91                 if(endpoints[i].link==&other)
  92                         return i;
  93
  94         return -1;
  95 }
  96
  97 float Block::get_path_length(unsigned entry, const Route *route) const
  98 {
  99         if(entry>=endpoints.size())
 100                 throw InvalidParameterValue("Endpoint index out of range");
 101
 102         TrackIter t_iter(endpoints[entry].track, endpoints[entry].track_ep);
 103
 104         float result = 0;
 105         while(t_iter && has_track(*t_iter))
 106         {
 107                 int path = -1;
 108                 if(t_iter->get_turnout_id() && route)
 109                         path = route->get_turnout(t_iter->get_turnout_id());
 110                 if(path==-1)
 111                         path = t_iter->get_active_path();
 112
 113                 result += t_iter->get_type().get_path_length(path);
 114
 115                 t_iter = t_iter.next(path);
 116         }
 117
 118         return result;
 119 }
 120
 121 void Block::check_link(Block &other)
 122 {
 123         for(vector<Endpoint>::iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
 124         {
 125                 if(i->link)
 126                         continue;
 127
 128                 for(vector<Endpoint>::iterator j=other.endpoints.begin(); j!=other.endpoints.end(); ++j)
 129                         if(j->track==i->track->get_link(i->track_ep) && j->track->get_link(j->track_ep)==i->track && !j->link)
 130                         {
 131                                 i->link = &other;
 132                                 j->link = this;
 133
 134                                 determine_id();
 135                                 other.determine_id();
 136                         }
 137         }
 138 }
 139
 140 void Block::break_link(Block &other)
 141 {
 142         for(vector<Endpoint>::iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
 143                 if(i->link==&other)
 144                 {
 145                         i->link = 0;
 146                         other.break_link(*this);
 147                         determine_id();
 148                 }
 149 }
 150
 151 Block *Block::get_link(unsigned epi) const
 152 {
 153         if(epi>=endpoints.size())
 154                 throw InvalidParameterValue("Endpoint index out of range");
 155         return endpoints[epi].link;
 156 }
 157
 158 bool Block::reserve(Train *t)
 159 {
 160         if(!t || !train)
 161         {
 162                 train = t;
 163                 layout.signal_block_reserved.emit(*this, train);
 164                 return true;
 165         }
 166         else
 167                 return false;
 168 }
 169
 170 void Block::find_paths(Track &track, unsigned track_ep, unsigned path, set<Track *> &visited)
 171 {
 172         visited.insert(&track);
 173
 174         const vector<Marklin::Endpoint> &eps = track.get_type().get_endpoints();
 175         for(unsigned i=0; i<eps.size(); ++i)
 176         {
 177                 if(i==track_ep) continue;
 178                 Track *link = track.get_link(i);
 179                 if(!link) continue;
 180                 if(visited.count(link)) continue;
 181                 if(!(eps[i].paths&eps[track_ep].paths)) continue;
 182
 183                 if(tracks.count(link))
 184                         find_paths(*link, link->get_endpoint_by_link(track), path, visited);
 185                 else
 186                 {
 187                         for(vector<Endpoint>::iterator j=endpoints.begin(); j!=endpoints.end(); ++j)
 188                                 if(j->track==&track && j->track_ep==i)
 189                                         j->paths |= path;
 190                 }
 191         }
 192 }
 193
 194 void Block::determine_id()
 195 {
 196         if(sensor_id)
 197                 id = 0x1000|sensor_id;
 198         else if(turnout_id)
 199                 id = 0x2000|turnout_id;
 200         else if(endpoints.size()==2)
 201         {
 202                 unsigned id1 = endpoints[0].link ? endpoints[0].link->get_id() : 1;
 203                 unsigned id2 = endpoints[1].link ? endpoints[1].link->get_id() : 1;
 204                 if(id2<id1)
 205                         swap(id1, id2);
 206                 id = (id1<<16)|id2;
 207         }
 208         else if(endpoints.size()==1)
 209         {
 210                 unsigned id1 = endpoints[0].link ? endpoints[0].link->get_id() : 1;
 211                 id = 0x10000 | id1;
 212         }
 213 }
 214
 215
 216 Block::Endpoint::Endpoint(Track *t, unsigned e):
 217         track(t),
 218         track_ep(e),
 219         link(0),
 220         paths(0)
 221 { }
 222
 223 } // namespace Marklin