Making all in oqgraph
make[2]: Entrando no diretório `/tmp/yaourt-tmp-obedi/aur-mariadb/src/mariadb-5.3.2-beta/storage/oqgraph'
if /bin/sh ../../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I. -I../../include -I../../include -I../../include -I../../regex -I../../sql -I. -DHAVE_OQGRAPH    -fPIC -march=i686 -mtune=generic -O2 -pipe -fstack-protector --param=ssp-buffer-size=4 -D_FORTIFY_SOURCE=2 -fno-strict-aliasing -felide-constructors -fno-rtti   -fno-implicit-templates -fno-exceptions -fno-rtti -DMYSQL_DYNAMIC_PLUGIN  -MT ha_oqgraph_la-ha_oqgraph.lo -MD -MP -MF ".deps/ha_oqgraph_la-ha_oqgraph.Tpo" -c -o ha_oqgraph_la-ha_oqgraph.lo `test -f 'ha_oqgraph.cc' || echo './'`ha_oqgraph.cc; \
then mv -f ".deps/ha_oqgraph_la-ha_oqgraph.Tpo" ".deps/ha_oqgraph_la-ha_oqgraph.Plo"; else rm -f ".deps/ha_oqgraph_la-ha_oqgraph.Tpo"; exit 1; fi
libtool: compile:  g++ -DHAVE_CONFIG_H -I. -I. -I../../include -I../../include -I../../include -I../../regex -I../../sql -I. -DHAVE_OQGRAPH -fPIC -march=i686 -mtune=generic -O2 -pipe -fstack-protector --param=ssp-buffer-size=4 -D_FORTIFY_SOURCE=2 -fno-strict-aliasing -felide-constructors -fno-rtti -fno-implicit-templates -fno-exceptions -fno-rtti -DMYSQL_DYNAMIC_PLUGIN -MT ha_oqgraph_la-ha_oqgraph.lo -MD -MP -MF .deps/ha_oqgraph_la-ha_oqgraph.Tpo -c ha_oqgraph.cc  -fPIC -DPIC -o .libs/ha_oqgraph_la-ha_oqgraph.o
libtool: compile:  g++ -DHAVE_CONFIG_H -I. -I. -I../../include -I../../include -I../../include -I../../regex -I../../sql -I. -DHAVE_OQGRAPH -fPIC -march=i686 -mtune=generic -O2 -pipe -fstack-protector --param=ssp-buffer-size=4 -D_FORTIFY_SOURCE=2 -fno-strict-aliasing -felide-constructors -fno-rtti -fno-implicit-templates -fno-exceptions -fno-rtti -DMYSQL_DYNAMIC_PLUGIN -MT ha_oqgraph_la-ha_oqgraph.lo -MD -MP -MF .deps/ha_oqgraph_la-ha_oqgraph.Tpo -c ha_oqgraph.cc -o ha_oqgraph_la-ha_oqgraph.o >/dev/null 2>&1
if /bin/sh ../../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I. -I../../include -I../../include -I../../include -I../../regex -I../../sql -I. -DHAVE_OQGRAPH    -fPIC -march=i686 -mtune=generic -O2 -pipe -fstack-protector --param=ssp-buffer-size=4 -D_FORTIFY_SOURCE=2 -fno-strict-aliasing -felide-constructors -fno-rtti   -fno-implicit-templates -fno-exceptions -fno-rtti -frtti -fexceptions -fimplicit-templates -O3 -fstrict-aliasing -falign-loops -fvisibility-inlines-hidden -funroll-loops -fno-trapping-math  -MT libgraphcore_la-graphcore.lo -MD -MP -MF ".deps/libgraphcore_la-graphcore.Tpo" -c -o libgraphcore_la-graphcore.lo `test -f 'graphcore.cc' || echo './'`graphcore.cc; \
then mv -f ".deps/libgraphcore_la-graphcore.Tpo" ".deps/libgraphcore_la-graphcore.Plo"; else rm -f ".deps/libgraphcore_la-graphcore.Tpo"; exit 1; fi
libtool: compile:  g++ -DHAVE_CONFIG_H -I. -I. -I../../include -I../../include -I../../include -I../../regex -I../../sql -I. -DHAVE_OQGRAPH -fPIC -march=i686 -mtune=generic -O2 -pipe -fstack-protector --param=ssp-buffer-size=4 -D_FORTIFY_SOURCE=2 -fno-strict-aliasing -felide-constructors -fno-rtti -fno-implicit-templates -fno-exceptions -fno-rtti -frtti -fexceptions -fimplicit-templates -O3 -fstrict-aliasing -falign-loops -fvisibility-inlines-hidden -funroll-loops -fno-trapping-math -MT libgraphcore_la-graphcore.lo -MD -MP -MF .deps/libgraphcore_la-graphcore.Tpo -c graphcore.cc  -fPIC -DPIC -o .libs/libgraphcore_la-graphcore.o
In file included from graphcore.cc:36:0:
/usr/include/boost/property_map/property_map.hpp: In function ‘Reference boost::get(const boost::put_get_helper<Reference, PropertyMap>&, const K&) [with PropertyMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, Reference = double&, K = boost::detail::reverse_graph_edge_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int> >]’:
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:161:9:   instantiated from ‘void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::examine_edge(Edge, Graph&) [with Edge = boost::detail::reverse_graph_edge_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int> >, Graph = const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, UniformCostVisitor = boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, UpdatableQueue = boost::d_ary_heap_indirect<unsigned int, 4u, boost::iterator_property_map<unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, std::less<double>, std::vector<unsigned int> >, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, BinaryFunction = boost::closed_plus<double>, BinaryPredicate = std::less<double>]’
/usr/include/boost/graph/breadth_first_search.hpp:77:47:   instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, Buffer = boost::d_ary_heap_indirect<unsigned int, 4u, boost::iterator_property_map<unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, std::less<double>, std::vector<unsigned int> >, BFSVisitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, boost::d_ary_heap_indirect<unsigned int, 4u, boost::iterator_property_map<unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, std::less<double>, std::vector<unsigned int> >, boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, boost::closed_plus<double>, std::less<double> >, ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int> >, typename boost::graph_traits<Graph>::vertex_descriptor = unsigned int]’
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:332:5:   instantiated from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, DijkstraVisitor = boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistZero = double, ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int> >, typename boost::graph_traits<Graph>::vertex_descriptor = unsigned int]’
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:383:5:   instantiated from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<VertexListGraph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, DijkstraVisitor = boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double, ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int> >, typename boost::graph_traits<VertexListGraph>::vertex_descriptor = unsigned int]’
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:353:5:   instantiated from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<VertexListGraph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params<T, Tag, Base>&, typename boost::enable_if_c<boost::is_base_and_derived<boost::vertex_list_graph_tag, typename boost::graph_traits<VertexListGraph>::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, DijkstraVisitor = boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, Compare = std::less<double>, Combine = boost::closed_plus<double>, DistInf = double, DistZero = double, T = boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, Tag = boost::graph_visitor_t, Base = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, boost::edge_weight_t, boost::no_property> > >, typename boost::graph_traits<VertexListGraph>::vertex_descriptor = unsigned int, typename boost::enable_if_c<boost::is_base_and_derived<boost::vertex_list_graph_tag, typename boost::graph_traits<VertexListGraph>::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter]’
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:426:7:   instantiated from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, Params = boost::bgl_named_params<boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, boost::graph_visitor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, boost::edge_weight_t, boost::no_property> > > >, typename boost::graph_traits<Graph>::vertex_descriptor = unsigned int]’
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:457:7:   instantiated from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, Params = boost::bgl_named_params<boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, boost::graph_visitor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, boost::edge_weight_t, boost::no_property> > > >, typename boost::graph_traits<Graph>::vertex_descriptor = unsigned int]’
/usr/include/boost/graph/dijkstra_shortest_paths.hpp:475:5:   instantiated from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo> >, Param = boost::dijkstra_visitor<open_query::oqgraph_visit_dist>, Tag = boost::graph_visitor_t, Rest = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, unsigned int, unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t, open_query::VertexInfo, boost::no_property>, unsigned int>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>, boost::edge_weight_t, boost::no_property> > >, typename boost::graph_traits<Graph>::vertex_descriptor = unsigned int]’
graphcore.cc:892:13:   instantiated from here
/usr/include/boost/property_map/property_map.hpp:354:56: error: no match for ‘operator[]’ in ‘((const boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, open_query::EdgeInfo, double>&)pa)[k]’
/usr/include/boost/property_map/property_map.hpp:354:56: note: candidate is:
/usr/include/boost/graph/properties.hpp:397:15: note: T& boost::bundle_property_map<Graph, Descriptor, Bundle, T>::operator[](boost::bundle_property_map<Graph, Descriptor, Bundle, T>::key_type) const [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, open_query::VertexInfo, open_query::EdgeInfo>, Descriptor = boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, Bundle = open_query::EdgeInfo, T = double, boost::bundle_property_map<Graph, Descriptor, Bundle, T>::reference = double&, boost::bundle_property_map<Graph, Descriptor, Bundle, T>::key_type = boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>]
/usr/include/boost/graph/properties.hpp:397:15: note:   no known conversion for argument 1 from ‘const boost::detail::reverse_graph_edge_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int> >’ to ‘boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>’
make[2]: ** [libgraphcore_la-graphcore.lo] Erro 1
make[2]: Saindo do diretório `/tmp/yaourt-tmp-obedi/aur-mariadb/src/mariadb-5.3.2-beta/storage/oqgraph'
make[1]: ** [all-recursive] Erro 1
make[1]: Saindo do diretório `/tmp/yaourt-tmp-obedi/aur-mariadb/src/mariadb-5.3.2-beta/storage'
make: ** [all-recursive] Erro 1