March 2014 - Boost-users - lists.boost.org

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