NBContHelper.h

Go to the documentation of this file.

/****************************************************************************/
// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
// Copyright (C) 2001-2025 German Aerospace Center (DLR) and others.
// This program and the accompanying materials are made available under the
// terms of the Eclipse Public License 2.0 which is available at
// https://www.eclipse.org/legal/epl-2.0/
// This Source Code may also be made available under the following Secondary
// Licenses when the conditions for such availability set forth in the Eclipse
// Public License 2.0 are satisfied: GNU General Public License, version 2
// or later which is available at
// https://www.gnu.org/licenses/old-licenses/gpl-2.0-standalone.html
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
/****************************************************************************/
// Some methods for traversing lists of edges
/****************************************************************************/
#pragma once
#include <config.h>
 
#include <vector>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cassert>
#include "NBHelpers.h"
#include "NBCont.h"
#include "NBEdge.h"
#include "NBNode.h"
#include <utils/common/StdDefs.h>
#include <utils/geom/GeomHelper.h>
 
 
// ===========================================================================
// class definitions
// ===========================================================================
class NBContHelper {
public:
    static void nextCW(const EdgeVector& edges,
                       EdgeVector::const_iterator& from);
 
    static void nextCCW(const EdgeVector& edges,
                        EdgeVector::const_iterator& from);
 
    static double getMaxSpeed(const EdgeVector& edges);
 
    static double getMinSpeed(const EdgeVector& edges);
 
    static std::ostream& out(std::ostream& os, const std::vector<bool>& v);
 
 
    class relative_outgoing_edge_sorter {
    public:
        explicit relative_outgoing_edge_sorter(NBEdge* e) : myAngle(e->getEndAngle()) {}
        explicit relative_outgoing_edge_sorter(double angle) : myAngle(angle) {}
 
    public:
        bool operator()(const NBEdge* e1, const NBEdge* e2) const;
 
    private:
        double myAngle;
    };
 
 
    class relative_incoming_edge_sorter {
    public:
        explicit relative_incoming_edge_sorter(NBEdge* e) : myAngle(e->getStartAngle()) {}
        explicit relative_incoming_edge_sorter(double angle) : myAngle(angle) {}
 
    public:
        bool operator()(const NBEdge* e1, const NBEdge* e2) const;
 
    private:
        double myAngle;
    };
 
 
    class edge_by_priority_sorter {
    public:
        edge_by_priority_sorter(SVCPermissions permissions) : myPermissions(permissions) {}
        int operator()(NBEdge* e1, NBEdge* e2) const {
            if (e1->getPriority() != e2->getPriority()) {
                return e1->getPriority() > e2->getPriority();
            }
            if (e1->getSpeed() != e2->getSpeed()) {
                return e1->getSpeed() > e2->getSpeed();
            }
            return e1->getNumLanesThatAllow(myPermissions, false) > e2->getNumLanesThatAllow(myPermissions, false);
        }
 
    private:
        SVCPermissions myPermissions;
    };
 
    // ---------------------------
 
    class edge_opposite_direction_sorter {
    public:
        explicit edge_opposite_direction_sorter(const NBEdge* const e, const NBNode* const n, bool regardPriority) :
            myNode(n),
            myEdge(e),
            myRegardPriority(regardPriority) {
            myAngle = getEdgeAngleAt(e, n);
        }
 
        int operator()(NBEdge* e1, NBEdge* e2) const {
            if (!myRegardPriority || e1->getPriority() == e2->getPriority() || e1 == myEdge || e2 == myEdge) {
                return getDiff(e1) > getDiff(e2);
            } else {
                return e1->getPriority() > e2->getPriority();
            }
        }
 
    protected:
        double getDiff(const NBEdge* const e) const {
            return fabs(GeomHelper::angleDiff(getEdgeAngleAt(e, myNode), myAngle));
        }
 
        double getEdgeAngleAt(const NBEdge* const e, const NBNode* const n) const {
            if (e->getFromNode() == n) {
                return e->getGeometry().angleAt2D(0);
            } else {
                return e->getGeometry()[-1].angleTo2D(e->getGeometry()[-2]);
            }
        }
 
    private:
 
        const NBNode* const myNode;
 
        const NBEdge* const myEdge;
 
        double myAngle;
 
        bool myRegardPriority;
 
    };
 
    // ---------------------------
 
