Advertisement
Guest User

Untitled

a guest
Feb 22nd, 2018
124
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 19.06 KB | None | 0 0
  1. ~/Thesis-lib-code/mod/build ~/Thesis-lib-code/mod ~/Thesis-lib-code/mod/src ~
  2. Making all in src
  3. make[1]: Entering directory '/home/user/Thesis-lib-code/mod/build/src'
  4. /bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I../src -I../../src -DBOOST_SPIRIT_USE_PHOENIX_V3 -DBOOST_RESULT_OF_USE_DECLTYPE -DBOOST_SYSTEM_NO_DEPRECATED -I/home/user/Thesis-lib-build/include -I/home/user/Thesis-lib-code/cplex/concert/include -I/home/user/Thesis-lib-code/cplex/cplex/include -I/usr/include/openbabel-2.0 -I/usr/include/python3.6m -std=c++14 -Wno-unused-local-typedefs -Wno-unused-parameter -Wno-comment -Wno-maybe-uninitialized -Wno-deprecated-declarations -g -O2 -g -O2 -MT mod/lib/DG/libmod_la-VertexMap.lo -MD -MP -MF mod/lib/DG/.deps/libmod_la-VertexMap.Tpo -c -o mod/lib/DG/libmod_la-VertexMap.lo `test -f 'mod/lib/DG/VertexMap.cpp' || echo '../../src/'`mod/lib/DG/VertexMap.cpp
  5. libtool: compile: g++ -DHAVE_CONFIG_H -I../src -I../../src -DBOOST_SPIRIT_USE_PHOENIX_V3 -DBOOST_RESULT_OF_USE_DECLTYPE -DBOOST_SYSTEM_NO_DEPRECATED -I/home/user/Thesis-lib-build/include -I/home/user/Thesis-lib-code/cplex/concert/include -I/home/user/Thesis-lib-code/cplex/cplex/include -I/usr/include/openbabel-2.0 -I/usr/include/python3.6m -std=c++14 -Wno-unused-local-typedefs -Wno-unused-parameter -Wno-comment -Wno-maybe-uninitialized -Wno-deprecated-declarations -g -O2 -g -O2 -MT mod/lib/DG/libmod_la-VertexMap.lo -MD -MP -MF mod/lib/DG/.deps/libmod_la-VertexMap.Tpo -c ../../src/mod/lib/DG/VertexMap.cpp -fPIC -DPIC -o mod/lib/DG/.libs/libmod_la-VertexMap.o
  6. In file included from /usr/include/boost/graph/adjacency_list.hpp:25:0,
  7. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  8. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  9. from ../../src/mod/lib/DG/VertexMap.h:4,
  10. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  11. /usr/include/boost/graph/graph_traits.hpp: In instantiation of ‘struct boost::graph_traits<mod::lib::Rules::LabelledLeftGraph>’:
  12. ../../src/jla_boost/graph/FilteredWrapper.hpp:17:67: required from ‘struct jla_boost::FilteredWrapper<mod::lib::Rules::LabelledLeftGraph>’
  13. ../../src/mod/lib/DG/VertexMap.cpp:244:55: required from here
  14. /usr/include/boost/graph/graph_traits.hpp:57:52: error: no type named ‘vertex_descriptor’ in ‘struct mod::lib::Rules::LabelledLeftGraph’
  15. typedef typename G::vertex_descriptor vertex_descriptor;
  16. ^~~~~~~~~~~~~~~~~
  17. /usr/include/boost/graph/graph_traits.hpp:58:52: error: no type named ‘edge_descriptor’ in ‘struct mod::lib::Rules::LabelledLeftGraph’
  18. typedef typename G::edge_descriptor edge_descriptor;
  19. ^~~~~~~~~~~~~~~
  20. /usr/include/boost/graph/graph_traits.hpp:65:52: error: no type named ‘directed_category’ in ‘struct mod::lib::Rules::LabelledLeftGraph’
  21. typedef typename G::directed_category directed_category;
  22. ^~~~~~~~~~~~~~~~~
  23. /usr/include/boost/graph/graph_traits.hpp:66:52: error: no type named ‘edge_parallel_category’ in ‘struct mod::lib::Rules::LabelledLeftGraph’
  24. typedef typename G::edge_parallel_category edge_parallel_category;
  25. ^~~~~~~~~~~~~~~~~~~~~~
  26. /usr/include/boost/graph/graph_traits.hpp:67:52: error: no type named ‘traversal_category’ in ‘struct mod::lib::Rules::LabelledLeftGraph’
  27. typedef typename G::traversal_category traversal_category;
  28. ^~~~~~~~~~~~~~~~~~
  29. In file included from /usr/include/c++/7.3.0/bits/stl_construct.h:61:0,
  30. from /usr/include/c++/7.3.0/vector:62,
  31. from /usr/include/boost/graph/adjacency_list.hpp:17,
  32. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  33. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  34. from ../../src/mod/lib/DG/VertexMap.h:4,
  35. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  36. /usr/include/c++/7.3.0/ext/alloc_traits.h: In instantiation of ‘struct __gnu_cxx::__alloc_traits<std::allocator<void> >’:
  37. /usr/include/c++/7.3.0/bits/stl_vector.h:77:21: required from ‘struct std::_Vector_base<void, std::allocator<void> >’
  38. /usr/include/c++/7.3.0/bits/stl_vector.h:216:11: required from ‘class std::vector<void, std::allocator<void> >’
  39. ../../src/jla_boost/graph/FilteredWrapper.hpp:77:34: required from ‘struct jla_boost::FilteredWrapper<mod::lib::Rules::LabelledLeftGraph>’
  40. ../../src/mod/lib/DG/VertexMap.cpp:244:55: required from here
  41. /usr/include/c++/7.3.0/ext/alloc_traits.h:64:53: error: forming reference to void
  42. typedef value_type& reference;
  43. ^~~~~~~~~
  44. /usr/include/c++/7.3.0/ext/alloc_traits.h:65:53: error: forming reference to void
  45. typedef const value_type& const_reference;
  46. ^~~~~~~~~~~~~~~
  47. In file included from /usr/include/c++/7.3.0/vector:64:0,
  48. from /usr/include/boost/graph/adjacency_list.hpp:17,
  49. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  50. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  51. from ../../src/mod/lib/DG/VertexMap.h:4,
  52. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  53. /usr/include/c++/7.3.0/bits/stl_vector.h: In instantiation of ‘class std::vector<void, std::allocator<void> >’:
  54. ../../src/jla_boost/graph/FilteredWrapper.hpp:77:34: required from ‘struct jla_boost::FilteredWrapper<mod::lib::Rules::LabelledLeftGraph>’
  55. ../../src/mod/lib/DG/VertexMap.cpp:244:55: required from here
  56. /usr/include/c++/7.3.0/bits/stl_vector.h:295:7: error: forming reference to void
  57. vector(size_type __n, const value_type& __value,
  58. ^~~~~~
  59. /usr/include/c++/7.3.0/bits/stl_vector.h:501:7: error: forming reference to void
  60. assign(size_type __n, const value_type& __val)
  61. ^~~~~~
  62. /usr/include/c++/7.3.0/bits/stl_vector.h:709:7: error: forming reference to void
  63. resize(size_type __new_size, const value_type& __x)
  64. ^~~~~~
  65. /usr/include/c++/7.3.0/bits/stl_vector.h:939:7: error: forming reference to void
  66. push_back(const value_type& __x)
  67. ^~~~~~~~~
  68. /usr/include/c++/7.3.0/bits/stl_vector.h:953:7: error: forming reference to void
  69. push_back(value_type&& __x)
  70. ^~~~~~~~~
  71. In file included from /usr/include/c++/7.3.0/vector:69:0,
  72. from /usr/include/boost/graph/adjacency_list.hpp:17,
  73. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  74. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  75. from ../../src/mod/lib/DG/VertexMap.h:4,
  76. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  77. /usr/include/c++/7.3.0/bits/vector.tcc:114:5: error: forming reference to void
  78. vector<_Tp, _Alloc>::
  79. ^~~~~~~~~~~~~~~~~~~
  80. In file included from /usr/include/c++/7.3.0/vector:64:0,
  81. from /usr/include/boost/graph/adjacency_list.hpp:17,
  82. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  83. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  84. from ../../src/mod/lib/DG/VertexMap.h:4,
  85. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  86. /usr/include/c++/7.3.0/bits/stl_vector.h:1042:7: error: forming reference to void
  87. insert(const_iterator __position, value_type&& __x)
  88. ^~~~~~
  89. /usr/include/c++/7.3.0/bits/stl_vector.h:1084:7: error: forming reference to void
  90. insert(const_iterator __position, size_type __n, const value_type& __x)
  91. ^~~~~~
  92. /usr/include/c++/7.3.0/bits/stl_vector.h:1334:7: error: forming reference to void
  93. _M_fill_initialize(size_type __n, const value_type& __value)
  94. ^~~~~~~~~~~~~~~~~~
  95. In file included from /usr/include/c++/7.3.0/vector:69:0,
  96. from /usr/include/boost/graph/adjacency_list.hpp:17,
  97. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  98. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  99. from ../../src/mod/lib/DG/VertexMap.h:4,
  100. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  101. /usr/include/c++/7.3.0/bits/vector.tcc:237:5: error: forming reference to void
  102. vector<_Tp, _Alloc>::
  103. ^~~~~~~~~~~~~~~~~~~
  104. /usr/include/c++/7.3.0/bits/vector.tcc:458:5: error: forming reference to void
  105. vector<_Tp, _Alloc>::
  106. ^~~~~~~~~~~~~~~~~~~
  107. /usr/include/c++/7.3.0/bits/vector.tcc:313:5: error: forming reference to void
  108. vector<_Tp, _Alloc>::
  109. ^~~~~~~~~~~~~~~~~~~
  110. In file included from /usr/include/c++/7.3.0/vector:64:0,
  111. from /usr/include/boost/graph/adjacency_list.hpp:17,
  112. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  113. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  114. from ../../src/mod/lib/DG/VertexMap.h:4,
  115. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  116. /usr/include/c++/7.3.0/bits/stl_vector.h:1491:7: error: forming reference to void
  117. _M_emplace_aux(const_iterator __position, value_type&& __v)
  118. ^~~~~~~~~~~~~~
  119. In file included from ../../src/mod/lib/RC/MatchMaker/ComponentWiseUtil.h:9:0,
  120. from ../../src/mod/lib/RC/MatchMaker/Sub.h:10,
  121. from ../../src/mod/lib/DG/VertexMap.cpp:13:
  122. ../../src/jla_boost/graph/FilteredWrapper.hpp: In instantiation of ‘jla_boost::FilteredWrapper<Graph>::FilteredWrapper(const Graph&) [with Graph = mod::lib::Rules::LabelledLeftGraph]’:
  123. ../../src/jla_boost/graph/FilteredWrapper.hpp:83:9: required from ‘jla_boost::FilteredWrapper<Graph> jla_boost::makeFilteredWrapper(const Graph&) [with Graph = mod::lib::Rules::LabelledLeftGraph]’
  124. ../../src/mod/lib/DG/VertexMap.cpp:244:55: required from here
  125. ../../src/jla_boost/graph/FilteredWrapper.hpp:62:26: error: no matching function for call to ‘num_vertices(const mod::lib::Rules::LabelledLeftGraph&)’
  126. : g(g), map(num_vertices(g), std::numeric_limits<vertices_size_type>::max()) {
  127. ~~~~~~~~~~~~^~~
  128. In file included from ../../src/mod/lib/DG/VertexMap.h:7:0,
  129. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  130. ../../src/jla_boost/graph/UnionGraph.hpp:352:49: note: candidate: template<class Graph> typename jla_boost::union_graph<Graph>::vertices_size_type jla_boost::num_vertices(const jla_boost::union_graph<Graph>&)
  131. typename union_graph<Graph>::vertices_size_type num_vertices(const union_graph<Graph> &g) {
  132. ^~~~~~~~~~~~
  133. ../../src/jla_boost/graph/UnionGraph.hpp:352:49: note: template argument deduction/substitution failed:
  134. In file included from ../../src/mod/lib/RC/MatchMaker/ComponentWiseUtil.h:9:0,
  135. from ../../src/mod/lib/RC/MatchMaker/Sub.h:10,
  136. from ../../src/mod/lib/DG/VertexMap.cpp:13:
  137. ../../src/jla_boost/graph/FilteredWrapper.hpp:62:26: note: ‘const mod::lib::Rules::LabelledLeftGraph’ is not derived from ‘const jla_boost::union_graph<Graph>’
  138. : g(g), map(num_vertices(g), std::numeric_limits<vertices_size_type>::max()) {
  139. ~~~~~~~~~~~~^~~
  140. ../../src/jla_boost/graph/FilteredWrapper.hpp:63:22: error: variable or field ‘count’ declared void
  141. vertices_size_type count = 0;
  142. ^~~~~
  143. ../../src/jla_boost/graph/FilteredWrapper.hpp:66:82: error: no matching function for call to ‘vertices(const mod::lib::Rules::LabelledLeftGraph&)’
  144. for(typename boost::graph_traits<Graph>::vertex_descriptor v : asRange(vertices(g))) {
  145. ~~~~~~~~^~~
  146. In file included from ../../src/mod/lib/DG/VertexMap.h:7:0,
  147. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  148. ../../src/jla_boost/graph/UnionGraph.hpp:340:1: note: candidate: template<class Graph> std::pair<typename jla_boost::union_graph<Graph>::vertex_iterator, typename jla_boost::union_graph<Graph>::vertex_iterator> jla_boost::vertices(const jla_boost::union_graph<Graph>&)
  149. vertices(const union_graph<Graph> &g) {
  150. ^~~~~~~~
  151. ../../src/jla_boost/graph/UnionGraph.hpp:340:1: note: template argument deduction/substitution failed:
  152. In file included from ../../src/mod/lib/RC/MatchMaker/ComponentWiseUtil.h:9:0,
  153. from ../../src/mod/lib/RC/MatchMaker/Sub.h:10,
  154. from ../../src/mod/lib/DG/VertexMap.cpp:13:
  155. ../../src/jla_boost/graph/FilteredWrapper.hpp:66:82: note: ‘const mod::lib::Rules::LabelledLeftGraph’ is not derived from ‘const jla_boost::union_graph<Graph>’
  156. for(typename boost::graph_traits<Graph>::vertex_descriptor v : asRange(vertices(g))) {
  157. ~~~~~~~~^~~
  158. ../../src/jla_boost/graph/FilteredWrapper.hpp:67:23: error: variable or field ‘vId’ declared void
  159. vertices_size_type vId = get(boost::vertex_index_t(), g, v);
  160. ^~~
  161. ../../src/jla_boost/graph/FilteredWrapper.hpp:71:15: error: ‘class std::vector<void, std::allocator<void> >’ has no member named ‘push_back’; did you mean ‘pop_back’?
  162. reverseMap.push_back(vId);
  163. ~~~~~~~~~~~^~~~~~~~~
  164. pop_back
  165. In file included from /usr/include/c++/7.3.0/vector:64:0,
  166. from /usr/include/boost/graph/adjacency_list.hpp:17,
  167. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  168. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  169. from ../../src/mod/lib/DG/VertexMap.h:4,
  170. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  171. /usr/include/c++/7.3.0/bits/stl_vector.h: In instantiation of ‘std::_Vector_base<_Tp, _Alloc>::~_Vector_base() [with _Tp = void; _Alloc = std::allocator<void>]’:
  172. /usr/include/c++/7.3.0/bits/stl_vector.h:435:33: required from ‘std::vector<_Tp, _Alloc>::~vector() [with _Tp = void; _Alloc = std::allocator<void>]’
  173. ../../src/jla_boost/graph/FilteredWrapper.hpp:14:8: required from here
  174. /usr/include/c++/7.3.0/bits/stl_vector.h:163:9: error: invalid use of ‘void’
  175. { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage
  176. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177. - this->_M_impl._M_start); }
  178. ^~~~~~~~~~~~~~~~~~~~~~~~
  179. In file included from /usr/include/c++/7.3.0/bits/stl_algobase.h:65:0,
  180. from /usr/include/c++/7.3.0/vector:60,
  181. from /usr/include/boost/graph/adjacency_list.hpp:17,
  182. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  183. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  184. from ../../src/mod/lib/DG/VertexMap.h:4,
  185. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  186. /usr/include/c++/7.3.0/bits/stl_iterator_base_types.h: In instantiation of ‘struct std::iterator_traits<void*>’:
  187. /usr/include/c++/7.3.0/bits/stl_construct.h:130:24: required from ‘void std::_Destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = void*]’
  188. /usr/include/c++/7.3.0/bits/stl_construct.h:206:15: required from ‘void std::_Destroy(_ForwardIterator, _ForwardIterator, std::allocator<_T2>&) [with _ForwardIterator = void*; _Tp = void]’
  189. /usr/include/c++/7.3.0/bits/stl_vector.h:434:22: required from ‘std::vector<_Tp, _Alloc>::~vector() [with _Tp = void; _Alloc = std::allocator<void>]’
  190. ../../src/jla_boost/graph/FilteredWrapper.hpp:14:8: required from here
  191. /usr/include/c++/7.3.0/bits/stl_iterator_base_types.h:184:43: error: forming reference to void
  192. typedef _Tp& reference;
  193. ^~~~~~~~~
  194. In file included from /usr/include/c++/7.3.0/vector:62:0,
  195. from /usr/include/boost/graph/adjacency_list.hpp:17,
  196. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  197. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  198. from ../../src/mod/lib/DG/VertexMap.h:4,
  199. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  200. /usr/include/c++/7.3.0/bits/stl_construct.h: In instantiation of ‘void std::_Destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = void*]’:
  201. /usr/include/c++/7.3.0/bits/stl_construct.h:206:15: required from ‘void std::_Destroy(_ForwardIterator, _ForwardIterator, std::allocator<_T2>&) [with _ForwardIterator = void*; _Tp = void]’
  202. /usr/include/c++/7.3.0/bits/stl_vector.h:434:22: required from ‘std::vector<_Tp, _Alloc>::~vector() [with _Tp = void; _Alloc = std::allocator<void>]’
  203. ../../src/jla_boost/graph/FilteredWrapper.hpp:14:8: required from here
  204. /usr/include/c++/7.3.0/bits/stl_construct.h:133:7: error: static assertion failed: value type is destructible
  205. static_assert(is_destructible<_Value_type>::value,
  206. ^~~~~~~~~~~~~
  207. In file included from /usr/include/c++/7.3.0/ext/alloc_traits.h:36:0,
  208. from /usr/include/c++/7.3.0/bits/stl_construct.h:61,
  209. from /usr/include/c++/7.3.0/vector:62,
  210. from /usr/include/boost/graph/adjacency_list.hpp:17,
  211. from ../../src/jla_boost/graph/EdgeIndexedAdjacencyList.hpp:4,
  212. from ../../src/mod/lib/Graph/GraphDecl.h:4,
  213. from ../../src/mod/lib/DG/VertexMap.h:4,
  214. from ../../src/mod/lib/DG/VertexMap.cpp:1:
  215. /usr/include/c++/7.3.0/bits/alloc_traits.h: In instantiation of ‘static void std::allocator_traits<std::allocator<_Tp1> >::deallocate(std::allocator_traits<std::allocator<_Tp1> >::allocator_type&, std::allocator_traits<std::allocator<_Tp1> >::pointer, std::allocator_traits<std::allocator<_Tp1> >::size_type) [with _Tp = void; std::allocator_traits<std::allocator<_Tp1> >::allocator_type = std::allocator<void>; std::allocator_traits<std::allocator<_Tp1> >::pointer = void*; std::allocator_traits<std::allocator<_Tp1> >::size_type = long unsigned int]’:
  216. /usr/include/c++/7.3.0/bits/stl_vector.h:180:19: required from ‘void std::_Vector_base<_Tp, _Alloc>::_M_deallocate(std::_Vector_base<_Tp, _Alloc>::pointer, std::size_t) [with _Tp = void; _Alloc = std::allocator<void>; std::_Vector_base<_Tp, _Alloc>::pointer = void*; std::size_t = long unsigned int]’
  217. /usr/include/c++/7.3.0/bits/stl_vector.h:162:22: required from ‘std::_Vector_base<_Tp, _Alloc>::~_Vector_base() [with _Tp = void; _Alloc = std::allocator<void>]’
  218. /usr/include/c++/7.3.0/bits/stl_vector.h:435:33: required from ‘std::vector<_Tp, _Alloc>::~vector() [with _Tp = void; _Alloc = std::allocator<void>]’
  219. ../../src/jla_boost/graph/FilteredWrapper.hpp:14:8: required from here
  220. /usr/include/c++/7.3.0/bits/alloc_traits.h:462:13: error: ‘using allocator_type = class std::allocator<void> {aka class std::allocator<void>}’ has no member named ‘deallocate’; did you mean ‘allocator’?
  221. { __a.deallocate(__p, __n); }
  222. ~~~~^~~~~~~~~~
  223. allocator
  224. make[1]: *** [Makefile:2336: mod/lib/DG/libmod_la-VertexMap.lo] Error 1
  225. make[1]: Leaving directory '/home/user/Thesis-lib-code/mod/build/src'
  226. make: *** [Makefile:493: all-recursive] Error 1
  227. ~/Thesis-lib-code/mod ~/Thesis-lib-code/mod/src ~
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement