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

nearest neighbors search with boost
by Georgios Samaras 11 Apr '14

11 Apr '14

I just find out that boost supports nearest neighbor searching, will amazes me. However, I do not want just to use the nearest() method, I want to study it and understand it. Is there any relevant documentation, specifically on how NNS is performed in R-tree? Are the code files that implement this method visible to the user? I downloaded the latest .tar file. Thank you in advance, Georgios PS - Hello Boost world! :)

2 1

possible bug with boost::is_convertible
by Matei David 11 Apr '14

11 Apr '14

Hi, I found a situation where (with gcc 4.8.2 & 1.55) I cannot compile a call to boost::is_convertible, but I can compile a similar call to std::is_convertible. I don't know yet if this is a bug. Is it undefined behaviour to pass is_convertible a type with a deleted or private copy ctor? Before I go into the details, I'd like to ask, which type_traits library should we prefer these days, post c++11? Intuition says std should be more stable/portable, is that wrong? If it is indeed std, is there a way (perhaps a macro?) to make boost mirror std (I'm talking about type_traits only). The reason for having such a mirror option is not for new code, but for other boost libraries which need type_traits. E.g, I came across this issue from boost::iterator. Here is the discordant code: #include <type_traits> #include <boost/type_traits/is_convertible.hpp> struct A { A() = default; A(const A&) = delete; // or private: A(const A&) = default; }; struct Ref_A { // proxy reference to A operator A& () { return *_ptr; } A* _ptr; }; int main() { (void)std::is_convertible< Ref_A, A >::value; (void)boost::is_convertible< Ref_A, A >::value; } I compile with: {g++|clang++} -std=c++11 -I${BOOST_INCLUDE} -Wall -Wextra -c With gcc 4.8.2, the call to boost::is_convertible fails, complaining that the copy ctor of A is deleted (or private.) The similar call to std::is_convertible compiles ok. With clang 3.4, both calls compile. The reason for the discrepancy is that boost/type_traits/intrinsics.hpp defines the macro BOOST_IS_CONVERTIBLE(T,U) for clang, but not for gcc. Because of that, at the bottom of boost/type_traits/is_convertible.hpp, clang uses the macro to implement is_convertible, whereas gcc uses is_convertible_impl_dispatch instead (which is the one that fails). A temporary fix I found is to define that macro to defer to std: #include <type_traits> #include <boost/type_traits/intrinsics.hpp> #ifndef BOOST_IS_CONVERTIBLE #define BOOST_IS_CONVERTIBLE(T, U) (std::is_convertible<T, U>::value) #endif #include <boost/type_traits/is_convertible.hpp> As I was asking above, is there a way to do that systematically for all type_traits? Thanks, M

1 0

[asio] Crash when posted handlers execute in one thread only?
by Sohail Somani 10 Apr '14

10 Apr '14

Hi, Not sure if there is a race condition in the code below, or if I am not stopping the service in a sanctioned manner but when run, the code consistently crashes on OSX 10.9 with Boost 1.55 and Clang. The only regular pattern was that the crash occurs when all the posted completion handlers execute in one thread only. When the completion handlers execute across both threads, there is no crash. This seems to me like there could be an initialization bug somewhere. I'll try and create a smaller test case. Thanks for any ideas or suggestions. The code: #define LOG(msg) { \ boost::mutex::scoped_lock lock(log_mutex); \ std::cout << "[" << boost::this_thread::get_id() \ << "] " << msg << std::endl; \ } void test() { boost::mutex log_mutex; LOG("Boost version: " << BOOST_LIB_VERSION); for(int ii = 0; ii < 100; ++ii) { LOG("Iteration: " << ii); boost::asio::io_service service; boost::asio::io_service::work work(service); boost::thread_group group; auto fun = [&](){ LOG("Starting service"); service.run(); LOG("Completing service"); }; group.create_thread(fun); group.create_thread(fun); int ntasks = 10; volatile int val = 2; std::vector<volatile int> ints(ntasks,val); for(int ii = 0; ii < ntasks; ++ii) { service.post([&ints,ii,&log_mutex]() { LOG("Task: " << ii); ints[ii] = 1; }); } service.post([&service,&log_mutex](){ LOG("Stopping service"); service.stop(); }); group.join_all(); for(int ii = 0; ii < ntasks; ++ii) { if(ints[ii] != 1) { LOG(ii << "->" << ints[ii]); } } } LOG("Done test"); } int main() { try { test(); } catch(...) { std::cout << "Exception in main()" << std::endl; } } The output + stack trace: ... [0x7fff7aeb9310] Iteration: 91 [0x104681000] Starting service [0x104704000] Starting service [0x104704000] Task: 0 [0x104704000] Task: 1 [0x104704000] Task: 2 [0x104704000] Task: 3 [0x104704000] Task: 4 [0x104704000] Task: 5 [0x104704000] Task: 6 [0x104704000] Task: 7 [0x104704000] Task: 8 [0x104704000] Task: 9 [0x104704000] Stopping service [0x104704000] Completing service [0x104681000] Completing service Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_INVALID_ADDRESS at address: 0x0000000104703c57 0x00007fff8b06cdf3 in _pthread_cond_updateval () (gdb) where #0 0x00007fff8b06cdf3 in _pthread_cond_updateval () #1 0x00007fff8b06c91e in _pthread_cond_signal () #2 0x00000001000048d0 in boost::asio::detail::posix_event::signal_and_unlock<boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex> > () at build/boost/include/boost/asio/detail/posix_event.hpp:62 #3 0x00000001000048d0 in boost::asio::detail::task_io_service::wake_one_idle_thread_and_unlock () at build/boost/include/boost/asio/detail/task_io_service.hpp:484 #4 0x00000001000048d0 in boost::asio::detail::task_io_service::wake_one_thread_and_unlock (this=<value temporarily unavailable, due to optimizations>, lock=<value temporarily unavailable, due to optimizations>) at posix_event.hpp:493 #5 0x0000000100004776 in boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex>::~scoped_lock () at task_io_service.ipp:278 #6 boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex>::~scoped_lock () at build/boost/include/boost/asio/detail/scoped_lock.hpp:52 #7 0x0000000100004776 in boost::asio::detail::task_io_service::post_immediate_completion (this=<value temporarily unavailable, due to optimizations>, op=<value temporarily unavailable, due to optimizations>, is_continuation=<value temporarily unavailable, due to optimizations>) at scoped_lock.hpp:279 #8 0x0000000100001952 in test () at task_io_service.hpp:70 #9 0x0000000100002ca0 in main () at app/exe/testcpp/main.cpp:64 (gdb) info threads 2 0x00007fff985fc662 in kevent64 () * 1 0x00007fff8b06cdf3 in _pthread_cond_updateval ()

3 5

Re: [Boost-users] [Graph] Questions and remarks
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Sun, Apr 6, 2014 4:14 AM PDT Albert Yiamakis wrote: >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? The issue is more likely to be a missing vertex index map than that concept constraint. Graphs with setS as vertex container do not have that by default, and I believe the graphviz writer needs that. You can look online for how to create that map. >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). That would almost always be dangerous because of iterator and descriptor invalidation. The loop variables, current source vertex, etc. would often become invalid (and thus invalid to use) because of the structural modifications. > >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. Yes, that does appear to be a bug. -- Jeremiah Willcock

