API tools faq
paste
Advertisement
Sokolmish

No move assignment error

Sokolmish
Apr 17th, 2022
212
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 14.97 KB | None | 0 0
raw download clone embed print report
  1. In file included from /usr/include/c++/11/ext/alloc_traits.h:34,
  2. from /usr/include/c++/11/bits/stl_uninitialized.h:64,
  3. from /usr/include/c++/11/vector:66,
  4. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.hpp:4,
  5. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.cpp:1:
  6. /usr/include/c++/11/bits/alloc_traits.h: In instantiation of ‘static constexpr void std::allocator_traits<std::allocator<_Up> >::construct(std::allocator_traits<std::allocator<_Up> >::allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<const int, IR_Block>; _Args = {const std::pair<const int, IR_Block>&}; _Tp = std::_Rb_tree_node<std::pair<const int, IR_Block> >; std::allocator_traits<std::allocator<_Up> >::allocator_type = std::allocator<std::_Rb_tree_node<std::pair<const int, IR_Block> > >]’:
  7. /usr/include/c++/11/bits/stl_tree.h:595:32: required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_construct_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, _Args&& ...) [with _Args = {const std::pair<const int, IR_Block>&}; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  8. /usr/include/c++/11/bits/stl_tree.h:472:25: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Reuse_or_alloc_node::operator()(_Arg&&) [with _Arg = const std::pair<const int, IR_Block>&; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  9. /usr/include/c++/11/bits/stl_tree.h:645:18: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_clone_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, _NodeGen&) [with bool _MoveValue = false; _NodeGen = std::_Rb_tree<int, std::pair<const int, IR_Block>, std::_Select1st<std::pair<const int, IR_Block> >, std::less<int>, std::allocator<std::pair<const int, IR_Block> > >::_Reuse_or_alloc_node; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  10. /usr/include/c++/11/bits/stl_tree.h:1847:47: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_copy(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Base_ptr, _NodeGen&) [with bool _MoveValues = false; _NodeGen = std::_Rb_tree<int, std::pair<const int, IR_Block>, std::_Select1st<std::pair<const int, IR_Block> >, std::less<int>, std::allocator<std::pair<const int, IR_Block> > >::_Reuse_or_alloc_node; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Base_ptr = std::_Rb_tree_node_base*]’
  11. /usr/include/c++/11/bits/stl_tree.h:890:26: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_copy(const std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&, _NodeGen&) [with bool _MoveValues = false; _NodeGen = std::_Rb_tree<int, std::pair<const int, IR_Block>, std::_Select1st<std::pair<const int, IR_Block> >, std::less<int>, std::allocator<std::pair<const int, IR_Block> > >::_Reuse_or_alloc_node; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  12. /usr/include/c++/11/bits/stl_tree.h:1755:38: required from ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::operator=(const std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&) [with _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >]’
  13. /usr/include/c++/11/bits/stl_map.h:319:7: required from here
  14. /usr/include/c++/11/bits/alloc_traits.h:514:28: error: no matching function for call to ‘construct_at(std::pair<const int, IR_Block>*&, const std::pair<const int, IR_Block>&)’
  15. 514 | std::construct_at(__p, std::forward<_Args>(__args)...);
  16. | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  17. In file included from /usr/include/c++/11/bits/stl_tempbuf.h:60,
  18. from /usr/include/c++/11/bits/stl_algo.h:62,
  19. from /usr/include/c++/11/vector:62,
  20. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.hpp:4,
  21. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.cpp:1:
  22. /usr/include/c++/11/bits/stl_construct.h:94:5: note: candidate: ‘template<class _Tp, class ... _Args> constexpr decltype (::new(void*(0)) _Tp) std::construct_at(_Tp*, _Args&& ...)’
  23. 94 | construct_at(_Tp* __location, _Args&&... __args)
  24. | ^~~~~~~~~~~~
  25. /usr/include/c++/11/bits/stl_construct.h:94:5: note: template argument deduction/substitution failed:
  26. /usr/include/c++/11/bits/stl_construct.h: In substitution of ‘template<class _Tp, class ... _Args> constexpr decltype (::new(void*(0)) _Tp) std::construct_at(_Tp*, _Args&& ...) [with _Tp = std::pair<const int, IR_Block>; _Args = {const std::pair<const int, IR_Block>&}]’:
  27. /usr/include/c++/11/bits/alloc_traits.h:514:21: required from ‘static constexpr void std::allocator_traits<std::allocator<_Up> >::construct(std::allocator_traits<std::allocator<_Up> >::allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<const int, IR_Block>; _Args = {const std::pair<const int, IR_Block>&}; _Tp = std::_Rb_tree_node<std::pair<const int, IR_Block> >; std::allocator_traits<std::allocator<_Up> >::allocator_type = std::allocator<std::_Rb_tree_node<std::pair<const int, IR_Block> > >]’
  28. /usr/include/c++/11/bits/stl_tree.h:595:32: required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_construct_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, _Args&& ...) [with _Args = {const std::pair<const int, IR_Block>&}; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  29. /usr/include/c++/11/bits/stl_tree.h:472:25: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Reuse_or_alloc_node::operator()(_Arg&&) [with _Arg = const std::pair<const int, IR_Block>&; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  30. /usr/include/c++/11/bits/stl_tree.h:645:18: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_clone_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, _NodeGen&) [with bool _MoveValue = false; _NodeGen = std::_Rb_tree<int, std::pair<const int, IR_Block>, std::_Select1st<std::pair<const int, IR_Block> >, std::less<int>, std::allocator<std::pair<const int, IR_Block> > >::_Reuse_or_alloc_node; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  31. /usr/include/c++/11/bits/stl_tree.h:1847:47: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_copy(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Base_ptr, _NodeGen&) [with bool _MoveValues = false; _NodeGen = std::_Rb_tree<int, std::pair<const int, IR_Block>, std::_Select1st<std::pair<const int, IR_Block> >, std::less<int>, std::allocator<std::pair<const int, IR_Block> > >::_Reuse_or_alloc_node; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Base_ptr = std::_Rb_tree_node_base*]’
  32. /usr/include/c++/11/bits/stl_tree.h:890:26: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_copy(const std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&, _NodeGen&) [with bool _MoveValues = false; _NodeGen = std::_Rb_tree<int, std::pair<const int, IR_Block>, std::_Select1st<std::pair<const int, IR_Block> >, std::less<int>, std::allocator<std::pair<const int, IR_Block> > >::_Reuse_or_alloc_node; _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const int, IR_Block> >*]’
  33. /usr/include/c++/11/bits/stl_tree.h:1755:38: required from ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::operator=(const std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&) [with _Key = int; _Val = std::pair<const int, IR_Block>; _KeyOfValue = std::_Select1st<std::pair<const int, IR_Block> >; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, IR_Block> >]’
  34. /usr/include/c++/11/bits/stl_map.h:319:7: required from here
  35. /usr/include/c++/11/bits/stl_construct.h:96:17: error: use of deleted function ‘constexpr std::pair<_T1, _T2>::pair(const std::pair<_T1, _T2>&) [with _T1 = const int; _T2 = IR_Block]’
  36. 96 | -> decltype(::new((void*)0) _Tp(std::declval<_Args>()...))
  37. | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  38. In file included from /usr/include/c++/11/bits/stl_algobase.h:64,
  39. from /usr/include/c++/11/vector:60,
  40. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.hpp:4,
  41. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.cpp:1:
  42. /usr/include/c++/11/bits/stl_pair.h:314:17: note: ‘constexpr std::pair<_T1, _T2>::pair(const std::pair<_T1, _T2>&) [with _T1 = const int; _T2 = IR_Block]’ is implicitly deleted because the default definition would be ill-formed:
  43. 314 | constexpr pair(const pair&) = default; ///< Copy constructor
  44. | ^~~~
  45. /usr/include/c++/11/bits/stl_pair.h:314:17: error: use of deleted function ‘IR_Block::IR_Block(const IR_Block&)’
  46. In file included from /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/unit.hpp:9,
  47. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/ir_transformer.hpp:4,
  48. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.hpp:5,
  49. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.cpp:1:
  50. /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/nodes.hpp:174:7: note: ‘IR_Block::IR_Block(const IR_Block&)’ is implicitly deleted because the default definition would be ill-formed:
  51. 174 | class IR_Block {
  52. | ^~~~~~~~
  53. /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/nodes.hpp:174:7: error: use of deleted function ‘std::optional<IR_Node>::optional(const std::optional<IR_Node>&)’
  54. In file included from /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/nodes.hpp:7,
  55. from /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/unit.hpp:9,
  56. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/ir_transformer.hpp:4,
  57. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.hpp:5,
  58. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.cpp:1:
  59. /usr/include/c++/11/optional:663:11: note: ‘std::optional<IR_Node>::optional(const std::optional<IR_Node>&)’ is implicitly deleted because the default definition would be ill-formed:
  60. 663 | class optional
  61. | ^~~~~~~~
  62. /usr/include/c++/11/optional:663:11: error: use of deleted function ‘constexpr std::_Enable_copy_move<false, false, true, true, _Tag>::_Enable_copy_move(const std::_Enable_copy_move<false, false, true, true, _Tag>&) [with _Tag = std::optional<IR_Node>]’
  63. In file included from /usr/include/c++/11/optional:43,
  64. from /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/nodes.hpp:7,
  65. from /mnt/HDD/Projects/Studing/diploma/cw39/src/ir/unit.hpp:9,
  66. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/ir_transformer.hpp:4,
  67. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.hpp:5,
  68. from /mnt/HDD/Projects/Studing/diploma/cw39/src/transformations/tailrec_eliminator.cpp:1:
  69. /usr/include/c++/11/bits/enable_special_members.h:159:15: note: declared here
  70. 159 | constexpr _Enable_copy_move(_Enable_copy_move const&) noexcept = delete;
  71. | ^~~~~~~~~~~~~~~~~
  72. make[3]: *** [CMakeFiles/cw39.dir/build.make:440: CMakeFiles/cw39.dir/src/transformations/tailrec_eliminator.cpp.o] Error 1
  73. make[2]: *** [CMakeFiles/Makefile2:87: CMakeFiles/cw39.dir/all] Error 2
  74. make[1]: *** [CMakeFiles/Makefile2:94: CMakeFiles/cw39.dir/rule] Error 2
  75. make: *** [Makefile:124: cw39] Error 2
  76.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!