Home
last modified time | relevance | path

Searched refs:NBNode (Results 1 – 25 of 98) sorted by relevance

1234

/dports/cad/sumo/sumo-1.2.0/src/netbuild/
H A DNBNodeCont.h63 typedef std::set<NBNode*, ComparatorIdLess> NodeSet;
65 typedef std::pair<NBNode*, double> NodeAndDist;
87 bool insert(NBNode* node);
93 bool erase(NBNode* node);
100 bool extract(NBNode* node, bool remember = false);
106 NBNode* retrieve(const std::string& id) const;
153 …& cluster, int circleSize, NodeSet startNodes, std::vector<NBNode*> cands = std::vector<NBNode*>()…
252 void rename(NBNode* node, const std::string& newID);
317 void markAsSplit(const NBNode* node) { in markAsSplit()
365 typedef std::map<std::string, NBNode*> NodeCont;
[all …]
H A DNBAlgorithms.h35 class NBNode; variable
59 static void computeTurnDirectionsForNode(NBNode* node, bool warn);
115 explicit crossing_by_junction_angle_sorter(const NBNode* node, const EdgeVector& ordering);
117 int operator()(const NBNode::Crossing* c1, const NBNode::Crossing* c2) const { in operator()
151 static void swapWhenReversed(const NBNode* const n,
161 explicit edge_by_junction_angle_sorter(NBNode* n) : myNode(n) {} in edge_by_junction_angle_sorter()
189 NBNode* myNode;
216 static bool isRailwayNode(const NBNode* n);
238 static void setPriorityJunctionPriorities(NBNode& n);
241 static void markBestParallel(const NBNode& n, NBEdge* bestFirst, NBEdge* bestSecond);
[all …]
H A DNBEdge.h49 class NBNode; variable
314 NBNode* from, NBNode* to, std::string type,
343 NBNode* from, NBNode* to, std::string type,
364 NBNode* from, NBNode* to,
389 void reinit(NBNode* from, NBNode* to, const std::string& type,
400 void reinitNodes(NBNode* from, NBNode* to);
434 NBNode* getFromNode() const { in getFromNode()
441 NBNode* getToNode() const { in getToNode()
582 NBNode* getSignalNode() const { in getSignalNode()
1464 NBNode* myFrom, *myTo;
[all …]
H A DNBTrafficLightDefinition.cpp237 std::vector<NBNode*>::const_iterator i = in mustBrake()
241 NBNode* node = *i; in mustBrake()
283 std::vector<NBNode*>::const_iterator incoming = in forbids()
285 std::vector<NBNode*>::const_iterator outgoing = in forbids()
288 NBNode* incnode = *incoming; in forbids()
289 NBNode* outnode = *outgoing; in forbids()
316 NBNode* outnode2 = *outgoing2; in forbids()
348 NBNode* incnode2 = *incoming2; in forbids()
405 NBNode* incnode = *incoming; in foes()
406 NBNode* outnode = *outgoing; in foes()
[all …]
H A DNBNodeCont.cpp85 NBNode* node = new NBNode(id, position, district); in insert()
107 NBNode*
117 NBNode*
138 NBNodeCont::erase(NBNode* node) { in erase()
258 NBNode* to; in removeIsolatedRoads()
453 std::set<NBNode*> visited; in generateNodeClusters()
1321 for (NBNode* j : c) { in shouldBeTLSControlled()
1345 for (NBNode* node : c) { in onlyCrossings()
1373 for (NBNode* node : c) { in customTLID()
1606 for (NBNode* j : c) { in joinTLS()
[all …]
H A DNBAlgorithms_Railway.h101 static std::set<NBNode*> getRailNodes(NBNetBuilder& nb, bool verbose = false);
102 static std::set<NBNode*> getBrokenRailNodes(NBNetBuilder& nb, bool verbose = false);
105 static void getRailEdges(const NBNode* node, EdgeVector& inEdges, EdgeVector& outEdges);
107 static bool isStraight(const NBNode* node, const NBEdge* e1, const NBEdge* e2);
108 …static bool hasStraightPair(const NBNode* node, const EdgeVector& edges, const EdgeVector& edges2);
109 …static bool allBroken(const NBNode* node, NBEdge* candOut, const EdgeVector& in, const EdgeVector&…
110 …static bool allSharp(const NBNode* node, const EdgeVector& in, const EdgeVector& out, bool countBi…
112 static NBEdge* isBidiSwitch(const NBNode* n);
119 static int extendBidiEdges(NBNetBuilder& nb, NBNode* node, NBEdge* bidiIn);
H A DNBAlgorithms_Ramps.h35 class NBNode; variable
68 static bool mayNeedOnRamp(NBNode* cur, double minHighwaySpeed, double maxRampSpeed,
79 static bool mayNeedOffRamp(NBNode* cur, double minHighwaySpeed, double maxRampSpeed,
92 …static void buildOnRamp(NBNode* cur, NBNodeCont& nc, NBEdgeCont& ec, NBDistrictCont& dc, double ra…
104 …static void buildOffRamp(NBNode* cur, NBNodeCont& nc, NBEdgeCont& ec, NBDistrictCont& dc, double r…
107 static void getOnRampEdges(NBNode* n, NBEdge** potHighway, NBEdge** potRamp, NBEdge** other);
108 static void getOffRampEdges(NBNode* n, NBEdge** potHighway, NBEdge** potRamp, NBEdge** other);
H A DNBNode.cpp82 const int NBNode::FORWARD(1);
252 NBNode::NBNode(const std::string& id, const Position& position, in NBNode() function in NBNode
297 NBNode::~NBNode() { in ~NBNode()
339 NBNode::mirrorX() { in mirrorX()
527 NBNode* recordError, in bezierControlPoints()
2134 NBNode::getConnectionTo(NBNode* n) const { in getConnectionTo()
3054 NBNode::setRoundabout() { in setRoundabout()
3061 NBNode::Crossing*
3088 NBNode::Crossing*
3099 NBNode::Crossing*
[all …]
H A DNBAlgorithms_Railway.cpp194 std::set<NBNode*>
196 std::set<NBNode*> brokenNodes;; in getBrokenRailNodes()
206 for (NBNode* node : railNodes) { in getBrokenRailNodes()
242 for (NBNode* n : it.second) { in getBrokenRailNodes()
333 std::set<NBNode*>
335 std::set<NBNode*> railNodes; in getRailNodes()
347 std::set<NBNode*> railSignals; in getRailNodes()
348 for (NBNode* node : railNodes) { in getRailNodes()
525 for (NBNode* n : brokenNodes) { in reverseEdges()
727 for (NBNode* n : brokenNodes) { in addBidiEdgesBetweenSwitches()
[all …]
H A DNBNode.h68 class NBNode : public Named, public Parameterised {
136 const NBNode* node;
226 NBNode(const std::string& id, const Position& position, SumoXMLNodeType type);
236 ~NBNode();
410 NBEdge* getConnectionTo(NBNode* n) const;
582 bool& ok, NBNode* recordError = 0, double straightThresh = DEG2RAD(5),
721 int operator()(NBNode* n1, NBNode* n2) const { in operator()
732 explicit edge_by_direction_sorter(NBNode* n) : myNode(n) {} in edge_by_direction_sorter()
742 NBNode* myNode;
884 NBNode(const NBNode& s);
[all …]
H A DNBAlgorithms_Ramps.cpp85 std::set<NBNode*, ComparatorIdLess> potOnRamps; in computeRamps()
86 std::set<NBNode*, ComparatorIdLess> potOffRamps; in computeRamps()
88 NBNode* cur = (*i).second; in computeRamps()
121 NBNode* from = e->getFromNode(); in computeRamps()
131 NBNode* to = e->getToNode(); in computeRamps()
197 NBNode* nextN = curr->getToNode(); in buildOnRamp()
219 …NBNode* rn = new NBNode(curr->getID() + "-AddedOnRampNode", curr->getGeometry().positionAtOffset(r… in buildOnRamp()
298 NBNode* prevN = curr->getFromNode(); in buildOffRamp()
325 NBNode* rn = new NBNode(curr->getID() + "-AddedOffRampNode", pos); in buildOffRamp()
473 if (NBNode::isTrafficLight(potRamp->getToNode()->getType())) { in fulfillsRampConstraints()
[all …]
H A DNBContHelper.h147 …explicit edge_opposite_direction_sorter(const NBEdge* const e, const NBNode* const n, bool regardP… in edge_opposite_direction_sorter()
182 double getEdgeAngleAt(const NBEdge* const e, const NBNode* const n) const { in getEdgeAngleAt()
193 const NBNode* const myNode;
265 bool operator()(const NBNode* const n) const;
285 bool operator()(const NBNode* const n) const;
302 edge_with_destination_finder(NBNode* dest);
307 NBNode* myDestinationNode;
319 NBNode* from, NBNode* to);
399 explicit edge_by_angle_to_nodeShapeCentroid_sorter(const NBNode* n) : myNode(n) {} in edge_by_angle_to_nodeShapeCentroid_sorter()
407 const NBNode* myNode;
H A DNBOwnTLDef.h56 const std::vector<NBNode*>& junctions,
67 NBOwnTLDef(const std::string& id, NBNode* junction, SUMOTime offset,
112 …const std::vector<NBNode::Crossing*>& crossings, const EdgeVector& fromEdges, const EdgeVector& to…
117 …std::string state, const std::vector<NBNode::Crossing*>& crossings, const EdgeVector& fromEdges, c…
121 …const std::vector<NBNode::Crossing*>& crossings, const EdgeVector& fromEdges, const EdgeVector& to…
216 …static bool hasCrossing(const NBEdge* from, const NBEdge* to, const std::vector<NBNode::Crossing*>…
235 const std::vector<NBNode::Crossing*>& crossings);
H A DNBTrafficLightDefinition.h48 class NBNode; variable
100 const std::vector<NBNode*>& junctions,
114 NBNode* junction,
153 virtual void addNode(NBNode* node);
159 virtual void removeNode(NBNode* node);
173 const std::vector<NBNode*>& getNodes() const { in getNodes()
407 std::vector<NBNode*> myControlledNodes;
H A DNBLoadedSUMOTLDef.cpp315 std::vector<NBNode::Crossing*> crossings; in patchIfCrossingsAdded()
317 const std::vector<NBNode::Crossing*>& c = (*i)->getCrossings(); in patchIfCrossingsAdded()
473 for (NBNode* n : myControlledNodes) { in reconstructLogic()
474 for (NBNode::Crossing* c : n->getCrossings()) { in reconstructLogic()
518 for (NBNode* n : myControlledNodes) { in reconstructLogic()
558 for (NBNode* n : myControlledNodes) { in getMaxIndex()
559 for (NBNode::Crossing* c : n->getCrossings()) { in getMaxIndex()
581 for (NBNode* n : myControlledNodes) { in hasValidIndices()
582 for (NBNode::Crossing* c : n->getCrossings()) { in hasValidIndices()
620 for (NBNode* n : myControlledNodes) { in usingSignalGroups()
[all …]
H A DNBAlgorithms.cpp49 for (std::map<std::string, NBNode*>::const_iterator i = nc.begin(); i != nc.end(); ++i) { in computeTurnDirections()
55 NBTurningDirectionsComputer::computeTurnDirectionsForNode(NBNode* node, bool warn) { in computeTurnDirectionsForNode()
132 for (std::map<std::string, NBNode*>::const_iterator i = nc.begin(); i != nc.end(); ++i) { in sortNodesEdges()
139 NBNodesEdgesSorter::swapWhenReversed(const NBNode* const n, in swapWhenReversed()
160 for (std::map<std::string, NBNode*>::const_iterator i = nc.begin(); i != nc.end(); ++i) { in computeNodeTypes()
161 NBNode* n = (*i).second; in computeNodeTypes()
219 for (std::map<std::string, NBNode*>::const_iterator i = nc.begin(); i != nc.end(); ++i) { in validateRailCrossings()
220 NBNode* n = (*i).second; in validateRailCrossings()
264 NBNodeTypeComputer::isRailwayNode(const NBNode* n) { in isRailwayNode()
307 NBEdgePriorityComputer::setPriorityJunctionPriorities(NBNode& n) { in setPriorityJunctionPriorities()
[all …]
/dports/cad/sumo/sumo-1.2.0/src/netimport/vissim/tempstructs/
H A DNIVissimEdge.cpp660 std::pair<NBNode*, NBNode*>
669 NBNode* newNode = new NBNode(nid, in remapOneOfNodes()
674 return std::pair<NBNode*, NBNode*>(newNode, toNode); in remapOneOfNodes()
676 NBNode* newNode = new NBNode(nid, in remapOneOfNodes()
687 std::pair<NBNode*, NBNode*>
733 NBNode* end = new NBNode( in resolveSameNode()
740 return std::pair<NBNode*, NBNode*>(node, end); in resolveSameNode()
745 NBNode* beg = new NBNode( in resolveSameNode()
753 return std::pair<NBNode*, NBNode*>(beg, node); in resolveSameNode()
758 return std::pair<NBNode*, NBNode*>(node, node); in resolveSameNode()
[all …]
H A DNIVissimEdge.h41 class NBNode; variable
79 NBNode* getNodeAt(const Position& p, NBNode* other = 0);
179 std::pair<NIVissimConnectionCluster*, NBNode*>
183 std::pair<NIVissimConnectionCluster*, NBNode*>
187 std::pair<NBNode*, NBNode*> resolveSameNode(NBNodeCont& nc,
188 double offset, NBNode* prevFrom, NBNode* prevTo);
205 static NBNode* getNodeSecure(int nodeid, const Position& pos,
208 std::pair<NBNode*, NBNode*>
211 NBNode* fromNode, NBNode* toNode);
/dports/cad/sumo/sumo-1.2.0/src/netimport/
H A DNIImporter_VISUM.h44 class NBNode; variable
223 NBNode* getNamedNode(const std::string& fieldName);
224 NBNode* getNamedNodeSecure(const std::string& fieldName, NBNode* fallback = 0);
278 NBEdge* getNamedEdgeContinuating(const std::string& fieldName, NBNode* node);
291 NBNode* node);
299 NBEdge* getNamedEdgeContinuating(NBEdge* begin, NBNode* node);
308 NBEdge* getEdge(NBNode* FromNode, NBNode* ToNode);
321 NBEdge* getReversedContinuating(NBEdge* edge, NBNode* node);
336 NBNode* buildDistrictNode(const std::string& id, NBNode* dest, bool isSource);
347 bool checkNodes(NBNode* from, NBNode* to);
[all …]
H A DNIImporter_VISUM.cpp446 NBNode* dest = getNamedNode("KnotNr"); in parse_Connectors()
757 NBNode* rn = new NBNode(edgeID + "_" + toString((int) length) + "_" + node->getID(), p); in parse_Lanes()
837 NBNode* via = myLineParser.know("KNOTNR") in parse_TurnsToSignalGroups()
958 NBNode* node = nullptr; in parse_LanesConnections()
1130 NBNode*
1140 NBNode*
1151 NBNode*
1272 NBNode* node) { in getNamedEdgeContinuating()
1282 NIImporter_VISUM::getEdge(NBNode* FromNode, NBNode* ToNode) { in getEdge()
1356 NBNode*
[all …]
H A DNIXMLNodesHandler.h37 class NBNode; variable
73 …static NBNode* processNodeType(const SUMOSAXAttributes& attrs, NBNode* node, const std::string& no…
135 NBNode* currentNode, NBTrafficLightLogicCont& tlc);
H A DNIImporter_ITSUMO.h39 class NBNode; variable
143 …std::string& _id, const std::vector<Lane>& _lanes, double _v, int _pos, NBNode* _from, NBNode* _to) in LaneSet()
149 NBNode* from;
150 NBNode* to;
H A DNIImporter_OpenStreetMap.h44 class NBNode; variable
115 NBNode* node;
262 NBNode* insertNodeChecking(long long int id, NBNodeCont& nc, NBTrafficLightLogicCont& tlsc);
277 int insertEdge(Edge* e, int index, NBNode* from, NBNode* to,
284 std::map<NBNode*, std::pair<double, double> >
285 getNeighboringNodes(NBNode* node, double maxDist, const std::set<NBNode*>& knownElevation);
/dports/cad/sumo/sumo-1.2.0/src/netgen/
H A DNGNode.cpp67 NBNode*
73 return new NBNode(myID, pos, NODETYPE_NOJUNCTION); in buildNBNode()
75 NBNode* node = nullptr; in buildNBNode()
81 node = new NBNode(myID, pos, type); in buildNBNode()
84 if (NBNode::isTrafficLight(type)) { in buildNBNode()
96 node = new NBNode(myID, pos, NODETYPE_PRIORITY); in buildNBNode()
/dports/cad/sumo/sumo-1.2.0/src/netwrite/
H A DNWWriter_SUMO.h44 class NBNode; variable
113 static bool writeInternalEdges(OutputDevice& into, const NBEdgeCont& ec, const NBNode& n);
148 static void writeJunction(OutputDevice& into, const NBNode& n);
155 static bool writeInternalNodes(OutputDevice& into, const NBNode& n);
162 static bool writeInternalConnections(OutputDevice& into, const NBNode& n);

1234