1 0

Re: [Boost-users] [Graph] Run-time weight search
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 8, 2014 5:38 AM PDT Sensei wrote: >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. > You might consider using A* search instead of a normal shortest path algorithm. You don't need a heuristic function (just use one that always returns zero). There is a function_property_map type that you can use to turn a weight-computing function into a property map. -- Jeremiah Willcock

1 0

the asio example which implement the tcp long connection
by lx 10 Apr '14

10 Apr '14

hi : I want to learn how to implement long connection by asio.But I can't find example. So, where I can find ? Thank you.

1 0

conflicting intmax_t definitions - Boost 1.53 and gcc 4.8 incompatibility?
by Nate Finch 09 Apr '14

09 Apr '14

I recently upgraded to Ubuntu Trusty Tehr, and now the C++ project I'm working on won't build. It looks like the stdlib and Boost aren't working nicely together for some reason. A bunch of typedefs are conflicting between the two, below is one of the errors, where intmax_t is getting defined in two places. I'm not sure what changed, but I now have gcc (Ubuntu/Linaro 4.8.2-14ubuntu2) 4.8.2 and boost Version: 1.53.0.0ubuntu2 Here's an example error message: /usr/include/inttypes.h:290:8: error: reference to ‘intmax_t’ is ambiguous extern intmax_t imaxabs (intmax_t __n) __THROW __attribute__ ((__const__)); ^ In file included from /usr/lib/gcc/x86_64-linux-gnu/4.8/include/stdint.h:9:0, from /usr/include/inttypes.h:27, from src/uint256.h:11, from src/key.h:12, from src/crypter.h:8, from src/keystore.h:8, from src/script.h:14, from src/script.cpp:11: /usr/include/stdint.h:134:19: note: candidates are: typedef long int intmax_t typedef long int intmax_t; ^ In file included from /usr/include/boost/math_fwd.hpp:12:0, from /usr/include/boost/math/common_factor_ct.hpp:13, from /usr/include/boost/variant/variant.hpp:44, from /usr/include/boost/variant.hpp:17, from src/script.h:12, from src/script.cpp:11: /usr/include/boost/cstdint.hpp:306:50: note: typedef boost::long_long_type boost::intmax_t typedef ::boost::long_long_type intmax_t; Any help would be much appreciated. I'm fine with downgrading something, I'm just not sure what to downgrade.... or if there's an actual fix, that's cool too. -- View this message in context: http://boost.2283326.n4.nabble.com/conflicting-intmax-t-definitions-Boost-1… Sent from the Boost - Users mailing list archive at Nabble.com.

