Eclipse SUMO - Simulation of Urban MObility
NBContHelper.cpp
Go to the documentation of this file.
1 /****************************************************************************/
2 // Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.org/sumo
3 // Copyright (C) 2001-2019 German Aerospace Center (DLR) and others.
4 // This program and the accompanying materials
5 // are made available under the terms of the Eclipse Public License v2.0
6 // which accompanies this distribution, and is available at
7 // http://www.eclipse.org/legal/epl-v20.html
8 // SPDX-License-Identifier: EPL-2.0
9 /****************************************************************************/
17 // Some methods for traversing lists of edges
18 /****************************************************************************/
19 
20 
21 // ===========================================================================
22 // included modules
23 // ===========================================================================
24 #include <config.h>
25 
26 #include <vector>
27 #include <map>
28 #include <cassert>
29 #include "NBContHelper.h"
30 #include <utils/geom/GeomHelper.h>
31 
32 
33 // ===========================================================================
34 // method definitions
35 // ===========================================================================
36 /* -------------------------------------------------------------------------
37  * utility methods
38  * ----------------------------------------------------------------------- */
39 void
40 NBContHelper::nextCW(const EdgeVector& edges, EdgeVector::const_iterator& from) {
41  from++;
42  if (from == edges.end()) {
43  from = edges.begin();
44  }
45 }
46 
47 
48 void
49 NBContHelper::nextCCW(const EdgeVector& edges, EdgeVector::const_iterator& from) {
50  if (from == edges.begin()) {
51  from = edges.end() - 1;
52  } else {
53  --from;
54  }
55 }
56 
57 
58 std::ostream&
59 NBContHelper::out(std::ostream& os, const std::vector<bool>& v) {
60  for (std::vector<bool>::const_iterator i = v.begin(); i != v.end(); i++) {
61  os << *i;
62  }
63  return os;
64 }
65 
66 
67 NBEdge*
69  NBNode* from, NBNode* to) {
70  for (EdgeVector::const_iterator i = edges.begin(); i != edges.end(); i++) {
71  if ((*i)->getToNode() == to && (*i)->getFromNode() == from) {
72  return *i;
73  }
74  }
75  return nullptr;
76 }
77 
78 
79 
80 double
82  assert(ev.size() > 0);
83  double max = (*(ev.begin()))->getSpeed();
84  for (EdgeVector::const_iterator i = ev.begin() + 1; i != ev.end(); i++) {
85  max =
86  max > (*i)->getSpeed()
87  ? max : (*i)->getSpeed();
88  }
89  return max;
90 }
91 
92 
93 
94 /* -------------------------------------------------------------------------
95  * methods from node_with_incoming_finder
96  * ----------------------------------------------------------------------- */
98  : myEdge(e) {}
99 
100 
101 bool
103  const EdgeVector& incoming = n->getIncomingEdges();
104  return std::find(incoming.begin(), incoming.end(), myEdge) != incoming.end();
105 }
106 
107 
108 
109 /* -------------------------------------------------------------------------
110  * methods from node_with_outgoing_finder
111  * ----------------------------------------------------------------------- */
113  : myEdge(e) {}
114 
115 
116 bool
118  const EdgeVector& outgoing = n->getOutgoingEdges();
119  return std::find(outgoing.begin(), outgoing.end(), myEdge) != outgoing.end();
120 }
121 
122 
123 /* -------------------------------------------------------------------------
124  * methods from edge_with_destination_finder
125  * ----------------------------------------------------------------------- */
127  : myDestinationNode(dest) {}
128 
129 
130 bool
132  return e->getToNode() == myDestinationNode;
133 }
134 
135 
136 /* -------------------------------------------------------------------------
137  * methods from relative_outgoing_edge_sorter
138  * ----------------------------------------------------------------------- */
139 int
141  if (e1 == nullptr || e2 == nullptr) {
142  return -1;
143  }
144  double relAngle1 = NBHelpers::normRelAngle(
145  myEdge->getEndAngle(), e1->getStartAngle());
146  double relAngle2 = NBHelpers::normRelAngle(
147  myEdge->getEndAngle(), e2->getStartAngle());
148 
149  double lookAhead = 2 * NBEdge::ANGLE_LOOKAHEAD;
150  while (fabs(relAngle1 - relAngle2) < 3.0) {
151  // look at further geometry segments to resolve ambiguity
152  const Position referencePos1 = e1->getGeometry().positionAtOffset2D(lookAhead);
153  const Position referencePos2 = e2->getGeometry().positionAtOffset2D(lookAhead);
154  relAngle1 = NBHelpers::normRelAngle(myEdge->getEndAngle(), GeomHelper::legacyDegree(
155  e1->getFromNode()->getPosition().angleTo2D(referencePos1), true));
156  relAngle2 = NBHelpers::normRelAngle(myEdge->getEndAngle(), GeomHelper::legacyDegree(
157  e2->getFromNode()->getPosition().angleTo2D(referencePos2), true));
158  if (lookAhead > MAX2(e1->getLength(), e2->getLength())) {
159  break;
160  }
161  lookAhead *= 2;
162  }
163  return relAngle1 > relAngle2;
164 }
165 
166 
167 /* -------------------------------------------------------------------------
168  * methods from relative_incoming_edge_sorter
169  * ----------------------------------------------------------------------- */
170 int
172  if (e1 == nullptr || e2 == nullptr) {
173  return -1;
174  }
175  double relAngle1 = NBHelpers::normRelAngle(
176  myEdge->getStartAngle(), e1->getEndAngle());
177  double relAngle2 = NBHelpers::normRelAngle(
178  myEdge->getStartAngle(), e2->getEndAngle());
179 
180  double lookAhead = 2 * NBEdge::ANGLE_LOOKAHEAD;
181  while (fabs(relAngle1 - relAngle2) < 3.0) {
182  // look at further geometry segments to resolve ambiguity
183  const Position referencePos1 = e1->getGeometry().positionAtOffset2D(e1->getGeometry().length() - lookAhead);
184  const Position referencePos2 = e2->getGeometry().positionAtOffset2D(e2->getGeometry().length() - lookAhead);
185  relAngle1 = NBHelpers::normRelAngle(myEdge->getStartAngle(), GeomHelper::legacyDegree(
186  referencePos1.angleTo2D(e1->getToNode()->getPosition()), true));
187  relAngle2 = NBHelpers::normRelAngle(myEdge->getStartAngle(), GeomHelper::legacyDegree(
188  referencePos2.angleTo2D(e2->getToNode()->getPosition()), true));
189  if (lookAhead > MAX2(e1->getLength(), e2->getLength())) {
190  break;
191  }
192  lookAhead *= 2;
193  }
194  return relAngle1 > relAngle2;
195 }
196 
197 
198 std::ostream&
199 operator<<(std::ostream& os, const EdgeVector& ev) {
200  for (EdgeVector::const_iterator i = ev.begin(); i != ev.end(); i++) {
201  if (i != ev.begin()) {
202  os << ", ";
203  }
204  os << (*i)->getID();
205  }
206  return os;
207 }
208 
209 
210 double
212  if (edges.size() == 0) {
213  return -1;
214  }
215  double ret = (*(edges.begin()))->getSpeed();
216  for (EdgeVector::const_iterator i = edges.begin() + 1; i != edges.end(); i++) {
217  if ((*i)->getSpeed() > ret) {
218  ret = (*i)->getSpeed();
219  }
220  }
221  return ret;
222 }
223 
224 
225 double
227  if (edges.size() == 0) {
228  return -1;
229  }
230  double ret = (*(edges.begin()))->getSpeed();
231  for (EdgeVector::const_iterator i = edges.begin() + 1; i != edges.end(); i++) {
232  if ((*i)->getSpeed() < ret) {
233  ret = (*i)->getSpeed();
234  }
235  }
236  return ret;
237 }
238 
239 
240 int
242  assert(e1->getFromNode() == myNode || e1->getToNode() == myNode);
243  assert(e2->getFromNode() == myNode || e2->getToNode() == myNode);
244  const double angle1 = e1->getAngleAtNodeToCenter(myNode);
245  const double angle2 = e2->getAngleAtNodeToCenter(myNode);
246  const double absDiff = fabs(angle1 - angle2);
247 
248  // cannot trust the angle difference hence a heuristic:
249  if (absDiff < 2 || absDiff > (360 - 2)) {
250  const bool sameDir = ((e1->getFromNode() == myNode && e2->getFromNode() == myNode)
251  || (e1->getToNode() == myNode && e2->getToNode() == myNode));
252  if (sameDir) {
253  // put edges that allow pedestrians on the 'outside', but be aware if both allow / disallow
254  const bool e1Peds = (e1->getPermissions() & SVC_PEDESTRIAN) != 0;
255  const bool e2Peds = (e2->getPermissions() & SVC_PEDESTRIAN) != 0;
256  if (e1->getToNode() == myNode) {
257  if (e1Peds && !e2Peds) {
258  return true;
259  } else if (!e1Peds && e2Peds) {
260  return false;
261  }
262  } else {
263  if (!e1Peds && e2Peds) {
264  return true;
265  } else if (e1Peds && !e2Peds) {
266  return false;
267  }
268  }
269  // break ties to ensure strictly weak ordering
270  return e1->getID() < e2->getID();
271  } else {
272  // sort incoming before outgoing, no need to break ties here
273  return e1->getToNode() == myNode;
274  }
275  }
276  return angle1 < angle2;
277 }
278 
279 /****************************************************************************/
280 
bool operator()(const NBNode *const n) const
double getLength() const
Returns the computed length of the edge.
Definition: NBEdge.h:533
double getAngleAtNodeToCenter(const NBNode *const node) const
Returns the angle of from the node shape center to where the edge meets the node shape.
Definition: NBEdge.cpp:1875
node_with_outgoing_finder(const NBEdge *const e)
constructor
static double maxSpeed(const EdgeVector &ev)
static double getMinSpeed(const EdgeVector &edges)
static double normRelAngle(double angle1, double angle2)
ensure that reverse relAngles (>=179.999) always count as turnarounds (-180)
Definition: NBHelpers.cpp:60
Position positionAtOffset2D(double pos, double lateralOffset=0) const
Returns the position at the given length.
static const double ANGLE_LOOKAHEAD
the distance at which to take the default angle
Definition: NBEdge.h:324
friend std::ostream & operator<<(std::ostream &os, const EdgeVector &ev)
The representation of a single edge during network building.
Definition: NBEdge.h:86
int operator()(const NBEdge *e1, const NBEdge *e2) const
comparing operation
double angleTo2D(const Position &other) const
returns the angle in the plane of the vector pointing from here to the other position ...
Definition: Position.h:254
T MAX2(T a, T b)
Definition: StdDefs.h:80
static void nextCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
static double legacyDegree(const double angle, const bool positive=false)
Definition: GeomHelper.cpp:217
const EdgeVector & getOutgoingEdges() const
Returns this node&#39;s outgoing edges (The edges which start at this node)
Definition: NBNode.h:264
static std::ostream & out(std::ostream &os, const std::vector< bool > &v)
A point in 2D or 3D with translation and scaling methods.
Definition: Position.h:39
bool operator()(const NBNode *const n) const
const std::string & getID() const
Definition: NBEdge.h:1364
int operator()(NBEdge *e1, NBEdge *e2) const
comparing operation
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
Definition: NBEdge.cpp:3441
edge_with_destination_finder(NBNode *dest)
constructor
const PositionVector & getGeometry() const
Returns the geometry of the edge.
Definition: NBEdge.h:680
int operator()(NBEdge *e1, NBEdge *e2) const
comparing operation
double length() const
Returns the length.
const EdgeVector & getIncomingEdges() const
Returns this node&#39;s incoming edges (The edges which yield in this node)
Definition: NBNode.h:259
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
Definition: NBCont.h:35
double getStartAngle() const
Returns the angle at the start of the edge (relative to the node shape center) The angle is computed ...
Definition: NBEdge.h:495
node_with_incoming_finder(const NBEdge *const e)
constructor
const Position & getPosition() const
Definition: NBNode.h:251
Represents a single node (junction) during network building.
Definition: NBNode.h:68
static double getMaxSpeed(const EdgeVector &edges)
NBNode * getFromNode() const
Returns the origin node of the edge.
Definition: NBEdge.h:479
NBNode * getToNode() const
Returns the destination node of the edge.
Definition: NBEdge.h:486
static void nextCCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
double getEndAngle() const
Returns the angle at the end of the edge (relative to the node shape center) The angle is computed in...
Definition: NBEdge.h:504
static NBEdge * findConnectingEdge(const EdgeVector &edges, NBNode *from, NBNode *to)