| 1 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:15:0,
|
|---|
| 2 | from cpputils.hpp:9,
|
|---|
| 3 | from BaseGraphTypes.hpp:7,
|
|---|
| 4 | from GraphComponent.hpp:9,
|
|---|
| 5 | from Graph.hpp:13,
|
|---|
| 6 | from graphutils.h:4,
|
|---|
| 7 | from graphutils.cpp:1:
|
|---|
| 8 | /usr/include/boost/range/concepts.hpp: In instantiation of ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >]’:
|
|---|
| 9 | /usr/include/boost/concept/detail/general.hpp:38:28: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >]’
|
|---|
| 10 | /usr/include/boost/range/algorithm/for_each.hpp:91:53: required from ‘UnaryFunction boost::range::for_each(const SinglePassRange&, UnaryFunction) [with SinglePassRange = boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >; UnaryFunction = xHeinz::generateRandomGraph(int, int)::__lambda0::__lambda1]’
|
|---|
| 11 | graphutils.cpp:20:7: required from here
|
|---|
| 12 | /usr/include/boost/range/concepts.hpp:270:46: error: call of overloaded ‘ignore_unused_variable_warning(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::iterator&)’ is ambiguous
|
|---|
| 13 | ignore_unused_variable_warning(i1);
|
|---|
| 14 | ^
|
|---|
| 15 | /usr/include/boost/range/concepts.hpp:270:46: note: candidates are:
|
|---|
| 16 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 17 | from cpputils.hpp:9,
|
|---|
| 18 | from BaseGraphTypes.hpp:7,
|
|---|
| 19 | from GraphComponent.hpp:9,
|
|---|
| 20 | from Graph.hpp:13,
|
|---|
| 21 | from graphutils.h:4,
|
|---|
| 22 | from graphutils.cpp:1:
|
|---|
| 23 | /usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
|
|---|
| 24 | template <class T> inline void ignore_unused_variable_warning(T const&) {}
|
|---|
| 25 | ^
|
|---|
| 26 | In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
|
|---|
| 27 | from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
|
|---|
| 28 | from Graph.hpp:9,
|
|---|
| 29 | from graphutils.h:4,
|
|---|
| 30 | from graphutils.cpp:1:
|
|---|
| 31 | ../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
|
|---|
| 32 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:15:0,
|
|---|
| 33 | from cpputils.hpp:9,
|
|---|
| 34 | from BaseGraphTypes.hpp:7,
|
|---|
| 35 | from GraphComponent.hpp:9,
|
|---|
| 36 | from Graph.hpp:13,
|
|---|
| 37 | from graphutils.h:4,
|
|---|
| 38 | from graphutils.cpp:1:
|
|---|
| 39 | /usr/include/boost/range/concepts.hpp:271:46: error: call of overloaded ‘ignore_unused_variable_warning(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::iterator&)’ is ambiguous
|
|---|
| 40 | ignore_unused_variable_warning(i2);
|
|---|
| 41 | ^
|
|---|
| 42 | /usr/include/boost/range/concepts.hpp:271:46: note: candidates are:
|
|---|
| 43 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 44 | from cpputils.hpp:9,
|
|---|
| 45 | from BaseGraphTypes.hpp:7,
|
|---|
| 46 | from GraphComponent.hpp:9,
|
|---|
| 47 | from Graph.hpp:13,
|
|---|
| 48 | from graphutils.h:4,
|
|---|
| 49 | from graphutils.cpp:1:
|
|---|
| 50 | /usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
|
|---|
| 51 | template <class T> inline void ignore_unused_variable_warning(T const&) {}
|
|---|
| 52 | ^
|
|---|
| 53 | In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
|
|---|
| 54 | from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
|
|---|
| 55 | from Graph.hpp:9,
|
|---|
| 56 | from graphutils.h:4,
|
|---|
| 57 | from graphutils.cpp:1:
|
|---|
| 58 | ../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
|
|---|
| 59 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 60 | from cpputils.hpp:9,
|
|---|
| 61 | from BaseGraphTypes.hpp:7,
|
|---|
| 62 | from GraphComponent.hpp:9,
|
|---|
| 63 | from Graph.hpp:13,
|
|---|
| 64 | from graphutils.h:4,
|
|---|
| 65 | from graphutils.cpp:1:
|
|---|
| 66 | /usr/include/boost/concept_check.hpp: In instantiation of ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]’:
|
|---|
| 67 | /usr/include/boost/concept/usage.hpp:22:29: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >]’
|
|---|
| 68 | /usr/include/boost/concept/detail/general.hpp:38:28: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >]’
|
|---|
| 69 | /usr/include/boost/concept_check.hpp:162:53: required from ‘struct boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
|
|---|
| 70 | /usr/include/boost/range/concepts.hpp:113:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
|
|---|
| 71 | /usr/include/boost/range/concepts.hpp:135:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
|
|---|
| 72 | /usr/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
|
|---|
| 73 | /usr/include/boost/concept/detail/has_constraints.hpp:42:73: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >::value’
|
|---|
| 74 | /usr/include/boost/concept/detail/has_constraints.hpp:45:31: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >’
|
|---|
| 75 | /usr/include/boost/mpl/if.hpp:67:11: required from ‘struct boost::mpl::if_<boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::constraint<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::requirement<boost::concepts::failed************ boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::************> >’
|
|---|
| 76 | /usr/include/boost/concept/detail/general.hpp:50:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >)>’
|
|---|
| 77 | /usr/include/boost/range/algorithm/for_each.hpp:91:53: required from ‘UnaryFunction boost::range::for_each(const SinglePassRange&, UnaryFunction) [with SinglePassRange = boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >; UnaryFunction = xHeinz::generateRandomGraph(int, int)::__lambda0::__lambda1]’
|
|---|
| 78 | graphutils.cpp:20:7: required from here
|
|---|
| 79 | /usr/include/boost/concept_check.hpp:166:41: error: call of overloaded ‘ignore_unused_variable_warning(xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*&)’ is ambiguous
|
|---|
| 80 | ignore_unused_variable_warning(ptr);
|
|---|
| 81 | ^
|
|---|
| 82 | /usr/include/boost/concept_check.hpp:166:41: note: candidates are:
|
|---|
| 83 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 84 | from cpputils.hpp:9,
|
|---|
| 85 | from BaseGraphTypes.hpp:7,
|
|---|
| 86 | from GraphComponent.hpp:9,
|
|---|
| 87 | from Graph.hpp:13,
|
|---|
| 88 | from graphutils.h:4,
|
|---|
| 89 | from graphutils.cpp:1:
|
|---|
| 90 | /usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
|
|---|
| 91 | template <class T> inline void ignore_unused_variable_warning(T const&) {}
|
|---|
| 92 | ^
|
|---|
| 93 | In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
|
|---|
| 94 | from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
|
|---|
| 95 | from Graph.hpp:9,
|
|---|
| 96 | from graphutils.h:4,
|
|---|
| 97 | from graphutils.cpp:1:
|
|---|
| 98 | ../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
|
|---|
| 99 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 100 | from cpputils.hpp:9,
|
|---|
| 101 | from BaseGraphTypes.hpp:7,
|
|---|
| 102 | from GraphComponent.hpp:9,
|
|---|
| 103 | from Graph.hpp:13,
|
|---|
| 104 | from graphutils.h:4,
|
|---|
| 105 | from graphutils.cpp:1:
|
|---|
| 106 | /usr/include/boost/concept_check.hpp: In instantiation of ‘void boost::CopyConstructible<TT>::const_constraints(const TT&) [with TT = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]’:
|
|---|
| 107 | /usr/include/boost/concept_check.hpp:165:26: required from ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]’
|
|---|
| 108 | /usr/include/boost/concept/usage.hpp:22:29: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >]’
|
|---|
| 109 | /usr/include/boost/concept/detail/general.hpp:38:28: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >]’
|
|---|
| 110 | /usr/include/boost/concept_check.hpp:162:53: required from ‘struct boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
|
|---|
| 111 | /usr/include/boost/range/concepts.hpp:113:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
|
|---|
| 112 | /usr/include/boost/range/concepts.hpp:135:16: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
|
|---|
| 113 | /usr/include/boost/concept/detail/has_constraints.hpp:42:73: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >::value’
|
|---|
| 114 | /usr/include/boost/concept/detail/has_constraints.hpp:45:31: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >’
|
|---|
| 115 | /usr/include/boost/mpl/if.hpp:67:11: required from ‘struct boost::mpl::if_<boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::constraint<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::requirement<boost::concepts::failed************ boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::************> >’
|
|---|
| 116 | /usr/include/boost/concept/detail/general.hpp:50:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >)>’
|
|---|
| 117 | /usr/include/boost/range/algorithm/for_each.hpp:91:53: required from ‘UnaryFunction boost::range::for_each(const SinglePassRange&, UnaryFunction) [with SinglePassRange = boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >; UnaryFunction = xHeinz::generateRandomGraph(int, int)::__lambda0::__lambda1]’
|
|---|
| 118 | graphutils.cpp:20:7: required from here
|
|---|
| 119 | /usr/include/boost/concept_check.hpp:172:39: error: call of overloaded ‘ignore_unused_variable_warning(xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>&)’ is ambiguous
|
|---|
| 120 | ignore_unused_variable_warning(c);
|
|---|
| 121 | ^
|
|---|
| 122 | /usr/include/boost/concept_check.hpp:172:39: note: candidates are:
|
|---|
| 123 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 124 | from cpputils.hpp:9,
|
|---|
| 125 | from BaseGraphTypes.hpp:7,
|
|---|
| 126 | from GraphComponent.hpp:9,
|
|---|
| 127 | from Graph.hpp:13,
|
|---|
| 128 | from graphutils.h:4,
|
|---|
| 129 | from graphutils.cpp:1:
|
|---|
| 130 | /usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
|
|---|
| 131 | template <class T> inline void ignore_unused_variable_warning(T const&) {}
|
|---|
| 132 | ^
|
|---|
| 133 | In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
|
|---|
| 134 | from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
|
|---|
| 135 | from Graph.hpp:9,
|
|---|
| 136 | from graphutils.h:4,
|
|---|
| 137 | from graphutils.cpp:1:
|
|---|
| 138 | ../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
|
|---|
| 139 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 140 | from cpputils.hpp:9,
|
|---|
| 141 | from BaseGraphTypes.hpp:7,
|
|---|
| 142 | from GraphComponent.hpp:9,
|
|---|
| 143 | from Graph.hpp:13,
|
|---|
| 144 | from graphutils.h:4,
|
|---|
| 145 | from graphutils.cpp:1:
|
|---|
| 146 | /usr/include/boost/concept_check.hpp:173:41: error: call of overloaded ‘ignore_unused_variable_warning(const xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*&)’ is ambiguous
|
|---|
| 147 | ignore_unused_variable_warning(ptr);
|
|---|
| 148 | ^
|
|---|
| 149 | /usr/include/boost/concept_check.hpp:173:41: note: candidates are:
|
|---|
| 150 | In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
|
|---|
| 151 | from cpputils.hpp:9,
|
|---|
| 152 | from BaseGraphTypes.hpp:7,
|
|---|
| 153 | from GraphComponent.hpp:9,
|
|---|
| 154 | from Graph.hpp:13,
|
|---|
| 155 | from graphutils.h:4,
|
|---|
| 156 | from graphutils.cpp:1:
|
|---|
| 157 | /usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = const xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
|
|---|
| 158 | template <class T> inline void ignore_unused_variable_warning(T const&) {}
|
|---|
| 159 | ^
|
|---|
| 160 | In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
|
|---|
| 161 | from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
|
|---|
| 162 | from Graph.hpp:9,
|
|---|
| 163 | from graphutils.h:4,
|
|---|
| 164 | from graphutils.cpp:1:
|
|---|
| 165 | ../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = const xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
|
|---|