8 20

Re: [Boost-users] [serialization] [multimap] change of element's order when deserialize
by Pablo Madoery 09 Apr '14

09 Apr '14

Thank you for your quick answer. I think I will use a map of vector instead of a multimap. On Wed, Apr 9, 2014 at 12:18 PM, Robert Ramey <robertmacleranramey(a)gmail.com > wrote: > > > On Wednesday, April 9, 2014 7:45:59 AM UTC-7, Pablo Madoery wrote: >> >> I have the following code: >> > > >> snip ... >> >> where you can see that the element's order is changed. >> >> When compiling it throw this warning: >> boost::mpl::print<boost::serialization::BOOST_ >> SERIALIZATION_STATIC_WARNING_LINE<98> > >> > > that I don't know what it means. > > You'll have to look into source code error stack to see the comment > associated with this warning. > > >> >> Is this a normal behavior of the serialization library? >> I am missing something ? >> > > This is a feature of the implementation of the serialization of multi map > as well as the implementation > of the std::multi map itself. The result is correct in that it's a valid > multimap but it is a different one that the original. > You could say it's an equivalent multimap. Should this have been done > differently? probably not. Trying > to guarantee this level of "equality" would couple the serialization > implementation to the > std::multimap implementation. This would add much work and never could be > entirely relied upon. > > If you want a specific order - don't use multi map. Expend your key size > and use map or set > > Robert Ramey > >

1 0

[serialization] [multimap] change of element's order when deserialize
by Pablo Madoery 09 Apr '14

09 Apr '14

I have the following code: #include <utility> #include <vector> #include <string> #include <fstream> #include <iostream> #include <map> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/map.hpp> using namespace std; void print(multimap<pair<string, string>, int> &m) { multimap<pair<string, string>, int>::iterator it1 = m.begin(); multimap<pair<string, string>, int>::iterator it2 = m.end(); for(; it1!=it2; ++it1) { cout<<"key = "<<(it1->first).first<<(it1->first).second<<"\t\t"; cout<<"value = "<<(it1->second)<<endl; } cout<<endl; } int main() { multimap<pair<string, string>, int> m1; pair<string, string> par1("A", "B"); pair<string, string> par2("A", "B"); pair<string, string> par3("E", "F"); pair<string, string> par4("E", "F"); m1.insert(pair<pair<string, string>, int>(par1,10)); m1.insert(pair<pair<string, string>, int>(par2,20)); m1.insert(pair<pair<string, string>, int>(par3,30)); m1.insert(pair<pair<string, string>, int>(par4,40)); ofstream ofs("filename"); boost::archive::text_oarchive serial1(ofs); serial1 << m1; ofs.close(); ifstream ifs("filename"); boost::archive::text_iarchive serial2(ifs); multimap<pair<string, string>, int> m2; serial2 >> m2; cout<<"map1 = "<<endl; print(m1); cout<<endl; cout<<"map2 = "<<endl; print(m2); cout << "end" << endl; return 0; } What I am trying to do is serialize a multimap and then deserialize it. The problem i that the order of the elements is not conserved. This program gives as result the following: map1 = key = AB value = 10 key = AB value = 20 key = EF value = 30 key = EF value = 40 map2 = key = AB value = 20 key = AB value = 10 key = EF value = 40 key = EF value = 30 end where you can see that the element's order is changed. When compiling it throw this warning: boost::mpl::print<boost::serialization::BOOST_SERIALIZATION_STATIC_WARNING_LINE<98> > that I don't know what it means. Is this a normal behavior of the serialization library? I am missing something ?

1 0

shared_lock owner
by shada 09 Apr '14

09 Apr '14

did shared_lock has a member like visual c++ critical_section's owner? i use shared_lock in a game server, it has several hundred threads. if has owner, it more easy resolve deadlock.

