FM / engine

/srv/osrm/osrm-backend/include/engine

Name	Size	Mode	Actions
api/	-	0755	rm
datafacade/	-	0755	rm
guidance/	-	0755	rm
map_matching/	-	0755	rm
plugins/	-	0755	rm
routing_algorithms/	-	0755	rm
trip/	-	0755	rm
algorithm.hpp	2974	0644	edit dl rm
approach.hpp	1530	0644	edit dl rm
base64.hpp	4600	0644	edit dl rm
bearing.hpp	1806	0644	edit dl rm
datafacade.hpp	408	0644	edit dl rm
datafacade_factory.hpp	5449	0644	edit dl rm
datafacade_provider.hpp	3468	0644	edit dl rm
data_watchdog.hpp	6140	0644	edit dl rm
douglas_peucker.hpp	2606	0644	edit dl rm
engine.hpp	5453	0644	edit dl rm
engine_config.hpp	3214	0644	edit dl rm
geospatial_query.hpp	27393	0644	edit dl rm
hint.hpp	2942	0644	edit dl rm
internal_route_result.hpp	6020	0644	edit dl rm
phantom_node.hpp	10938	0644	edit dl rm
polyline_compressor.hpp	2875	0644	edit dl rm
routing_algorithms.hpp	9399	0644	edit dl rm
search_engine_data.hpp	4380	0644	edit dl rm
status.hpp	1534	0644	edit dl rm

Edit: /srv/osrm/osrm-backend/include/engine/engine_config.hpp (3214B)

Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list
of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

#ifndef ENGINE_CONFIG_HPP
#define ENGINE_CONFIG_HPP

#include "storage/storage_config.hpp"

#include <boost/filesystem/path.hpp>

#include <string>

namespace osrm::engine
{

/**
 * Configures an OSRM instance.
 *
 * You can customize the storage OSRM uses for auxiliary files specifying a storage config.
 *
 * You can further set service constraints.
 * These are the maximum number of allowed locations (-1 for unlimited) for the services:
 *  - Trip
 *  - Route
 *  - Table
 *  - Match
 *  - Nearest
 *
 * In addition, shared memory can be used for datasets loaded with osrm-datastore.
 *
 * You can chose between three algorithms:
 *  - Algorithm::CH
 *      Contraction Hierarchies, extremely fast queries but slow pre-processing. The default right
 * now.
 *  - Algorithm::CoreCH
 *      Deprecated, to be removed in v6.0
 *      Contraction Hierachies with partial contraction for faster pre-processing but slower
 * queries.
 *  - Algorithm::MLD
 *      Multi Level Dijkstra, moderately fast in both pre-processing and query.
 *
 * \see OSRM, StorageConfig
 */
struct EngineConfig final
{
    bool IsValid() const;

enum class Algorithm
    {
        CH,
        CoreCH, // Deprecated, will be removed in v6.0
        MLD
    };

storage::StorageConfig storage_config;
    int max_locations_trip = -1;
    int max_locations_viaroute = -1;
    int max_locations_distance_table = -1;
    int max_locations_map_matching = -1;
    double max_radius_map_matching = -1.0;
    int max_results_nearest = -1;
    boost::optional<double> default_radius;
    int max_alternatives = 3; // set an arbitrary upper bound; can be adjusted by user
    bool use_shared_memory = true;
    boost::filesystem::path memory_file;
    bool use_mmap = true;
    Algorithm algorithm = Algorithm::CH;
    std::string verbosity;
    std::string dataset_name;
};
} // namespace osrm::engine

#endif // SERVER_CONFIG_HPP

/* Copyright (c) 2017, Project OSRM contributors All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef ENGINE_CONFIG_HPP #define ENGINE_CONFIG_HPP #include "storage/storage_config.hpp" #include #include namespace osrm::engine { /** * Configures an OSRM instance. * * You can customize the storage OSRM uses for auxiliary files specifying a storage config. * * You can further set service constraints. * These are the maximum number of allowed locations (-1 for unlimited) for the services: * - Trip * - Route * - Table * - Match * - Nearest * * In addition, shared memory can be used for datasets loaded with osrm-datastore. * * You can chose between three algorithms: * - Algorithm::CH * Contraction Hierarchies, extremely fast queries but slow pre-processing. The default right * now. * - Algorithm::CoreCH * Deprecated, to be removed in v6.0 * Contraction Hierachies with partial contraction for faster pre-processing but slower * queries. * - Algorithm::MLD * Multi Level Dijkstra, moderately fast in both pre-processing and query. * * \see OSRM, StorageConfig */ struct EngineConfig final { bool IsValid() const; enum class Algorithm { CH, CoreCH, // Deprecated, will be removed in v6.0 MLD }; storage::StorageConfig storage_config; int max_locations_trip = -1; int max_locations_viaroute = -1; int max_locations_distance_table = -1; int max_locations_map_matching = -1; double max_radius_map_matching = -1.0; int max_results_nearest = -1; boost::optional default_radius; int max_alternatives = 3; // set an arbitrary upper bound; can be adjusted by user bool use_shared_memory = true; boost::filesystem::path memory_file; bool use_mmap = true; Algorithm algorithm = Algorithm::CH; std::string verbosity; std::string dataset_name; }; } // namespace osrm::engine #endif // SERVER_CONFIG_HPP