Container to associate multiple routing graphs to allow queries on multiple graphs. More...
#include <RoutingGraphContainer.h>
Public Types | |
| using | ConflictingInGraph = std::pair< size_t, ConstLanelets > |
| id of conflicing graph, lanelets in conflict there More... | |
| using | ConflictingInGraphs = std::vector< ConflictingInGraph > |
Public Member Functions | |
| ConstLanelets | conflictingInGraph (const ConstLanelet &lanelet, size_t routingGraphId, double participantHeight=.0) const |
| Find the conflicting lanelets of a given lanelet within a specified graph. More... | |
| ConflictingInGraphs | conflictingInGraphs (const ConstLanelet &lanelet, double participantHeight=.0) const |
| Find the conflicting lanelets of a given lanelet within all graphs. More... | |
| ConstLanelets | conflictingOfRouteInGraph (const Route *route, size_t routingGraphId, double participantHeight=.0) const |
| Find the conflicting lanelets of a given route within a specified graph. More... | |
| ConflictingInGraphs | conflictingOfRouteInGraphs (const Route *route, double participantHeight=.0) const |
| Find the conflicting lanelets of a given route within all graphs. More... | |
| RoutingGraphContainer (const std::vector< RoutingGraphPtr > &routingGraphs) | |
| Constructor of routing graph container. More... | |
| RoutingGraphContainer (std::vector< RoutingGraphConstPtr > routingGraphs) | |
| Constructor of routing graph container. More... | |
| const std::vector< RoutingGraphConstPtr > & | routingGraphs () const |
| Returns the routing graphs stored in the container. More... | |
Private Attributes | |
| std::vector< RoutingGraphConstPtr > | graphs_ |
| Routing graphs of the container. More... | |
Container to associate multiple routing graphs to allow queries on multiple graphs.
Definition at line 20 of file RoutingGraphContainer.h.
| using lanelet::routing::RoutingGraphContainer::ConflictingInGraph = std::pair<size_t, ConstLanelets> |
id of conflicing graph, lanelets in conflict there
Definition at line 22 of file RoutingGraphContainer.h.
| using lanelet::routing::RoutingGraphContainer::ConflictingInGraphs = std::vector<ConflictingInGraph> |
Definition at line 23 of file RoutingGraphContainer.h.
|
inlineexplicit |
Constructor of routing graph container.
| routingGraphs | The routing graphs that should be used in the container |
Definition at line 27 of file RoutingGraphContainer.h.
|
inlineexplicit |
Constructor of routing graph container.
| routingGraphs | The routing graphs that should be used in the container |
Definition at line 31 of file RoutingGraphContainer.h.
|
inline |
Find the conflicting lanelets of a given lanelet within a specified graph.
| lanelet | Find conflicting ones for this lanelet |
| routingGraphId | ID/position in vector of the routing graph |
| participantHeight | Optional height of the participant |
| InvalidInputError | if the routingGraphId is too high |
Definition at line 40 of file RoutingGraphContainer.h.
|
inline |
Find the conflicting lanelets of a given lanelet within all graphs.
| lanelet | Find conflicting ones for this lanelet |
| participantHeight | Optional height of the participant |
Definition at line 63 of file RoutingGraphContainer.h.
|
inline |
Find the conflicting lanelets of a given route within a specified graph.
| route | Find conflicting lanelets for all lanelets within this route |
| routingGraphId | ID/position in vector of the routing graph |
| participantHeight | Optional height of the participant |
| InvalidInputError | if the routingGraphId is too high |
Definition at line 77 of file RoutingGraphContainer.h.
|
inline |
Find the conflicting lanelets of a given route within all graphs.
| route | Find conflicting lanelets for all lanelets within this route |
| participantHeight | Optional height of the participant |
Definition at line 91 of file RoutingGraphContainer.h.
|
inline |
Returns the routing graphs stored in the container.
Definition at line 100 of file RoutingGraphContainer.h.
|
private |
Routing graphs of the container.
Definition at line 103 of file RoutingGraphContainer.h.