2 2

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

[Serialization] Polymorphic portable binary archive error
by Szymon Gatner 04 Apr '14

04 Apr '14

Hi, I am trying to use polymorphic_portable_binary_archive in Visual Studio 2012 but adding relevant *.cpp(s) (from examples directory) to the project yields: 1>c:\users\bravo\documents\visual studio 2012\projects\polymorphic_serialization_test\polymorphic_portable_binary_oarchive.hpp(19): fatal error C1083: Cannot open include file: 'boost/archive/detail/polymorphic_oarchive_dispatch.hpp': No such file or directory 1>c:\users\bravo\documents\visual studio 2012\projects\polymorphic_serialization_test\polymorphic_portable_binary_oarchive.cpp(18): fatal error C1083: Cannot open include file: 'boost/archive/impl/archive_pointer_oserializer.ipp': No such file or directory Error 2 error C1083: Cannot open include file: 'boost/archive/detail/polymorphic_iarchive_dispatch.hpp': No such file or directory c:\users\bravo\documents\visual studio 2012\projects\polymorphic_serialization_test\polymorphic_portable_binary_iarchive.hpp 19 polymorphic_serialization_test Indeed, none of those files exists in my boost release, I am using boot 1.54. Also: what is the status of Portable Binary Archives? From forum posts It would seem that ony unsupported things is floating point numbers? Is that correct? Other that that, is everything else production ready? Regards, Szymon Gatner -- Szymon Gatner Bravasoft / The Lordz Games Studio Twitter: @sgatner

1 0

boost::regex_replace problem
by Илья 04 Apr '14

04 Apr '14

Greetings everyone! My name is Ilya and i have such problem with boost::regex_replace : I want to process some text messages to find and replace with * swears there. I wrote regular expressions, this is an example of one of them: "([[:punct:]]|[[:space:]]|[[:digit:]]|^)(?:a)(?:[[:punct:]]|[[:space:]]|[[:digit:]])*(?:b)(?:[[:punct:]]|[[:space:]]|[[:digit:]])*(?:c)([[:punct:]]|[[:space:]]|[[:digit:]]|$)". The format string i used is: "$1***$2" Then i run boost::regex_replace() and it works almoust correctly, except one case: when i have message with abc's standing next to each other with one separator beetween them, like this: "abc abc", "--abc-abc--" etc. So i need to run boost::regex_replace() twice to process corectly such messages. Are there any other ways to solve this problem? Thank you for answers. Ilya Bindiug

2 2

[Serialization] good practice for serialization with private default constructors
by David Rajaratnam 04 Apr '14

04 Apr '14

I am interested to know what is good practice when dealing with serializable classes with private default constructors. In particular it is not clear what is the cleanest way to deserializing these objects. Explaining with reference to the example from: http://stackoverflow.com/questions/7123613/boost-serialization-does-the-def… The answer to this stackoverflow question shows how to serialize/deserialize an object with a private default constructor. Summarizing: class Colour { friend class boost::serialization::access; // private default constructor // template serialize function public: boost::shared_ptr<Colour> test() { // returns new object; } }; int main(){ boost::shared_ptr<Colour> c = Colour::test(); std::stringstream str; boost::archive::text_oarchive oa(str); oa & c; // ... c.reset(); boost::archive::text_iarchive ia(str); ia & c; } However, it is important to observe that it is not just serializing/deserializing the object itself but also the shared pointer to the object! So for example: replacing "ao & c;" with "oa & *c;" will compile and properly serialize (only) the object, but will throw an exception when it tries to deserialize because it is expecting a shared pointer to the object. My solution to this is to provide a constructor that takes an archive object: class Colour { // other stuff public: template<typename Archive> Colour(Archive& ar) { ar >> *this; } }; // some explicit specializations where there are // other single argument constructors The example main then becomes: int main(){ boost::shared_ptr<Colour> c = Colour::test(); std::stringstream str; boost::archive::text_oarchive oa(str); oa & *c; // ... boost::archive::text_iarchive ia(str); Colour c2(ia); } The above works and is clean in that only the Colour object is being serialized/deserialized. However, I'm not sure if it is good practice. In particular: - I presume there will be an intermediate copy of the Colour object being created by the archive object. - Passing *this to a function that takes an object of type Object from within the constructor seems like a bad thing. - In general template based constructors seems like they should be avoided. So, my question is whether my solution is reasonable or is there a better option. Regards, Dave R.

1 0

[wave] fail to parse variadics macro
by gag maker 03 Apr '14

03 Apr '14

