stdout:
/bin/sh ./doit.sh
Makefile:4: recipe for target 'build' failed


stderr:
cp: '/temp/compiling/poly.h' and 'poly.h' are the same file
In file included from /usr/include/c++/8/map:60,
                 from poly.h:4,
                 from test_31415926.cpp:1:
/usr/include/c++/8/bits/stl_tree.h: In instantiation of ‘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 = int&; _NodeGen = std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::_Alloc_node; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const int, int> >]’:
/usr/include/c++/8/bits/stl_tree.h:2468:4:   required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_II, _II) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
/usr/include/c++/8/bits/stl_map.h:273:4:   required from ‘std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
poly.h:40:49:   required from ‘Polynomial<T>::Polynomial(It, It) [with It = std::_List_iterator<int>; T = int]’
test_31415926.cpp:208:63:   required from here
/usr/include/c++/8/bits/stl_tree.h:2217:59: error: no match for call to ‘(std::_Select1st<std::pair<const int, int> >) (int&)’
  = _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v));
                                              ~~~~~~~~~~~~~^~~~~
In file included from /usr/include/c++/8/functional:49,
                 from poly.h:2,
                 from test_31415926.cpp:1:
/usr/include/c++/8/bits/stl_function.h:1127:7: note: candidate: ‘typename _Pair::first_type& std::_Select1st<_Pair>::operator()(_Pair&) const [with _Pair = std::pair<const int, int>; typename _Pair::first_type = const int]’
       operator()(_Pair& __x) const
       ^~~~~~~~
/usr/include/c++/8/bits/stl_function.h:1127:7: note:   no known conversion for argument 1 from ‘int’ to ‘std::pair<const int, int>&’
/usr/include/c++/8/bits/stl_function.h:1131:7: note: candidate: ‘const typename _Pair::first_type& std::_Select1st<_Pair>::operator()(const _Pair&) const [with _Pair = std::pair<const int, int>; typename _Pair::first_type = const int]’
       operator()(const _Pair& __x) const
       ^~~~~~~~
/usr/include/c++/8/bits/stl_function.h:1131:7: note:   no known conversion for argument 1 from ‘int’ to ‘const std::pair<const int, int>&’
/usr/include/c++/8/bits/stl_function.h:1137:9: note: candidate: ‘template<class _Pair2> typename _Pair2::first_type& std::_Select1st<_Pair>::operator()(_Pair2&) const [with _Pair2 = _Pair2; _Pair = std::pair<const int, int>]’
         operator()(_Pair2& __x) const
         ^~~~~~~~
/usr/include/c++/8/bits/stl_function.h:1137:9: note:   template argument deduction/substitution failed:
/usr/include/c++/8/bits/stl_function.h: In substitution of ‘template<class _Pair2> typename _Pair2::first_type& std::_Select1st<std::pair<const int, int> >::operator()<_Pair2>(_Pair2&) const [with _Pair2 = int]’:
/usr/include/c++/8/bits/stl_tree.h:2217:59:   required from ‘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 = int&; _NodeGen = std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::_Alloc_node; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const int, int> >]’
/usr/include/c++/8/bits/stl_tree.h:2468:4:   required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_II, _II) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
/usr/include/c++/8/bits/stl_map.h:273:4:   required from ‘std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
poly.h:40:49:   required from ‘Polynomial<T>::Polynomial(It, It) [with It = std::_List_iterator<int>; T = int]’
test_31415926.cpp:208:63:   required from here
/usr/include/c++/8/bits/stl_function.h:1137:9: error: ‘int’ is not a class, struct, or union type
/usr/include/c++/8/bits/stl_tree.h: In instantiation of ‘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 = int&; _NodeGen = std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::_Alloc_node; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const int, int> >]’:
/usr/include/c++/8/bits/stl_tree.h:2468:4:   required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_II, _II) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
/usr/include/c++/8/bits/stl_map.h:273:4:   required from ‘std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
poly.h:40:49:   required from ‘Polynomial<T>::Polynomial(It, It) [with It = std::_List_iterator<int>; T = int]’
test_31415926.cpp:208:63:   required from here
/usr/include/c++/8/bits/stl_function.h:1142:9: note: candidate: ‘template<class _Pair2> const typename _Pair2::first_type& std::_Select1st<_Pair>::operator()(const _Pair2&) const [with _Pair2 = _Pair2; _Pair = std::pair<const int, int>]’
         operator()(const _Pair2& __x) const
         ^~~~~~~~
/usr/include/c++/8/bits/stl_function.h:1142:9: note:   template argument deduction/substitution failed:
/usr/include/c++/8/bits/stl_function.h: In substitution of ‘template<class _Pair2> const typename _Pair2::first_type& std::_Select1st<std::pair<const int, int> >::operator()<_Pair2>(const _Pair2&) const [with _Pair2 = int]’:
/usr/include/c++/8/bits/stl_tree.h:2217:59:   required from ‘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 = int&; _NodeGen = std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::_Alloc_node; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const int, int> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const int, int> >]’
/usr/include/c++/8/bits/stl_tree.h:2468:4:   required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_II, _II) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Val = std::pair<const int, int>; _KeyOfValue = std::_Select1st<std::pair<const int, int> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
/usr/include/c++/8/bits/stl_map.h:273:4:   required from ‘std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator) [with _InputIterator = std::_List_iterator<int>; _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]’
poly.h:40:49:   required from ‘Polynomial<T>::Polynomial(It, It) [with It = std::_List_iterator<int>; T = int]’
test_31415926.cpp:208:63:   required from here
/usr/include/c++/8/bits/stl_function.h:1142:9: error: ‘int’ is not a class, struct, or union type
make: *** [build] Error 1