- Boost-users - lists.boost.org

\boost\cstdint.hpp(129) : error C2059: syntax error : '::'
by Uthpal Urubail 05 Mar '14

05 Mar '14

I am trying use boost in my application. I am getting compiler error, if I try to include headers after one of the application include file where uint64_t is defined. #if defined(OS_WIN) && !defined(uint64_t) #define uint64_t unsigned __int64 #endif Error: Can some one help me find the better solution to resolve these type of issues? Regards, UJ

3 5

CMake and Boost
by Koteswara Rao Ruvva 05 Mar '14

05 Mar '14

Hello All, I built boost libraries with the option build-type=complete and created libraries for various options, like gcc54-mt, gcc45-mt-d, gcc45-mt-s, gcc-54mt-sd etc. I have similar ones for intel toolchain too. Now, how do I force CMake to link to the correct library file out of many versions? Do I have to specify the full library name? Or can I specify the build type, like debug, multi-threading etc and leave the CMake to choose the right file to link? Is there such an option? I'm building on Linux under gcc and intel compilers and keeping both gcc and intel library files in one folder. Thank you all for being there to help the community. --Kotesh

2 2

relocation R_X86_64_32 against
by Koteswara Rao Ruvva 04 Mar '14

04 Mar '14

Hello All, I'm a newbie to this mailing list. I am trying to build static boost libraries and link to my libraries. I used ./bjam debug link=static cxxflags="-std=c++0x" stage to build the boost libraries. When I build my libraries (shared or static) with linking to boost libraries, I get the following error: libboost_regex.a(instances.o): relocation R_X86_64_32 against `.bss' can not be used when making a shared object; recompile with -fPIC libboost_regex.a: could not read symbols: Bad value Then I tried adding -fPIC while building my boost libraries. Didn't help. Any suggestions. Thank you Kotesh

3 6

Boost qi parser
by Uthpal Urubail 04 Mar '14

04 Mar '14

{ name = "new" sub_name = "SUBTITLE" values = { 1, 2, 3; } input_values = { 1, 2, 3; 5, 5, 6 10, 12, 3} type = input intval = 100 } Can some one help me to write the parser for the above format? I am trying something like below and this doesn’t seem to work for me. template <typename Iterator> struct keys_and_values : qi::grammar<Iterator, mapDef()> { keys_and_values() : keys_and_values::base_type(query) { using namespace qi; query = '{' >> *lit(' ') >> pair >> *(lit(' ') >> *lit(' ') >> pair) >> *lit(' ') >> '}'; pair = key >> -(*lit(' ') >> "=" >> *lit(' ') >> value); key = +char_("a-zA-Z0-9_") ; value = +char_("a-zA-Z0-9") | lexeme[('{' >> +char_("\"@+*.( , ) $ a-zA-Z0-9_ -") >> '}')] | lexeme[('"' >> +char_("\"@+*.( , ) $ a-zA-Z0-9_ -") >> '"')]; } qi::rule<Iterator, mapDef()> query; qi::rule<Iterator, std::pair<std::string, std::string>()> pair; qi::rule<Iterator, std::string()> key, value; }; Any help would be highly appriciated. Regards, UJ

3 5

[Boost.Log] logging only in a debug build
by Sean Farrow 03 Mar '14

03 Mar '14

Hi, Is there a way with Boost.Log to have logging code emitted in a debug build but completely removed for release. The only way I can come up with is to have #if defs and #endif's scattered throughout the code. Has anyone come up with a better way? Any help appreciated. Kind Regards Sean.

2 3

[BGL] Shared nodes on path
by Sensei 03 Mar '14

03 Mar '14

Dear all, I have a simple question about the most efficient way of finding shared nodes between a path and a graph. Let me be more explicit. I have an oriented graph G, and a very simple graph P, which is actually a simple oriented path (n0 -> n1 -> ... -> nK). I need to find *all* the possible shared paths between P and G with the same length as P. For instance, being P = n1 -> n2 -> n3 -> n4 -> n5 -> n6 we may find that the G and P share only two sub-paths n1 -> n2 -> n3 n5 -> n6 I'd like to find all sub-graphs that connect the two paths, for instance having n1 -> n2 -> n3 -> n10 -> n5 -> n6 n1 -> n2 -> n3 -> n42 -> n5 -> n6 with the constraint that the solution must be a path with the same length as P, therefore a solution as these n1 -> n2 -> n3 -> n9 -> n8 -> n5 -> n6 n1 -> n2 -> n3 -> n5 -> n6 would not be acceptable. I know I can do it manually, but I think a BGL-aware solution is quite better that a manual search :) Thanks & Cheers!

2 4

Error compiling Boost::graph crs_graph
by Andrea Cassioli 28 Feb '14

28 Feb '14

