Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- In file included from /usr/include/c++/8/unordered_map:43,
- from test.cpp:1:
- /usr/include/c++/8/bits/stl_pair.h: In instantiation of ‘struct std::pair<const int, Node>’:
- /usr/include/c++/8/ext/aligned_buffer.h:91:28: required from ‘struct __gnu_cxx::__aligned_buffer<std::pair<const int, Node> >’
- /usr/include/c++/8/bits/hashtable_policy.h:234:43: required from ‘struct std::__detail::_Hash_node_value_base<std::pair<const int, Node> >’
- /usr/include/c++/8/bits/hashtable_policy.h:280:12: required from ‘struct std::__detail::_Hash_node<std::pair<const int, Node>, false>’
- /usr/include/c++/8/bits/hashtable_policy.h:2027:49: required from ‘struct std::__detail::_Hashtable_alloc<std::allocator<std::__detail::_Hash_node<std::pair<const int, Node>, false> > >’
- /usr/include/c++/8/bits/hashtable.h:173:11: required from ‘class std::_Hashtable<int, std::pair<const int, Node>, std::allocator<std::pair<const int, Node> >, std::__detail::_Select1st, std::equal_to<int>, std::hash<int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >’
- /usr/include/c++/8/bits/unordered_map.h:105:18: required from ‘class std::unordered_map<int, Node>’
- test.cpp:5:32: required from here
- /usr/include/c++/8/bits/stl_pair.h:215:11: error: ‘std::pair<_T1, _T2>::second’ has incomplete type
- _T2 second; /// @c second is a copy of the second object
- ^~~~~~
- test.cpp:3:8: note: forward declaration of ‘struct Node’
- struct Node {
- std::unordered_map<int, Node*>::iterator up;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement