Fix formatting

include/contractor/contract_excludable_graph.hpp

@@ -92,6 +92,6 @@ inline auto contractExcludableGraph(ContractorGraph contractor_graph_,
     return GraphAndFilter{QueryGraph{num_nodes, edge_container.edges},
                           edge_container.MakeEdgeFilters()};
 }
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif

include/contractor/contracted_edge_container.hpp

@@ -162,6 +162,6 @@ struct ContractedEdgeContainer
     std::vector<MergedFlags> flags;
     std::vector<QueryEdge> edges;
 };
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif

include/contractor/contracted_metric.hpp

@@ -17,6 +17,6 @@ template <storage::Ownership Ownership> struct ContractedMetric
 
 using ContractedMetric = detail::ContractedMetric<storage::Ownership::Container>;
 using ContractedMetricView = detail::ContractedMetric<storage::Ownership::View>;
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif

include/contractor/contractor.hpp

@@ -47,6 +47,6 @@ class Contractor
   private:
     ContractorConfig config;
 };
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // PROCESSING_CHAIN_HPP

include/contractor/contractor_config.hpp

@@ -69,6 +69,6 @@ struct ContractorConfig final : storage::IOConfig
     //(e.g. 0.8 contracts 80 percent of the hierarchy, leaving a core of 20%)
     double core_factor = 1.0;
 };
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // EXTRACTOR_OPTIONS_HPP

include/contractor/contractor_graph.hpp

@@ -40,6 +40,6 @@ struct ContractorEdgeData
 using ContractorGraph = util::DynamicGraph<ContractorEdgeData>;
 using ContractorEdge = ContractorGraph::InputEdge;
 
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // OSRM_CONTRACTOR_CONTRACTOR_GRAPH_HPP_

include/contractor/contractor_heap.hpp

@@ -22,6 +22,6 @@ using ContractorHeap = util::QueryHeap<NodeID,
                                        ContractorHeapData,
                                        util::XORFastHashStorage<NodeID, NodeID>>;
 
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // OSRM_CONTRACTOR_CONTRACTOR_HEAP_HPP_

include/contractor/contractor_search.hpp

@@ -18,6 +18,6 @@ void search(ContractorHeap &heap,
             const EdgeWeight weight_limit,
             const NodeID forbidden_node);
 
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // OSRM_CONTRACTOR_DIJKSTRA_HPP

include/contractor/crc32_processor.hpp

@@ -123,6 +123,6 @@ struct RangebasedCRC32
   private:
     IteratorbasedCRC32 crc32;
 };
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif /* ITERATOR_BASED_CRC32_H */

include/contractor/files.hpp

@@ -48,6 +48,6 @@ inline void writeGraph(const boost::filesystem::path &path,
         serialization::write(writer, "/ch/metrics/" + pair.first, pair.second);
     }
 }
-} // namespace osrm
+} // namespace osrm::contractor::files
 
 #endif

include/contractor/graph_contractor.hpp

@@ -35,6 +35,6 @@ inline auto contractGraph(ContractorGraph &graph,
         graph, {}, std::move(node_is_contractable), std::move(node_weights), core_factor);
 }
 
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // OSRM_CONTRACTOR_GRAPH_CONTRACTOR_HPP

include/contractor/graph_contractor_adaptors.hpp

@@ -175,6 +175,6 @@ template <class Edge, typename GraphT> inline std::vector<Edge> toEdges(GraphT g
     return edges;
 }
 
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // OSRM_CONTRACTOR_GRAPH_CONTRACTION_ADAPTORS_HPP_

include/contractor/query_edge.hpp

@@ -75,6 +75,6 @@ struct QueryEdge
                 data.distance == right.data.distance);
     }
 };
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // QUERYEDGE_HPP

include/contractor/query_graph.hpp

@@ -17,6 +17,6 @@ using QueryGraph = util::StaticGraph<typename QueryEdge::EdgeData, Ownership>;
 
 using QueryGraph = detail::QueryGraph<storage::Ownership::Container>;
 using QueryGraphView = detail::QueryGraph<storage::Ownership::View>;
-} // namespace osrm
+} // namespace osrm::contractor
 
 #endif // QUERYEDGE_HPP

