"clang++-17" -fvisibility-inlines-hidden -Wno-c99-extensions -std=c++20 -Wall -Wextra -fPIC -pthread -O0 -fno-inline -Wall -fvisibility=hidden -m64 --target=x86_64-pc-linux -DBOOST_ALL_NO_LIB=1 -DBOOST_COBALT_USE_STD_PMR=1 -I".." -c -o "/var/boost/run/results/boost/bin.v2/libs/graph/test/layout_test.test/clang-linux-17~c++20~warn/debug/x86_64/debug-symbols-off/threading-multi/visibility-hidden/layout_test.o" "../libs/graph/test/layout_test.cpp"
In file included from ../libs/graph/test/layout_test.cpp:18:
In file included from ../boost/graph/kamada_kawai_spring_layout.hpp:15:
In file included from ../boost/graph/johnson_all_pairs_shortest.hpp:29:
../boost/graph/dijkstra_shortest_paths.hpp:100:62: warning: unused parameter 'u' [-Wunused-parameter]
template < class Edge, class Graph > void tree_edge(Edge u, Graph& g) {}
^
../boost/graph/dijkstra_shortest_paths.hpp:100:72: warning: unused parameter 'g' [-Wunused-parameter]
template < class Edge, class Graph > void tree_edge(Edge u, Graph& g) {}
^
../boost/graph/dijkstra_shortest_paths.hpp:253:40: warning: unused parameter 'g' [-Wunused-parameter]
static type build(const Graph& g, const IndexMap& index,
^
../boost/graph/dijkstra_shortest_paths.hpp:254:43: warning: unused parameter 'array_holder' [-Wunused-parameter]
boost::scoped_array< Value >& array_holder)
^
../boost/graph/dijkstra_shortest_paths.hpp:302:40: warning: unused parameter 'g' [-Wunused-parameter]
static type build(const Graph& g, const IndexMap& index)
^
In file included from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/kamada_kawai_spring_layout.hpp:471:66: warning: unused parameter 'p' [-Wunused-parameter]
typename boost::graph_traits< Graph >::vertex_descriptor p,
^
../boost/graph/kamada_kawai_spring_layout.hpp:472:22: warning: unused parameter 'g' [-Wunused-parameter]
const Graph& g, bool global)
^
In file included from ../libs/graph/test/layout_test.cpp:18:
In file included from ../boost/graph/kamada_kawai_spring_layout.hpp:15:
In file included from ../boost/graph/johnson_all_pairs_shortest.hpp:30:
In file included from ../boost/graph/adjacency_list.hpp:255:
In file included from ../boost/graph/detail/adjacency_list.hpp:35:
../boost/graph/detail/adj_list_edge_iterator.hpp:50:16: warning: definition of implicit copy assignment operator for 'adj_list_edge_iterator<boost::range_detail::integer_iterator<unsigned long>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>> *, std::vector<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>, unsigned long, boost::detail::edge_desc_impl<boost::directed_tag, unsigned long>, long>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>' is deprecated because it has a user-provided copy constructor [-Wdeprecated-copy-with-user-provided-copy]
inline adj_list_edge_iterator(const self& x)
^
/usr/bin/../lib/gcc/x86_64-linux-gnu/11/../../../../include/c++/11/bits/stl_pair.h:408:8: note: in implicit copy assignment operator for 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<unsigned long>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>> *, std::vector<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>, unsigned long, boost::detail::edge_desc_impl<boost::directed_tag, unsigned long>, long>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>' first required here
first = std::forward<first_type>(__p.first);
^
../boost/graph/graph_concepts.hpp:247:11: note: in instantiation of member function 'std::pair<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<unsigned long>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>> *, std::vector<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>, unsigned long, boost::detail::edge_desc_impl<boost::directed_tag, unsigned long>, long>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>, boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<unsigned long>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>> *, std::vector<boost::detail::stored_edge_property<unsigned long, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>, unsigned long, boost::detail::edge_desc_impl<boost::directed_tag, unsigned long>, long>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>::operator=' requested here
p = edges(g);
^
../boost/concept/usage.hpp:20:43: note: in instantiation of member function 'boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>::~EdgeListGraph' requested here
~usage_requirements() { ((Model*)0)->~Model(); }
^
../boost/concept/detail/general.hpp:50:42: note: in instantiation of member function 'boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>::~usage_requirements' requested here
static void failed() { ((Model*)0)->~Model(); }
^
../boost/graph/graph_concepts.hpp:233:5: note: in instantiation of member function 'boost::concepts::requirement<boost::concepts::failed ************boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double>>>>>::************>::failed' requested here
BOOST_CONCEPT_USAGE(EdgeListGraph)
^
../boost/concept/usage.hpp:36:7: note: expanded from macro 'BOOST_CONCEPT_USAGE'
BOOST_CONCEPT_ASSERT((boost::concepts::usage_requirements<model>)); \
^
../boost/concept/assert.hpp:43:5: note: expanded from macro 'BOOST_CONCEPT_ASSERT'
BOOST_CONCEPT_ASSERT_FN(void(*)ModelInParens)
^
../boost/concept/detail/general.hpp:92:51: note: expanded from macro 'BOOST_CONCEPT_ASSERT_FN'
&::boost::concepts::requirement_<ModelFnPtr>::failed> \
^
../boost/graph/johnson_all_pairs_shortest.hpp:112:9: note: (skipping 4 contexts in backtrace; use -ftemplate-backtrace-limit=0 to see all)
if (bellman_ford_shortest_paths(
^
../boost/graph/kamada_kawai_spring_layout.hpp:635:12: note: in instantiation of function template specialization 'boost::kamada_kawai_spring_layout<boost::square_topology<>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::convex_topology<2>::point, boost::convex_topology<2>::point &, vertex_position_t>, boost::adj_list_edge_property_map<boost::undirected_tag, double, double &, void *, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, double, false, kamada_kawai_done, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, int, const int &, boost::vertex_index_t>, __gnu_cxx::__normal_iterator<std::vector<double> *, std::vector<std::vector<double>>>, __gnu_cxx::__normal_iterator<std::vector<double> *, std::vector<std::vector<double>>>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference *, std::vector<boost::convex_topology<2>::point_difference>>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, int, const int &, boost::vertex_index_t>, boost::convex_topology<2>::point_difference, boost::convex_topology<2>::point_difference &>>' requested here
return kamada_kawai_spring_layout(g, position, weight, topology,
^
../boost/graph/kamada_kawai_spring_layout.hpp:653:12: note: in instantiation of function template specialization 'boost::kamada_kawai_spring_layout<boost::square_topology<>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::convex_topology<2>::point, boost::convex_topology<2>::point &, vertex_position_t>, boost::adj_list_edge_property_map<boost::undirected_tag, double, double &, void *, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, double, false, kamada_kawai_done, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, int, const int &, boost::vertex_index_t>>' requested here
return kamada_kawai_spring_layout(g, position, weight, topology,
^
../boost/graph/kamada_kawai_spring_layout.hpp:668:12: note: in instantiation of function template specialization 'boost::kamada_kawai_spring_layout<boost::square_topology<>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::convex_topology<2>::point, boost::convex_topology<2>::point &, vertex_position_t>, boost::adj_list_edge_property_map<boost::undirected_tag, double, double &, void *, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, double, false, kamada_kawai_done>' requested here
return kamada_kawai_spring_layout(g, position, weight, topology,
^
../libs/graph/test/layout_test.cpp:223:15: note: in instantiation of function template specialization 'boost::kamada_kawai_spring_layout<boost::square_topology<>, boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>, boost::convex_topology<2>::point, boost::convex_topology<2>::point &, vertex_position_t>, boost::adj_list_edge_property_map<boost::undirected_tag, double, double &, void *, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, double, false, kamada_kawai_done>' requested here
bool ok = kamada_kawai_spring_layout(g, get(vertex_position, g),
^
../libs/graph/test/layout_test.cpp:403:5: note: in instantiation of function template specialization 'test_cube<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point>>, boost::property<boost::edge_weight_t, double>>>' requested here
test_cube((Graph*)0);
^
8 warnings generated.
"clang++-17" -o "/var/boost/run/results/boost/bin.v2/libs/graph/test/layout_test.test/clang-linux-17~c++20~warn/debug/x86_64/debug-symbols-off/threading-multi/visibility-hidden/layout_test" -Wl,--start-group "/var/boost/run/results/boost/bin.v2/libs/graph/test/layout_test.test/clang-linux-17~c++20~warn/debug/x86_64/debug-symbols-off/threading-multi/visibility-hidden/layout_test.o" -Wl,-Bstatic -Wl,-Bdynamic -lrt -Wl,--end-group -fPIC -pthread -fvisibility=hidden -fvisibility-inlines-hidden -m64 --target=x86_64-pc-linux
Regular polygon layout with 5 points.
E
D
A
C
B
(A, E) (A, B) (A, D) (B, F) (B, C) (C, D) (C, G) (D, H) (E, H) (E, F) (F, G) (G, H)
Cube layout (Kamada-Kawai).
G
F
C
H
B
E
D
A
Cube layout (Fruchterman-Reingold).
D
A
H
E C
B
G
F
(A, B) (A, C) (B, C) (B, D) (B, E) (C, E) (C, F) (D, E) (D, G) (D, H) (E, F) (E, H) (E, I) (F, I) (F, J) (G, H) (H, I) (I, J)
Triangular layout (Kamada-Kawai).
I J
H
G
F
E
D
B C
A
Triangular layout (Fruchterman-Reingold).
A
B
C
D
E
G
F
H
I
J
(A, B) (B, C) (C, A) (D, E) (E, F) (F, G) (G, H) (H, D) (D, F) (F, H) (H, E) (E, G) (G, D)
Disconnected layout (Fruchterman-Reingold).
A C
B
D
F
H
E
G
No errors detected.
EXIT STATUS: 0