Eclipse SUMO - Simulation of Urban MObility
MSInternalJunction.cpp
Go to the documentation of this file.
1/****************************************************************************/
2// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
3// Copyright (C) 2001-2023 German Aerospace Center (DLR) and others.
4// This program and the accompanying materials are made available under the
5// terms of the Eclipse Public License 2.0 which is available at
6// https://www.eclipse.org/legal/epl-2.0/
7// This Source Code may also be made available under the following Secondary
8// Licenses when the conditions for such availability set forth in the Eclipse
9// Public License 2.0 are satisfied: GNU General Public License, version 2
10// or later which is available at
11// https://www.gnu.org/licenses/old-licenses/gpl-2.0-standalone.html
12// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
13/****************************************************************************/
21// junction.
22/****************************************************************************/
23#include <config.h>
24
25#include <algorithm>
26#include <cassert>
27#include <cmath>
29#include "MSLane.h"
30#include "MSLink.h"
31#include "MSEdge.h"
32#include "MSJunctionLogic.h"
33#include "MSInternalJunction.h"
34
35
36// ===========================================================================
37// method definitions
38// ===========================================================================
40 SumoXMLNodeType type,
41 const Position& position,
42 const PositionVector& shape,
43 std::vector<MSLane*> incoming,
44 std::vector<MSLane*> internal)
45 : MSLogicJunction(id, type, position, shape, "", incoming, internal) {}
46
47
48
50
51
52void
54 if (myIncomingLanes.size() == 0) {
55 throw ProcessError(TLF("Internal junction % has no incoming lanes", getID()));
56 }
57 // the first lane in the list of incoming lanes is special. It defines the
58 // link that needs to do all the checking for this internal junction
59 const MSLane* specialLane = myIncomingLanes[0];
60 assert(specialLane->getLinkCont().size() == 1);
61 MSLink* thisLink = specialLane->getLinkCont()[0];
62 const MSRightOfWayJunction* parent = dynamic_cast<const MSRightOfWayJunction*>(specialLane->getEdge().getToJunction());
63 if (parent == nullptr) {
64 // parent has type traffic_light_unregulated
65 return;
66 }
67 const int ownLinkIndex = specialLane->getIncomingLanes()[0].viaLink->getIndex();
68 const MSLogicJunction::LinkBits& response = parent->getLogic()->getResponseFor(ownLinkIndex);
69 // inform links where they have to report approaching vehicles to
70 //std::cout << " special=" << specialLane->getID() << " incoming=" << toString(myIncomingLanes) << " internal=" << toString(myInternalLanes) << "\n";
71 for (MSLane* const lane : myInternalLanes) {
72 for (MSLink* const link : lane->getLinkCont()) {
73 if (link->getViaLane() != nullptr) {
74 const int foeIndex = lane->getIncomingLanes()[0].viaLink->getIndex();
75 //std::cout << " response=" << response << " index=" << ownLinkIndex << " foeIndex=" << foeIndex << " ibct=" << indirectBicycleTurn(specialLane, thisLink, *i, *q) << "\n";
76 if (response.test(foeIndex) || indirectBicycleTurn(specialLane, thisLink, lane, link)) {
77 // only respect vehicles before internal junctions if they
78 // have priority (see the analogous foeLinks.test() when
79 // initializing myLinkFoeInternalLanes in MSRightOfWayJunction
80 // Indirect left turns for bicycles are a special case
81 // because they both intersect on their second part with the first part of the other one
82 // and only one of the has priority
83 myInternalLaneFoes.push_back(lane);
84 }
85 if (std::find(myInternalLaneFoes.begin(), myInternalLaneFoes.end(), link->getViaLane()) == myInternalLaneFoes.end()) {
86 myInternalLaneFoes.push_back(link->getViaLane());
87 }
88 } else {
89 if (std::find(myInternalLaneFoes.begin(), myInternalLaneFoes.end(), lane) == myInternalLaneFoes.end()) {
90 myInternalLaneFoes.push_back(lane);
91 }
92 }
93 }
94 //std::cout << " intLane=" << lane->getID() << " foes=" << toString(myInternalLaneFoes) << "\n";
95
96 }
97 for (std::vector<MSLane*>::const_iterator i = myIncomingLanes.begin() + 1; i != myIncomingLanes.end(); ++i) {
98 for (MSLink* const link : (*i)->getLinkCont()) {
99 // link indices of internal junctions may not be initialized yet
100 int linkIndex = link->getCorrespondingEntryLink()->getIndex();
101 // links that target a shared walkingarea always have index -1
102 if (linkIndex != -1 && response.test(linkIndex)) {
103 myInternalLinkFoes.push_back(link);
104 const MSLane* via = link->getViaLane();
105 if (via != nullptr && via->getLinkCont().front()->getViaLane() != nullptr) {
106 // we added the entry link, also use the internalJunctionLink that follows
107 myInternalLinkFoes.push_back(via->getLinkCont().front());
108 }
109 }
110 }
111 }
112 // thisLinks is itself an exitLink of the preceding internal lane
113 thisLink->setRequestInformation(ownLinkIndex, true, false, myInternalLinkFoes, myInternalLaneFoes, thisLink->getViaLane()->getLogicalPredecessorLane());
114 assert(thisLink->getViaLane()->getLinkCont().size() == 1);
115 MSLink* exitLink = thisLink->getViaLane()->getLinkCont()[0];
116 exitLink->setRequestInformation(ownLinkIndex, false, false, std::vector<MSLink*>(),
117 myInternalLaneFoes, thisLink->getViaLane());
118 for (const auto& ili : exitLink->getLane()->getIncomingLanes()) {
119 if (ili.lane->getEdge().isWalkingArea()) {
120 exitLink->addWalkingAreaFoeExit(ili.lane);
121 break;
122 }
123 }
124 for (MSLink* const link : myInternalLinkFoes) {
125 thisLink->addBlockedLink(link);
126 link->addBlockedLink(thisLink);
127 }
128}
129
130
131bool
132MSInternalJunction::indirectBicycleTurn(const MSLane* specialLane, const MSLink* thisLink, const MSLane* foeFirstPart, const MSLink* foeLink) const {
133 if (specialLane->getPermissions() == SVC_BICYCLE && foeFirstPart->getPermissions() == SVC_BICYCLE
134 && thisLink->getDirection() == LinkDirection::LEFT && foeLink->getDirection() == LinkDirection::LEFT
135 && thisLink->getViaLane() != nullptr
136 && thisLink->getViaLane()->getShape().intersects(foeFirstPart->getShape())) {
137 return true;
138 } else {
139 return false;
140 }
141}
142
143
144/****************************************************************************/
#define TLF(string,...)
Definition: MsgHandler.h:288
@ SVC_BICYCLE
vehicle is a bicycle
@ LEFT
The link is a (hard) left direction.
SumoXMLNodeType
Numbers representing special SUMO-XML-attribute values for representing node- (junction-) types used ...
const MSJunction * getToJunction() const
Definition: MSEdge.h:415
void postloadInit()
initialises the junction after the whole net has been loaded
virtual ~MSInternalJunction()
Destructor.
bool indirectBicycleTurn(const MSLane *specialLane, const MSLink *thisLink, const MSLane *foeFirstPart, const MSLink *foeLink) const
std::vector< MSLane * > myInternalLaneFoes
std::vector< MSLink * > myInternalLinkFoes
MSInternalJunction(const std::string &id, SumoXMLNodeType type, const Position &position, const PositionVector &shape, std::vector< MSLane * > incoming, std::vector< MSLane * > internal)
Constructor.
virtual const MSLogicJunction::LinkBits & getResponseFor(int linkIndex) const
Returns the response for the given link.
Representation of a lane in the micro simulation.
Definition: MSLane.h:84
SVCPermissions getPermissions() const
Returns the vehicle class permissions for this lane.
Definition: MSLane.h:601
const std::vector< IncomingLaneInfo > & getIncomingLanes() const
Definition: MSLane.h:923
MSLane * getLogicalPredecessorLane() const
get the most likely precedecessor lane (sorted using by_connections_to_sorter). The result is cached ...
Definition: MSLane.cpp:2999
virtual const PositionVector & getShape(bool) const
Definition: MSLane.h:293
MSEdge & getEdge() const
Returns the lane's edge.
Definition: MSLane.h:745
const std::vector< MSLink * > & getLinkCont() const
returns the container with all links !!!
Definition: MSLane.h:707
std::vector< MSLane * > myInternalLanes
list of internal lanes
std::bitset< SUMO_MAX_CONNECTIONS > LinkBits
Container for link response and foes.
std::vector< MSLane * > myIncomingLanes
list of incoming lanes
A junction with right-of-way - rules.
const MSJunctionLogic * getLogic() const
const std::string & getID() const
Returns the id.
Definition: Named.h:74
A point in 2D or 3D with translation and scaling methods.
Definition: Position.h:37
A list of positions.
bool intersects(const Position &p1, const Position &p2) const
Returns the information whether this list of points interesects the given line.