include/contractor/serialization.hpp

@@ -42,6 +42,6 @@ void read(storage::tar::FileReader &reader,
                                      metric.edge_filter[index]);
     }
 }
-} // namespace osrm
+} // namespace osrm::contractor::serialization
 
 #endif

include/customizer/cell_customizer.hpp

@@ -233,6 +233,6 @@ class CellCustomizer
 
     const partitioner::MultiLevelPartition &partition;
 };
-} // namespace osrm
+} // namespace osrm::customizer
 
 #endif // OSRM_CELLS_CUSTOMIZER_HPP

include/customizer/cell_metric.hpp

@@ -24,6 +24,6 @@ template <storage::Ownership Ownership> struct CellMetricImpl
 
 using CellMetric = detail::CellMetricImpl<storage::Ownership::Container>;
 using CellMetricView = detail::CellMetricImpl<storage::Ownership::View>;
-} // namespace osrm
+} // namespace osrm::customizer
 
 #endif

include/customizer/customizer.hpp

@@ -12,6 +12,6 @@ class Customizer
     int Run(const CustomizationConfig &config);
 };
 
-} // namespace osrm
+} // namespace osrm::customizer
 
 #endif // OSRM_CUSTOMIZE_CUSTOMIZER_HPP

include/customizer/customizer_config.hpp

@@ -37,6 +37,6 @@ struct CustomizationConfig final : storage::IOConfig
 
     updater::UpdaterConfig updater_config;
 };
-} // namespace osrm
+} // namespace osrm::customizer
 
 #endif // OSRM_CUSTOMIZE_CUSTOMIZER_CONFIG_HPP

include/customizer/edge_based_graph.hpp

@@ -124,6 +124,6 @@ using MultiLevelEdgeBasedGraph =
     MultiLevelGraph<EdgeBasedGraphEdgeData, storage::Ownership::Container>;
 using MultiLevelEdgeBasedGraphView =
     MultiLevelGraph<EdgeBasedGraphEdgeData, storage::Ownership::View>;
-} // namespace osrm
+} // namespace osrm::customizer
 
 #endif

include/customizer/files.hpp

@@ -102,6 +102,6 @@ inline void writeGraph(const boost::filesystem::path &path,
     writer.WriteFrom("/mld/connectivity_checksum", connectivity_checksum);
     serialization::write(writer, "/mld/multilevelgraph", graph);
 }
-} // namespace osrm
+} // namespace osrm::customizer::files
 
 #endif

include/customizer/serialization.hpp

@@ -61,6 +61,6 @@ inline void write(storage::tar::FileWriter &writer,
     storage::serialization::write(writer, name + "/is_backward_edge", graph.is_backward_edge);
     storage::serialization::write(writer, name + "/node_to_edge_offset", graph.node_to_edge_offset);
 }
-} // namespace osrm
+} // namespace osrm::customizer::serialization
 
 #endif

include/engine/algorithm.hpp

@@ -107,6 +107,6 @@ template <> struct HasGetTileTurns<mld::Algorithm> final : std::true_type
 template <> struct HasExcludeFlags<mld::Algorithm> final : std::true_type
 {
 };
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif

include/engine/api/base_api.hpp

@@ -166,6 +166,6 @@ class BaseAPI
     const BaseParameters &parameters;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/base_parameters.hpp

@@ -120,6 +120,6 @@ struct BaseParameters
                            });
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif // ROUTE_PARAMETERS_HPP

include/engine/api/base_result.hpp

@@ -12,6 +12,6 @@ namespace osrm::engine::api
 {
 using ResultT =
     mapbox::util::variant<util::json::Object, std::string, flatbuffers::FlatBufferBuilder>;
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/json_factory.hpp

@@ -108,7 +108,7 @@ util::json::Object makeRouteLeg(guidance::RouteLeg leg, util::json::Array steps)
 util::json::Array makeRouteLegs(std::vector<guidance::RouteLeg> legs,
                                 std::vector<util::json::Value> step_geometries,
                                 std::vector<util::json::Object> annotations);
-} // namespace api
-} // namespace osrm
+} // namespace api::json
+} // namespace osrm::engine
 
 #endif // ENGINE_GUIDANCE_API_RESPONSE_GENERATOR_HPP_

