diff -r 35e0355c6d9b -r 9535436aaa9f gui/mapstorage.cc --- a/gui/mapstorage.cc Tue Apr 18 13:25:41 2006 +0000 +++ b/gui/mapstorage.cc Tue Apr 18 22:59:33 2006 +0000 @@ -17,11 +17,11 @@ edgemap_storage["arrow_pos_y"] = new Graph::EdgeMap(graph); arrow_pos.setYMap(*edgemap_storage["arrow_pos_y"]); - nodemap_storage["id"] = new Graph::NodeMap(graph); - edgemap_storage["id"] = new Graph::EdgeMap(graph); + nodemap_storage["label"] = new Graph::NodeMap(graph); + edgemap_storage["label"] = new Graph::EdgeMap(graph); - nodemap_default["id"] = 1.0; - edgemap_default["id"] = 1.0; + nodemap_default["label"] = 1.0; + edgemap_default["label"] = 1.0; active_nodemaps.resize(NODE_PROPERTY_NUM); for(int i=0;i::const_iterator it = edgeMapNames.begin(); it != edgeMapNames.end(); ++it) { - if (*it == "id") + if (*it == "label") { //std::cout << "read id edgemap" << std::endl; } @@ -287,11 +287,11 @@ if (!read_edge_id) { - edgemap_storage["id"] = new Graph::EdgeMap(graph); + edgemap_storage["label"] = new Graph::EdgeMap(graph); int i = 1; for (EdgeIt e(graph); e != INVALID; ++e) { - (*edgemap_storage["id"])[e] = i++; + (*edgemap_storage["label"])[e] = i++; } } @@ -326,28 +326,28 @@ for (std::map*>::const_iterator it = nodemap_storage.begin(); it != nodemap_storage.end(); ++it) { - if ((it->first != "id") && + if ((it->first != "label") && (it->first != "coordiantes_x") && (it->first != "coordinates_y")) { nodemap_default[it->first] = 0.0; } - else if (it->first == "id") + else if (it->first == "label") { NodeIt n(graph); - double max = (*nodemap_storage["id"])[n]; + double max = (*nodemap_storage["label"])[n]; for (; n != INVALID; ++n) { - if ((*nodemap_storage["id"])[n] > max) - max = (*nodemap_storage["id"])[n]; + if ((*nodemap_storage["label"])[n] > max) + max = (*nodemap_storage["label"])[n]; } - nodemap_default["id"] = max + 1.0; + nodemap_default["label"] = max + 1.0; } } for (std::map*>::const_iterator it = edgemap_storage.begin(); it != edgemap_storage.end(); ++it) { - if (it->first != "id") + if (it->first != "label") { edgemap_default[it->first] = 0.0; } @@ -356,13 +356,13 @@ double max = std::numeric_limits::min(); for (EdgeIt e(graph); e != INVALID; ++e) { - if ((*edgemap_storage["id"])[e] > max) - max = (*edgemap_storage["id"])[e]; + if ((*edgemap_storage["label"])[e] > max) + max = (*edgemap_storage["label"])[e]; } if (max > std::numeric_limits::min()) - edgemap_default["id"] = max + 1.0; + edgemap_default["label"] = max + 1.0; else - edgemap_default["id"] = 1.0; + edgemap_default["label"] = 1.0; } } @@ -400,7 +400,7 @@ { if ((it->first != "coordinates_x") && (it->first != "coordinates_y") && - (it->first != "id")) + (it->first != "label")) { delete it->second; nodemap_storage.erase(it); @@ -409,7 +409,7 @@ for (std::map*>::iterator it = edgemap_storage.begin(); it != edgemap_storage.end(); ++it) { - if ((it->first != "id") && + if ((it->first != "label") && (it->first != "arrow_pos_x") && (it->first != "arrow_pos_y")) { @@ -420,13 +420,13 @@ for (std::map::iterator it = nodemap_default.begin(); it != nodemap_default.end(); ++it) { - if (it->first != "id") + if (it->first != "label") nodemap_default.erase(it); } for (std::map::iterator it = edgemap_default.begin(); it != edgemap_default.end(); ++it) { - if (it->first != "id") + if (it->first != "label") edgemap_default.erase(it); } graph.clear();