    class edge_similar_direction_sorter {
    public:
        explicit edge_similar_direction_sorter(const NBEdge* const e, bool outgoing = true) :
            myCompareOutgoing(outgoing),
            myAngle(outgoing ? e->getShapeEndAngle() : e->getShapeStartAngle())
        {}
 
        int operator()(const NBEdge* e1, const NBEdge* e2) const {
            const double d1 = angleDiff(myCompareOutgoing ? e1->getShapeStartAngle() : e1->getShapeEndAngle(), myAngle);
            const double d2 = angleDiff(myCompareOutgoing ? e2->getShapeStartAngle() : e2->getShapeEndAngle(), myAngle);
            if (fabs(fabs(d1) - fabs(d2)) < NUMERICAL_EPS) {
                if (fabs(d1 - d2) > NUMERICAL_EPS) {
                    return d1 < d2;
                } else {
                    return e1->getNumericalID() < e2->getNumericalID();
                }
            }
            return fabs(d1) < fabs(d2);
        }
 
    private:
        double angleDiff(const double angle1, const double angle2) const {
            double d = angle2 - angle1;
            while (d >= 180.) {
                d -= 360.;
            }
            while (d < -180.) {
                d += 360.;
            }
            return d;
        }
 
 
    private:
        bool myCompareOutgoing;
        double myAngle;
    };
 
 
    class node_with_incoming_finder {
    public:
        node_with_incoming_finder(const NBEdge* const e);
 
        bool operator()(const NBNode* const n) const;
 
    private:
        const NBEdge* const myEdge;
 
    };
 
 
    class node_with_outgoing_finder {
    public:
        node_with_outgoing_finder(const NBEdge* const e);
 
        bool operator()(const NBNode* const n) const;
 
    private:
        const NBEdge* const myEdge;
 
    };
 
 
 
 
    class edge_with_destination_finder {
    public:
        edge_with_destination_finder(NBNode* dest);
 
        bool operator()(NBEdge* e) const;
 
    private:
        NBNode* myDestinationNode;
 
    private:
        edge_with_destination_finder& operator=(const edge_with_destination_finder& s);
 
    };
 
 
    static NBEdge* findConnectingEdge(const EdgeVector& edges,
                                      NBNode* from, NBNode* to);
 
 
    static double maxSpeed(const EdgeVector& ev);
 
    class same_connection_edge_sorter {
    public:
        explicit same_connection_edge_sorter() { }
 
        int operator()(NBEdge* e1, NBEdge* e2) const {
            std::pair<double, double> mm1 = getMinMaxRelAngles(e1);
            std::pair<double, double> mm2 = getMinMaxRelAngles(e2);
            if (mm1.first == mm2.first && mm1.second == mm2.second) {
                // ok, let's simply sort them arbitrarily
                return e1->getID() < e2->getID();
            }
 
            assert(
                (mm1.first <= mm2.first && mm1.second <= mm2.second)
                ||
                (mm1.first >= mm2.first && mm1.second >= mm2.second));
            return (mm1.first >= mm2.first && mm1.second >= mm2.second);
        }
 
        std::pair<double, double> getMinMaxRelAngles(NBEdge* e) const {
            double min = 360;
            double max = 360;
            const EdgeVector& ev = e->getConnectedEdges();
            for (EdgeVector::const_iterator i = ev.begin(); i != ev.end(); ++i) {
                double angle = NBHelpers::normRelAngle(
                                   e->getTotalAngle(), (*i)->getTotalAngle());
                if (min == 360 || min > angle) {
                    min = angle;
                }
                if (max == 360 || max < angle) {
                    max = angle;
                }
            }
            return std::pair<double, double>(min, max);
        }
    };
 
 
    friend std::ostream& operator<<(std::ostream& os, const EdgeVector& ev);
 
    class opposite_finder {
    public:
        opposite_finder(NBEdge* edge)
            : myReferenceEdge(edge) { }
 
        bool operator()(NBEdge* e) const {
            return e->isTurningDirectionAt(myReferenceEdge) ||
                   myReferenceEdge->isTurningDirectionAt(e);
        }
 
    private:
        NBEdge* myReferenceEdge;
 
    };
 
    class edge_by_angle_to_nodeShapeCentroid_sorter {
    public:
        explicit edge_by_angle_to_nodeShapeCentroid_sorter(const NBNode* n) : myNode(n) {}
 
    public:
        bool operator()(const NBEdge* e1, const NBEdge* e2) const;
 
    private:
        const NBNode* myNode;
    };
 
};