include/engine/api/match_api.hpp

@@ -249,6 +249,6 @@ class MatchAPI final : public RouteAPI
     const tidy::Result &tidy_result;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/match_parameters.hpp

@@ -94,6 +94,6 @@ struct MatchParameters : public RouteParameters
                (timestamps.empty() || timestamps.size() == coordinates.size());
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/match_parameters_tidy.hpp

@@ -194,6 +194,6 @@ inline Result tidy(const MatchParameters &params, Thresholds cfg = {15., 5})
     return result;
 }
 
-} // namespace osrm
+} // namespace osrm::engine::api::tidy
 
 #endif

include/engine/api/nearest_api.hpp

@@ -160,6 +160,6 @@ class NearestAPI final : public BaseAPI
     }
 };
 
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/nearest_parameters.hpp

@@ -48,6 +48,6 @@ struct NearestParameters : public BaseParameters
 
     bool IsValid() const { return BaseParameters::IsValid() && number_of_results >= 1; }
 };
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif // ENGINE_API_NEAREST_PARAMETERS_HPP

include/engine/api/route_api.hpp

@@ -997,6 +997,6 @@ class RouteAPI : public BaseAPI
     }
 };
 
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/route_parameters.hpp

@@ -207,6 +207,6 @@ inline RouteParameters::AnnotationsType operator|=(RouteParameters::AnnotationsT
 {
     return lhs = lhs | rhs;
 }
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/table_api.hpp

@@ -418,6 +418,6 @@ class TableAPI final : public BaseAPI
     const TableParameters &parameters;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/table_parameters.hpp

@@ -162,6 +162,6 @@ inline TableParameters::AnnotationsType &operator|=(TableParameters::Annotations
 {
     return lhs = lhs | rhs;
 }
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif // ENGINE_API_TABLE_PARAMETERS_HPP

include/engine/api/tile_parameters.hpp

@@ -66,6 +66,6 @@ struct TileParameters final
         return valid_x && valid_y && valid_z;
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/trip_api.hpp

@@ -176,6 +176,6 @@ class TripAPI final : public RouteAPI
     const TripParameters &parameters;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/api/trip_parameters.hpp

@@ -72,6 +72,6 @@ struct TripParameters : public RouteParameters
 
     bool IsValid() const { return RouteParameters::IsValid(); }
 };
-} // namespace osrm
+} // namespace osrm::engine::api
 
 #endif

include/engine/approach.hpp

@@ -39,5 +39,5 @@ enum class Approach : std::uint8_t
     UNRESTRICTED = 1
 
 };
-} // namespace osrm
+} // namespace osrm::engine
 #endif

include/engine/bearing.hpp

@@ -44,6 +44,6 @@ inline bool operator==(const Bearing lhs, const Bearing rhs)
     return lhs.bearing == rhs.bearing && lhs.range == rhs.range;
 }
 inline bool operator!=(const Bearing lhs, const Bearing rhs) { return !(lhs == rhs); }
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/data_watchdog.hpp

@@ -147,6 +147,6 @@ class DataWatchdogImpl<AlgorithmT, datafacade::ContiguousInternalMemoryDataFacad
 // once a new dataset arrives.
 template <typename AlgorithmT, template <typename A> class FacadeT>
 using DataWatchdog = detail::DataWatchdogImpl<AlgorithmT, FacadeT<AlgorithmT>>;
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/datafacade.hpp

@@ -9,6 +9,6 @@ namespace osrm::engine
 using DataFacadeBase = datafacade::ContiguousInternalMemoryDataFacadeBase;
 template <typename AlgorithmT>
 using DataFacade = datafacade::ContiguousInternalMemoryDataFacade<AlgorithmT>;
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/datafacade/algorithm_datafacade.hpp

@@ -105,6 +105,6 @@ template <> class AlgorithmDataFacade<MLD>
     virtual EdgeID FindEdge(const NodeID edge_based_node_from,
                             const NodeID edge_based_node_to) const = 0;
 };
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif

include/engine/datafacade/contiguous_block_allocator.hpp

