[1606] | 1 | #include "mapstorage.h" |
---|
[1645] | 2 | #include <gtkmm.h> |
---|
[1634] | 3 | #include <cmath> |
---|
[1442] | 4 | |
---|
[1606] | 5 | MapStorage::MapStorage() : modified(false), file_name("") |
---|
[1442] | 6 | { |
---|
[1606] | 7 | nodemap_storage["coordinates_x"] = new Graph::NodeMap<double>(graph); |
---|
| 8 | coords.setXMap(*nodemap_storage["coordinates_x"]); |
---|
| 9 | nodemap_storage["coordinates_y"] = new Graph::NodeMap<double>(graph); |
---|
| 10 | coords.setYMap(*nodemap_storage["coordinates_y"]); |
---|
| 11 | |
---|
| 12 | nodemap_storage["id"] = new Graph::NodeMap<double>(graph); |
---|
| 13 | edgemap_storage["id"] = new Graph::EdgeMap<double>(graph); |
---|
[1646] | 14 | |
---|
| 15 | nodemap_default["id"] = 1.0; |
---|
| 16 | edgemap_default["id"] = 1.0; |
---|
[1606] | 17 | } |
---|
| 18 | |
---|
| 19 | MapStorage::~MapStorage() |
---|
| 20 | { |
---|
| 21 | for (std::map<std::string, Graph::NodeMap<double>*>::const_iterator it = |
---|
| 22 | nodemap_storage.begin(); it != nodemap_storage.end(); ++it) |
---|
| 23 | { |
---|
| 24 | delete it->second; |
---|
| 25 | } |
---|
| 26 | for (std::map<std::string, Graph::EdgeMap<double>*>::const_iterator it = |
---|
| 27 | edgemap_storage.begin(); it != edgemap_storage.end(); ++it) |
---|
| 28 | { |
---|
| 29 | delete it->second; |
---|
| 30 | } |
---|
| 31 | } |
---|
[1442] | 32 | |
---|
[1645] | 33 | int MapStorage::addNodeMap(const std::string & name, Graph::NodeMap<double> *nodemap, double default_value = 0.0) |
---|
[1442] | 34 | { |
---|
[1597] | 35 | if( nodemap_storage.find(name) == nodemap_storage.end() ) |
---|
| 36 | { |
---|
| 37 | nodemap_storage[name]=nodemap; |
---|
[1645] | 38 | // set the maps default value |
---|
| 39 | nodemap_default[name] = default_value; |
---|
[1597] | 40 | return 0; |
---|
| 41 | } |
---|
| 42 | return 1; |
---|
[1442] | 43 | } |
---|
| 44 | |
---|
[1645] | 45 | int MapStorage::addEdgeMap(const std::string & name, Graph::EdgeMap<double> *edgemap, double default_value = 0.0) |
---|
[1442] | 46 | { |
---|
[1597] | 47 | if( edgemap_storage.find(name) == edgemap_storage.end() ) |
---|
| 48 | { |
---|
| 49 | edgemap_storage[name]=edgemap; |
---|
[1645] | 50 | // set the maps default value |
---|
| 51 | edgemap_default[name] = default_value; |
---|
[1597] | 52 | return 0; |
---|
| 53 | } |
---|
| 54 | return 1; |
---|
[1442] | 55 | } |
---|
| 56 | |
---|
| 57 | double MapStorage::maxOfNodeMap(const std::string & name) |
---|
| 58 | { |
---|
| 59 | double max=0; |
---|
[1606] | 60 | for (NodeIt j(graph); j!=INVALID; ++j) |
---|
[1442] | 61 | { |
---|
| 62 | if( (*nodemap_storage[name])[j]>max ) |
---|
| 63 | { |
---|
| 64 | max=(*nodemap_storage[name])[j]; |
---|
| 65 | } |
---|
| 66 | } |
---|
| 67 | return max; |
---|
| 68 | } |
---|
| 69 | |
---|
| 70 | double MapStorage::maxOfEdgeMap(const std::string & name) |
---|
| 71 | { |
---|
| 72 | double max=0; |
---|
[1606] | 73 | for (EdgeIt j(graph); j!=INVALID; ++j) |
---|
[1442] | 74 | { |
---|
| 75 | if( (*edgemap_storage[name])[j]>max ) |
---|
| 76 | { |
---|
| 77 | max=(*edgemap_storage[name])[j]; |
---|
| 78 | } |
---|
| 79 | } |
---|
| 80 | return max; |
---|
| 81 | } |
---|
| 82 | |
---|
| 83 | double MapStorage::minOfNodeMap(const std::string & name) |
---|
| 84 | { |
---|
[1606] | 85 | NodeIt j(graph); |
---|
[1617] | 86 | double min; |
---|
| 87 | if(j!=INVALID) |
---|
| 88 | { |
---|
| 89 | min=(*nodemap_storage[name])[j]; |
---|
| 90 | } |
---|
| 91 | else |
---|
| 92 | { |
---|
| 93 | min=0; |
---|
| 94 | } |
---|
[1442] | 95 | for (; j!=INVALID; ++j) |
---|
| 96 | { |
---|
| 97 | if( (*nodemap_storage[name])[j]<min ) |
---|
| 98 | { |
---|
| 99 | min=(*nodemap_storage[name])[j]; |
---|
| 100 | } |
---|
| 101 | } |
---|
| 102 | return min; |
---|
| 103 | } |
---|
| 104 | |
---|
| 105 | double MapStorage::minOfEdgeMap(const std::string & name) |
---|
| 106 | { |
---|
[1606] | 107 | EdgeIt j(graph); |
---|
[1617] | 108 | double min; |
---|
| 109 | if(j!=INVALID) |
---|
| 110 | { |
---|
| 111 | min=(*edgemap_storage[name])[j]; |
---|
| 112 | } |
---|
| 113 | else |
---|
| 114 | { |
---|
| 115 | min=0; |
---|
| 116 | } |
---|
[1606] | 117 | for (EdgeIt j(graph); j!=INVALID; ++j) |
---|
[1442] | 118 | { |
---|
| 119 | if( (*edgemap_storage[name])[j]<min ) |
---|
| 120 | { |
---|
| 121 | min=(*edgemap_storage[name])[j]; |
---|
| 122 | } |
---|
| 123 | } |
---|
| 124 | return min; |
---|
| 125 | } |
---|
| 126 | |
---|
[1645] | 127 | int MapStorage::readFromFile(const std::string &filename) |
---|
[1606] | 128 | { |
---|
| 129 | bool read_x = false; |
---|
| 130 | bool read_y = false; |
---|
[1646] | 131 | bool read_edge_id = false; |
---|
[1606] | 132 | |
---|
| 133 | try { |
---|
| 134 | LemonReader lreader(filename); |
---|
| 135 | ContentReader content(lreader); |
---|
| 136 | lreader.run(); |
---|
| 137 | |
---|
| 138 | const std::vector<std::string>& nodeMapNames = content.nodeSetMaps(0); |
---|
| 139 | const std::vector<std::string>& edgeMapNames = content.edgeSetMaps(0); |
---|
| 140 | |
---|
| 141 | GraphReader<Graph> greader(filename, graph); |
---|
| 142 | for (std::vector<std::string>::const_iterator it = nodeMapNames.begin(); |
---|
| 143 | it != nodeMapNames.end(); ++it) |
---|
| 144 | { |
---|
| 145 | if (*it == "coordinates_x") |
---|
| 146 | { |
---|
| 147 | read_x = true; |
---|
| 148 | //std::cout << "read X nodemap" << std::endl; |
---|
| 149 | } |
---|
| 150 | else if (*it == "coordinates_y") |
---|
| 151 | { |
---|
| 152 | read_y = true; |
---|
| 153 | //std::cout << "read Y nodemap" << std::endl; |
---|
| 154 | } |
---|
| 155 | else if (*it == "id") |
---|
| 156 | { |
---|
| 157 | //std::cout << "read id nodemap" << std::endl; |
---|
| 158 | } |
---|
| 159 | else |
---|
| 160 | { |
---|
| 161 | nodemap_storage[*it] = new Graph::NodeMap<double>(graph); |
---|
| 162 | //std::cout << "read " << *it << " nodemap" << std::endl; |
---|
| 163 | } |
---|
| 164 | greader.readNodeMap(*it, *nodemap_storage[*it]); |
---|
| 165 | } |
---|
| 166 | for (std::vector<std::string>::const_iterator it = edgeMapNames.begin(); |
---|
| 167 | it != edgeMapNames.end(); ++it) |
---|
| 168 | { |
---|
| 169 | if (*it == "id") |
---|
| 170 | { |
---|
| 171 | //std::cout << "read id edgemap" << std::endl; |
---|
| 172 | } |
---|
| 173 | else |
---|
| 174 | { |
---|
| 175 | edgemap_storage[*it] = new Graph::EdgeMap<double>(graph); |
---|
| 176 | //std::cout << "read " << *it << " edgemap" << std::endl; |
---|
| 177 | } |
---|
| 178 | greader.readEdgeMap(*it, *edgemap_storage[*it]); |
---|
| 179 | } |
---|
| 180 | greader.run(); |
---|
| 181 | } catch (DataFormatError& error) { |
---|
| 182 | Gtk::MessageDialog mdialog("Read Error"); |
---|
| 183 | mdialog.set_message(error.what()); |
---|
| 184 | mdialog.run(); |
---|
[1645] | 185 | clear(); |
---|
| 186 | return 1; |
---|
[1606] | 187 | } |
---|
| 188 | |
---|
[1646] | 189 | if (!read_edge_id) |
---|
| 190 | { |
---|
| 191 | edgemap_storage["id"] = new Graph::EdgeMap<double>(graph); |
---|
| 192 | int i = 1; |
---|
| 193 | for (EdgeIt e(graph); e != INVALID; ++e) |
---|
| 194 | { |
---|
| 195 | (*edgemap_storage["id"])[e] = i++; |
---|
| 196 | } |
---|
| 197 | } |
---|
| 198 | |
---|
[1606] | 199 | if (!read_x || !read_y) |
---|
| 200 | { |
---|
| 201 | int node_num = 0; |
---|
| 202 | for (NodeIt n(graph); n != INVALID; ++n) |
---|
| 203 | { |
---|
| 204 | node_num++; |
---|
| 205 | } |
---|
| 206 | const double pi = 3.142; |
---|
| 207 | double step = 2 * pi / (double) node_num; |
---|
| 208 | int i = 0; |
---|
| 209 | for (NodeIt n(graph); n != INVALID; ++n) |
---|
| 210 | { |
---|
| 211 | nodemap_storage["coordinates_x"]->set(n, 250.0 * cos(i * step)); |
---|
| 212 | nodemap_storage["coordinates_y"]->set(n, 250.0 * sin(i * step)); |
---|
| 213 | i++; |
---|
| 214 | } |
---|
| 215 | } |
---|
[1645] | 216 | |
---|
| 217 | // fill in the default values for the maps |
---|
| 218 | for (std::map<std::string, Graph::NodeMap<double>*>::const_iterator it = |
---|
| 219 | nodemap_storage.begin(); it != nodemap_storage.end(); ++it) |
---|
| 220 | { |
---|
| 221 | if ((it->first != "id") && |
---|
| 222 | (it->first != "coordiantes_x") && |
---|
| 223 | (it->first != "coordinates_y")) |
---|
| 224 | { |
---|
| 225 | nodemap_default[it->first] = 0.0; |
---|
| 226 | } |
---|
[1646] | 227 | else if (it->first == "id") |
---|
| 228 | { |
---|
| 229 | NodeIt n(graph); |
---|
| 230 | double max = (*nodemap_storage["id"])[n]; |
---|
| 231 | for (; n != INVALID; ++n) |
---|
| 232 | { |
---|
| 233 | if ((*nodemap_storage["id"])[n] > max) |
---|
| 234 | max = (*nodemap_storage["id"])[n]; |
---|
| 235 | } |
---|
| 236 | nodemap_default["id"] = max + 1.0; |
---|
| 237 | } |
---|
[1645] | 238 | } |
---|
| 239 | for (std::map<std::string, Graph::EdgeMap<double>*>::const_iterator it = |
---|
| 240 | edgemap_storage.begin(); it != edgemap_storage.end(); ++it) |
---|
| 241 | { |
---|
| 242 | if (it->first != "id") |
---|
| 243 | { |
---|
| 244 | edgemap_default[it->first] = 0.0; |
---|
| 245 | } |
---|
[1646] | 246 | else |
---|
| 247 | { |
---|
[1649] | 248 | double max = std::numeric_limits<double>::min(); |
---|
| 249 | for (EdgeIt e(graph); e != INVALID; ++e) |
---|
[1646] | 250 | { |
---|
| 251 | if ((*edgemap_storage["id"])[e] > max) |
---|
| 252 | max = (*edgemap_storage["id"])[e]; |
---|
| 253 | } |
---|
[1649] | 254 | if (max > std::numeric_limits<double>::min()) |
---|
| 255 | edgemap_default["id"] = max + 1.0; |
---|
| 256 | else |
---|
| 257 | edgemap_default["id"] = 1.0; |
---|
[1646] | 258 | } |
---|
[1645] | 259 | } |
---|
| 260 | |
---|
| 261 | return 0; |
---|
[1606] | 262 | } |
---|
| 263 | |
---|
| 264 | void MapStorage::writeToFile(const std::string &filename) |
---|
| 265 | { |
---|
| 266 | GraphWriter<Graph> gwriter(filename, graph); |
---|
| 267 | |
---|
| 268 | for (std::map<std::string, Graph::NodeMap<double>*>::const_iterator it = |
---|
| 269 | nodemap_storage.begin(); it != nodemap_storage.end(); ++it) |
---|
| 270 | { |
---|
| 271 | gwriter.writeNodeMap(it->first, *(it->second)); |
---|
| 272 | //std::cout << "wrote " << it->first << " nodemap" << std::endl; |
---|
| 273 | } |
---|
| 274 | for (std::map<std::string, Graph::EdgeMap<double>*>::const_iterator it = |
---|
| 275 | edgemap_storage.begin(); it != edgemap_storage.end(); ++it) |
---|
| 276 | { |
---|
| 277 | gwriter.writeEdgeMap(it->first, *(it->second)); |
---|
| 278 | //std::cout << "wrote " << it->first << " edgemap" << std::endl; |
---|
| 279 | } |
---|
| 280 | gwriter.run(); |
---|
| 281 | } |
---|
| 282 | |
---|
| 283 | void MapStorage::clear() |
---|
| 284 | { |
---|
| 285 | for (std::map<std::string, Graph::NodeMap<double>*>::iterator it = |
---|
| 286 | nodemap_storage.begin(); it != nodemap_storage.end(); ++it) |
---|
| 287 | { |
---|
| 288 | if ((it->first != "coordinates_x") && |
---|
| 289 | (it->first != "coordinates_y") && |
---|
| 290 | (it->first != "id")) |
---|
| 291 | { |
---|
| 292 | delete it->second; |
---|
| 293 | nodemap_storage.erase(it); |
---|
| 294 | } |
---|
| 295 | } |
---|
| 296 | for (std::map<std::string, Graph::EdgeMap<double>*>::iterator it = |
---|
| 297 | edgemap_storage.begin(); it != edgemap_storage.end(); ++it) |
---|
| 298 | { |
---|
| 299 | if (it->first != "id") |
---|
| 300 | { |
---|
| 301 | delete it->second; |
---|
| 302 | edgemap_storage.erase(it); |
---|
| 303 | } |
---|
| 304 | } |
---|
[1645] | 305 | for (std::map<std::string, double>::iterator it = |
---|
| 306 | nodemap_default.begin(); it != nodemap_default.end(); ++it) |
---|
| 307 | { |
---|
[1646] | 308 | if (it->first != "id") |
---|
| 309 | nodemap_default.erase(it); |
---|
[1645] | 310 | } |
---|
| 311 | for (std::map<std::string, double>::iterator it = |
---|
| 312 | edgemap_default.begin(); it != edgemap_default.end(); ++it) |
---|
| 313 | { |
---|
[1646] | 314 | if (it->first != "id") |
---|
| 315 | edgemap_default.erase(it); |
---|
[1645] | 316 | } |
---|
[1606] | 317 | graph.clear(); |
---|
| 318 | file_name = ""; |
---|
| 319 | modified = false; |
---|
| 320 | } |
---|