Home
last modified time | relevance | path

Searched refs:local_sources (Results 1 – 5 of 5) sorted by relevance

/third_party/boost/libs/graph_parallel/test/
Dalgorithm_performance.cpp219 std::vector<vertex_descriptor> all_sources, local_sources; in test_directed_csr_only_algorithms() local
228 … && std::find(local_sources.begin(), local_sources.end(), *iter) == local_sources.end()) { in test_directed_csr_only_algorithms()
229 local_sources.push_back(*iter); in test_directed_csr_only_algorithms()
233 all_gather(pg, local_sources.begin(), local_sources.end(), all_sources); in test_directed_csr_only_algorithms()
Dssca.cpp193 std::vector<vertex_descriptor> all_sources, local_sources; in generate_sources() local
202 && std::find(local_sources.begin(), local_sources.end(), *iter) == local_sources.end()) { in generate_sources()
203 local_sources.push_back(*iter); in generate_sources()
207 all_gather(pg, local_sources.begin(), local_sources.end(), all_sources); in generate_sources()
/third_party/boost/boost/graph/distributed/
Dbetweenness_centrality.hpp1141 std::vector<vertex_descriptor> local_sources; in non_distributed_brandes_betweenness_centrality_impl() local
1145 local_sources.push_back(sources.top()); in non_distributed_brandes_betweenness_centrality_impl()
1151 for(size_t i = 0; i < local_sources.size(); ++i) in non_distributed_brandes_betweenness_centrality_impl()
1154 shortest_paths, ordered_vertices, local_sources[i]); in non_distributed_brandes_betweenness_centrality_impl()
/third_party/glib/gio/
Dmeson.build326 local_sources = files( variable
601 gio_sources += local_sources
/third_party/glib/
DBUILD.gn451 # local_sources