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.sourceforge.net/
// Copyright (C) 2001-2011 DLR (http://www.dlr.de/) and contributors
/****************************************************************************/
//
//   This program 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 2 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) throw();


    ~NBEdgeCont() throw();


    void applyOptions(OptionsCont& oc);


    void clear() throw();





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


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


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


    NBEdge* retrievePossiblySplitted(const std::string& id, SUMOReal pos) const throw();


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


    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) throw(ProcessError);


    bool splitAt(NBDistrictCont& dc, NBEdge* edge, NBNode* node,
                 const std::string& firstEdgeName, const std::string& secondEdgeName,
                 unsigned int noLanesFirstEdge, unsigned int noLanesSecondEdge) throw(ProcessError);


    bool splitAt(NBDistrictCont& dc, NBEdge* edge, SUMOReal edgepos, NBNode* node,
                 const std::string& firstEdgeName, const std::string& secondEdgeName,
                 unsigned int noLanesFirstEdge, unsigned int noLanesSecondEdge) throw(ProcessError);




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


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


    unsigned int getNoEdgeSplits() const throw() {
        return myEdgesSplit;
    }




    void removeUnwishedEdges(NBDistrictCont& dc);


    void splitGeometry(NBNodeCont& nc);




    void computeTurningDirections() throw();


    void sortOutgoingLanesConnections() throw();


    void computeEdge2Edges(bool noLeftMovers) throw();


    void computeLanes2Edges() throw();


    void recheckLanes() throw();


    void appendTurnarounds(bool noTLSControlled) throw();


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


    void computeEdgeShapes() throw();


    void recomputeLaneShapes() throw();


    void clearControllingTLInformation() const;


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


    void recheckLaneSpread() throw();



    void guessRoundabouts(std::vector<std::set<NBEdge*> > &marked) throw();


    bool isLeftHanded() const throw() {
        return myAmLeftHanded;
    }


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


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


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


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

    EdgeCont myEdges;

    EdgeCont myExtractedEdges;

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

    unsigned int myEdgesSplit;

    bool myAmLeftHanded;



    SUMOReal myEdgesMinSpeed;

    bool myRemoveEdgesAfterJoining;

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

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

    SUMOVehicleClasses myVehicleClasses2Keep;

    SUMOVehicleClasses myVehicleClasses2Remove;

    PositionVector myPrunningBoundary;



    NBTypeCont& myTypeCont;


private:
    NBEdgeCont(const NBEdgeCont& s);

    NBEdgeCont& operator=(const NBEdgeCont& s);


};


#endif

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