FM / partitioner

/srv/osrm/osrm-backend/include/partitioner/

/srv/osrm/osrm-backend/include/partitioner

Name	Size	Mode	Actions
bisection_graph.hpp	4481	0644	edit dl rm
bisection_graph_view.hpp	2397	0644	edit dl rm
bisection_to_partition.hpp	619	0644	edit dl rm
cell_statistics.hpp	1805	0644	edit dl rm
cell_storage.hpp	19648	0644	edit dl rm
dinic_max_flow.hpp	3745	0644	edit dl rm
edge_based_graph.hpp	1605	0644	edit dl rm
edge_based_graph_reader.hpp	7516	0644	edit dl rm
files.hpp	3596	0644	edit dl rm
inertial_flow.hpp	584	0644	edit dl rm
multi_level_graph.hpp	9762	0644	edit dl rm
multi_level_partition.hpp	13165	0644	edit dl rm
partitioner.hpp	365	0644	edit dl rm
partitioner_config.hpp	1315	0644	edit dl rm
partition_graph.hpp	5678	0644	edit dl rm
recursive_bisection.hpp	952	0644	edit dl rm
recursive_bisection_state.hpp	1870	0644	edit dl rm
remove_unconnected.hpp	3974	0644	edit dl rm
renumber.hpp	3108	0644	edit dl rm
reorder_first_last.hpp	1783	0644	edit dl rm
serialization.hpp	2672	0644	edit dl rm
tarjan_graph_wrapper.hpp	648	0644	edit dl rm

Edit: /srv/osrm/osrm-backend/include/partitioner/edge_based_graph.hpp (1605B)

#ifndef OSRM_PARTITIONER_EDGE_BASED_GRAPH_HPP
#define OSRM_PARTITIONER_EDGE_BASED_GRAPH_HPP

#include "extractor/edge_based_edge.hpp"
#include "storage/io.hpp"
#include "util/coordinate.hpp"
#include "util/dynamic_graph.hpp"
#include "util/typedefs.hpp"

#include <cstdint>

#include <algorithm>
#include <iterator>
#include <memory>
#include <vector>

namespace osrm::partitioner
{

struct EdgeBasedGraphEdgeData : extractor::EdgeBasedEdge::EdgeData
{
    using Base = extractor::EdgeBasedEdge::EdgeData;
    using Base::Base;

EdgeBasedGraphEdgeData(const EdgeBasedGraphEdgeData &) = default;
    EdgeBasedGraphEdgeData(EdgeBasedGraphEdgeData &&) = default;
    EdgeBasedGraphEdgeData &operator=(const EdgeBasedGraphEdgeData &) = default;
    EdgeBasedGraphEdgeData &operator=(EdgeBasedGraphEdgeData &&) = default;
    EdgeBasedGraphEdgeData(const Base &base) : Base(base) {}
    EdgeBasedGraphEdgeData() : Base() {}
};

struct DynamicEdgeBasedGraph : util::DynamicGraph<EdgeBasedGraphEdgeData>
{
    using Base = util::DynamicGraph<EdgeBasedGraphEdgeData>;
    using Base::Base;

template <class ContainerT>
    DynamicEdgeBasedGraph(const NodeIterator nodes,
                          const ContainerT &graph,
                          std::uint32_t connectivity_checksum)
        : Base(nodes, graph), connectivity_checksum(connectivity_checksum)
    {
    }

std::uint32_t connectivity_checksum;
};

struct DynamicEdgeBasedGraphEdge : DynamicEdgeBasedGraph::InputEdge
{
    using Base = DynamicEdgeBasedGraph::InputEdge;
    using Base::Base;
};
} // namespace osrm::partitioner

#endif

#ifndef OSRM_PARTITIONER_EDGE_BASED_GRAPH_HPP #define OSRM_PARTITIONER_EDGE_BASED_GRAPH_HPP #include "extractor/edge_based_edge.hpp" #include "storage/io.hpp" #include "util/coordinate.hpp" #include "util/dynamic_graph.hpp" #include "util/typedefs.hpp" #include #include #include #include #include namespace osrm::partitioner { struct EdgeBasedGraphEdgeData : extractor::EdgeBasedEdge::EdgeData { using Base = extractor::EdgeBasedEdge::EdgeData; using Base::Base; EdgeBasedGraphEdgeData(const EdgeBasedGraphEdgeData &) = default; EdgeBasedGraphEdgeData(EdgeBasedGraphEdgeData &&) = default; EdgeBasedGraphEdgeData &operator=(const EdgeBasedGraphEdgeData &) = default; EdgeBasedGraphEdgeData &operator=(EdgeBasedGraphEdgeData &&) = default; EdgeBasedGraphEdgeData(const Base &base) : Base(base) {} EdgeBasedGraphEdgeData() : Base() {} }; struct DynamicEdgeBasedGraph : util::DynamicGraph { using Base = util::DynamicGraph; using Base::Base; template DynamicEdgeBasedGraph(const NodeIterator nodes, const ContainerT &graph, std::uint32_t connectivity_checksum) : Base(nodes, graph), connectivity_checksum(connectivity_checksum) { } std::uint32_t connectivity_checksum; }; struct DynamicEdgeBasedGraphEdge : DynamicEdgeBasedGraph::InputEdge { using Base = DynamicEdgeBasedGraph::InputEdge; using Base::Base; }; } // namespace osrm::partitioner #endif