April 2014 - Boost-users - lists.preview.boost.org

After install, ld finds some boost libs, but not others. All are present.
by Devon Oslund 09 Apr '14

09 Apr '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Can find boost_regex, can't find boost_system. Both right there. _________________________________________________________________________________________________________ ./bootstrap.sh --prefix=/usr ./b2 sudo ./b2 install /usr/lib$ ls -la /usr/lib/libboost_regex.* - -rw-r--r-- 1 root root 3022020 Apr 8 14:29 /usr/lib/libboost_regex.a lrwxrwxrwx 1 root root 24 Apr 8 14:29 /usr/lib/libboost_regex.so -> libboost_regex.so.1.55.0 - -rwxr-xr-x 1 root root 1453274 Apr 8 14:29 /usr/lib/libboost_regex.so.1.55.0 ls -la /usr/lib/libboost_system.* - -rw-r----- 1 root root 32482 Apr 8 14:29 /usr/lib/libboost_system.a lrwxrwxrwx 1 root root 25 Apr 8 14:29 /usr/lib/libboost_system.so -> libboost_system.so.1.55.0 - -rwxr-x--- 1 root root 20461 Apr 8 14:29 /usr/lib/libboost_system.so.1.55.0 **** Build of configuration Release for project TCCore_Batchd **** make all Building target: libTCCore_Batchd.so Invoking: GCC C++ Linker g++ -L/home/devonerik/workspace/tclink-4.0.1-C -L/home/devonerik/workspace/nacl-20110221/build/shalebridge/lib/amd64 - -L/home/devonerik/workspace/scrypt/Release -Xlinker -rpath . -shared -o "libTCCore_Batchd.so" {snip filenames} -lboost_system -lboost_regex -lscrypt -lpqxx /usr/bin/ld: cannot find -lboost_system collect2: error: ld returned 1 exit status make: *** [libTCCore_Batchd.so] Error 1 **** Build of configuration Release for project TCCore_Batchd **** make all Building target: libTCCore_Batchd.so Invoking: GCC C++ Linker g++ -L/home/devonerik/workspace/tclink-4.0.1-C -L/home/devonerik/workspace/nacl-20110221/build/shalebridge/lib/amd64 - -L/home/devonerik/workspace/scrypt/Release -Xlinker -rpath . -shared -o "libTCCore_Batchd.so" {snip filenames} -lboost_regex -lscrypt -lpqxx -lboost_system /usr/bin/ld: cannot find -lboost_system collect2: error: ld returned 1 exit status make: *** [libTCCore_Batchd.so] Error 1 **** Build Finished **** -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTRHG1AAoJEAy07rHw4yivheoH/jRaeucvmZhDAossFEAfiqkJ 8BPzoyGxzX+7aIZXFy9m8HlOo6CEWIAh20XB7iq31vYIq9NLaahcegZgzYX1SmGL T0y0LpmJgUlipcQHbLl0o0E3RWHk7olqCALNy2OBOHLgMYHxDF4tGRMQ6jnbo3xV JLMex5ai5TQwWNmciv7bLuHG/INnVEHVn/UVW2G/fgn7m9j8puhTcWmgbJIq6GAd Gusqqd8P4UZN5Umm1N4PmDtOoIuu2OLD6QvUoP3pM+QvJ5ZVY0nRPx/RDcrzdhoY 7WUDo2anrZiEaPFENUFnCJFBTf3pn7D+JJFeljoAhnqgNuShUjheuUMWsUV2/28= =hc+I -----END PGP SIGNATURE-----

3 3

BOOST_PP_REPEAT to repeat comma-containing text
by Igor R 08 Apr '14

08 Apr '14

Hello, I'm trying to repeat a group of actual parameters (passed to some 3d party plain-C "variadic" function). The function call looks like this: func(count, param1, param2, arr1[0], arr2[0], param1, param2, arr1[1], arr2[1], param1, param2, arr1[2], arr2[2] /* etc */); So essentially, I'd like to repeat (param1, param2, arr1[n], arr2[n]) group. What is the right way to invoke BOOST_PP_REPEAT in this case? Thanks.

2 3

[Graph] Run-time weight search
by Sensei 08 Apr '14

08 Apr '14

