void
NIVissimEdge::setDistrictSpeed(/* NBDistribution &dc */) {
if (myDistrictConnections.size() > 0) {
SUMOReal pos = *(myDistrictConnections.begin());
if (pos < getLength() - pos) {
NIVissimDistrictConnection* d =
NIVissimDistrictConnection::dict_findForEdge(myID);
if (d != 0) {
SUMOReal speed = d->getMeanSpeed(/*dc*/);
if (speed == -1) {
return;
}
for (unsigned int i = 0; i < myNoLanes; i++) {
myLaneSpeeds[i] = speed;
// propagate the speed further
// get the list of connected edges
std::vector<NIVissimConnection*> connected = getOutgoingConnected(i);
// go throught the list
for (std::vector<NIVissimConnection*>::iterator j = connected.begin(); j != connected.end(); j++) {
NIVissimConnection* c = *j;
NIVissimEdge* e = NIVissimEdge::dictionary(c->getToEdgeID());
// propagate
e->propagateSpeed(/*dc, */speed, c->getToLanes());
}
}
}
}
}
}
void
NIVissimDistrictConnection::dict_BuildDistrictNodes(NBDistrictCont& dc,
NBNodeCont& nc) {
for (std::map<int, std::vector<int> >::iterator k = myDistrictsConnections.begin(); k != myDistrictsConnections.end(); k++) {
// get the connections
const std::vector<int>& connections = (*k).second;
// retrieve the current district
std::string dsid = toString<int>((*k).first);
NBDistrict* district = new NBDistrict(dsid);
dc.insert(district);
// compute the middle of the district
PositionVector pos;
for (std::vector<int>::const_iterator j = connections.begin(); j != connections.end(); j++) {
NIVissimDistrictConnection* c = dictionary(*j);
pos.push_back(c->geomPosition());
}
Position distCenter = pos.getPolygonCenter();
if (connections.size() == 1) { // !!! ok, ok, maybe not the best way just to add an offset
distCenter.add(10, 10);
}
district->setCenter(distCenter);
// build the node
std::string id = "District" + district->getID();
NBNode* districtNode =
new NBNode(id, district->getPosition(), district);
if (!nc.insert(districtNode)) {
throw 1;
}
}
}
void
NIVissimDistrictConnection::dict_CheckEdgeEnds() {
for (std::map<int, std::vector<int> >::iterator k = myDistrictsConnections.begin(); k != myDistrictsConnections.end(); k++) {
const std::vector<int>& connections = (*k).second;
for (std::vector<int>::const_iterator j = connections.begin(); j != connections.end(); j++) {
NIVissimDistrictConnection* c = dictionary(*j);
c->checkEdgeEnd();
}
}
}
std::pair<NBNode*, NBNode*>
NIVissimEdge::resolveSameNode(NBNodeCont& nc, SUMOReal offset,
NBNode* prevFrom, NBNode* prevTo) {
// check whether the edge is connected to a district
// use it if so
NIVissimDistrictConnection* d =
NIVissimDistrictConnection::dict_findForEdge(myID);
if (d != 0) {
Position pos = d->geomPosition();
SUMOReal position = d->getPosition();
// the district is at the begin of the edge
if (myGeom.length() - position > position) {
std::string nid = "ParkingPlace" + toString<int>(d->getID());
NBNode* node = nc.retrieve(nid);
if (node == 0) {
node = new NBNode(nid,
pos, NODETYPE_NOJUNCTION);
if (!nc.insert(node)) {
throw 1;
}
}
return std::pair<NBNode*, NBNode*>(node, prevTo);
}
// the district is at the end of the edge
else {
std::string nid = "ParkingPlace" + toString<int>(d->getID());
NBNode* node = nc.retrieve(nid);
if (node == 0) {
node = new NBNode(nid, pos, NODETYPE_NOJUNCTION);
if (!nc.insert(node)) {
throw 1;
}
}
assert(node != 0);
return std::pair<NBNode*, NBNode*>(prevFrom, node);
}
}
// otherwise, check whether the edge is some kind of
// a dead end...
// check which end is nearer to the node centre
if (myConnectionClusters.size() == 1) {
NBNode* node = prevFrom; // it is the same as getToNode()
NIVissimConnectionCluster* c = *(myConnectionClusters.begin());
// no end node given
if (c->around(myGeom.front(), offset) && !c->around(myGeom.back(), offset)) {
NBNode* end = new NBNode(
toString<int>(myID) + "-End",
myGeom.back(),
NODETYPE_NOJUNCTION);
if (!nc.insert(end)) {
throw 1;
}
return std::pair<NBNode*, NBNode*>(node, end);
}
// no begin node given
if (!c->around(myGeom.front(), offset) && c->around(myGeom.back(), offset)) {
NBNode* beg = new NBNode(
toString<int>(myID) + "-Begin",
myGeom.front(),
NODETYPE_NOJUNCTION);
if (!nc.insert(beg)) {
std::cout << "nope, NIVissimDisturbance" << std::endl;
throw 1;
}
return std::pair<NBNode*, NBNode*>(beg, node);
}
// self-loop edge - both points lie within the same cluster
if (c->around(myGeom.front()) && c->around(myGeom.back())) {
return std::pair<NBNode*, NBNode*>(node, node);
}
}
// what to do in other cases?
// It simply is a self-looping edge....
return std::pair<NBNode*, NBNode*>(prevFrom, prevTo);
}
void
NIVissimDistrictConnection::dict_BuildDistricts(NBDistrictCont& dc,
NBEdgeCont& ec,
NBNodeCont& nc/*,
NBDistribution &distc*/) {
// add the sources and sinks
// their normalised probability is computed within NBDistrict
// to avoid SUMOReal code writing and more securty within the converter
// go through the district table
for (std::map<int, std::vector<int> >::iterator k = myDistrictsConnections.begin(); k != myDistrictsConnections.end(); k++) {
// get the connections
const std::vector<int>& connections = (*k).second;
// retrieve the current district
NBDistrict* district =
dc.retrieve(toString<int>((*k).first));
NBNode* districtNode = nc.retrieve("District" + district->getID());
assert(district != 0 && districtNode != 0);
for (std::vector<int>::const_iterator l = connections.begin(); l != connections.end(); l++) {
NIVissimDistrictConnection* c = dictionary(*l);
// get the edge to connect the parking place to
NBEdge* e = ec.retrieve(toString<int>(c->myEdgeID));
if (e == 0) {
e = ec.retrievePossiblySplit(toString<int>(c->myEdgeID), c->myPosition);
}
if (e == 0) {
WRITE_WARNING("Could not build district '" + toString<int>((*k).first) + "' - edge '" + toString<int>(c->myEdgeID) + "' is missing.");
continue;
}
std::string id = "ParkingPlace" + toString<int>(*l);
NBNode* parkingPlace = nc.retrieve(id);
if (parkingPlace == 0) {
SUMOReal pos = c->getPosition();
if (pos < e->getLength() - pos) {
parkingPlace = e->getFromNode();
parkingPlace->invalidateIncomingConnections();
} else {
parkingPlace = e->getToNode();
parkingPlace->invalidateOutgoingConnections();
}
}
assert(
e->getToNode() == parkingPlace
||
e->getFromNode() == parkingPlace);
// build the connection to the source
if (e->getFromNode() == parkingPlace) {
id = "VissimFromParkingplace" + toString<int>((*k).first) + "-" + toString<int>(c->myID);
NBEdge* source =
new NBEdge(id, districtNode, parkingPlace,
"Connection", c->getMeanSpeed(/*distc*/) / (SUMOReal) 3.6, 3, -1,
NBEdge::UNSPECIFIED_WIDTH, NBEdge::UNSPECIFIED_OFFSET);
if (!ec.insert(source)) { // !!! in den Konstruktor
throw 1; // !!!
}
SUMOReal percNormed =
c->myPercentages[(*k).first];
if (!district->addSource(source, percNormed)) {
throw 1;
}
}
// build the connection to the destination
if (e->getToNode() == parkingPlace) {
id = "VissimToParkingplace" + toString<int>((*k).first) + "-" + toString<int>(c->myID);
NBEdge* destination =
new NBEdge(id, parkingPlace, districtNode,
"Connection", (SUMOReal) 100 / (SUMOReal) 3.6, 2, -1,
NBEdge::UNSPECIFIED_WIDTH, NBEdge::UNSPECIFIED_OFFSET);
if (!ec.insert(destination)) { // !!! (in den Konstruktor)
throw 1; // !!!
}
SUMOReal percNormed2 =
c->myPercentages[(*k).first];
if (!district->addSink(destination, percNormed2)) {
throw 1; // !!!
}
}
/*
if(e->getToNode()==districtNode) {
SUMOReal percNormed =
c->myPercentages[(*k).first];
district->addSink(e, percNormed);
}
if(e->getFromNode()==districtNode) {
SUMOReal percNormed =
c->myPercentages[(*k).first];
district->addSource(e, percNormed);
}
*/
}
/*
// add them as sources and sinks to the current district
for(std::vector<int>::const_iterator l=connections.begin(); l!=connections.end(); l++) {
// get the current connections
NIVissimDistrictConnection *c = dictionary(*l);
// get the edge to connect the parking place to
NBEdge *e = NBEdgeCont::retrieve(toString<int>(c->myEdgeID));
Position edgepos = c->geomPosition();
NBNode *edgeend = e->tryGetNodeAtPosition(c->myPosition,
e->getLength()/4.0);
if(edgeend==0) {
// Edge splitting omitted on build district connections by now
assert(false);
}
// build the district-node if not yet existing
std::string id = "VissimParkingplace" + district->getID();
NBNode *districtNode = nc.retrieve(id);
assert(districtNode!=0);
if(e->getToNode()==edgeend) {
// build the connection to the source
id = std::string("VissimFromParkingplace")
+ toString<int>((*k).first) + "-"
+ toString<int>(c->myID);
NBEdge *source =
new NBEdge(id, id, districtNode, edgeend,
"Connection", 100/3.6, 2, 100, 0,
NBEdge::EDGEFUNCTION_SOURCE);
NBEdgeCont::insert(source); // !!! (in den Konstruktor)
SUMOReal percNormed =
c->myPercentages[(*k).first];
district->addSource(source, percNormed);
} else {
// build the connection to the destination
id = std::string("VissimToParkingplace")
+ toString<int>((*k).first) + "-"
+ toString<int>(c->myID);
NBEdge *destination =
new NBEdge(id, id, edgeend, districtNode,
"Connection", 100/3.6, 2, 100, 0,
NBEdge::EDGEFUNCTION_SINK);
NBEdgeCont::insert(destination); // !!! (in den Konstruktor)
// add both the source and the sink to the district
SUMOReal percNormed =
c->myPercentages[(*k).first];
district->addSink(destination, percNormed);
}
}
*/
}
}
