Eclipse SUMO - Simulation of Urban MObility
|
Sorts crossings by minimum clockwise clockwise edge angle. Use the ordering found in myAllEdges of the given node. More...
#include <NBAlgorithms.h>
Public Member Functions | |
crossing_by_junction_angle_sorter (const NBNode *node, const EdgeVector &ordering) | |
int | operator() (const std::unique_ptr< NBNode::Crossing > &c1, const std::unique_ptr< NBNode::Crossing > &c2) const |
Private Member Functions | |
int | getMinRank (const EdgeVector &e) const |
retrieves the minimum index in myAllEdges More... | |
Private Attributes | |
EdgeVector | myOrdering |
Sorts crossings by minimum clockwise clockwise edge angle. Use the ordering found in myAllEdges of the given node.
Definition at line 127 of file NBAlgorithms.h.
|
explicit |
Definition at line 692 of file NBAlgorithms.cpp.
References myOrdering.
|
inlineprivate |
retrieves the minimum index in myAllEdges
Definition at line 143 of file NBAlgorithms.h.
References MIN2(), and myOrdering.
Referenced by operator()().
|
inline |
Definition at line 131 of file NBAlgorithms.h.
References getMinRank().
|
private |
Definition at line 153 of file NBAlgorithms.h.
Referenced by crossing_by_junction_angle_sorter(), and getMinRank().