Compile [2024-11-21 20:52:37 UTC]: succeed
"g++-8" -fvisibility-inlines-hidden -std=c++2a -fPIC -pthread -O0 -fno-inline -Wall -fvisibility=hidden -Wno-unused-variable -Wno-long-long -ftemplate-depth-255 -DBOOST_ALL_NO_LIB=1 -DBOOST_ARCHIVE_TEST=xml_warchive.hpp -DBOOST_COBALT_USE_STD_PMR=1 -DBOOST_LIB_DIAGNOSTIC=1 -DBOOST_SERIALIZATION_DYN_LINK=1 -DBOOST_WSERIALIZATION_DYN_LINK=1 -I".." -c -o "/mnt/fs1/teeks99-05/run/results/boost/bin.v2/libs/serialization/test/test_map_xml_warchive.test/gcc-8~c++2a/debug/arm_32/debug-symbols-off/threading-multi/visibility-hidden/test_map.o" "../libs/serialization/test/test_map.cpp"
In file included from /usr/include/c++/8/map:60,
from ../boost/serialization/map.hpp:20,
from ../libs/serialization/test/test_map.cpp:31:
/usr/include/c++/8/bits/stl_tree.h: In function ???bool std::operator==(const std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&, const std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&) [with _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:1553:20: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
&& std::equal(__x.begin(), __x.end(), __y.begin());
~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/8/algorithm:61,
from ../libs/serialization/test/test_map.cpp:12:
/usr/include/c++/8/bits/stl_algobase.h: In function ???bool std::equal(_II1, _II1, _II2) [with _II1 = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >; _II2 = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_algobase.h:1039:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
equal(_II1 __first1, _II1 __last1, _II2 __first2)
^~~~~
/usr/include/c++/8/bits/stl_algobase.h:1039:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
/usr/include/c++/8/bits/stl_algobase.h:1039:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
/usr/include/c++/8/bits/stl_algobase.h:1049:30: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
return std::__equal_aux(std::__niter_base(__first1),
~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
std::__niter_base(__last1),
~~~~~~~~~~~~~~~~~~~~~~~~~~~
std::__niter_base(__first2));
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_algobase.h: In function ???_Iterator std::__niter_base(_Iterator) [with _Iterator = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_algobase.h:277:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
__niter_base(_Iterator __it)
^~~~~~~~~~~~
/usr/include/c++/8/bits/stl_algobase.h: In function ???bool std::__equal_aux(_II1, _II1, _II2) [with _II1 = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >; _II2 = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_algobase.h:821:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
__equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)
^~~~~~~~~~~
/usr/include/c++/8/bits/stl_algobase.h:821:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
/usr/include/c++/8/bits/stl_algobase.h:821:5: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
/usr/include/c++/8/bits/stl_algobase.h:831:43: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
return std::__equal<__simple>::equal(__first1, __last1, __first2);
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_algobase.h: In static member function ???static bool std::__equal<_BoolType>::equal(_II1, _II1, _II2) [with _II1 = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >; _II2 = std::_Rb_tree_const_iterator<std::pair<const random_key, A> >; bool _BoolType = false]???:
/usr/include/c++/8/bits/stl_algobase.h:797:2: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
equal(_II1 __first1, _II1 __last1, _II2 __first2)
^~~~~
/usr/include/c++/8/bits/stl_algobase.h:797:2: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
/usr/include/c++/8/bits/stl_algobase.h:797:2: note: parameter passing for argument of type ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >??? changed in GCC 7.1
In file included from ../libs/serialization/test/test_map.cpp:31:
../boost/serialization/map.hpp: In function ???void boost::serialization::load_map_collection(Archive&, Container&) [with Archive = boost::archive::xml_wiarchive; Container = std::map<random_key, A>]???:
../boost/serialization/map.hpp:62:38: note: parameter passing for argument of type ???std::map<random_key, A>::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
typename Container::iterator result =
^~~~~~
../boost/serialization/map.hpp: In function ???void boost::serialization::load_map_collection(Archive&, Container&) [with Archive = boost::archive::xml_wiarchive; Container = std::multimap<random_key, A>]???:
../boost/serialization/map.hpp:62:38: note: parameter passing for argument of type ???std::multimap<random_key, A>::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
typename Container::iterator result =
^~~~~~
In file included from /usr/include/c++/8/map:61,
from ../boost/serialization/map.hpp:20,
from ../libs/serialization/test/test_map.cpp:31:
/usr/include/c++/8/bits/stl_map.h: In member function ???std::map<_Key, _Tp, _Compare, _Alloc>::iterator std::map<_Key, _Tp, _Compare, _Alloc>::insert(std::map<_Key, _Tp, _Compare, _Alloc>::const_iterator, std::map<_Key, _Tp, _Compare, _Alloc>::value_type&&) [with _Key = random_key; _Tp = A; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_map.h:868:7: note: parameter passing for argument of type ???std::map<random_key, A>::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
insert(const_iterator __position, value_type&& __x)
^~~~~~
/usr/include/c++/8/bits/stl_map.h:869:65: note: parameter passing for argument of type ???std::map<random_key, A>::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
{ return _M_t._M_insert_unique_(__position, std::move(__x)); }
^
In file included from /usr/include/c++/8/map:62,
from ../boost/serialization/map.hpp:20,
from ../libs/serialization/test/test_map.cpp:31:
/usr/include/c++/8/bits/stl_multimap.h: In member function ???std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::insert(std::multimap<_Key, _Tp, _Compare, _Alloc>::const_iterator, std::multimap<_Key, _Tp, _Compare, _Alloc>::value_type&&) [with _Key = random_key; _Tp = A; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_multimap.h:587:7: note: parameter passing for argument of type ???std::multimap<random_key, A>::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
insert(const_iterator __position, value_type&& __x)
^~~~~~
/usr/include/c++/8/bits/stl_multimap.h:588:64: note: parameter passing for argument of type ???std::multimap<random_key, A>::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
{ return _M_t._M_insert_equal_(__position, std::move(__x)); }
^
In file included from /usr/include/c++/8/map:60,
from ../boost/serialization/map.hpp:20,
from ../libs/serialization/test/test_map.cpp:31:
/usr/include/c++/8/bits/stl_tree.h: In member function ???std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique_(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, _Arg&&) [with _Arg = std::pair<const random_key, A>; _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:1039:2: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
_M_insert_unique_(const_iterator __pos, _Arg&& __x)
^~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_tree.h:1042:65: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
return _M_insert_unique_(__pos, std::forward<_Arg>(__x), __an);
^
/usr/include/c++/8/bits/stl_tree.h: In member function ???std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_equal_(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, _Arg&&) [with _Arg = std::pair<const random_key, A>; _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:1051:2: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
_M_insert_equal_(const_iterator __pos, _Arg&& __x)
^~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_tree.h:1054:64: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
return _M_insert_equal_(__pos, std::forward<_Arg>(__x), __an);
^
/usr/include/c++/8/bits/stl_tree.h: In member function ???std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique_(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, _Arg&&, _NodeGen&) [with _Arg = std::pair<const random_key, A>; _NodeGen = std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::_Alloc_node; _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:2207:7: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_tree.h: In member function ???std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_equal_(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, _Arg&&, _NodeGen&) [with _Arg = std::pair<const random_key, A>; _NodeGen = std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::_Alloc_node; _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:2289:7: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_tree.h: In member function ???std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, const key_type&) [with _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:2146:5: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/stl_tree.h: In member function ???std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_equal_pos(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, const key_type&) [with _Key = random_key; _Val = std::pair<const random_key, A>; _KeyOfValue = std::_Select1st<std::pair<const random_key, A> >; _Compare = std::less<random_key>; _Alloc = std::allocator<std::pair<const random_key, A> >]???:
/usr/include/c++/8/bits/stl_tree.h:2232:5: note: parameter passing for argument of type ???std::_Rb_tree<random_key, std::pair<const random_key, A>, std::_Select1st<std::pair<const random_key, A> >, std::less<random_key>, std::allocator<std::pair<const random_key, A> > >::const_iterator??? {aka ???std::_Rb_tree_const_iterator<std::pair<const random_key, A> >???} changed in GCC 7.1
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~