Dear all, after many speculations and your previous advice I've come to the conclusion that I still need your help :) The setting is simple: I have an oriented graph, and I have two nodes. I wish to find all paths from one node to the other. Some restrictions apply: - I *cannot* calculate weights except at run-time when needed, it's too costly; - I can, if you say it's needed, restrict the path length to a certain threshold. What can I relax? The "all paths". Since weights are costly, I could set for just the best path, i.e., the one with the lowest weight. I don't think it would be possible to find the optimum path, in case I cannot search for all possible paths, but I can be easily wrong. I'm not that skilled with BGL, so any help would be quite appreciated! I've read the Table of Contents, but at first I cannot see if this can be done. Thanks!

1 0

Problems calling make_reversed_graph in a call to dijkstra from version 1.48
by Berit Dangaard Brouer 08 Apr '14

08 Apr '14

Hi, First of all thank you for providign the boost BGL library. I use it extensively. I am having some problems with some code, that works just fine using boost version 1.46, but cannot compile using version 1.48 and higher. I have a Bidirectional Graph using bundled properties defined as: struct Port { Port(int index=-1, int type=-1, int port_code=0, string UN="NN", string name="NN", int service_id=-1 ): m_index(index), m_type(type), m_port_code( port_code), UNLOCODE(UN), m_name(name), m_service_id(service_id) {} int m_index; int m_type;//0 port, 1 port call int m_port_code; string UNLOCODE; string m_name; int m_service_id; }; struct Edge { Edge( int id=-1, int type=-1, double weight=0.0, double cost=0.0, double dual_cost=0.0, double util=0.0, double cap=0.0, double r_cap=0.0 ) : m_idx(id), m_type(type), m_weight(weight) , m_cost(cost), m_dual_cost(dual_cost), m_utilization(util), m_capacity(cap), m_res_cap(r_cap) {} unsigned int m_idx; int m_type;//0 is load edge, 1 is voyage edge, 2 forfeited edge (commodity link) double m_weight; //distance double m_cost; //cost - only on load/unload/transhipment edges double m_dual_cost; double m_utilization; double m_capacity; double m_res_cap; //residual capacity }; //Graph typedef adjacency_list< vecS , vecS , bidirectionalS, Port, Edge> mcf_graph; I am trying to make a call to dijkstra on a reversed graph as follows: (the reversed graph is also a filtered graph, but I do not think this is an issue: dijkstra_shortest_paths (make_reverse_graph(fg), before_p, predecessor_map ( &p[0] ).distance_map ( &d[0] ).weight_map ( get ( &Edge::m_weight, fg) ).vertex_index_map ( get ( vertex_index,fg ) ) ); which works fine in 1.46, but it seems in 1.48 I can no longer use make_reverse_graph(<mcf_graph&>) (returning a reverse graph) with the bundled properties from fg. and I get the error (compressed summary - full details attached) 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, Port, Edge>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Edge, double>&)pa)[k]' /usr/include/boost/property_map/property_map.hpp:354:56: note: candidate is: In file included from /usr/include/boost/graph/adjacency_list.hpp:44:0, from /home/chrkr/git/lsndp/include/ipheuristic.h:36, from /home/chrkr/git/lsndp/src/ipheuristic.cpp:29: /usr/include/boost/graph/properties.hpp:399: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, Port, Edge>; Descriptor = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>; Bundle = Edge; 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, long unsigned int>] /usr/include/boost/graph/properties.hpp:399:15: note: no known conversion for argument 1 from 'const boost::detail::reverse_graph_edge_descriptor<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >' to 'boost::bundle_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Edge, double>::key_type {aka boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>}' From various sources I understand that as of 1.48 reverse graph is no longer an image of the graph, but another object, where I need the actual property maps and the property maps of the reversed graph, but I did not get much wiser on how to call dijkstra with the reversed graph given these new description. I tried defining the reverse graph as a separate object reverse_graph<mcf_graph> r_fg=reverse_graph(fg); dijkstra_shortest_paths (r_fg), before_p, predecessor_map ( &p[0] ).distance_map ( &d[0] ).weight_map ( get ( &Edge::m_weight, r_fg) ).vertex_index_map ( get ( vertex_index, r_fg ) ) ); indicating that I am not getting the right properties for the reverse graph: equired from here /usr/include/boost/graph/properties.hpp:420:44: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:421:42: error: no type named 'edge_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:425:7: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:429:7: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:432:70: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /usr/include/boost/graph/properties.hpp:434:7: error: no type named 'vertex_bundled' in 'class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >' /home/chrkr/git/lsndp/src/ipheuristic.cpp:939:132: error: no matching function for call to 'get(double Edge::*, boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Port, Edge> >&)' /home/chrkr/git/lsndp/src/ipheuristic.cpp:939:132: note: candidates are: In file included from /usr/include/boost/graph/adjacency_list.hpp:36:0, from /home/chrkr/git/lsndp/include/ipheuristic.h:36, from /home/chrkr/git/lsndp/src/ipheuristic.cpp:29: /usr/include/boost/property_map/property_map.hpp:179:19: note: template<class T> const T& get(const T*, std::ptrdiff_t) /usr/include/boost/property_map/property_map.hpp:179:19: note: template argument deduction/substitution failed: /home/chrkr/git/lsndp/src/ipheuristic.cpp:939:132: note: mismatched types 'const T*' and 'double Edge::*' In file included from /usr/include/boost/graph/graphviz.hpp:25:0, from /home/chrkr/git/lsndp/include/data.h:19, from /home/chrkr/git/lsndp/include/ipheuristic.h:46, from /home/chrkr/git/lsndp/src/ipheuristic.cpp:29: /usr/include/boost/property_map/dynamic_property_map.hpp:322:1: note: template<class Key> std::string boost::get(const string&, const boost::dynamic_properties&, const Key&) /usr/include/boost/property_map/dynamic_property_map.hpp:322:1: note: template argument deduction/substitution failed: Is the problem the bundled properties from the original graph or ? -- Best Regards, Ph.D. Berit Dangaard Brouer Post Doc. DTU Management Engineering, Management Science Technical University of Denmark Department of Management Engineering Produktionstorvet, Bygning 426 2800 Kgs. Lyngby blof(a)dtu.dk <mailto:blof@man.dtu.dk> www.ms.man.dtu.dk <http://www.ms.man.dtu.dk> http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/ Please read about the ENERPLAN project here <http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/>

2 3

Boost Parallel Graph Library: remove_vertex gives unexpected results.
by Alok Kumbhare 06 Apr '14

06 Apr '14

Hi All, i need some help with parallel boost graph library. In particular, i am trying to modify the structure of the graph (distributed adjacency list) after it is loaded. The code snippet is at http://pastebin.com/erizQ0Sf. The problem is that clear_vertex(v,g) and remove_vertex(v,g) does not seem to operate on the same vertex in the graph. Here is a sample graph in metis format: http://pastebin.com/qxy2w6aw (I use the default distribution for this example) The graph_viz output is available here for different scenarios: https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…<https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…> As you can see in the above figure: The first image is the original graph split into two partitions (mpirun -np 2 ./test) The second image is after clear_vertex is called for one of the vertices. Notice vertex "0". All the edges are removed as expected. The third image is after remove_vertex is called (which is called after clear_vertex, as mentioned in the documentation here: http://www.boost.org/doc/libs/1_55_0/libs/graph_parallel/doc/html/distribut…) Notice here that the vertex "2" is removed instead of vertex "0" even when using the same vertex descriptor for both calls. I tried putting synchronize(g) after each call, or at the end of both calls. but both gives the same results. Is this a bug or am i doing something wrong. Your help will be greatly appreciated. Thanks, Alok Kumbhare

1 0

Mac & Boost::Locale from_utf error Undefined symbols for architecture x86_64
by NoRulez 06 Apr '14

06 Apr '14

Hello, I've used the following command to build boost on a mac: ./b2 -a toolset=darwin architecture=x86 macosx-version=10.5 macosx-version-min=10.5 threading=multi link=static address-model=32_64 --without-mpi stage When i link the following source: bool runJavascript(const char * jscode) { std::string javaScriptCode; try { javaScriptCode = boost::locale::conv::from_utf<char>(jscode, "ISO-8859-15"); } catch(...) { javaScriptCode = jscode; } } Then i get the following error message, on windows this work just fine: Undefined symbols for architecture x86_64: "std::basic_string<char, std::char_traits<char>, std::allocator<char> > boost::locale::conv::from_utf<char>(char const*, char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, boost::locale::conv::method_type)", referenced from: ProxyMethod(char const*, char const*, void*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)in JavaScriptRunner.cpp.o ld: symbol(s) not found for architecture x86_64 collect2: ld returned 1 exit status Does anyone have an idea on how to solve that? Thanks in advance

1 0

[Graph] Questions and remarks
by Albert Yiamakis 06 Apr '14

06 Apr '14

Hello, Some questions and remarks regarding Boost.Graph: i) Why does write_graphviz require a VertexEdgeListGraph? I was unable to invoke it on an adjacency_list using sets as containers for vertices and edges; instead I had to switch to vectors. However, the function is meant to output - does the efficiency of the traversal really matter? ii) Would it be possible to mutate the graph in the visitors of an algorithm? For instance, generating the graph during a breadth-first search, by adding vertices and edges. Presumably, it would be the user's responsibility to color the vertices appropriately. (Interestingly, visitors take a non-const reference to the graph - but compilation failed at some other point). iii) The documentation of the distance_recorder states that "A WritablePropertyMap where the key type and the value type are the vertex descriptor type of the graph." which has to be a mistake. It seems this has already been pointed out in the past (http://boost.2283326.n4.nabble.com/BGL-distance-recorder-td2571349.html) but is yet to be corrected. Albert -- kojirion.github.io

