RODFRouteCont.h

Go to the documentation of this file.

/****************************************************************************/
// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
// Copyright (C) 2001-2024 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
/****************************************************************************/
// A container for routes
/****************************************************************************/
#pragma once
#include <config.h>
 
#include <vector>
#include <map>
#include <utils/common/UtilExceptions.h>
#include "RODFRouteDesc.h"
 
 
// ===========================================================================
// class declarations
// ===========================================================================
class RODFNet;
class OutputDevice;
 
 
// ===========================================================================
// class definitions
// ===========================================================================
class RODFRouteCont {
public:
    RODFRouteCont();
 
    ~RODFRouteCont();
 
 
    void addRouteDesc(RODFRouteDesc& desc);
 
 
    bool removeRouteDesc(RODFRouteDesc& desc);
 
 
    bool save(std::vector<std::string>& saved,
              const std::string& prependix, OutputDevice& out);
 
 
    std::vector<RODFRouteDesc>& get() {
        return myRoutes;
    }
 
 
    void sortByDistance();
 
 
    void removeIllegal(const std::vector<ROEdgeVector >& illegals);
 
 
protected:
    void setID(RODFRouteDesc& desc) const;
 
 
    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> myConnectionOccurrences;
 
 
};