Hi, I'm using wave library from boost 1.53.0. Library compiled with default settings, meaning BOOST_WAVE_SUPPORT_VARIADICS_PLACEMARKERS is set to 1 in wave_config.cpp Wave driver is also compiled to support variadics. However, when I try to feed translation unit to wave driver it reports following error: .../compiler.h:32:1: error: ill formed preprocessor directive: #define __builtin_warning(x, y...) (1) And btw, wave driver was called with --variadics option What went wrong here? Thank you, --Alex

6 9

[preprocessor] Undeclared identifier BOOST_PP_IIF_0 under Clang only
by Pierre Talbot 03 Apr '14

03 Apr '14

Hi, I defined a macro using Boost.Preprocessor that compiles and works fine under gcc but fails to compile under Clang. The macro is defined here: https://github.com/ptal/Boost.Expected/blob/master/include/boost/functional… And the error message follows this message, the file using the macro is https://github.com/ptal/Boost.Expected/blob/master/example/monadic_calculat… Thanks for any helps, Pierre Talbot Boost.Expected/example/monadic_calculator$ b2 ...patience... ...found 1246 targets... ...updating 2 targets... clang-linux.compile.c++.without-pth bin/clang-linux-3.5.0/debug/monadic_calculator.o monadic_calculator.cpp:141:15: error: use of undeclared identifier 'BOOST_PP_IIF_0' etokens = DO( ^ ../../include/boost/functional/do_yield.hpp:100:17: note: expanded from macro 'DO' #define DO(...) DO_SEQ(BOOST_PP_VARIADIC_TO_SEQ(__VA_ARGS__)) ^ ../../include/boost/functional/do_yield.hpp:97:3: note: expanded from macro 'DO_SEQ' BOOST_PP_SEQ_FOR_EACH_I(DO_ELEM, seq, seq) \ ^ /usr/local/boost_1_55_0/boost/preprocessor/seq/for_each_i.hpp:27:55: note: expanded from macro 'BOOST_PP_SEQ_FOR_EACH_I' # define BOOST_PP_SEQ_FOR_EACH_I(macro, data, seq) BOOST_PP_FOR((macro, data, seq (nil), 0), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M) ^ /usr/local/boost_1_55_0/boost/preprocessor/repetition/for.hpp:27:23: note: expanded from macro 'BOOST_PP_FOR' # define BOOST_PP_FOR BOOST_PP_CAT(BOOST_PP_FOR_, BOOST_PP_AUTO_REC(BOOST_PP_FOR_P, 256)) ^ /usr/local/boost_1_55_0/boost/preprocessor/cat.hpp:22:32: note: expanded from macro 'BOOST_PP_CAT' # define BOOST_PP_CAT(a, b) BOOST_PP_CAT_I(a, b) ^ /usr/local/boost_1_55_0/boost/preprocessor/cat.hpp:29:34: note: expanded from macro 'BOOST_PP_CAT_I' # define BOOST_PP_CAT_I(a, b) a ## b ^ <scratch space>:130:1: note: expanded from here BOOST_PP_FOR_1 ^ /usr/local/boost_1_55_0/boost/preprocessor/repetition/detail/for.hpp:22:37: note: expanded from macro 'BOOST_PP_FOR_1' # define BOOST_PP_FOR_1(s, p, o, m) BOOST_PP_FOR_1_C(BOOST_PP_BOOL(p(2, s)), s, p, o, m) ^ /usr/local/boost_1_55_0/boost/preprocessor/repetition/detail/for.hpp:279:42: note: expanded from macro 'BOOST_PP_FOR_1_C' # define BOOST_PP_FOR_1_C(c, s, p, o, m) BOOST_PP_IIF(c, m, BOOST_PP_TUPLE_EAT_2)(2, s) BOOST_PP_IIF(c, BOOST_PP_FOR_2, BOOST_PP_TUPLE_EAT_4)(BOOST_PP_EXPR_IIF(c, o)(2, s), p, o, m) ^ /usr/local/boost_1_55_0/boost/preprocessor/control/iif.hpp:18:37: note: expanded from macro 'BOOST_PP_IIF' # define BOOST_PP_IIF(bit, t, f) BOOST_PP_IIF_I(bit, t, f) ^ /usr/local/boost_1_55_0/boost/preprocessor/control/iif.hpp:25:39: note: expanded from macro 'BOOST_PP_IIF_I' # define BOOST_PP_IIF_I(bit, t, f) BOOST_PP_IIF_ ## bit(t, f) ^ <scratch space>:136:1: note: expanded from here BOOST_PP_IIF_0 ^

2 4