1 0

Find out which build options were used
by NoRulez 05 Apr '14

05 Apr '14

Hello, is there somewhere in the boost directory a log file or something else where I can find out how the boost libraries where build? The problem is the following, a college of mine build an old version of boost. The college is not longer in our company and I want to update the library to 1.55.0, but I don't know the preprocessor variables and/or options he used. Any help would be great. Thanks so much

2 4

Compilation errors after upgrading from 1.38 to 1.55
by Normand Mongeau 04 Apr '14

04 Apr '14

Hi, I'm trying to change our boost version from 1.38 to 1.55, and am getting these compilation errors: 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): warning C4002: too many actual parameters for macro 'trunc' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2027: use of undefined type 'boost::math::tools::promote_args' 1> D:\RootReferences\boost_1_55_0\boost/math/tools/promotion.hpp(120) : see declaration of 'boost::math::tools::promote_args' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2226: syntax error : unexpected type 'T' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2988: unrecognizable template declaration/definition 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2059: syntax error : '-' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(24): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2065: 'T' : undeclared identifier 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2988: unrecognizable template declaration/definition 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2059: syntax error : '-' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(26): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): warning C4002: too many actual parameters for macro 'round' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2027: use of undefined type 'boost::math::tools::promote_args' 1> D:\RootReferences\boost_1_55_0\boost/math/tools/promotion.hpp(120) : see declaration of 'boost::math::tools::promote_args' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2226: syntax error : unexpected type 'T' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2143: syntax error : missing ';' before '+' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(42): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2065: 'T' : undeclared identifier 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2374: 'boost::math::floor' : redefinition; multiple initialization 1> D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_fwd .hpp(42) : see declaration of 'boost::math::floor' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2143: syntax error : missing ';' before '+' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2059: syntax error : ')' 1>D:\RootReferences\boost_1_55_0\boost/math/special_functions/detail/round_f wd.hpp(44): error C2059: syntax error : ')' The code doesn't matter as the errors occur as soon as I have an include for lexical_cast, i.e. #include <boost/lexical_cast.hpp> This is using Visual Studio 2010. Any ideas as to what the problem is? Thanks, Normand

2 2

Re: [Boost-users] [Serialization] good practice for serialization with private default constructors
by David Rajaratnam 04 Apr '14

04 Apr '14

On 05/04/14 03:46, Robert Ramey wrote: > > Note that subject is treated in the manual. I forget where. You'll > have to > look for it. boost/libs/serialization/doc/index.html > > And there are two tests which explicitly test this. see. > > https://github.com/boostorg/serialization/blob/develop/test/test_non_defaul… > Sorry, I couldn't find the reference in the manual addressing private default constructor good/bad practice. I am undoubtedly misunderstanding something, but I'm not sure the part on non-default constructors is relevant. In any case... > > never do ar & *x. This will evade certain code which the library > requires. Trust > the source luke! > this answers my question. Regards, Dave PS. Thanks for the great library!

1 0