NBEdgeCont.h

Go to the documentation of this file.

/****************************************************************************/
// Storage for edges, including some functionality operating on multiple edges
/****************************************************************************/
// SUMO, Simulation of Urban MObility; see http://sumo.dlr.de/
// Copyright (C) 2001-2017 DLR (http://www.dlr.de/) and contributors
/****************************************************************************/
//
//   This file is part of SUMO.
//   SUMO is free software: you can redistribute it and/or modify
//   it under the terms of the GNU General Public License as published by
//   the Free Software Foundation, either version 3 of the License, or
//   (at your option) any later version.
//
/****************************************************************************/
#ifndef NBEdgeCont_h
#define NBEdgeCont_h


// ===========================================================================
// included modules
// ===========================================================================
#ifdef _MSC_VER
#include <windows_config.h>
#else
#include <config.h>
#endif

#include <map>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include "NBCont.h"
#include <utils/common/SUMOVehicleClass.h>
#include <utils/common/UtilExceptions.h>
#include <utils/geom/PositionVector.h>


// ===========================================================================
// class declarations
// ===========================================================================
class NBNodeCont;
class NBTypeCont;
class NBEdge;
class NBNode;
class OptionsCont;
class NBDistrictCont;
class NBTrafficLightLogicCont;
class OutputDevice;


// ===========================================================================
// class definitions
// ===========================================================================
class NBEdgeCont {
public:
    NBEdgeCont(NBTypeCont& tc);


    ~NBEdgeCont();


    void applyOptions(OptionsCont& oc);


    void clear();





    bool insert(NBEdge* edge, bool ignorePrunning = false);


    NBEdge* retrieve(const std::string& id, bool retrieveExtracted = false) const;


    NBEdge* retrievePossiblySplit(const std::string& id, bool downstream) const;


    NBEdge* retrievePossiblySplit(const std::string& id, const std::string& hint, bool incoming) const;


    NBEdge* retrievePossiblySplit(const std::string& id, double pos) const;


    void erase(NBDistrictCont& dc, NBEdge* edge);


    void extract(NBDistrictCont& dc, NBEdge* edge, bool remember = false);


    std::map<std::string, NBEdge*>::const_iterator begin() const {
        return myEdges.begin();
    }


    std::map<std::string, NBEdge*>::const_iterator end() const {
        return myEdges.end();
    }




    bool splitAt(NBDistrictCont& dc, NBEdge* edge, NBNode* node);


    bool splitAt(NBDistrictCont& dc, NBEdge* edge, NBNode* node,
                 const std::string& firstEdgeName, const std::string& secondEdgeName,
                 int noLanesFirstEdge, int noLanesSecondEdge,
                 const double speed = -1., const int changedLeft = 0);


    bool splitAt(NBDistrictCont& dc, NBEdge* edge, double edgepos, NBNode* node,
                 const std::string& firstEdgeName, const std::string& secondEdgeName,
                 int noLanesFirstEdge, int noLanesSecondEdge,
                 const double speed = -1., const int changedLeft = 0);




    int size() const {
        return (int) myEdges.size();
    }


    std::vector<std::string> getAllNames() const;


    int getNoEdgeSplits() const {
        return myEdgesSplit;
    }




    void removeUnwishedEdges(NBDistrictCont& dc);


    void splitGeometry(NBNodeCont& nc);


    void reduceGeometries(const double minDist);


    void checkGeometries(const double maxAngle, const double minRadius, bool fix);




    void sortOutgoingLanesConnections();


    void computeEdge2Edges(bool noLeftMovers);


    void computeLanes2Edges();


    void recheckLanes();


    void appendTurnarounds(bool noTLSControlled);


    void appendTurnarounds(const std::set<std::string>& ids, bool noTLSControlled);


    void computeEdgeShapes();


    void computeLaneShapes();


    void clearControllingTLInformation() const;


    void joinSameNodeConnectingEdges(NBDistrictCont& dc,
                                     NBTrafficLightLogicCont& tlc, EdgeVector edges);


    void guessOpposites();


    void recheckLaneSpread();


    NBEdge* getOppositeByID(const std::string& edgeID) const;

    NBEdge* getByID(const std::string& edgeID) const;

    int guessRoundabouts();


    bool wasIgnored(std::string id) const {
        return myIgnoredEdges.count(id) != 0;
    }

    void ignore(std::string id) {
        myIgnoredEdges.insert(id);
    }

    bool wasRemoved(std::string id) const {
        return myExtractedEdges.count(id) != 0;
    }

    void rename(NBEdge* edge, const std::string& newID);




    void addPostProcessConnection(const std::string& from, int fromLane, const std::string& to, int toLane, bool mayDefinitelyPass, bool keepClear, double contPos, double visibility,
                                  bool warnOnly = false);


    void recheckPostProcessConnections();

    void generateStreetSigns();

    int guessSidewalks(double width, double minSpeed, double maxSpeed, bool fromPermissions);


    const std::set<EdgeSet> getRoundabouts() const;

    void addRoundabout(const EdgeSet& roundabout);

    void markRoundabouts();

    void patchRoundabouts(NBEdge* orig, NBEdge* part1, NBEdge* part2, std::set<EdgeSet>& roundabouts);

    bool ignoreFilterMatch(NBEdge* edge);

    int remapIDs(bool numericaIDs, bool reservedIDs);

    void checkOverlap(double threshold, double zThreshold) const;

    void checkGrade(double threshold) const;


    EdgeVector getGeneratedFrom(const std::string& id) const;

private:
    static double formFactor(const EdgeVector& loopEdges);

private:
    NBTypeCont& myTypeCont;

    struct PostProcessConnection {
    public:
        PostProcessConnection(const std::string& from_, int fromLane_, const std::string& to_, int toLane_, bool mayDefinitelyPass_, bool keepClear_, double contPos_, double visibility_,
                              bool warnOnly_ = false) :
            from(from_), fromLane(fromLane_), to(to_), toLane(toLane_), mayDefinitelyPass(mayDefinitelyPass_), keepClear(keepClear_), contPos(contPos_),
            visibility(visibility_),
            warnOnly(warnOnly_) {
        }
        std::string from;
        int fromLane;
        std::string to;
        int toLane;
        bool mayDefinitelyPass;
        bool keepClear;
        double contPos;
        double visibility;
        bool warnOnly;
    };

    std::vector<PostProcessConnection> myConnections;


    typedef std::map<std::string, NBEdge*> EdgeCont;

    EdgeCont myEdges;

    EdgeCont myExtractedEdges;

    std::set<std::string> myIgnoredEdges;

    int myEdgesSplit;


    double myEdgesMinSpeed;

    bool myRemoveEdgesAfterJoining;

    std::set<std::string> myEdges2Keep;

    std::set<std::string> myEdges2Remove;

    SVCPermissions myVehicleClasses2Keep;

    SVCPermissions myVehicleClasses2Remove;

    std::set<std::string> myTypes2Keep;

    std::set<std::string> myTypes2Remove;

    PositionVector myPruningBoundary;

    bool myNeedGeoTransformedPruningBoundary;

    std::set<EdgeSet> myRoundabouts;
    std::set<EdgeSet> myGuessedRoundabouts;


private:
    NBEdgeCont(const NBEdgeCont& s);

    NBEdgeCont& operator=(const NBEdgeCont& s);


};


#endif

/****************************************************************************/