@@ -15,6 +15,6 @@ class ContiguousBlockAllocator
     virtual const storage::SharedDataIndex &GetIndex() = 0;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif // OSRM_ENGINE_DATAFACADE_CONTIGUOUS_BLOCK_ALLOCATOR_HPP_

include/engine/datafacade/contiguous_internalmem_datafacade.hpp

@@ -689,6 +689,6 @@ class ContiguousInternalMemoryDataFacade<MLD> final
     {
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif // CONTIGUOUS_INTERNALMEM_DATAFACADE_HPP

include/engine/datafacade/datafacade_base.hpp

@@ -185,6 +185,6 @@ class BaseDataFacade
     virtual std::vector<extractor::ManeuverOverride>
     GetOverridesThatStartAt(const NodeID edge_based_node_id) const = 0;
 };
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif // DATAFACADE_BASE_HPP

include/engine/datafacade/mmap_memory_allocator.hpp

@@ -33,6 +33,6 @@ class MMapMemoryAllocator final : public ContiguousBlockAllocator
     std::string rtree_filename;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif // OSRM_ENGINE_DATAFACADE_SHARED_MEMORY_ALLOCATOR_HPP_

include/engine/datafacade/process_memory_allocator.hpp

@@ -30,6 +30,6 @@ class ProcessMemoryAllocator final : public ContiguousBlockAllocator
     std::unique_ptr<char[]> internal_memory;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif // OSRM_ENGINE_DATAFACADE_PROCESS_MEMORY_ALLOCATOR_HPP_

include/engine/datafacade/shared_memory_allocator.hpp

@@ -31,6 +31,6 @@ class SharedMemoryAllocator final : public ContiguousBlockAllocator
     std::vector<std::unique_ptr<storage::SharedMemory>> memory_regions;
 };
 
-} // namespace osrm
+} // namespace osrm::engine::datafacade
 
 #endif // OSRM_ENGINE_DATAFACADE_SHARED_MEMORY_ALLOCATOR_HPP_

include/engine/datafacade_factory.hpp

@@ -150,6 +150,6 @@ template <template <typename A> class FacadeT, typename AlgorithmT> class DataFa
     std::unordered_map<std::string, extractor::ClassData> name_to_class;
     const extractor::ProfileProperties *properties = nullptr;
 };
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/datafacade_provider.hpp

@@ -101,6 +101,6 @@ template <typename AlgorithmT>
 using ImmutableProvider = detail::ImmutableProvider<AlgorithmT, DataFacade>;
 template <typename AlgorithmT>
 using ExternalProvider = detail::ExternalProvider<AlgorithmT, DataFacade>;
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/douglas_peucker.hpp

@@ -73,6 +73,6 @@ inline std::vector<util::Coordinate> douglasPeucker(const std::vector<util::Coor
 {
     return douglasPeucker(begin(geometry), end(geometry), zoom_level);
 }
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif /* DOUGLAS_PEUCKER_HPP_ */

include/engine/engine.hpp

@@ -128,6 +128,6 @@ template <typename Algorithm> class Engine final : public EngineInterface
     const plugins::MatchPlugin match_plugin;
     const plugins::TilePlugin tile_plugin;
 };
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif // OSRM_IMPL_HPP

include/engine/engine_config.hpp

@@ -91,6 +91,6 @@ struct EngineConfig final
     std::string verbosity;
     std::string dataset_name;
 };
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif // SERVER_CONFIG_HPP

include/engine/geospatial_query.hpp

@@ -581,6 +581,6 @@ template <typename RTreeT, typename DataFacadeT> class GeospatialQuery
     const CoordinateList &coordinates;
     DataFacadeT &datafacade;
 };
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/guidance/assemble_geometry.hpp

@@ -168,6 +168,6 @@ inline LegGeometry assembleGeometry(const datafacade::BaseDataFacade &facade,
 
     return geometry;
 }
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/assemble_leg.hpp

@@ -228,6 +228,6 @@ inline RouteLeg assembleLeg(const datafacade::BaseDataFacade &facade,
                     {}};
 }
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif // ENGINE_GUIDANCE_SEGMENT_LIST_HPP_

include/engine/guidance/assemble_overview.hpp

