1 //  Copyright (C) 2007, 2008, 2009, 2014 Ben Asselstine
2 //
3 //  This program is free software; you can redistribute it and/or modify
4 //  it under the terms of the GNU General Public License as published by
5 //  the Free Software Foundation; either version 3 of the License, or
6 //  (at your option) any later version.
7 //
8 //  This program is distributed in the hope that it will be useful,
9 //  but WITHOUT ANY WARRANTY; without even the implied warranty of
10 //  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11 //  GNU Library General Public License for more details.
12 //
13 //  You should have received a copy of the GNU General Public License
14 //  along with this program; if not, write to the Free Software
15 //  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
16 //  02110-1301, USA.
17 
18 #include <sigc++/functors/mem_fun.h>
19 
20 #include "roadlist.h"
21 #include "road.h"
22 #include "GameMap.h"
23 #include "xmlhelper.h"
24 
25 Glib::ustring Roadlist::d_tag = "roadlist";
26 //#define debug(x) {std::cerr<<__FILE__<<": "<<__LINE__<<": "<<x<<std::endl<<std::flush;}
27 #define debug(x)
28 
29 Roadlist* Roadlist::s_instance=0;
30 
getInstance()31 Roadlist* Roadlist::getInstance()
32 {
33     if (s_instance == 0)
34         s_instance = new Roadlist();
35 
36     return s_instance;
37 }
38 
getInstance(XML_Helper * helper)39 Roadlist* Roadlist::getInstance(XML_Helper* helper)
40 {
41     if (s_instance)
42         deleteInstance();
43 
44     s_instance = new Roadlist(helper);
45     return s_instance;
46 }
47 
deleteInstance()48 void Roadlist::deleteInstance()
49 {
50     if (s_instance)
51         delete s_instance;
52 
53     s_instance = 0;
54 }
55 
Roadlist()56 Roadlist::Roadlist()
57 {
58 }
59 
Roadlist(XML_Helper * helper)60 Roadlist::Roadlist(XML_Helper* helper)
61 {
62     helper->registerTag(Road::d_tag, sigc::mem_fun(this, &Roadlist::load));
63 }
64 
save(XML_Helper * helper) const65 bool Roadlist::save(XML_Helper* helper) const
66 {
67     bool retval = true;
68 
69     retval &= helper->openTag(Roadlist::d_tag);
70 
71     for (const_iterator it = begin(); it != end(); it++)
72         retval &= (*it)->save(helper);
73 
74     retval &= helper->closeTag();
75 
76     return retval;
77 }
78 
load(Glib::ustring tag,XML_Helper * helper)79 bool Roadlist::load(Glib::ustring tag, XML_Helper* helper)
80 {
81     if (tag != Road::d_tag)
82     //what has happened?
83         return false;
84 
85     add(new Road(helper));
86 
87     return true;
88 }
89 
calculateType(Vector<int> t) const90 int Roadlist::calculateType (Vector<int> t) const
91 {
92     // examine neighbour tiles to discover whether there's a road on them
93     bool u = false; //up
94     bool b = false; //bottom
95     bool l = false; //left
96     bool r = false; //right
97 
98     if (t.y > 0)
99       u = getObjectAt(t + Vector<int>(0, -1));
100     if (t.y < GameMap::getHeight() - 1)
101       b = getObjectAt(t + Vector<int>(0, 1));
102     if (t.x > 0)
103       l = getObjectAt(t + Vector<int>(-1, 0));
104     if (t.x < GameMap::getWidth() - 1)
105     r = getObjectAt(t + Vector<int>(1, 0));
106 
107     // then translate this to the type
108     int type = 2;
109     //show road type 2 when no other road tiles are around
110     if (!u && !b && !l && !r)
111 	type = 2;
112     else if (u && b && l && r)
113 	type = 2;
114     else if (!u && b && l && r)
115 	type = 9;
116     else if (u && !b && l && r)
117 	type = 8;
118     else if (u && b && !l && r)
119 	type = 7;
120     else if (u && b && l && !r)
121 	type = 10;
122     else if (u && b && !l && !r)
123 	type = 1;
124     else if (!u && !b && l && r)
125 	type = 0;
126     else if (u && !b && l && !r)
127 	type = 3;
128     else if (u && !b && !l && r)
129 	type = 4;
130     else if (!u && b && l && !r)
131 	type = 6;
132     else if (!u && b && !l && r)
133 	type = 5;
134     else if (u && !b && !l && !r)
135 	type = Road::CONNECTS_NORTH;
136     else if (!u && b && !l && !r)
137 	type = Road::CONNECTS_SOUTH;
138     else if (!u && !b && l && !r)
139 	type = Road::CONNECTS_WEST;
140     else if (!u && !b && !l && r)
141 	type = Road::CONNECTS_EAST;
142     return type;
143 }
144 
145