Dear all, I have been using the compressed_sparse_row_graph quite extensively in past. Now, I am working under Linux with Boost 1.55 and I am lost trying to compile the following toy piece of code: #include <vector> #include <boost/graph/compressed_sparse_row_graph.hpp> int main() { typedef boost::compressed_sparse_row_graph<boost::directedS, boost::no_property, int> gtype; std::vector<boost::graph_traits<gtype>::edge_descriptor> edges; std::vector< int > distances; gtype graph(boost::edges_are_unsorted_t(), edges.begin(), edges.end(), distances.begin(), edges.size()); return 0; } Just compile with g++ 4.8.2 and you get In file included from /usr/include/boost/graph/detail/compressed_sparse_row_struct.hpp:33:0, from /usr/include/boost/graph/compressed_sparse_row_graph.hpp:29, from prova_icl.cpp:2: /usr/include/boost/graph/detail/histogram_sort.hpp: In instantiation of ��void boost::graph::detail::split_into_separate_coords(InputIterator, InputIterator, std::vector<Property>&, std::vector<Property>&) [with InputIterator = __gnu_cxx::__normal_iterator<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>*, std::vector<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> > >; VerticesSize = long unsigned int]��: /usr/include/boost/graph/compressed_sparse_row_graph.hpp:466:46: required from ��boost::compressed_sparse_row_graph<boost::directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::compressed_sparse_row_graph(boost::edges_are_unsorted_t, InputIterator, InputIterator, EdgePropertyIterator, boost::compressed_sparse_row_graph<boost::directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::vertices_size_type, const GraphProperty&) [with InputIterator = __gnu_cxx::__normal_iterator<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>*, std::vector<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> > >; EdgePropertyIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >; VertexProperty = boost::no_property; EdgeProperty = int; GraphProperty = boost::no_property; Vertex = long unsigned int; EdgeIndex = long unsigned int; boost::compressed_sparse_row_graph<boost::directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::vertices_size_type = long unsigned int]�� prova_icl.cpp:14:34: required from here /usr/include/boost/graph/detail/histogram_sort.hpp:226:51: error: conversion from ��boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>�� to non-scalar type ��std::pair<long unsigned int, long unsigned int>�� requested std::pair<VerticesSize, VerticesSize> edge = *begin; What the xxx is happening? In my understanding sounds like there conversion from an edge_descriptor to a pair....Any ideas?? Best, Andrea Cassioli

1 0

boost::optional with BOOST_FUSION_ADAPT_ADT broken?
by Andrew 28 Feb '14

28 Feb '14

There's an issue using get expressions returning optionals with BOOST_FUSION_ADAPT_ADT, demonstrated in the simplest case below. Optional<T> is trying initialize its internal T object using the attribute proxy object returned by fusion, but this can only degrade to optional<T> and not T, so the assignment fails. C++ wizard, K-Ballo, took a quick look at this in #boost and seemed to suggest it's the way op= is SFINAEd up for optional. Does anyone have a work around for this? #include <boost/optional.hpp> #include <boost/fusion/adapted/struct/adapt_struct.hpp> #include <boost/fusion/adapted/adt/adapt_adt.hpp> #include <boost/fusion/algorithm/auxiliary/copy.hpp> struct A { boost::optional<int> x; }; struct B { boost::optional<int> y; }; BOOST_FUSION_ADAPT_STRUCT(B, (boost::optional<int>, y)) BOOST_FUSION_ADAPT_ADT(A, (boost::optional<int>, boost::optional<int>, obj.x, obj.x = val)) int main() { A a; B b; // doesn't work: boost::fusion::copy (a, b); // this works: // boost::fusion::copy (b, a); }

3 4

boost graph, Using Bundled Properties and Internal Properties at the same time
by Paolo Bolzoni 27 Feb '14

27 Feb '14

Dear list, Related to the other email of me I woud like to use the subgraphs class, but the base graph needs two internal properties: vertex_index and edge_index. However in my program I use bundled properties as suggested in this list some time ago. Now I have this problem, is possible to use internal and bundled properties in the same graph? Or can I use subgraph in another way? Your faithfully, Paolo

1 0

Strange problem with boost/graph/subgraph.hpp
by Paolo Bolzoni 27 Feb '14

27 Feb '14

Dear list, I cannot compile a simple example using the subgraph implementation. I enclosed the code in the bottom of this email. It is quite short, but it is the whole code. It does not compile with errors from inside boost/graph/detail/adjacency_list.hpp about the impossiblity of making a reference to void. I read the subgraph documentation but I cannot understand why it does not work. Can anyone enlighten me? Your faithfully, Paolo The code: ------------------ >8 #include <boost/graph/adjacency_list.hpp> #include <boost/graph/subgraph.hpp> typedef boost::adjacency_list < boost::listS, boost::listS, boost::undirectedS > main_graph; typedef boost::subgraph <main_graph> sub_graph; typedef boost::graph_traits<sub_graph>::vertex_descriptor Bvertex; 8< ------------------

1 1