Home
last modified time | relevance | path

Searched refs:engine_working_data (Results 1 – 15 of 15) sorted by relevance

/dports/www/osrm-backend/osrm-backend-5.26.0/src/engine/routing_algorithms/
H A Ddirect_shortest_path.cpp20 InternalRouteResult directShortestPathSearch(SearchEngineData<ch::Algorithm> &engine_working_data, in directShortestPathSearch() argument
24 engine_working_data.InitializeOrClearFirstThreadLocalStorage(facade.GetNumberOfNodes()); in directShortestPathSearch()
25 auto &forward_heap = *engine_working_data.forward_heap_1; in directShortestPathSearch()
26 auto &reverse_heap = *engine_working_data.reverse_heap_1; in directShortestPathSearch()
34 search(engine_working_data, in directShortestPathSearch()
67 InternalRouteResult directShortestPathSearch(SearchEngineData<mld::Algorithm> &engine_working_data, in directShortestPathSearch() argument
71 engine_working_data.InitializeOrClearFirstThreadLocalStorage(facade.GetNumberOfNodes(), in directShortestPathSearch()
73 auto &forward_heap = *engine_working_data.forward_heap_1; in directShortestPathSearch()
74 auto &reverse_heap = *engine_working_data.reverse_heap_1; in directShortestPathSearch()
82 std::tie(weight, unpacked_nodes, unpacked_edges) = mld::search(engine_working_data, in directShortestPathSearch()
H A Dalternative_path_ch.cpp170 auto &existing_forward_heap = *engine_working_data.forward_heap_1; in computeWeightAndSharingOfViaPath()
172 auto &new_forward_heap = *engine_working_data.forward_heap_2; in computeWeightAndSharingOfViaPath()
173 auto &new_reverse_heap = *engine_working_data.reverse_heap_2; in computeWeightAndSharingOfViaPath()
530 QueryHeap &forward_heap3 = *engine_working_data.forward_heap_3; in viaNodeCandidatePassesTTest()
531 QueryHeap &reverse_heap3 = *engine_working_data.reverse_heap_3; in viaNodeCandidatePassesTTest()
588 auto &forward_heap1 = *engine_working_data.forward_heap_1; in alternativePathSearch()
589 auto &reverse_heap1 = *engine_working_data.reverse_heap_1; in alternativePathSearch()
590 auto &forward_heap2 = *engine_working_data.forward_heap_2; in alternativePathSearch()
591 auto &reverse_heap2 = *engine_working_data.reverse_heap_2; in alternativePathSearch()
758 computeWeightAndSharingOfViaPath(engine_working_data, in alternativePathSearch()
[all …]
H A Dmap_matching.cpp51 inline void initializeHeap(SearchEngineData<Algorithm> &engine_working_data, in initializeHeap() argument
56 engine_working_data.InitializeOrClearFirstThreadLocalStorage(nodes_number); in initializeHeap()
60 inline void initializeHeap<mld::Algorithm>(SearchEngineData<mld::Algorithm> &engine_working_data, in initializeHeap() argument
66 engine_working_data.InitializeOrClearFirstThreadLocalStorage(nodes_number, border_nodes_number); in initializeHeap()
71 SubMatchingList mapMatching(SearchEngineData<Algorithm> &engine_working_data, in mapMatching() argument
153 initializeHeap(engine_working_data, facade); in mapMatching()
154 auto &forward_heap = *engine_working_data.forward_heap_1; in mapMatching()
155 auto &reverse_heap = *engine_working_data.reverse_heap_1; in mapMatching()
241 getNetworkDistance(engine_working_data, in mapMatching()
442 mapMatching(SearchEngineData<ch::Algorithm> &engine_working_data,
[all …]
H A Dmany_to_many_mld.cpp215 oneToManySearch(SearchEngineData<Algorithm> &engine_working_data, in oneToManySearch() argument
274 engine_working_data.InitializeOrClearManyToManyThreadLocalStorage( in oneToManySearch()
276 auto &query_heap = *(engine_working_data.many_to_many_heap); in oneToManySearch()
525 manyToManySearch(SearchEngineData<Algorithm> &engine_working_data, in manyToManySearch() argument
550 engine_working_data.InitializeOrClearManyToManyThreadLocalStorage( in manyToManySearch()
552 auto &query_heap = *(engine_working_data.many_to_many_heap); in manyToManySearch()
577 engine_working_data.InitializeOrClearManyToManyThreadLocalStorage( in manyToManySearch()
580 auto &query_heap = *(engine_working_data.many_to_many_heap); in manyToManySearch()
623 manyToManySearch(SearchEngineData<mld::Algorithm> &engine_working_data, in manyToManySearch() argument
632 return mld::oneToManySearch<FORWARD_DIRECTION>(engine_working_data, in manyToManySearch()
[all …]
H A Dshortest_path.cpp13 shortestPathSearch(SearchEngineData<ch::Algorithm> &engine_working_data,
19 shortestPathSearch(SearchEngineData<mld::Algorithm> &engine_working_data,
H A Dmany_to_many_ch.cpp182 manyToManySearch(SearchEngineData<ch::Algorithm> &engine_working_data, in manyToManySearch() argument
207 engine_working_data.InitializeOrClearManyToManyThreadLocalStorage( in manyToManySearch()
209 auto &query_heap = *(engine_working_data.many_to_many_heap); in manyToManySearch()
230 engine_working_data.InitializeOrClearManyToManyThreadLocalStorage( in manyToManySearch()
232 auto &query_heap = *(engine_working_data.many_to_many_heap); in manyToManySearch()
H A Drouting_base_ch.cpp171 double getNetworkDistance(SearchEngineData<Algorithm> &engine_working_data, in getNetworkDistance() argument
186 search(engine_working_data, in getNetworkDistance()
/dports/www/osrm-backend/osrm-backend-5.26.0/include/engine/routing_algorithms/
H A Dshortest_path_impl.hpp24 void searchWithUTurn(SearchEngineData<Algorithm> &engine_working_data, in searchWithUTurn() argument
74 search(engine_working_data, in searchWithUTurn()
95 void search(SearchEngineData<Algorithm> &engine_working_data, in search() argument
135 search(engine_working_data, in search()
168 search(engine_working_data, in search()
212 inline void initializeHeap(SearchEngineData<Algorithm> &engine_working_data, in initializeHeap() argument
243 initializeHeap(engine_working_data, facade); in shortestPathSearch()
245 auto &forward_heap = *engine_working_data.forward_heap_1; in shortestPathSearch()
246 auto &reverse_heap = *engine_working_data.reverse_heap_1; in shortestPathSearch()
287 searchWithUTurn(engine_working_data, in shortestPathSearch()
[all …]
H A Drouting_base_mld.hpp392 UnpackedPath search(SearchEngineData<Algorithm> &engine_working_data, in search() argument
497 std::tie(subpath_weight, subpath_nodes, subpath_edges) = search(engine_working_data, in search()
521 inline void search(SearchEngineData<Algorithm> &engine_working_data, in search() argument
533 std::tie(weight, unpacked_nodes, std::ignore) = search(engine_working_data, in search()
575 double getNetworkDistance(SearchEngineData<Algorithm> &engine_working_data, in getNetworkDistance() argument
592 std::tie(weight, unpacked_nodes, unpacked_edges) = search(engine_working_data, in getNetworkDistance()
H A Ddirect_shortest_path.hpp25 InternalRouteResult directShortestPathSearch(SearchEngineData<Algorithm> &engine_working_data,
H A Dshortest_path.hpp17 InternalRouteResult shortestPathSearch(SearchEngineData<Algorithm> &engine_working_data,
H A Dmap_matching.hpp26 SubMatchingList mapMatching(SearchEngineData<Algorithm> &engine_working_data,
H A Dmany_to_many.hpp95 manyToManySearch(SearchEngineData<Algorithm> &engine_working_data,
H A Drouting_base_ch.hpp466 void search(SearchEngineData<Algorithm> &engine_working_data,
480 double getNetworkDistance(SearchEngineData<Algorithm> &engine_working_data,
/dports/www/osrm-backend/osrm-backend-5.26.0/unit_tests/engine/
H A Doffline_facade.cpp397 inline void search(SearchEngineData<Algorithm> &engine_working_data, in search() argument
408 mld::search(engine_working_data, in search()