@@ -13,6 +13,6 @@ namespace osrm::engine::guidance
 std::vector<util::Coordinate> assembleOverview(const std::vector<LegGeometry> &leg_geometries,
                                                const bool use_simplification);
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/assemble_route.hpp

@@ -11,6 +11,6 @@ namespace osrm::engine::guidance
 
 Route assembleRoute(const std::vector<RouteLeg> &route_legs);
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/assemble_steps.hpp

@@ -361,6 +361,6 @@ inline std::vector<RouteStep> assembleSteps(const datafacade::BaseDataFacade &fa
     return steps;
 }
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif // ENGINE_GUIDANCE_SEGMENT_LIST_HPP_

include/engine/guidance/collapse_scenario_detection.hpp

@@ -83,6 +83,6 @@ bool doubleChoiceless(const RouteStepIterator step_entering_intersection,
 bool straightTurnFollowedByChoiceless(const RouteStepIterator step_entering_intersection,
                                       const RouteStepIterator step_leaving_intersection);
 
-} /* namespace osrm */
+} // namespace osrm::engine::guidance
 
 #endif /* OSRM_ENGINE_GUIDANCE_COLLAPSE_SCENARIO_DETECTION_HPP_ */

include/engine/guidance/collapse_turns.hpp

@@ -158,6 +158,6 @@ void combineRouteSteps(RouteStep &step_at_turn_location,
 // alias for suppressing a step, using CombineRouteStep with NoModificationStrategy only
 void suppressStep(RouteStep &step_at_turn_location, RouteStep &step_after_turn_location);
 
-} /* namespace osrm */
+} // namespace osrm::engine::guidance
 
 #endif /* OSRM_ENGINE_GUIDANCE_COLLAPSE_HPP_ */

include/engine/guidance/collapsing_utility.hpp

@@ -298,6 +298,6 @@ inline bool hasStraightestTurn(const RouteStep &step)
     return false;
 }
 
-} /* namespace osrm */
+} // namespace osrm::engine::guidance
 
 #endif /* OSRM_ENGINE_GUIDANCE_COLLAPSING_UTILITY_HPP_ */

include/engine/guidance/lane_processing.hpp

@@ -18,6 +18,6 @@ OSRM_ATTR_WARN_UNUSED
 std::vector<RouteStep> anticipateLaneChange(std::vector<RouteStep> steps,
                                             const double min_distance_needed_for_lane_change = 200);
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif /* OSRM_ENGINE_GUIDANCE_LANE_PROCESSING_HPP_ */

include/engine/guidance/leg_geometry.hpp

@@ -60,6 +60,6 @@ struct LegGeometry
         return segment_offsets.size() - 1;
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/post_processing.hpp

@@ -54,6 +54,6 @@ void applyOverrides(const datafacade::BaseDataFacade &facade,
                     std::vector<RouteStep> &steps,
                     const LegGeometry &geometry);
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif // ENGINE_GUIDANCE_POST_PROCESSING_HPP

include/engine/guidance/postprocessing_toolkit.hpp

@@ -42,6 +42,6 @@ template <typename Iter, typename Fn> inline Fn forEachRoundabout(Iter first, It
     return fn;
 }
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif /* OSRM_ENGINE_GUIDANCE_POSTPROCESSING_TOOLKIT_HPP_ */

include/engine/guidance/route.hpp

@@ -10,6 +10,6 @@ struct Route
     double duration;
     double weight;
 };
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/route_leg.hpp

@@ -19,6 +19,6 @@ struct RouteLeg
     std::string summary;
     std::vector<RouteStep> steps;
 };
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/route_step.hpp

@@ -230,6 +230,6 @@ inline auto RouteStep::LanesToTheRight() const
     return boost::make_iterator_range(description.end() - num_lanes_right, description.end());
 }
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif

include/engine/guidance/step_maneuver.hpp

@@ -40,5 +40,5 @@ inline StepManeuver getInvalidStepManeuver()
             0};
 }
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 #endif

include/engine/guidance/verbosity_reduction.hpp

@@ -16,6 +16,6 @@ namespace osrm::engine::guidance
 OSRM_ATTR_WARN_UNUSED
 std::vector<RouteStep> suppressShortNameSegments(std::vector<RouteStep> steps);
 
