RODFRouteCont.h

Go to the documentation of this file.

/****************************************************************************/
// A container for routes
/****************************************************************************/
// SUMO, Simulation of Urban MObility; see http://sumo.sourceforge.net/
// Copyright 2001-2010 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 RODFRouteCont_h
#define RODFRouteCont_h


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

#include <vector>
#include <map>
#include <utils/common/UtilExceptions.h>
#include "RODFRouteDesc.h"


// ===========================================================================
// class declarations
// ===========================================================================
class RODFNet;
class OutputDevice;


// ===========================================================================
// class definitions
// ===========================================================================
class RODFRouteCont {
public:
    RODFRouteCont() throw();

    ~RODFRouteCont() throw();


    void addRouteDesc(RODFRouteDesc &desc) throw();


    bool removeRouteDesc(RODFRouteDesc &desc) throw();


    bool save(std::vector<std::string> &saved,
              const std::string &prependix, OutputDevice& out) throw(IOError);


    std::vector<RODFRouteDesc> &get() throw() {
        return myRoutes;
    }


    void sortByDistance() throw();


    void removeIllegal(const std::vector<std::vector<ROEdge*> > &illegals) throw();


    void addAllEndFollower() throw();


protected:
    void setID(RODFRouteDesc &desc) const throw();


    class by_distance_sorter {
    public:
        explicit by_distance_sorter() { }

        int operator()(const RODFRouteDesc &p1, const RODFRouteDesc &p2) {
            return p1.distance2Last<p2.distance2Last;
        }
    };


    class route_finder {
    public:
        explicit route_finder(const RODFRouteDesc &desc) : myDesc(desc) { }

        bool operator()(const RODFRouteDesc &desc) {
            return myDesc.edges2Pass==desc.edges2Pass;
        }

    private:
        const RODFRouteDesc &myDesc;

    };

protected:
    std::vector<RODFRouteDesc> myRoutes;

    mutable std::map<std::pair<ROEdge*, ROEdge*>, int> myConnectionOccurences;


};


#endif

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