0_0_22928190_12745.cpp: In instantiation of 'iter_range<graph<EAttr>::target_iter> graph<EAttr>::operator[](int) [with EAttr = empty_type]':
0_0_22928190_12745.cpp:194:21: required from here
0_0_22928190_12745.cpp:171:85: error: no matching function for call to 'graph<>::target_iter::target_iter(std::deque<graph<>::E, std::allocator<graph<>::E> >::iterator)'
return make_range(target_iter(edges[u].begin()), target_iter(edges[u].end()));
^
0_0_22928190_12745.cpp:171:85: note: candidates are:
0_0_22928190_12745.cpp:160:12: note: graph<>::target_iter::target_iter()
struct target_iter : list_iter_type { // for (int v : g[u])
^
0_0_22928190_12745.cpp:160:12: note: candidate expects 0 arguments, 1 provided
0_0_22928190_12745.cpp:161:31: note: graph<>::target_iter::target_iter(graph<>::E*, std::_Deque_iterator<graph<>::E, graph<>::E&, graph<>::E*>::_Map_pointer)
using list_iter_type::list_iter_type;
^
0_0_22928190_12745.cpp:161:31: note: candidate expects 2 arguments, 1 provided
0_0_22928190_12745.cpp:160:12: note: graph<>::target_iter::target_iter(const graph<>::target_iter&)
struct target_iter : list_iter_type { // for (int v : g[u])
^
0_0_22928190_12745.cpp:160:12: note: no known conversion for argument 1 from 'std::deque<graph<>::E, std::allocator<graph<>::E> >::iterator {aka std::_Deque_iterator<graph<>::E, graph<>::E&, graph<>::E*>}' to 'const graph<>::target_iter&'
0_0_22928190_12745.cpp:160:12: note: graph<>::target_iter::target_iter(graph<>::target_iter&&)
0_0_22928190_12745.cpp:160:12: note: no known conversion for argument 1 from 'std::deque<graph<>::E, std::allocator<graph<>::E> >::iterator {aka std::_Deque_iterator<graph<>::E, graph<>::E&, graph<>::E*>}' to 'graph<>::target_iter&&'
0_0_22928190_12745.cpp:171:85: error: no matching function for call to 'graph<>::target_iter::target_iter(std::deque<graph<>::E, std::allocator<graph<>::E> >::iterator)'
return make_range(target_iter(edges[u].begin()), target_iter(edges[u].end()));
^
0_0_22928190_12745.cpp:171:85: note: candidates are:
0_0_22928190_12745.cpp:160:12: note: graph<>::target_iter::target_iter()
struct target_iter : list_iter_type { // for (int v : g[u])
^
0_0_22928190_12745.cpp:160:12: note: candidate expects 0 arguments, 1 provided
0_0_22928190_12745.cpp:161:31: note: graph<>::target_iter::target_iter(graph<>::E*, std::_Deque_iterator<graph<>::E, graph<>::E&, graph<>::E*>::_Map_pointer)
using list_iter_type::list_iter_type;
^
0_0_22928190_12745.cpp:161:31: note: candidate expects 2 arguments, 1 provided
0_0_22928190_12745.cpp:160:12: note: graph<>::target_iter::target_iter(const graph<>::target_iter&)
struct target_iter : list_iter_type { // for (int v : g[u])
^
0_0_22928190_12745.cpp:160:12: note: no known conversion for argument 1 from 'std::deque<graph<>::E, std::allocator<graph<>::E> >::iterator {aka std::_Deque_iterator<graph<>::E, graph<>::E&, graph<>::E*>}' to 'const graph<>::target_iter&'
0_0_22928190_12745.cpp:160:12: note: graph<>::target_iter::target_iter(graph<>::target_iter&&)
0_0_22928190_12745.cpp:160:12: note: no known conversion for argument 1 from 'std::deque<graph<>::E, std::allocator<graph<>::E> >::iterator {aka std::_Deque_iterator<graph<>::E, graph<>::E&, graph<>::E*>}' to 'graph<>::target_iter&&'
|