-} // namespace osrm
+} // namespace osrm::engine::guidance
 
 #endif /* OSRM_ENGINE_GUIDANCE_VERBOSITY_REDUCTION_HPP_ */

include/engine/hint.hpp

@@ -81,6 +81,6 @@ constexpr std::size_t ENCODED_SEGMENT_HINT_SIZE = 112;
 static_assert(ENCODED_SEGMENT_HINT_SIZE / 4 * 3 >= sizeof(SegmentHint),
               "ENCODED_SEGMENT_HINT_SIZE does not match size of SegmentHint");
 
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/internal_route_result.hpp

@@ -150,6 +150,6 @@ inline InternalRouteResult CollapseInternalRouteResult(const InternalRouteResult
     BOOST_ASSERT(collapsed.leg_endpoints.size() == collapsed.unpacked_path_segments.size());
     return collapsed;
 }
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif // RAW_ROUTE_DATA_H

include/engine/map_matching/bayes_classifier.hpp

@@ -94,6 +94,6 @@ class BayesClassifier
     double positive_apriori_probability;
     double negative_apriori_probability;
 };
-} // namespace osrm
+} // namespace osrm::engine::map_matching
 
 #endif // BAYES_CLASSIFIER_HPP

include/engine/map_matching/hidden_markov_model.hpp

@@ -133,6 +133,6 @@ template <class CandidateLists> struct HiddenMarkovModel
         return initial_timestamp;
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::map_matching
 
 #endif // HIDDEN_MARKOV_MODEL

include/engine/map_matching/matching_confidence.hpp

@@ -47,6 +47,6 @@ struct MatchingConfidence
   private:
     ClassifierT classifier;
 };
-} // namespace osrm
+} // namespace osrm::engine::map_matching
 
 #endif

include/engine/map_matching/sub_matching.hpp

@@ -15,6 +15,6 @@ struct SubMatching
     std::vector<unsigned> alternatives_count;
     double confidence;
 };
-} // namespace osrm
+} // namespace osrm::engine::map_matching
 
 #endif

include/engine/phantom_node.hpp

@@ -271,6 +271,6 @@ struct PhantomEndpoints
     PhantomNode target_phantom;
 };
 
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif // OSRM_ENGINE_PHANTOM_NODE_H

include/engine/plugins/match.hpp

@@ -34,6 +34,6 @@ class MatchPlugin : public BasePlugin
     const int max_locations_map_matching;
     const double max_radius_map_matching;
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif // MATCH_HPP

include/engine/plugins/nearest.hpp

@@ -22,6 +22,6 @@ class NearestPlugin final : public BasePlugin
   private:
     const int max_results;
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif /* NEAREST_HPP */

include/engine/plugins/plugin_base.hpp

@@ -321,6 +321,6 @@ class BasePlugin
                std::to_string(missing_index);
     }
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif /* BASE_PLUGIN_HPP */

include/engine/plugins/table.hpp

@@ -23,6 +23,6 @@ class TablePlugin final : public BasePlugin
   private:
     const int max_locations_distance_table;
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif // TABLE_HPP

include/engine/plugins/tile.hpp

@@ -26,6 +26,6 @@ class TilePlugin final : public BasePlugin
                          const api::TileParameters &parameters,
                          osrm::engine::api::ResultT &pbf_buffer) const;
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif /* TILEPLUGIN_HPP */

include/engine/plugins/trip.hpp

@@ -38,6 +38,6 @@ class TripPlugin final : public BasePlugin
                          const api::TripParameters &parameters,
                          osrm::engine::api::ResultT &json_result) const;
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif // TRIP_HPP

include/engine/plugins/viaroute.hpp

@@ -31,6 +31,6 @@ class ViaRoutePlugin final : public BasePlugin
                          const api::RouteParameters &route_parameters,
                          osrm::engine::api::ResultT &json_result) const;
 };
-} // namespace osrm
+} // namespace osrm::engine::plugins
 
 #endif // VIA_ROUTE_HPP

include/engine/polyline_compressor.hpp

@@ -78,6 +78,6 @@ std::vector<util::Coordinate> decodePolyline(const std::string &polyline)
     }
     return coordinates;
 }
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif /* POLYLINECOMPRESSOR_H_ */

include/engine/routing_algorithms.hpp

@@ -230,6 +230,6 @@ inline std::vector<routing_algorithms::TurnData> RoutingAlgorithms<Algorithm>::G
     return routing_algorithms::getTileTurns(*facade, edges, sorted_edge_indexes);
 }
 
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif

include/engine/routing_algorithms/alternative_path.hpp

@@ -22,6 +22,6 @@ InternalManyRoutesResult alternativePathSearch(SearchEngineData<mld::Algorithm>
                                                const PhantomEndpointCandidates &endpoint_candidates,
                                                unsigned number_of_alternatives);
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif

include/engine/routing_algorithms/direct_shortest_path.hpp

@@ -22,6 +22,6 @@ InternalRouteResult directShortestPathSearch(SearchEngineData<Algorithm> &engine
                                              const DataFacade<Algorithm> &facade,
                                              const PhantomEndpointCandidates &endpoint_candidates);
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif /* DIRECT_SHORTEST_PATH_HPP */

include/engine/routing_algorithms/many_to_many.hpp

@@ -95,6 +95,6 @@ manyToManySearch(SearchEngineData<Algorithm> &engine_working_data,
                  const std::vector<std::size_t> &target_indices,
                  const bool calculate_distance);
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif

include/engine/routing_algorithms/map_matching.hpp

@@ -27,6 +27,6 @@ SubMatchingList mapMatching(SearchEngineData<Algorithm> &engine_working_data,
                             const std::vector<boost::optional<double>> &trace_gps_precision,
                             const bool allow_splitting);
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif /* MAP_MATCHING_HPP */

include/engine/routing_algorithms/routing_base.hpp

@@ -416,6 +416,6 @@ template <typename FacadeT> EdgeDistance computeEdgeDistance(const FacadeT &faca
     return total_distance;
 }
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif // OSRM_ENGINE_ROUTING_BASE_HPP

include/engine/routing_algorithms/routing_base_ch.hpp

@@ -514,6 +514,6 @@ std::tuple<EdgeMetric, EdgeDistance> getLoopMetric(const DataFacade<Algorithm> &
     }
     return std::make_tuple(loop_metric, loop_distance);
 }
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms::ch
 
 #endif // OSRM_ENGINE_ROUTING_BASE_CH_HPP

include/engine/routing_algorithms/routing_base_mld.hpp

@@ -649,6 +649,6 @@ double getNetworkDistance(SearchEngineData<Algorithm> &engine_working_data,
     return getPathDistance(facade, unpacked_path, source_phantom, target_phantom);
 }
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms::mld
 
 #endif // OSRM_ENGINE_ROUTING_BASE_MLD_HPP

include/engine/routing_algorithms/shortest_path.hpp

@@ -16,6 +16,6 @@ shortestPathSearch(SearchEngineData<Algorithm> &engine_working_data,
                    const std::vector<PhantomNodeCandidates> &waypoint_candidates,
                    const boost::optional<bool> continue_straight_at_waypoint);
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif /* OSRM_SHORTEST_PATH_HPP */

include/engine/routing_algorithms/shortest_path_impl.hpp

@@ -785,6 +785,6 @@ shortestPathSearch(SearchEngineData<Algorithm> &engine_working_data,
     }
 }
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif /* OSRM_SHORTEST_PATH_IMPL_HPP */

include/engine/routing_algorithms/tile_turns.hpp

@@ -33,6 +33,6 @@ std::vector<TurnData> getTileTurns(const DataFacade<mld::Algorithm> &facade,
                                    const std::vector<RTreeLeaf> &edges,
                                    const std::vector<std::size_t> &sorted_edge_indexes);
 
-} // namespace osrm
+} // namespace osrm::engine::routing_algorithms
 
 #endif

include/engine/search_engine_data.hpp

@@ -118,6 +118,6 @@ template <> struct SearchEngineData<routing_algorithms::mld::Algorithm>
     void InitializeOrClearManyToManyThreadLocalStorage(unsigned number_of_nodes,
                                                        unsigned number_of_boundary_nodes);
 };
-} // namespace osrm
+} // namespace osrm::engine
 
 #endif // SEARCH_ENGINE_DATA_HPP