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

[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

problems with nested boost::bind and boost::asio
by Marco 03 Apr '14

03 Apr '14

Hi, I use async_read of boost::asio to receive network data. After a complete 'packet' was read (which needs 2 async read calls) I want to call a user defined handler. Therefore, I introduced a new templater parameter in my callback methods. Unfortunately, my code ends in a compile error. If I outcomment the handler call, than it compiles fine. But with the call of the handler object, I got a conversion error. At first I want to describe my code on some excerpts: ---------------------------------------------------------------------------------------- In 'startProcessing' I use perfect forwarding for the callback object. template<typename T> void startProcessing(T&& handler,bool activateNoDelay = true) { // m_socket.set_option(asio::ip::tcp::no_delay(activateNoDelay )); // startAsyncRead(std::forward<T>(handler)); } ---------------------------------------------------------------------------------------- 'startAsynRead' has two overloads. One for boost::bind objects and one for all other. The boost bind objects are encased with boost::protect to prevent an evaluation of boost::bind in the later binds. // template<typename T> void startAsyncRead(T handler) { startAsyncReadImpl(handler); } //overload for boost bind objects necessary template<typename R, typename F, typename L> void startAsyncRead(boost::_bi::bind_t<R, F, L> handler) { startAsyncReadImpl(boost::protect(handler)); } ---------------------------------------------------------------------------------------- 'startAsyncReadImpl' calls asio::async_read and uses boost::bind to commit the handler object as a third parameter. // template<typename T> void startAsyncReadImpl(T&& handler) { //at first we need to read the header information auto& buf = m_headerInBuffer.getBuffer(); boost::asio::async_read( m_socket, boost::asio::buffer(buf.begin(), buf.size()), boost::asio::transfer_exactly(buf.size()), boost::bind(&CMessageChannel::handleAsyncReadHeader<T>, this,_1, _2, std::forward<T>(handler)) ); } ---------------------------------------------------------------------------------------- 'handleAsyncReadHeader' does some stuff and than calls asio::async_read with another method. // template<typename T> void handleAsyncReadHeader(const boost::system::error_code& error, std::size_t bytes_transferred, T handler) { . . . boost::asio::async_read( m_socket, boost::asio::buffer(buf.begin(), buf.size()), boost::asio::transfer_exactly(size), boost::bind(&CMessageChannel::handleAsyncReadBody<T>, this, _1, _2,handler) ); } ---------------------------------------------------------------------------------------- Finally, 'handleAsyncReadBody' has to do the wished call of the handler. // template<typename T> inline void CMessageChannel::handleAsyncReadBody(const boost::system::error_code& error, std::size_t bytes_transferred, T handler) { ... handler(Packet(m_headerInBuffer.getShort(4), bytes_transferred, m_currReadBuffer)); } ---------------------------------------------------------------------------------------- And here a call of start process: void testPacket(Packet& packet) {} . . . conn->startProcessing(boost::bind(&CMessageServer::testPacket, this, _1)); ---------------------------------------------------------------------------------------- I use Visual Studio 2013 and got the following error message: 1>D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind.hpp(313): error C2664: 'void boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>::operator ()(T *,A1) const' : Konvertierung von Argument 2 von 'const tuc::nw::Packet' in 'tuc::nw::Packet &' nicht möglich -> can't convert argument 2 'const tuc::nw::Packet' to tuc::nw::Packet & I never use const in my call chain. It seems that boost::protect introduces the const for the parameter. And I have no idea how to fix it :( ---------------------------------------------------------------------------------------- Here is the complete error message: 1>------ Erstellen gestartet: Projekt: network, Konfiguration: Release Win32 ------ 1> MessageChannel.cpp 1> MessageServer.cpp 1>D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind.hpp(313): error C2664: 'void boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>::operator ()(T *,A1) const' : Konvertierung von Argument 2 von 'const tuc::nw::Packet' in 'tuc::nw::Packet &' nicht möglich 1> with 1> [ 1> T=tuc::nw::CMessageServer 1> , A1=tuc::nw::Packet & 1> ] 1> Durch die Konvertierung gehen Qualifizierer verloren 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind_template.hpp(47): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>::operator ()<F,boost::_bi::list1<const A1 &>>(boost::_bi::type<void>,F &,A &,int)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , F=boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &> 1> , A1=tuc::nw::Packet 1> , A=boost::_bi::list1<const tuc::nw::Packet &> 1> ] 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/bind_template.hpp(47): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>::operator ()<F,boost::_bi::list1<const A1 &>>(boost::_bi::type<void>,F &,A &,int)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , F=boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &> 1> , A1=tuc::nw::Packet 1> , A=boost::_bi::list1<const tuc::nw::Packet &> 1> ] 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/protect.hpp(60): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>::operator ()<A1>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> D:\libraries\cpp\boost\boost_1_55_0\boost/bind/protect.hpp(60): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>::operator ()<A1>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(196): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>::operator ()<tuc::nw::Packet>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(196): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>::operator ()<tuc::nw::Packet>(const A1 &)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> , A1=tuc::nw::Packet 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(179): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::handleAsyncReadBody<T>(const boost::system::error_code &,size_t,T)". 1> with 1> [ 1> T=boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<tuc::nw::CMessageServer *>,boost::arg<1>>>> 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(127): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::handleAsyncReadHeader<T>(const boost::system::error_code &,size_t,T)". 1> with 1> [ 1> T=boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<tuc::nw::CMessageServer *>,boost::arg<1>>>> 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(117): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::startAsyncReadImpl<boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>>(boost::_bi::protected_bind_t<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>> &&)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> ] 1> G:\Quellcode\nc-programming\nc-libs\nc-libs/network/MessageChannel.h(76): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::startAsyncRead<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>(boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> ] 1> MessageServer.cpp(43): Siehe Verweis auf die Instanziierung der gerade kompilierten Funktions-template "void tuc::nw::CMessageChannel::startProcessing<boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>>>(boost::_bi::bind_t<void,boost::_mfi::mf1<void,tuc::nw::CMessageServer,tuc::nw::Packet &>,boost::_bi::list2<boost::_bi::value<T>,boost::arg<1>>> &&,bool)". 1> with 1> [ 1> T=tuc::nw::CMessageServer * 1> ] ========== Erstellen: 0 erfolgreich, 1 fehlerhaft, 0 aktuell, 0 übersprungen ==========

2 1

installing boost getting error "ld: symbol(s) not found for architecture x86_64" on OSX 10.9.2
by Corentin Hamel 02 Apr '14

02 Apr '14

Hi everyone, I hope this is the right place to ask my question. I'm trying to build boost 1.55.0 for python on OSX 10.9.2 but i'm encountering the following error "ld: symbol(s) not found for architecture x86_64" and I'm really blocked. I read it might be related to the standard c++ library which changed with maverick to be libc++ by default. But even adding cxxflags="-stdlib=libstdc++" when executing ./b2 didn't help. Here is what I did following the boost tutorial: download boost_1_55_0.tar ./bootstrap.sh --with-libraries=python toolset=darwin ./b2 include="/Library/Frameworks/Python.framework/Versions/2.7/include/python2.7/" And I get the following error: link.jam: No such file or directory Building the Boost C++ Libraries. error: No best alternative for /python_for_extensions next alternative: required properties: <python>2.7 <target-os>darwin matched next alternative: required properties: <python>2.7 <target-os>darwin matched error: No best alternative for /python_for_extensions next alternative: required properties: <python>2.7 <target-os>darwin matched next alternative: required properties: <python>2.7 <target-os>darwin matched Component configuration: - python : building darwin.link.dll bin.v2/libs/python/build/darwin-4.2.1/release/threading- multi/libboost_python.dylib Undefined symbols for architecture x86_64: "_PyFile_FromString", referenced from: boost::python::exec_file(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o "_PyFile_AsFile", referenced from: boost::python::exec_file(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o "_PyEval_GetGlobals", referenced from: boost::python::eval(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o boost::python::exec(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o boost::python::exec_statement(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o boost::python::exec_file(boost::python::str, boost::python::api::object, boost::python::api::object) in exec.o "_PyRun_StringFlags", referenced from: ........ "_PyExc_StopIteration", referenced from: boost::python::objects::stop_iteration_error() in iterator.o "_PyNumber_InPlaceAdd", referenced from: boost::python::api::operator+=(boost::python::api::object&, boost::python::api::object const&) in object_operators.o "_PyUnicodeUCS2_FromEncodedObject", referenced from: _encode_string_unaryfunc in builtin_converters.o "_PyErr_NoMemory", referenced from: boost::python::handle_exception_impl(boost::function0<void>) in errors.o "_PyDict_New", referenced from: boost::python::detail::dict_base::dict_base() in dict.o boost::python::detail::dict_base::dict_base() in dict.o _instance_get_dict in class.o ld: symbol(s) not found for architecture x86_64 clang: error: linker command failed with exit code 1 (use -v to see invocation) "g++" -dynamiclib -Wl,-single_module -install_name "libboost_python.dylib" -o "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/libboost_python.dylib" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/numeric.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/list.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/long.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/dict.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/tuple.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/str.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/slice.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/from_python.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/registry.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/type_id.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/enum.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/class.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/function.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/inheritance.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/life_support.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/pickle_support.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/errors.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/module.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/builtin_converters.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/converter/arg_to_python_base.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/iterator.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/stl_iterator.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object_protocol.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object_operators.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/wrapper.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/import.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/exec.o" "bin.v2/libs/python/build/darwin-4.2.1/release/threading-multi/object/function_doc_signature.o" -headerpad_max_install_names -Wl,-dead_strip -no_dead_strip_inits_and_terms ...failed darwin.link.dll bin.v2/libs/python/build/darwin-4.2.1/release/threading- multi/libboost_python.dylib... ...skipped <pstage/lib>libboost_python.dylib for lack of <pbin.v2/libs/python/build/darwin- 4.2.1/release/threading-multi>libboost_python.dylib... ...failed updating 1 target... ...skipped 1 target... Thanks for your help! Corentin Hamel Software Engineer Rocketboots Level 11, 189 Kent Street Sydney NSW 2000

2 5

boost asio synchronous vs asynchronous operations performance
by Donald Alan 31 Mar '14

31 Mar '14

Hi, I'm trying to compare the performance of boost::asio asynchronous vs synchronous IO operations for a single client. Below, I've sample synchronous and asynchronous server applications, which send 25 byte message to the client in a loop continuously. On the client side, I'm checking at what rate it is able to receive the messages. The sample setup is pretty simple. In synchronous server case, it spawns a new thread per client connection and the thread keeps sending the 25-byte message in a loop. In asynchronous server case as well it spawns a new thread per client connection and the thread keeps sending the 25-byte message in a loop, using asynchronous write (main thread is the one which calls ioservice.run()). For the performance testing I'm using only one client. *Synchronous server code* #include <iostream> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> #include <boost/enable_shared_from_this.hpp> #include <boost/asio.hpp> #include <boost/thread.hpp> using boost::asio::ip::tcp; class tcp_connection : public boost::enable_shared_from_this<tcp_connection> { public: typedef boost::shared_ptr<tcp_connection> pointer; static pointer create(boost::asio::io_service& io_service) { return pointer(new tcp_connection(io_service)); } tcp::socket& socket() { return socket_; } void start() { for (;;) { try { ssize_t len = boost::asio::write(socket_, boost::asio::buffer(message_)); if (len != message_.length()) { std::cerr<<"Unable to write all the bytes"<<std::endl; break; } if (len == -1) { std::cerr<<"Remote end closed the connection"<<std::endl; break; } } catch (std::exception& e) { std::cerr<<"Error while sending data"<<std::endl; break; } } } private: tcp_connection(boost::asio::io_service& io_service) : socket_(io_service), message_(25, 'A') { } tcp::socket socket_; std::string message_; }; class tcp_server { public: tcp_server(boost::asio::io_service& io_service) : acceptor_(io_service, tcp::endpoint(tcp::v4(), 1234)) { start_accept(); } private: void start_accept() { for (;;) { tcp_connection::pointer new_connection = tcp_connection::create(acceptor_.get_io_service()); acceptor_.accept(new_connection->socket()); boost::thread(boost::bind(&tcp_connection::start, new_connection)); } } tcp::acceptor acceptor_; }; int main() { try { boost::asio::io_service io_service; tcp_server server(io_service); } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } *ASynchronous server code:* #include <iostream> #include <string> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> #include <boost/enable_shared_from_this.hpp> #include <boost/asio.hpp> #include <boost/thread.hpp> using boost::asio::ip::tcp; class tcp_connection : public boost::enable_shared_from_this<tcp_connection> { public: typedef boost::shared_ptr<tcp_connection> pointer; static pointer create(boost::asio::io_service& io_service) { return pointer(new tcp_connection(io_service)); } tcp::socket& socket() { return socket_; } void start() { while (socket_.is_open()) { boost::asio::async_write(socket_, boost::asio::buffer(message_), boost::bind(&tcp_connection::handle_write, shared_from_this(), boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } } private: tcp_connection(boost::asio::io_service& io_service) : socket_(io_service), message_(25, 'A') { } void handle_write(const boost::system::error_code& error, size_t bytes_transferred) { if (error) { if (socket_.is_open()) { std::cout<<"Error while sending data asynchronously"<<std::endl; socket_.close(); } } } tcp::socket socket_; std::string message_; }; class tcp_server { public: tcp_server(boost::asio::io_service& io_service) : acceptor_(io_service, tcp::endpoint(tcp::v4(), 1234)) { start_accept(); } private: void start_accept() { tcp_connection::pointer new_connection = tcp_connection::create(acceptor_.get_io_service()); acceptor_.async_accept(new_connection->socket(), boost::bind(&tcp_server::handle_accept, this, new_connection, boost::asio::placeholders::error)); } void handle_accept(tcp_connection::pointer new_connection, const boost::system::error_code& error) { if (!error) { boost::thread(boost::bind(&tcp_connection::start, new_connection)); } start_accept(); } tcp::acceptor acceptor_; }; int main() { try { boost::asio::io_service io_service; tcp_server server(io_service); io_service.run(); } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } *Client code* #include <iostream> #include <boost/asio.hpp> #include <boost/array.hpp> int main(int argc, char* argv[]) { if (argc != 3) { std::cerr<<"Usage: client <server-host> <server-port>"<<std::endl; return 1; } boost::asio::io_service io_service; boost::asio::ip::tcp::resolver resolver(io_service); boost::asio::ip::tcp::resolver::query query(argv[1], argv[2]); boost::asio::ip::tcp::resolver::iterator it = resolver.resolve(query); boost::asio::ip::tcp::resolver::iterator end; boost::asio::ip::tcp::socket socket(io_service); boost::asio::connect(socket, it); // Statscollector to periodically print received messages stats // sample::myboost::StatsCollector stats_collector(5); // sample::myboost::StatsCollectorScheduler statsScheduler(stats_collector); // statsScheduler.start(); for (;;) { boost::array<char, 25> buf; boost::system::error_code error; size_t len = socket.read_some(boost::asio::buffer(buf), error); // size_t len = boost::asio::read(socket, boost::asio::buffer(buf)); if (len != buf.size()) { std::cerr<<"Length is not "<< buf.size() << " but "<<len<<std::endl; } // stats_collector.incr_msgs_received(); } } <b>Question:* When the client is running against synchronous server it is able to receive around 700K msgs/sec but when it is running against asynchronous server the performance is dropped to around 100K-120K msgs/sec. I know that one should use asynchronous IO for scalability when we have more number of clients and in the above case as I'm using only a single client, the obvious advantage of asynchronous IO is not evident. But the question is, is asynchronous IO expected to effect the performance so badly for a single client case or am I missing some obvious best practices to follow with asynchronous IO? Is the significant drop in the performance is because of the thread switch between ioservice thread (which is main thread in the above case) and connection thread? *Setup:* I'm using BOOST 1.47 on Linux machine. -- View this message in context: http://boost.2283326.n4.nabble.com/boost-asio-synchronous-vs-asynchronous-o… Sent from the Boost - Users mailing list archive at Nabble.com.

6 18

[fusion 1.55.0] fusion::map avoid copy construction for elements
by Frank Bergemann 30 Mar '14

30 Mar '14

3 2

[Thread] why isn't it possible to acquire 2 different upgrade_lock from 2 different threads?
by Elad Moshe 30 Mar '14

30 Mar '14

Hi, this is my first post here so please bare with me :) . I recently used upgrade_lock to try access a shared resource from 2 different threads. I noticed that once the first thread acquired its upgrade_lock the second thread was blacked until the first thread unlock it. can someone please explain me the logic behind this behavior? isn't an upgrade lock just a shared_lock that can be upgraded to unique_lock? why not let both threads acquire it just like shared_lock until, and if, they decide to upgrade it to unique_lock? Thanks a lot, Elad.

4 6

cross compiling boost python (64->32bits)
by Stéphane ANCELOT 30 Mar '14

30 Mar '14

Hi, I need to compile boost python from my linux system. the host system is a 64bits , and the target a 32 bit one. when I try using it on the target system, I have this message, ImportError: ./libboost_python.so.1.55.0: undefined symbol: Py_InitModule4_64 So, I suppose it is not compiled for 32bits system . I have tried many things, what is the right way to compile a 32 bits boost python lib, from a linux 64 bits system ? Regards, Steph

2 1

cygwin 64 boost install
by jfrm.maurel＠gmail.com 29 Mar '14

29 Mar '14

Hi, Trying to install boost 1_54 (I had the same problem with 1.55) on my laptop Windows 7 (64bits RAM 6 Go), I have following failure (details in attached file): common.mkdir bin.v2/libs/context/build common.mkdir bin.v2/libs/context/build/gcc-4.8.2 common.mkdir bin.v2/libs/context/build/gcc-4.8.2/release common.mkdir bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64 common.mkdir bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64/link-static common.mkdir bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64/link-static/asm gcc.compile.asm bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64/link-static/asm/make_x86_64_sysv_elf_gas.o libs/context/src/asm/make_x86_64_sysv_elf_gas.S: Messages de l'assembleur: libs/context/src/asm/make_x86_64_sysv_elf_gas.S:43: Avertissement: .type pseudo opérateur utilisé à l'extérieur de .def/.endef ignoré. libs/context/src/asm/make_x86_64_sysv_elf_gas.S:43: Erreur: rebut à la fin de la ligne, premier caractère non reconnu est « m » libs/context/src/asm/make_x86_64_sysv_elf_gas.S:73: Avertissement: .size pseudo opérateur utilisé à l'extérieur de .def/.endef ignoré. libs/context/src/asm/make_x86_64_sysv_elf_gas.S:73: Erreur: rebut à la fin de la ligne, premier caractère non reconnu est « m » "g++" -x assembler-with-cpp -O3 -finline-functions -Wno-inline -Wall -m64 -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64/link-static/asm/make_x86_64_sysv_elf_gas.o" "libs/context/src/asm/make_x86_64_sysv_elf_gas.S" ...failed gcc.compile.asm bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64/link-static/asm/make_x86_64_sysv_elf_gas.o... gcc.compile.asm bin.v2/libs/context/build/gcc-4.8.2/release/address-model-64/link-static/asm/jump_x86_64_sysv_elf_gas.o The process I followed after fresh cygwin 64 install: tar --bzip2 -xf boost_1_54_0.tar.bz2 cd boost_1_54_0/ ./bootstrap.sh #./b2 -j8 --prefix=$PWD --libdir=$PWD/lib64 --layout=tagged link=static threading=multi,single install || echo FAILURE ./b2 --prefix=$PWD --libdir=$PWD/lib64 --layout=tagged link=static threading=single address-model=64 install >build.log Could you please tell me what I am doing wrong ? I have read https://groups.google.com/forum/#!msg/boost-devel-archive/vqK2MXdmUZ0/cvhmd… but don't know if this is related. Regards -- Jean-François MAUREL PIMECA http://www.pimeca.com

2 2

[BOOST Users] serialize a pointer
by Andy Sardina 29 Mar '14

29 Mar '14

Hello, I would like to just serialize a pointer value. I have understood that boost save the pointer value, and serialize the object it points. How can I do?

2 1

[serialization] serialization of an ifstream/ofstream class member
by Pablo Madoery 28 Mar '14

28 Mar '14

Hi. Do You know if there is a way to serialize an ifstream/ofstream class member. I have this class for example class Object { public: Object(); Object(string name); virtual ~Object(); string getName() const; private: string name_; ifstream file_; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & name_; ar & file_; } }; when I try to serialize it throw compilation error : error: 'struct std::basic_ifstream<char>' has no member named 'serialize'. Is there a specific header i must include ?

3 3

[serialization] of nested stl containers
by Pablo Madoery 27 Mar '14

27 Mar '14

I have the following code: #include <list> #include <utility> #include <vector> #include <string> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/access.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/map.hpp> #include <boost/serialization/base_object.hpp> using namespace std; int main() { list< pair<string, string> > stlStr; pair<string, string> par1("aaa", "bbb"); stlStr.push_back(make_pair("key", par1)); std::ofstream ofs("filename"); { boost::archive::text_oarchive serial(ofs); serial << stlStr; } std::ifstream ifs("filename"); boost::archive::text_iarchive serial2(ifs); list<pair<string, string> > lst; serial2 >> lst; return 0; } that throw the following compilation error: error: 'class std::list<std::pair<std::basic_string<char>, std::basic_string<char> > >' has no member named 'serialize'. I'd like to know if I have to manually implement the serialization of this nested list. Because for example I haven't problems with maps that have inside a pair : map<string, pair<string, string> >. Thanks !

3 4

boost::future and when_all => compile error "call to deleted constructor"
by Tobias Oberstein 26 Mar '14

26 Mar '14

Hello, I am trying to use boost::future with continuations, in particular when_all/when_any. I am using Boost trunk from GitHub (since only that has when_all etc). This is what I want to compile: === #include <iostream> #define BOOST_THREAD_PROVIDES_FUTURE #define BOOST_THREAD_PROVIDES_FUTURE_CONTINUATION #define BOOST_THREAD_PROVIDES_FUTURE_WHEN_ALL_WHEN_ANY #include <boost/thread/future.hpp> using namespace boost; int main() { future<int> f1 = async([]() { return 1; }); future<int> f2 = async([]() { return 2; }); auto f3 = when_all(f1, f2); f3.then([](decltype(f3)) { std::cout << "done" << std::endl; }); f3.get(); } === https://gist.github.com/oberstet/9783359 This bails out with /usr/include/c++/v1/memory:1685:31: error: call to deleted constructor of 'boost::future<int>' https://gist.github.com/oberstet/9783364 Am I doing it wrong? Thanks! /Tobias

2 2

[msm] handle errors and no_transition
by Sam Fisher 25 Mar '14

25 Mar '14

Hi, I have root fsm which has a sub-fsm. In the sub-fsm there are some useful actions that can throw exceptions. For that case any fsm has its own exception handler that translates exception into a generic error event: template <typename Event, typename OtherFSM> void exception_caught(Event&, OtherFSM& fsm, std::exception& e) { fsm.process_event(error()); } I faced a strange problem: if an exception occurs, the sub successfully goes to Error state, the root has no_transition I use boost 1.55 and VS2013 there are transition tables: Sub: Error & Finish - exit points A_Exception action generates exception typedef ::boost::mpl::vector<Empty, AllOk> initial_state; struct /*sub*/ transition_table : public ::boost::mpl::vector < // Start Event Next Action Guard // +----------------+---------------+------------------+----------------------+--------------------------+ Row < Empty , none , Waiting , none , none >, Row < Waiting , process , Process , A_Exception , none >, Row < Process , none , Finish , none , none >, // +----------------+---------------+------------------+----------------------+--------------------------+ Row < AllOk , error , Error , none , none > // +----------------+---------------+------------------+----------------------+--------------------------+ > {}; Root: struct S { typedef SubFsm::exit_pt<SubFsm_::Error> Error; typedef SubFsm::exit_pt<SubFsm_::Finish> Finish; }; struct /*root*/ transition_table : public ::boost::mpl::vector < // Start Event Next Action Guard // +----------------+---------------+------------------+----------------------+--------------------------+ Row < Empty , init , Initial , none , none >, Row < Initial , sub , SubFsm , none , none >, // +----------------+---------------+------------------+----------------------+--------------------------+ Row < S::Error , error , Error , none , none >, Row < S::Finish , none , Initial , none , none > // +----------------+---------------+------------------+----------------------+--------------------------+ > {}; the control flow: Root root; root.start(); root.process_event(init()); root.process_event(sub()); root.process_event(process()); output log: =============> start Root_::InitEvent: Enter to Root_ state. Root_::InitEvent: Enter to Root_::Empty state. =============> init Exit from Root_::Empty state. init: Enter to Root_::Initial state. =============> sub Exit from Root_::Initial state. sub: Enter to Root_::SubFsm_ state. sub: Enter to SubFsm_::Empty state. sub: Enter to SubFsm_::AllOk state. Exit from SubFsm_::Empty state. front::none: Enter to SubFsm_::Waiting state. =============> process Exit from SubFsm_::Waiting state. SubFsm_::A_Exception() State machine produces an exception on event process Current state: SubFsm_::Waiting Message: A_Process exception Exit from SubFsm_::AllOk state. error: Enter to SubFsm_::Error state. No transition from state Root_::SubFsm_ on event process Exit from SubFsm_::Waiting state. Exit from SubFsm_::Error state. Exit from Root_::SubFsm_ state. error: Enter to Root_::Error state. A I understood, after exception comes, the "process" event now in kind of "unhandled" state. So it rises up to the root fsm that doesn't have any suitable transition How to make the root or sub to "forget" about unhandled event?

3 4

'Hashable' concept for type erasure
by Samuel Christie 25 Mar '14

25 Mar '14

Hello, I've been trying to add a 'hashable' concept to one of my type erasure requirements, but I haven't been getting anywhere and I still don't understand the voluminous error messages enough to make any progress. Here's approximately what I tried so far: namespace mpl = boost::mpl; namespace te = boost::type_erasure; template<class T> struct hashable { static size_t apply(const T& obj) { return std::hash<T>()(obj); } }; namespace std { template<> class hash<t>{ public : size_t operator()(const test &t ) const { return te::call(hashable<test>(), t); } }; }; typedef mpl::vector< ... hashable<te::_self>, ... > requirements typedef any<requirements> test; namespace std { template<> class hash<test>{ public : size_t operator()(const test&h ) const { return te::call(hashable<test>(), h); } }; }; I also tried something else, similar to the following: template<class C> struct hashable { static std::size_t apply(const C& c) { return c.hash(); } }; namespace boost { namespace type_erasure { template<class C, class Base> struct concept_interface<hashable<C>, Base, C> : Base { std::size_t hash() const { return call(hashable<C>(), *this); } }; } } // ... similar requirements / typedef as above namespace std { template<> class hash<test>{ public : size_t operator()(const test &t ) const { return t.hash(); } }; }; The first one is probably just wrong, and for the second one I'm getting some failed assertions when I try to use it with an implementation of hash that is: size_t hash() const { //coord is a member std::vector<int> return boost::hash_range(coord.begin(), coord.end()); } Any help would be most useful. -sc

2 9

[ANN] CppCon 2014 Call for Submissions
by Boris Kolpackov 25 Mar '14

25 Mar '14

Hi, CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community and so we invite you to present. Have you learned something interesting about C++, maybe a new technique possible in C++11? Or perhaps you have implemented something cool related to C++, maybe a new C++ library? If so, consider sharing it with other C++ enthusiasts by giving a talk at CppCon 2014. Submissions deadline is May 15 with decisions sent by June 13. For topic ideas, possible formats, and submission instructions, see the Submissions page: http://cppcon.org/submissions/ Hope to hear you speak! Boris

1 0

[GSoC 14] Request community to rank proposals
by Niall Douglas 24 Mar '14

24 Mar '14

Dear Boost Community, The Google Summer of Code 2014 proposals for Boost are in, and we would deeply appreciate the community's help in ranking the proposals according to merit before the 1st of April. To vote, the process is easy: 1. Go to this page https://www.google-melange.com/gsoc/homepage/google/gsoc2014 and click the "Log in" button under Mentors and Administrators. 2. Now click "Create Profile" on the same page. Note that even if you registered last year, you must register again in 2014. Fill in the form. Note that after submitting it drops you at "Edit Profile", which is confusing. 3. Click "My Dashboard", then "Connect with organisations". 4. Choose "Boost C++ Libraries". 5. In the message box, write this: "I am a member of the Boost community and the email(s) I normally post to boost mailing lists with is <email>" filling in the email address(es) you normally use to post to boost mailing lists. This lets us verify that you are indeed a long standing member of the Boost community. 6. Once we approve your request, you will get an email with the subject "Welcome as organisation member". You can now return to the Dashboard on the GSoC website where there will be a new item "Proposals". 7. Work your way through as many of the 42 proposals as you can. You can score them using the stars at the bottom of each proposal page, taking care to read any comments by the mentors and students if present. PLEASE try to rank some of the lowest scored proposals, every year we get a lot of people who only rank the top five and don't bother with the rest. Try to score on the basis of (i) proposal quality and your best estimate of the student's capability (ii) if the student came early to the mailing lists to ask for help writing the proposal (the mentors who helped them with their proposals have usually indicated this in the private comments) (iii) usefulness/appropriateness of the feature or work being proposed. Remember a good GSoC is more about getting promising new engineers into Boost and C++ than necessarily getting code to pass Boost peer review in a single summer. 8. Optional: If a proposal looks especially great to you and you feel able to mentor a student this year, please slide the "wish to mentor" button. Just because a proposal already has willing mentors does NOT mean you should not add yourself - we have at least two mentors with many attached very highly ranked proposals and we really don't want to have to reject an outstanding proposal just because we can't find the mentors for it as no mentor can realistically mentor more than two projects simultaneously. As you know, Google Summer of Code is usually worth $35,000 - $50,000 to Boost each year, and a successful GSoC raises our visibility and reputation in the wider open source community. Our thanks to you in advance for taking the time to vote. Niall Douglas Boris Schäling --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

1 0

[boost-build] building dependencies that use makefiles
by Mauricio Carneiro 24 Mar '14

24 Mar '14

I am using boost-build to build my project, but I have added a static library as a dependency that is built using GNU make. If I build this library manually, I can link it to my project in boost build using this simple Jamfile: lib hts : : <link>static <file>lib/lib.a : : <include>lib_headers ; Is there a way to tell boost-build to run make on the directory if the lib/lib.a is not present there? Thank you, Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

2 4

lexical_cast between double and string slow in Visual Studio 2013
by David Roberts 24 Mar '14

24 Mar '14

In Boost 1.54 I have noticed that lexical_cast from double to string and back is much slower in Visual Studio 2013 (Visual C++ 12) than it was in Visual Studio 2010 (Visual C++ 10). The following test program demonstrates the problem: #include <boost/lexical_cast.hpp> #include <string> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::string result(boost::lexical_cast<std::string>(count)); count = boost::lexical_cast<double>(result); } return 0; } It can be built at the Visual Studio command prompt using: cl /O2 /EHsc /DNDEBUG /I\some\path\boost-1_54 lexcast.cpp to give the program lexcast.exe. When built with Visual Studio 2013 this program takes about 10 seconds to run on my machine. When built with Visual Studio 2010 it takes about 3 seconds. Is this already a known issue? If not I can do a bit more investigation to narrow down why it's so much slower, but I don't want to waste my time if this has already been done. Thanks, David

2 1

About log example in visual studio 2008
by Xiande Cao 24 Mar '14

24 Mar '14

Hi, Experts, I was trying to run the log basic usage (libs/log/example/basic_usage/main.cpp) example in visual studio. And it crashed at line logging::add_console_log(std::clog, keywords::format = "%TimeStamp%: %Message%"); Stopped at // For compatibility with Boost.Log v1 we recognize %_% as the message attribute name const std::size_t len = end - begin; if (std::char_traits< char_type >::length(constants::message_text_keyword()) == len && std::char_traits< char_type >::compare(constants::message_text_keyword(), begin, len) == 0) { m_AttrName = log::aux::default_attribute_names::message(); } else { m_AttrName = attribute_name(log::aux::to_narrow(string_type(begin, end))); } Anybody has successfully run the example? Thanks! Regards, Triston

2 6

Boost and Android NDK
by Philipp Kraus 24 Mar '14

24 Mar '14

Hello, I would like to use Boost on Nexus tablets. I have used Boost at the moment on desktop systems (OSX, Linux, Windows), so my question can I use Boost e.g. random, asio, ublas, … on a Nexus? I would like to build Boost myself, so imho I must build Boost with the NDK compilers and linker, is this correct? Can I build Boost libs in "one shot"? So the NDK has got tools for arm-linux, mipsel-linux and so on. Does anybody can tell me any hopeful tips to use Boost with Android Thanks Phil

6 6

Fwd: Reg: named group finding using boost..
by swati upadhyaya 24 Mar '14

24 Mar '14

---------- Forwarded message ---------- From: swati upadhyaya <swatiupadhyaya(a)gmail.com> Date: Mon, Mar 24, 2014 at 11:33 AM Subject: Reg: named group finding using boost.. To: Boost...(a)lists.boost.org Hi @all, I have write a piece of code where I have a patter and a message and I have to fined the group name as well as match. With boost I am able to find the matches but *Is there a way to get a list or whatever of named captures/groups? * *I have check with re2 its present there but boost is much faster than re2.With glib also we dont have option for capturing group.. *

1 0

Re: [Boost-users] [Boost][Range] Immutable range
by Albert Yiamakis 22 Mar '14

22 Mar '14

Hello, Thanks for reply. However, the second method of extending a range: http://www.boost.org/doc/libs/1_55_0/libs/range/doc/html/range/reference/ex… states that specializing both metafunctions is necessary. In particular this: https://gist.github.com/Kojirion/9714131 fails to compile. It will compile - and produce correct result - by commenting out all lines (ie defining a mutable iterator, which really isn't...) Albert

1 0

[Boost][Range] Immutable range
by Albert Yiamakis 22 Mar '14

22 Mar '14

Hello, As far as I can tell from the documentation, it is not possible to create a range with const iterators only. Is this correct? Would it not make sense to have such a range that can be used with non-mutating algorithms only? Albert

2 1

Bind to a member's class method.
by Konrad Rybacki 21 Mar '14

21 Mar '14

Hi, I am rather beginner at boost - I am trying to achieve functionality similiar to property getter/setter from managed languages like C#. I have written the following code: #include "boost\lambda\bind.hpp" #include "boost\variant.hpp" #include "boost\optional.hpp" #include <iostream> #include <map> class Test { public: boost::optional<boost::variant<int, std::string>> m_value; }; int _tmain(int argc, _TCHAR* argv[]) { Test t1, t2; auto b1 = boost::lambda::bind(&Test::m_value, boost::lambda::_1); auto b2 = boost::lambda::bind(Test::m_value::get_value_or, boost::lambda::_1, "empty"); b1(t1) = "Test value"; std::cout << b2(t1); // "Test value" std::cout << b2(t2); // Should be "empty" return 0; } Unfortunately the compilers says: boost_tests.cpp(32): error C3083: 'm_value': the symbol to the left of a '::' must be a type boost_tests.cpp(32): error C2039: 'get_value_or' : is not a member of 'Test' boost_tests.cpp(22) : see declaration of 'Test' boost_tests.cpp(32): error C2065: 'get_value_or' : undeclared identifier boost_tests.cpp(32): fatal error C1903: unable to recover from previous error(s); stopping compilation I'd like to create a bind to Test::m_value.get_value_or() function with the first parameter set to "empty" - any ideas how to achieve that? Regards, Konrad.

2 4

passing pointer as function arg using boost::bind
by Lane 21 Mar '14

21 Mar '14

I'm having a problem passing a pointer as an arg via boost::bind and was hoping anyone could help out. I was able to pass 'a' just fine, but the second arg 'b' I'm having a problem with. Here is what I have. -- namespace NS { class MyThread { int doIt(NS::A a, B *b); // ... A a; B *b = new B(); NS::MyThread f_thread; boost::thread workerThread(boost::bind(&NS::MyThread::doIt, &f_thread, boost::ref(a), boost::ref(b))); Any help much appreciated.

3 2

[lockfree] spsc_queue unqiue_ptr
by Michael Marcin 21 Mar '14

21 Mar '14

Can you store unique_ptrs in a spsc_queue?

2 1

[log] BOOST_LOG_GLOBAL_LOGGER_* in DLL
by Michael Marcin 21 Mar '14

21 Mar '14

I'm trying to use BOOST_LOG_GLOBAL_LOGGER_DEFAULT( my_logger, boost::log::sources::severity_logger_mt<boost::log::trivial::severity_level> ) In a dll but it doesn't appear to be getting initialized. The first BOOST_LOG_SEV results in a crash due to core being null. How do I initialize a global logger in a DLL?

3 6

[Fusion] Issue with map and c++11 (ticket 9455)
by Chris Crickmar 20 Mar '14

20 Mar '14

https://svn.boost.org/trac/boost/ticket/9455 I posted this bug report a few months ago and thought I'd follow up on the mailing list to highlight it. To summarise, in-place construction of a class containing a fusion map is broken since 1.55 with gcc 4.8/4.7 in c++11 mode. The problem is not present with c++11 mode disabled or when using previous boost versions (tested with 1.51 & 1.54). I re-tested this issue today using git master and the issue is still present. Chris Crickmar

2 1

Boost.Compute v0.1 Released
by Kyle Lutz 20 Mar '14

20 Mar '14

I'm proud to announce the initial release (version 0.1) of Boost.Compute! It is available on GitHub [1] and instructions for using the library can be found in the documentation [2]. Boost.Compute is a GPGPU and parallel-programming library based on OpenCL. It provides an STL-like API and implements many common containers (e.g. vector<T>, array<T, N>) as well as many common algorithms (e.g. sort(), accumulate(), transform()). A full list can be found in the header reference [3]. I hope to propose Boost.Compute for review in the next few months but for I'm looking for more wide-spread testing and feedback from the Boost community (please note the FAQ [4] and design rationale [5] where I hope to have answered some common questions). Thanks, Kyle [1] https://github.com/kylelutz/compute [2] http://kylelutz.github.io/compute/ [3] http://kylelutz.github.io/compute/compute/reference.html [4] http://kylelutz.github.io/compute/boost_compute/faq.html [5] http://kylelutz.github.io/compute/boost_compute/design.html

7 8

Multiprecision support for serialization
by Michael Crawford 19 Mar '14

19 Mar '14

I noticed that the 1.55 documentation has a page regarding support for boost::serialization: http://www.boost.org/doc/libs/1_55_0/libs/multiprecision/doc/html/boost_mul… However, the page is broken at the moment. Can anyone fix this page or let me know what the status is for serialization of multiprecision types?

2 1

[ICL] Can't use an enum as map value
by Oodini 19 Mar '14

19 Mar '14

Hello, I declared an interval_map : interval_map<uint16_t, SomeEnumType> myMap; Later, I do : SomeEnumType enumValue = SOME_ENUM_VALUE; myMap.add(std::make_pair(disxrete_interval<uint16_t>(10,17), SOME_ENUM_VALUE); But that doesn't compile. It seems that ICL wants the += operator must eb defined for value type (why ???). What can I do ? Thanks.

3 4

[ICL] Map & insertion
by Oodini 19 Mar '14

19 Mar '14

Hello, I declared an interval_map : interval_map<uint16_t, SomeEnumType> myMap; and two intervals : discrete_interval<uint16_t>( 0,10) interval_1; discrete_interval<uint16_t>(10,17) interval_2; Later, I do : myMap.insert(std::make_pair(interval_1, SOME_ENUM_VALUE_1); myMap.insert(std::make_pair(interval_2, SOME_ENUM_VALUE_2); The second insertion hasn't any effect. I tought that by default, the upper bound was excluded. If so, there isn't any overlapping. So why does that failt ? By debugging, I cna see that somewhere in the ICL code, the second value is tested as "absorbable"... Thanks for help.

1 1

ICL & time intervals
by Oodini 19 Mar '14

19 Mar '14

Hello, Is it possible to define with ICL the time range [23:00 -> 05:00] with only one interval ? Thanks.

2 2

Boost InterProcess Shared Memory: Grow()
by Sunanda Chowdhary 19 Mar '14

19 Mar '14

> > Hi, > > I am new to Shared memory functionality. I have a question related to > grow(). > > 1. For growing a memory we need to first un-map the memory and then map it > again. Suppose before un-map base address of shared memory is X then after > growing will the base address be changed or extra segment of memory will be > added to existing memory keeping base address same? > > More specifically, will the entire memory (original + extra grow memory) > be reallocated as one chunk or mere addition of an extra chunk is done? > > 2. If entire memory (original + extra grow memory) is reallocated after > growing then how to manage previously allocated memory that is the shared > memory which was being used before grow was called (original)? Does grow > takes care of deleting it? > > By posing this query I am more concerned about memory leaks. Please help. Thanks >

1 0

[ICL] Search for an interval in a map
by Oodini 18 Mar '14

18 Mar '14

Hello, Let's suppose I have a map with 3 intervals : [0,5), [5,10), [10,15) If I want to apply the "find" function by giving as argument the interval [7,12), the documentation says I'll get an iterator to the first intervall overlapping with the given interval. So the result should be [5,10). Isn't there any way to have a pair of iterators (begin and end), as std::multimap::equal_range() ?

1 0

[ANN] Registration for CppCon 2014 is Open
by Boris Kolpackov 18 Mar '14

18 Mar '14

CppCon, The C++ Conference Opening Keynote by Bjarne Stroustrup September 7–12, 2014 Bellevue, Washington, USA Registration is now open for CppCon 2014 to be held September 7–12, 2014 at the Meydenbauer Center in Bellevue, Washington, USA. This year the conference starts with the keynote by Bjarne Stroustrup titled "Make Simple Tasks Simple!" CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community. You will enjoy inspirational talks and a friendly atmosphere designed to help attendees learn from each other, meet interesting people, and generally have a stimulating experience. Taking place this year in the beautiful Seattle neighborhood and including multiple diverse tracks, the conference will appeal to anyone from C++ novices to experts. What you can expect at CppCon: * Invited talks and panels: CppCon keynote by Bjarne Stroustrup will start off a week full of insight from some of the world’s leading experts in C++. Still have questions? Ask them at one of CppCon's panels featuring those at the cutting edge of the language. * Presentations by the C++ community: What do embedded systems, game development, high frequency trading, and particle accelerators have in common? C++, of course! Expect talks from a broad range of domains focused on practical C++ techniques, libraries, and tools. * Lightning talks: Get informed at a fast pace during special sessions of short, informal talks. Never presented at a conference before? This is your chance to share your thoughts on a C++-related topic in an informal setting. * Evening events and "unconference" time: Relax, socialize, or start an impromptu coding session. CppCon’s goal is to encourage the best use of C++ while preserving the diversity of viewpoints and experiences, but other than that it is non-partisan and has no agenda. The conference is a project of the Standard C++ Foundation, a not-for-profit organization whose purpose is to support the C++ software developer community and promote the understanding and use of modern, standard C++ on all compilers and platforms. For more information about the conference and to register, visit: http://cppcon.org

1 0

[Boost.polygon.voronoi] [Boost.multiprecision] higher precision voronoi
by Weatherby,Gerard 17 Mar '14

17 Mar '14

I'm attempting to following the http://www.boost.org/doc/libs/1_53_0_beta1/libs/polygon/doc/voronoi_advance… to compile boost::polygon::voronoi using 64 bit integer input. I'm using the boost::multiprecision library to do so. Using boost version 1.53 and Microsoft Visual Studio 2012. The error message is: 1>d:\workspace\movingboundary\boost_1_53_0\boost\polygon\detail\voronoi_robust_fpt.hpp(60): error C2665: 'sqrt' : none of the 3 overloads could convert all the argument types 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\math.h(588): could be 'long double sqrt(long double)' 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\math.h(540): or 'float sqrt(float)' 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\math.h(127): or 'double sqrt(double)' 1> while trying to match the argument list '(const boost::multiprecision::detail::expression<tag,Arg1,Arg2,Arg3,Arg4>)' 1> with 1> [ 1> tag=boost::multiprecision::detail::multiplies, 1> Arg1=boost::multiprecision::detail::expression<boost::multiprecision::detail::multiplies,boost::multiprecision::detail::expression<boost::multiprecision::detail::plus,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::plus,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,void,void>,void,void>, 1> Arg2=boost::multiprecision::detail::expression<boost::multiprecision::detail::plus,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,void,void>, 1> Arg3=void, 1> Arg4=void == reference line is template <typename T> T get_sqrt(const T& that) { return (std::sqrt)(that); //<-- line 60 } == code == #pragma warning (disable: 4996 4267) #include <cmath> #include <boost/multiprecision/cpp_int.hpp> #include <boost/multiprecision/cpp_dec_float.hpp> #include <boost/polygon/voronoi.hpp> #include <limits> #include <gtest/gtest.h> #include <iostream> using namespace boost::polygon; namespace vcellVoronoiImpl { typedef boost::multiprecision::number<boost::multiprecision::cpp_dec_float<48>> floatingType; struct FloatingConverter { template <typename T> floatingType operator( )(T x) const { return static_cast<floatingType>(x); } }; struct compareFloatingType { enum Result { LESS = -1, EQUAL = 0, MORE = 1 }; Result operator()(floatingType a, floatingType b, unsigned int maxUlps) const { if (a > b) { return a - b <= maxUlps ? EQUAL : LESS; } return b - a <= maxUlps ? EQUAL : MORE; } }; struct voronoi_ctype_traits { typedef boost::int64_t int_type; typedef boost::multiprecision::int128_t int_x2_type; typedef boost::multiprecision::uint128_t uint_x2_type; typedef boost::multiprecision::int512_t big_int_type; typedef floatingType fpt_type; typedef floatingType efpt_type; typedef compareFloatingType ulp_cmp_type; typedef FloatingConverter to_fpt_converter_type; typedef FloatingConverter to_efpt_converter_type; }; struct vcell_vd_traits{ typedef voronoi_ctype_traits::fpt_type coordinate_type; typedef voronoi_cell<coordinate_type> cell_type; typedef voronoi_vertex<coordinate_type> vertex_type; typedef voronoi_edge<coordinate_type> edge_type; typedef struct { public: enum { ULPS = 128 }; bool operator()(const vertex_type &v1, const vertex_type &v2) const { return (ulp_cmp(v1.x(), v2.x(), ULPS) == compareFloatingType::EQUAL && ulp_cmp(v1.y(), v2.y(), ULPS) == compareFloatingType::EQUAL); } private: compareFloatingType ulp_cmp; } vertex_equality_predicate_type; }; } using namespace vcellVoronoiImpl; TEST(highv,build) { voronoi_builder<boost::int64_t, vcellVoronoiImpl::voronoi_ctype_traits> vb; voronoi_diagram<boost::int64_t,vcell_vd_traits> vd; vb.construct(&vd); } Gerard Weatherby Appllication Architect Virtual Cell, Center for Cell Analysis and Modeling (CCAM) University of Connecticut Health Center 860-679-2065

3 4

Re: [Boost-users] boost::geometry::index::rtree with CoordinateSystem
by Ola Martin Lykkja 16 Mar '14

16 Mar '14

>> Hi, >> >> I am trying to build a rtree index with a collection of waypoint >> (about 30.000) each represented by longitude and latitude. When I use >> Cartesian coordinates rtree.query works as expected. However the >> results are slightly wrong because of my use of longitude,latitude in >> the cartesian domain. >> >> I then tried to refine the datatypes to use spherical_equatorial and >> geographic CoordinateSystem. Now I encounter two problems: >> a)With geographic, it does not compile. >> b)With spherical_equatorial query(nearest) gives clearly wrong results. >> >> Do you have any clues on what I am doing wrong? > >Everything you're doing is ok. > >The support for coordinate systems other than cartesian is limited for now. As you noticed the nearest query gives >wrong results. Also the internal structure of the rtree may be not-optimal. At least the nearest query for spherical >CS should be fixed in upcoming Boost 1.56. Do you need some quick workaround? > >As for geographic CS, it fails to compile because the default distance strategy isn't defined for this CS. It >probable that distance() is just not implemented yet for geographic CS but I must confirm it. > >Could you please create tickets for those issues? > >Regards, >Adam First: I am pretty impressed with the index::rtree template. It is *VERY* useful in my current project! Thanks for your reply! For my application, I am ok, for the moment, with the relatively small errors that using the cartesian domain gives me. I have created two tickets (9758 and 9759) What is the difference between spherical_equatorial and geographic and spherical? The documentation is rather unclear. Kind regards, Ola Martin

2 1

[multi-array] Is default initialization guaranteed?
by Eugenio Bargiacchi 15 Mar '14

15 Mar '14

Hello, I'm trying to figure out whether boost::multi_array does guarantee any initialization on its elements, since I can't find an explicit mention of this in the docs. I've noticed that all constructors of boost_multi array call the function allocate_space(), which is defined as follows: void allocate_space() { typename Allocator::const_pointer no_hint=0; base_ = allocator_.allocate(this->num_elements(),no_hint); this->set_base_ptr(base_); allocated_elements_ = this->num_elements(); std::uninitialized_fill_n(base_,allocated_elements_,T()); } Thus, std::uninitialized_fill_n should set all values to their default ones, right? For example, a boost::multi_array containing doubles is guaranteed to be zeroed at constructions, am I correct? Or are there cases where there's no guarantee of initialization, and that is why the documentation does not mention it? Thanks in advance. Best regards, Eugenio Bargiacchi

1 0

Boost Log
by Manuel Torres 14 Mar '14

14 Mar '14

Hello, I am using Boost Log 1.55 with MinGW 32-bits (GCC v.4.8.1) under Windows 7 64-bits and it seems that the "AutoFlush" parameter is not working when a settings file is used. I thought it might have to do with the "Asynchronous" parameter but, after setting four sinks with the combinations of "AutoFlush" and "Asynchronous", I got the same result: the log files are only created after the application is closed. I would appreciate if someone could help. This is the settings file I am testing with: [Core] DisableLogging=false Filter="%Severity% < 6" [Sinks.ConsoleSink] Destination=Console Format="[%TimeStamp%] <%Severity%> %Channel%: %Message%" Asynchronous=true AutoFlush=true [Sinks.TextFileSink0] Destination=TextFile FileName="0_%Y%m%d%H%M%S_Node_%N.log" Format="[%TimeStamp%] <%Severity%> %Channel%: %Message%" Asynchronous=true AutoFlush=true Target="../log" RotationSize=1000000 RotationTimePoint="00:00:00" MaxSize=10000000 [Sinks.TextFileSink1] Destination=TextFile FileName="1_%Y%m%d%H%M%S_Node_%N.log" Format="[%TimeStamp%] <%Severity%> %Channel%: %Message%" Asynchronous=true AutoFlush=false Target="../log" RotationSize=1000000 RotationTimePoint="00:00:00" MaxSize=10000000 [Sinks.TextFileSink2] Destination=TextFile FileName="2_%Y%m%d%H%M%S_Node_%N.log" Format="[%TimeStamp%] <%Severity%> %Channel%: %Message%" Asynchronous=false AutoFlush=true Target="../log" RotationSize=1000000 RotationTimePoint="00:00:00" MaxSize=10000000 [Sinks.TextFileSink3] Destination=TextFile FileName="3_%Y%m%d%H%M%S_Node_%N.log" Format="[%TimeStamp%] <%Severity%> %Channel%: %Message%" Asynchronous=false AutoFlush=false Target="../log" RotationSize=1000000 RotationTimePoint="00:00:00" MaxSize=10000000

2 2

[asio] resolver::cancel() problem
by Matthew Edwards 14 Mar '14

14 Mar '14

In my application (and a separate test program) it seems as though the cancel() function on the resolver does not work as intended. For async resolves, the cancel functionality should abort them immediately and pass an 'operation aborted' error code to the callback handler. In my tests, I will resolve an invalid domain (this causes the resolve to take a few seconds, to demonstrate the problem), sleep for 100ms, then call cancel on the resolver object. No cancelling actually occurs, and the callback is simply triggered after a few seconds with a "No host found" error code, not the expected operation aborted. Has anyone experienced this before, or know how I might be using the resolver incorrectly?

3 2

[Graph] Guarantee on bidirectional graphs
by Sensei 14 Mar '14

14 Mar '14

Dear all, I am implementing my custom algorithm for path discovery (as in a recent post), and I'd like to know one simple thing. My graph is a bidirectional sparse compressed row graph, and I need to represent a *directed* graph with that (I need in and out edges). So, is the order of nodes in an edge guaranteed to generate the correct in/out adjacent nodes? I do not care about ordering of nodes, just distinguishing nodes that belong to in and out edges. For instance, given a directed graph that has node 4 with two out edges to 5 and 6, and 4 in edges from 1, 2, and 3, am I guaranteed that, even if the graph is bidirectional, the in and out edges will be unaffected and won't be swapped? Moreover, when I dump the indices of out edges, the results seem to be right, but when I dump the in edges, results are erroneous. I must be doing something really wrong... And one more thing: I have tried my code with just using the stream output as in http://programmingexamples.net/wiki/CPP/Boost/BGL/DirectedGraph, just using std::cout << neighbors_out.first << std::endl; clang complains: main.cpp:165:19: error: invalid operands to binary expression ('ostream' (aka 'basic_ostream<char>') and 'boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::bidirectionalS, boost::no_property, boost::no_property, boost::no_property, unsigned long, unsigned long> >') std::cout << neighbors_out.first << std::endl; ~~~~~~~~~ ^ ~~~~~~~~~~~~~~~~~~~ while if I use the following, it compiles just fine (but as I said, the output is wrong): std::cout << neighbors_out.first->idx << std::endl; See the snippet for an example. Thanks & Cheers! typedef boost::compressed_sparse_row_graph<boost::bidirectionalS> boost_graph; typedef boost::graph_traits<boost_graph>::vertex_iterator vertex_iterator; typedef boost::graph_traits<boost_graph>::adjacency_iterator adjacency_iterator; typedef boost::graph_traits<boost_graph>::out_edge_iterator outward_iterator; typedef boost::graph_traits<boost_graph>::in_edge_iterator inward_iterator; // ... std::vector<std::pair<std::size_t, std::size_t>> results; results.push_back(std::make_pair( 0, 1)); results.push_back(std::make_pair( 0, 3)); results.push_back(std::make_pair( 1, 4)); results.push_back(std::make_pair( 2, 4)); results.push_back(std::make_pair( 3, 4)); results.push_back(std::make_pair( 4, 5)); results.push_back(std::make_pair( 4, 6)); results.push_back(std::make_pair( 5, 7)); results.push_back(std::make_pair( 7, 8)); results.push_back(std::make_pair( 8, 9)); results.push_back(std::make_pair( 8, 11)); results.push_back(std::make_pair( 8, 12)); results.push_back(std::make_pair( 9, 10)); results.push_back(std::make_pair(12, 10)); // Create the graph boost_graph graph(boost::edges_are_unsorted_multi_pass, results.begin(), results.end(), 13); std::cout << "Outward adjacents" << std::endl; std::pair<outward_iterator, outward_iterator> neighbors_out; neighbors_out = boost::out_edges(boost::vertex(4, graph), graph); for(; neighbors_out.first != neighbors_out.second; ++neighbors_out.first) { std::cout << neighbors_out.first->idx << std::endl; } std::cout << "Inward adjacents" << std::endl; std::pair<inward_iterator, inward_iterator> neighbors_in; neighbors_in = boost::in_edges(boost::vertex(4, graph), graph); for(; neighbors_in.first != neighbors_in.second; ++neighbors_in.first) { std::cout << neighbors_in.first->idx << std::endl; } == OUTPUT == Outward adjacents 5 6 Inward adjacents 2 3 4

2 4

cpp_rational memory bloat with repeated construction and destruction
by W Randolph Franklin 14 Mar '14

14 Mar '14

Hi, My application, overlay, constructs and destroys millions of cpp_rational variables. As overlay executes, its memory continually grows. My variables don't have that many digits, but each time that they are constructed or destroyed, they are slightly wider or narrower. W/o studying the cpp_rational source, I surmise that it uses a heap that gets badly fragmented. Apart from the space, each single allocation is probably taking ever more time. That's annoying because overlay otherwise would take linear time. What should I do? Are there easy ways to control this problem? Are other rational implementations better? Boost gives me a choice of several. Are there better implementations outside boost? ----- Not that it's relevant, but FYI, my application is to overlay two planar graphs, intersecting all the edges to find the output faces. There might be 100,000 edges. Roundoff error is a serious problem that causes topological impossibilities. The idea is to use rationals to prevent roundoff. Upon reading each input float, I use a continued fraction approximation to convert it to the closest rational justified by the number of significant digits. That entails constructing and destroying variables of varying widths as the approximation converges. This is probably what is thrashing the memory. However if I don't do that, the values start by having perhaps 20 digits, which doubles each time as line equations are computed and lines intersected. Perhaps I could restructure my code to avoid that. However IMHO, it is quite well structured now, and making it ugly to be fast would be a pity. Help? Thanks.

2 1

Indirectly 'recursive' type erasure
by Samuel Christie 13 Mar '14

13 Mar '14

I'm trying to create a type erasure concept for a type that has a member function which can return a custom collection of itself. Having had little luck with the general formulation, I tried simplifying it to: BOOST_TYPE_ERASURE_MEMBER((has_collection), collection, 0); typedef any< mpl::vector< copy_constructible<>, typeid_<>, relaxed, has_collection<vector<_self>()> > > test; class Test { public: vector<test> collection(); }; However, I get conversion errors if the Test::collection method returns either vector<Test> or vector<test>; it only seems to match if I have it literally return vector<_self>, which implies to me that I'm not understanding what I'm doing, and that _self isn't getting substituted in this case. What do I need to do in order to be able to return types that are dependent on the erasure type? My actual code uses a more indirect relationship, with the collection method returning a custom erased collection type that has an erased iterator that can dereference to the equivalent of Test. However, since there is still a form of cyclic dependency, I'm not really sure what I can do about it. I've tried using a custom struct based concept that had direct template arguments in the place of 'boost type erasure member', but I think I understand that technique even less, and it didn't seem to help much. It looked like there might be something useful under the Associated Types section of the type erasure documentation, but I couldn't quite figure it out. Any assistance would be most helpful. Thanks, -sc

2 5

[Coroutine] Assertion when coroutine is not run
by Brian Ravnsgaard Riis 13 Mar '14

13 Mar '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, I've been toying with Boost.Coroutine lately. For starters I have tried to implement a message parser using the library. For this purpose I have two coroutine<char>::push_type in a containing class. These are initialized at class construction with a lambda. One coroutine parses the message header, the other the body. This all worked fine. Until I had a test case where I was only interested in the message header, so I never called the message-body-coroutine. At object destruction I get a this assertion: replyparser: /usr/local/include/boost/coroutine/detail/push_coroutine_object.hpp:167: void boost::coroutines::detail::push_coroutine_object<char, <lambda at src/replyparser.cpp:303:22>, boost::coroutines::detail::standard_stack_allocator, std::allocator<boost::coroutines::push_coroutine<char> >, boost::coroutines::pull_coroutine<char> >::run() [X = char, Y = <lambda at src/replyparser.cpp:303:22>, Z = boost::coroutines::detail::standard_stack_allocator, V = std::allocator<boost::coroutines::push_coroutine<char> >, W = boost::coroutines::pull_coroutine<char>]: Assertion `hldr_from->data' failed. The message-body coroutine is really simple; it just takes the characters and stuffs them into a std::string until the string size is equal to the expected length of the body (parsed from the header): [&](coroutine<char>::pull_type& c) { content.push_back(c.get()); while(content.size() != contentLength) { c(); content.push_back(c.get()); } validResult = true; } This works just fine when I parse the message body, but when I (choose to) ignore the message body, so the coroutine is never called, I get the above assertion. I have a feeling I'm missing some obvious detail about this. Of course I would normally not skip the message body, but there is a chance the length is 0, i.e. there *is* no message body. I'd prefer to have no assertions in that case. What am I doing wrong? /Brian Riis -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.12 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTHQlPAAoJEFES4N8QrEodJ+MH/1z+N+YnXrCm3xPnp7wAlM+w 3RZkeNOOJ0h67nmBHRJXj3A3+t/Hy+FZV/SUBDMtCwx/zIH5fZZtsBaw89frAsdI SPmLiwG6NgBoBSV8Pih4gD+k4LvTbYh5AQLF2ssB/WAVZODk92iz4sNrNFVwThFn S68NStkEyyXElrCzkd3w0QQD8sD2OGWAW0YlHLGhUXlsouWRyd9VKAbEXdrTKLVQ I0ciL87AzOKsfrfV89U1eQh5uHEgg8ZcDa459ieqeOISXhNJI/ba8rv6mkXGEseB U7wRr7M1XMdHolPiFlUEKrUocdAPLS/AjeVfcGkJSzc2bhka08qu4EMTgqkOhtY= =G1Y2 -----END PGP SIGNATURE-----

2 10

managed shared memory with basic_string
by Sean K 12 Mar '14

12 Mar '14

I am new to boost so please pardon if this question has already been asked. I was able to build a shared memory IPC client and server using "int" primitive type successfully. I need to send a fixed number of "char" (primitive type). At first I tried to define a struct of a fixed char struct { char data[1024]; } dataset; typedef dataset mychararray; and use this like how this example shows for 'int" http://en.highscore.de/cpp/boost/interprocesscommunication.html#interproces… But for some reason it did not compile due to the boost::interprocess::managed_shared_memory.construct () not accepting that kind of datatype. So, I looked at the basic_string implementation based on these two web sites. http://prakharprakhar.blogspot.com/2009/12/boost-shared-memory-vector.html http://en.highscore.de/cpp/boost/interprocesscommunication.html#interproces… (basic_string variant) I am built a reader and writer separate app. The reader will look for content. If it does not find it, it will wait or sleep and try again, etc. If it finds something it will try to print the basic_string content that I sent over. I thought I had it correctly built but obviously it is not since the reader server crashes or cores when it tries to access the p.first content. Below are the two programs (along with the build.sh which compiles each). I am testing this as a 32 bit app on a 64 bit redhat5 and 32 bit centos6. You will notice in the strreader.cc that when I try to access the basic_string, that it crashes. I ran the reader (server) within the 32 bit eclipse debugger, and the memory addresses and content of the p BStringPair looks fine. Anybody have some ideas or can anybody try this and see what you can tell what is wrong. strreader.cc #include <iostream> #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/thread/thread.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <iostream> #include <string> #include <cstdlib> using namespace std; using namespace boost::interprocess; int main() { typedef boost::interprocess::allocator<char, boost::interprocess::managed_shared_memory::segment_manager> ShmemAllocator; typedef basic_string<char, std::char_traits<char>, ShmemAllocator> BString; typedef std::pair<BString *, std::size_t> BStringPair; int count = 0; shared_memory_object::remove("Highscore"); while (true) { managed_shared_memory segment(open_or_create, "Highscore", 65536); if (segment.get_num_named_objects() > 0){ BStringPair p = segment.find<BString> ("str"); printf("stuff in memory\n"); if (p.first ){ // THIS IS WHERE IT CRASHES!!! //printf("%s \n",(p.first->c_str()) ); //int strlen = p.first->size(); } printf("p.second: %d \n", p.second); } shared_memory_object::remove("Highscore"); //printf("one: %s", one.first); //printf("two: %s", two.first); int msecs = 2000; boost::this_thread::sleep(boost::posix_time::milliseconds(msecs)); printf("sleeping...\n"); } return 0; } build.sh for the reader g++ -m32 -fPIC -Xlinker -zmuldefs strreader.cc -o strreader -I/common/COTS/boost_1_42_0/include -L/common/COTS/boost_1_42_0/lib -lboost_thread -lboost_system -pthread strwriter.cpp #include <iostream> #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/thread/thread.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/string.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <iostream> #include <string> #include <cstdlib> using namespace std; using namespace boost::interprocess; int main() { typedef boost::interprocess::allocator<char, boost::interprocess::managed_shared_memory::segment_manager> ShmemAllocator; typedef boost::interprocess::basic_string<char, std::char_traits<char>, ShmemAllocator> BString; try { shared_memory_object::remove("Highscore"); printf("cleared out memory\n"); managed_shared_memory segment(open_or_create, "Highscore", 65536); printf("initialized managed shared memory \n"); ShmemAllocator allocInst (segment.get_segment_manager()); BString bstrData(segment.get_segment_manager()); bstrData = "hello"; std::string data = "Hello"; //BString bstrToSend(data.begin(), data.end()); //BString bstrToSend(data.c_str()); BString *mystring = segment.construct<BString> ("str")(bstrData); //mystring="Hello"; printf("inserted mystring into shmvector \n"); } catch (boost::interprocess::bad_alloc e) { printf("we caught bad alloc\n"); printf("explanation: %s", e.what()); throw; } catch (...) { printf("caught unknown exception\n"); throw; } printf("wrote number"); return 0; } build.sh for the writer: g++ -m32 -fPIC -Xlinker -zmuldefs strwriter.cpp -o strwriter -I/common/COTS/boost_1_42_0/include -L/common/COTS/boost_1_42_0/lib -lboost_thread -lboost_system -pthread -- Sean

2 3

[Boost.Preprocessor] Why BOOST_PP_SEQ_CAT with a sequence of comma separated pair is a missuse ?
by Albert 11 Mar '14

11 Mar '14

Hello, I tried to use the BOOST_PP_SEQ_CAT with a sequence of parenthesized comma-separated pair of token. It works fine with visual 2010 but fails with gcc. I first think that there were a problem in the specific gcc implementation part. That's why I opened the issue 9633 : https://svn.boost.org/trac/boost/ticket/9633 But, it has recently been closed for invalidity, the corrector telling that it is not a valid use. I have not read the entire help of the PP library but as far as I understand the sequence definition given in A.4.5.1. (http://www.boostpro.com/mplbook/preprocessor.html) as "any string of nonempty parenthesized /macro arguments/." and the definition of macro arguments in A.2.3, I fail to see why the sequence could be incorrect. Specially when I read the end of the paragraph : " It /is/ possible to pass either string of tokens above as part of a single macro argument, provided it is parenthesized: FOO(*(*std::pair<int,int>*)*) // one argument FOO(*(*{ int x = 1, y = 2; return x+y; }*)*) // one argument " I fail to see where in the dedicated entry for BOOST_PP_SEQ_CAT (http://www.boost.org/doc/libs/1_55_0/libs/preprocessor/doc/ref/seq_cat.html) there is a rule I violated. So my questions are : => why the code I proposed is invalid ? => Is the workaround proposed with BOOST_PP_SEQ_FOR_EACH is also a missused and may fail according to evolutions of the library ? Thanks in advance for your answers. The code : #include <boost\preprocessor\seq\cat.hpp> #define SOME_SEQUENCE (('a',1)) (('b',2)) (('c',3)) (('d',4)) (('e',5)) struct dummy { dummy& operator()(char,int) {return *this;} }; int main() { dummy() BOOST_PP_SEQ_CAT(SOME_SEQUENCE); // Visual 2010 generates dummy() ('a',1)('b',2)('c',3)('d',4)('e',5); // gcc fails with compiler errors due to the comma I suppose return 0; }

2 1

boost::serialization - Serialization (non intrusive) of a map containing in and structure.
by Brian Davis 11 Mar '14

11 Mar '14

I am using boost 1.41.0 and MS VS 2008. I have been having trouble serializing a map which contains a int (key) and structure value. I create a simple test app to aid in the discussion. I am attempting to perform a non intrusive serialization of the structure. I had in the past been able to serialize a map of <int,string> successfully, but now that the map is <int, non_intrusive> where non_intrusive is the name of my strut, I get an error: 2>Windows-6.1\install\include\boost-1_41\boost/serialization/access.hpp(109) : error C2039: 'serialize' : is not a member of 'non_intrusive' and the line in boost is: template<class Archive, class T> static void serialize( Archive & ar, T & t, const unsigned int file_version ){ t.serialize(ar, file_version); // serialize( ar, t, file_version ); } Where if I change the line t.serialize(ar, file_version); to serialize( ar, t, file_version ); and then it compiles. Which of course I know I should not do, but only did so to see if I could get it to call my template specialization for my serialize code of my strut with out having to perform in intrusive serialization and agian was just a test to see if boost would call my serialize function. I have revered this so fear not... this is not the problem. namespace boost { namespace serialization { template<class Archive> void serialize( Archive& ar, non_intrusive& ni ){ ar & ni.a; } which is of course wrapped in the boost::serialization namespace... full example below I am guessing I have not done something correctly and I have been successful in the past as I said serializing structures, vectors, and maps. This is the first time I tried to serialize a map with a struct. I also converted my code (not the example) to use a vector of std::pair<int, non_intrusive> and got the same error. Here is the full program listing any help would be appreciated: //------------------------------------------------------------------------------------------- #include <string> #include <fstream> #include <algorithm> #include <boost/filesystem.hpp> #include <boost/filesystem/fstream.hpp> #include <boost/serialization/utility.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/map.hpp> struct non_intrusive{ int id; std::string name; }; typedef std::map<int, non_intrusive> a_map_t; namespace boost { namespace serialization { // Not sure if I need to do this bit, but I have seen references to this // syntax on the web. template<class Archive> void serialize( Archive& ar, std::pair<int, non_intrusive> & ni_pair ){ ar & std::pair<int, non_intrusive>( ni_pair ); } template<class Archive> void serialize( Archive& ar, non_intrusive& ni ){ ar & ni.a; } }} void save ( const a_map_t& map_var, const std::string& file_name ) { boost::filesystem::path file_path = file_name; boost::filesystem::path pathstr = file_path.remove_leaf(); if( pathstr != "" ) boost::filesystem::create_directory( pathstr ); std::ofstream ofs( file_name.c_str(), std::ios_base::out | std::ios_base::trunc); boost::archive::xml_oarchive xml(ofs); xml << BOOST_SERIALIZATION_NVP( map_var ); } // +---------------------------------------------------------------------- a_map_t load(const std::string& file_name) { a_map_t map_var; // std::ifstream ifs(file_name.c_str(), std::fstream::binary | std::fstream::in); std::ifstream ifs(file_name.c_str() ); if( !ifs ) { non_intrusive od; od.id = -1; od.name = "unknown device"; map_var.insert( a_map_t::value_type( 0, od ) ); save( map_var, file_name ); }else { boost::archive::xml_iarchive xml(ifs); xml >> BOOST_SERIALIZATION_NVP( map_var ); } return map_var; } // +---------------------------------------------------------------------- int main( void ){ a_map_t map; map = load("map.xml"); save(map, "map.xm" ); }

2 2

error with static assert and floating-point detection
by Philipp Kraus 11 Mar '14

11 Mar '14

Hello, I try to use Boost Static Assert to define a template parameter only for double & floats. I use the call BOOST_STATIC_ASSERT( !boost::is_integral<T>::value ) I get in a class the error: error: no member named 'is_integral' in namespace 'boost' BOOST_STATIC_ASSERT( !boost::is_integral<T>::value ) My question is, how can I check the template parameter so that only floating-point types are allowed? How can I avoid the error? Thanks Phil

2 1

boost::asio::io_service::poll_once vs EPOLLET
by Jason Aubrey 11 Mar '14

11 Mar '14

The conditional define of boost::asio::io_service that uses epoll always seems to use edge triggered (ET) flag instead of level triggered (LT). This makes me think poll_once should be avoided due to Scenario 1 below. Can anyone confirm this? Given: 1) 2 sockets (A and B) added to epoll interface for receiving only 2) 2 UDP messages arrive in the same moment on socket A 3) epoll_wait returns a ready socket (socket A) Scenario 1: Using ET with poll_once: 4) If io_service::poll_once is called 1 of 2 messages are read 5) epoll_wait(ET) blocks until another message is received Result: Bad, starvation if another message is not received Scenario 2: Using ET with poll: 4) If io_service::poll is called 2 of 2 messages are read 5) epoll_wait(ET) blocks until another message is received? Result: Good, all messages processed without A/B fairness (unfair since read was greedy) Scenario 3: Using LT with poll_once: 4) If io_service::poll_once is called 1 of 2 messages are read 5) epoll_wait(LT) returns a ready socket (socket A) 6) If io_service::poll_once is called 1 of 1 messages are read Result: Good, all messages processed with A/B fairness I don't think Scenario 3 is currently supported by boost::asio::io_service. Jason

1 0

[Serialization] Avoiding multiple de-serialization
by beet 11 Mar '14

11 Mar '14

Dear Boost-Community, I have a large, "directed" tree-like data structure (i.e., no cycles), holding boost::shared_ptr's either to container-objects or "leaf-objects", i.e. individual objects not holding other objects. All shared_ptr's hold base-pointers, i.e. the leaf-objects share a common base type, but not much else. I would now like to collect statistics on some of the leaf-objects during the program run. In order to do this, I'm storing boost::shared_ptr's to the leaf objects in a container outside of the tree. Getting access to the leaf objects would otherwise be very inefficient, as the tree can have virtually any geometry (except for cycles), and I do not know the geometry in advance. The tree is repeatedly (de-)serialized, and I would like to also (de-)serialize the top-level container, so I still have easy access to the leaf-objects after de-serialization. However, it is not clear to me what happens to the leaf-objects after de-serialization of both the tree and the external container. Will the leaf-objects be de-serialized twice ? Or might there be different leaf-objects in the external container and in the tree ? Thanks for any insight you may provide. Best Regards, beet

2 1

Composer issue with boost::log::sinks::event_log on VS2010
by Konrad Rybacki 11 Mar '14

11 Mar '14

Hello, I use basic_event_log_backend according to documentation<http://www.boost.org/doc/libs/1_55_0/libs/log/doc/html/log/detailed/sink_ba…>- I add formatters to events with event_composer: sinks::event_log::event_composer composer( sinks::event_log::direct_event_id_mapping<int>("EventId") ); composer[MSG1] % expr::attr<WORD>("Tag1"); composer[MSG2] % expr::attr<DWORD>("Tag2"); composer[MSG3] % expr::attr<std::string>("Tag3"); backend->set_event_composer(composer); Unfortunately event log entries in event viewer are incomplete - i.e. there are still "%n" placeholders instead of their values. From what I have found while inspecting the code with debugger it seems that event_map_reference& operator% (FormatterT const& fmt)is never hit - so m_EventMap in composer is empty. I added a method that works the same way as mentioned operator: template< typename FormatterT > event_map_reference& add_formatter(FormatterT const &fmt) { m_Composer = m_Owner.add_formatter(m_ID, m_Composer, formatter_type(fmt)); return *this; } and call it explicitly, so the code looks like that: composer[MSG1].add_formatter(expr::attr<WORD>("Tag1")); composer[MSG2].add_formatter(expr::attr<DWORD>("Tag2")); composer[MSG3].add_formatter(expr::attr<std::string>("Tag3")); Now m_EventMap has three items - and I get empty strings instead of "%n" in event viewer. I pass the tag values with boost macro, i.e.: BOOST_LOG_SCOPED_THREAD_TAG("Tag3", std::string("value")); I am using Visual Studio 2010 compiler. Any ideas? Regards, Konrad.

1 0

Customizing locale of stream for Boost.Serialization seems to fail
by Christophe Fuzier 11 Mar '14

11 Mar '14

Hi, I have a problem with Boost.Serialization. I have posted a question on a forum but have not got any answer until now. Here is the reproduction of my post (note: I'm using Boost 1.48, patch level 0). I need to use Boost.Serialization to serialize floating-point numbers. Since NaN and infinites cannot natively be read from an input stream, I am trying to use the facets in boost/math/special_functions. I have tested them on my platform using code similar to the examples we can find here: http://www.boost.org/doc/libs/1_50_0/libs/math/doc/sf_and_dist/html/math_to… However, the following code still fails to properly unserialize non-finite floating point values (an exception is thrown with description "input stream error"). #include <limits> #include <locale> #include <sstream> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/math/special_functions/nonfinite_num_facets.hpp> #include <boost/serialization/nvp.hpp> struct Data { float f; Data() : f(std::numeric_limits<float>::quiet_NaN()) {} template <class Archive> void serialize(Archive & ar, unsigned const) { ar & BOOST_SERIALIZATION_NVP(f); } }; void test() { using namespace boost::archive; Data d; std::ostringstream oss; xml_oarchive oar(oss); oar << BOOST_SERIALIZATION_NVP(d); //std::cout << oss.str() << std::endl; std::istringstream iss(oss.str()); std::locale const new_loc(iss.getloc(), new boost::math::nonfinite_num_get<char>); iss.imbue(new_loc); xml_iarchive iar(iss); iar >> BOOST_SERIALIZATION_NVP(d); std::cout << d.f << std::endl; } Am I doing something wrong? Is there a problem with my Boost version or my platform? Is there a better solution? Any help would be greatly appreciated. <END OF POST> Thank you in advance for any suggestion. Christophe Fuzier

1 1

Re: [Boost-users] Problems with Boost 1.41
by Ксения Сафина 10 Mar '14

10 Mar '14

Thank you, Ben My platform is x86_64. I have any experience with Boost and c++ language at all so I'm sorry for asking questions like this. The errors like "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" are not clear for me. I mean I have any ideas about where do they come from. gcc -v gives me "Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-linux-gnu/4.7/lto-wrapper Target: x86_64-linux-gnu Configured with: ../src/configure -v --with-pkgversion='Ubuntu/Linaro 4.7.3-1ubuntu1' --with-bugurl=file:///usr/share/doc/gcc-4.7/README.Bugs --enable-languages=c,c++,go,fortran,objc,obj-c++ --prefix=/usr --program-suffix=-4.7 --enable-shared --enable-linker-build-id --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --with-gxx-include-dir=/usr/include/c++/4.7 --libdir=/usr/lib --enable-nls --with-sysroot=/ --enable-clocale=gnu --enable-libstdcxx-debug --enable-libstdcxx-time=yes --enable-gnu-unique-object --enable-plugin --with-system-zlib --enable-objc-gc --with-cloog --enable-cloog-backend=ppl --disable-cloog-version-check --disable-ppl-version-check --enable-multiarch --disable-werror --with-arch-32=i686 --with-abi=m64 --with-multilib-list=m32,m64,mx32 --with-tune=generic --enable-checking=release --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu Thread model: posix gcc version 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1) " Is there something wrong with these options? Ksenia > >Date: Mon, 10 Mar 2014 11:42:02 +0800 >From: Ben Pope < benpope81(a)gmail.com > >To: boost-users(a)lists.boost.org >Subject: Re: [Boost-users] Problems with Boost 1.41 >Message-ID: < lfjcb4$kvb$1(a)ger.gmane.org > >Content-Type: text/plain; charset=UTF-8; format=flowed > >On Sunday, March 09, 2014 06:05 PM, ?????? ?????? wrote: >> Hi everyone, >> >> I'm trying to build this >> http://vina.scripps.edu/manual.html#build program using Boost 1.41. >> >> 'make' command gives me a large amount of errors: > >snip > >> error: #error >> "Threading support unavaliable: it has been explicitly disabled with >> BOOST_DISABLE_THREADS" > >snip > >> error: #error >> "Sorry, no boost threads are available for this platform." > >snip > >> Could anyone help me to understand what do these all errors mean? > >I think the error messages are quite clear. > >> I'm on Ubuntu 13.04, gcc version is 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1) > >I hesitate to ask, but what architecture is your platform? > >Boost 1.41 was tested with gcc 4.4.1 on Ubuntu (and some older >compilers), the platform is not mentioned, but it's probably x86 or >x86_64. It's possible that you need to modify the compiler >configuration to accept the newer gcc and/or libstdc++. > >Ben > >Date: Sun, 09 Mar 2014 14:05:41 +0400 >From: ?????? ?????? < cat7mail.ru(a)mail.ru > >To: boost-users(a)lists.boost.org >Subject: [Boost-users] Problems with Boost 1.41 >Message-ID: < 1394359541.299650432(a)f329.i.mail.ru > >Content-Type: text/plain; charset="utf-8" > > Hi everyone, > >I'm trying to build this http://vina.scripps.edu/manual.html#build ?program using Boost 1.41. > >'make' ?command gives me a large amount of errors: >? >noraneko@noraneko-K53SJ:~/Programs/autodock_vina_1_1_2/build/linux/release$ make/usr/bin/g++ -static -pthread -ansi -Wno-long-long -O3 -DNDEBUG -I /usr/local/include -I ../../../src/lib -o main.o -c ../../../src/main/main.cpp >In file included from /usr/local/include/boost/thread/detail/platform.hpp:17:0, >from /usr/local/include/boost/thread/thread.hpp:12, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/config/requires_threads.hpp:29:4: error: #error "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" >In file included from /usr/local/include/boost/thread/thread.hpp:12:0, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/thread/detail/platform.hpp:67:9: error: #error "Sorry, no boost threads are available for this platform." >In file included from ../../../src/main/main.cpp:32:0: >/usr/local/include/boost/thread/thread.hpp:19:2: error: #error "Boost threads unavailable on this platform" >In file included from /usr/local/include/boost/thread/detail/thread.hpp:11:0, >from /usr/local/include/boost/thread/thread.hpp:22, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/thread/mutex.hpp:18:2: error: #error "Boost threads unavailable on this platform" >In file included from /usr/local/include/boost/thread/detail/thread.hpp:13:0, >from /usr/local/include/boost/thread/thread.hpp:22, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/thread/detail/thread_heap_alloc.hpp:19:2: error: #error "Boost threads unavailable on this platform" >In file included from /usr/local/include/boost/thread/detail/thread_group.hpp:9:0, >from /usr/local/include/boost/thread/thread.hpp:24, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/thread/shared_mutex.hpp:18:2: error: #error "Boost threads unavailable on this platform" >In file included from /usr/local/include/boost/thread/thread.hpp:22:0, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/thread/detail/thread.hpp:40:9: error: expected class-name before ?{? token >/usr/local/include/boost/thread/detail/thread.hpp:68:9: error: expected class-name before ?{? token >/usr/local/include/boost/thread/detail/thread.hpp:88:9: error: expected class-name before ?{? token >/usr/local/include/boost/thread/detail/thread.hpp:113:17: error: ?mutex? in namespace ?boost? does not name a type >/usr/local/include/boost/thread/detail/thread.hpp:114:9: error: ?thread_data_ptr? in namespace ?boost::detail? does not name a type >/usr/local/include/boost/thread/detail/thread.hpp:118:49: error: expected ?)? before ?data? >/usr/local/include/boost/thread/detail/thread.hpp:120:9: error: ?thread_data_ptr? in namespace ?boost::detail? does not name a type >In file included from /usr/local/include/boost/thread/thread.hpp:22:0, >from ../../../src/main/main.cpp:32: >/usr/local/include/boost/thread/detail/thread.hpp:134:23: error: ?thread_data_ptr? in namespace ?boost::detail? does not name a type >/usr/local/include/boost/thread/detail/thread.hpp:139:23: error: ?thread_data_ptr? in namespace ?boost::detail? does not name a type >/usr/local/include/boost/thread/detail/thread.hpp:319:17: error: ?thread_data_base? in namespace ?boost::detail? does not name a type >/usr/local/include/boost/thread/detail/thread.hpp:320:9: error: ?native_handle_type? does not name a type >/usr/local/include/boost/thread/detail/thread.hpp: In constructor ?boost::thread::thread(F, typename boost::disable_if<boost::is_convertible<T&, boost::detail::thread_move_t<T> >, boost::thread::dummy*>::type)?: >/usr/local/include/boost/thread/detail/thread.hpp:189:13: error: class ?boost::thread? does not have any field named ?thread_info? >/usr/local/include/boost/thread/detail/thread.hpp: In constructor ?boost::thread::thread(boost::detail::thread_move_t<T>)?: >/usr/local/include/boost/thread/detail/thread.hpp:197:13: error: class ?boost::thread? does not have any field named ?thread_info? >/usr/local/include/boost/thread/detail/thread.hpp: In constructor ?boost::thread::thread(boost::detail::thread_move_t<boost::thread>)?: >/usr/local/include/boost/thread/detail/thread.hpp:204:13: error: ?thread_info? was not declared in this scope >/usr/local/include/boost/thread/detail/thread.hpp:204:28: error: ?class boost::thread? has no member named ?thread_info? >/usr/local/include/boost/thread/detail/thread.hpp:205:16: error: ?class boost::thread? has no member named ?thread_info? >/usr/local/include/boost/thread/detail/thread.hpp: In constructor ?boost::thread::thread(F, A1)?: >/usr/local/include/boost/thread/detail/thread.hpp:237:13: error: class ?boost::thread? does not have any field named ?thread_info? >/usr/local/include/boost/thread/detail/thread.hpp: In constructor ?boost::thread::thread(F, A1, A2)?: >/usr/local/include/boost/thread/detail/thread.hpp:243:13: error: class ?boost::thread? does not have any field named ?thread_info? >/usr/local/include/boost/thread/detail/thread.hpp: In constructor ?boost::thread::thread(F, A1, A2, A3)?: >/usr/local/include/boost/thread/detail/thread.hpp:250:13: error: class ?boost::thread? does not have any field named ?thread_info? >.... >/usr/local/include/boost/thread/detail/thread_group.hpp: In member function ?void boost::thread_group::remove_thread(boost::thread*)?: >/usr/local/include/boost/thread/detail/thread_group.hpp:55:13: error: ?lock_guard? is not a member of ?boost? >/usr/local/include/boost/thread/detail/thread_group.hpp:55:31: error: ?shared_mutex? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:55:51: error: ?m? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:55:52: error: ?guard? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp: In member function ?void boost::thread_group::join_all()?: >/usr/local/include/boost/thread/detail/thread_group.hpp:65:13: error: ?shared_lock? is not a member of ?boost? >/usr/local/include/boost/thread/detail/thread_group.hpp:65:32: error: ?shared_mutex? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:65:52: error: ?m? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:65:53: error: ?guard? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp: In member function ?void boost::thread_group::interrupt_all()?: >/usr/local/include/boost/thread/detail/thread_group.hpp:77:13: error: ?shared_lock? is not a member of ?boost? >/usr/local/include/boost/thread/detail/thread_group.hpp:77:32: error: ?shared_mutex? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:77:52: error: ?m? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:77:53: error: ?guard? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp: In member function ?size_t boost::thread_group::size() const?: >/usr/local/include/boost/thread/detail/thread_group.hpp:89:13: error: ?shared_lock? is not a member of ?boost? >/usr/local/include/boost/thread/detail/thread_group.hpp:89:32: error: ?shared_mutex? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:89:52: error: ?m? was not declared in this scope >/usr/local/include/boost/thread/detail/thread_group.hpp:89:53: error: ?guard? was not declared in this scope >make: *** [main.o] Error 1 > >Could anyone help me to understand what do these all errors mean?? > >I'm on Ubuntu 13.04, gcc version is 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1)? > >Ksenia

2 5

Problems with Boost 1.41
by Ксения Сафина 10 Mar '14

10 Mar '14

Hi everyone, I'm trying to build this http://vina.scripps.edu/manual.html#build program using Boost 1.41. 'make' command gives me a large amount of errors: noraneko@noraneko-K53SJ:~/Programs/autodock_vina_1_1_2/build/linux/release$ make/usr/bin/g++ -static -pthread -ansi -Wno-long-long -O3 -DNDEBUG -I /usr/local/include -I ../../../src/lib -o main.o -c ../../../src/main/main.cpp In file included from /usr/local/include/boost/thread/detail/platform.hpp:17:0, from /usr/local/include/boost/thread/thread.hpp:12, from ../../../src/main/main.cpp:32: /usr/local/include/boost/config/requires_threads.hpp:29:4: error: #error "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" In file included from /usr/local/include/boost/thread/thread.hpp:12:0, from ../../../src/main/main.cpp:32: /usr/local/include/boost/thread/detail/platform.hpp:67:9: error: #error "Sorry, no boost threads are available for this platform." In file included from ../../../src/main/main.cpp:32:0: /usr/local/include/boost/thread/thread.hpp:19:2: error: #error "Boost threads unavailable on this platform" In file included from /usr/local/include/boost/thread/detail/thread.hpp:11:0, from /usr/local/include/boost/thread/thread.hpp:22, from ../../../src/main/main.cpp:32: /usr/local/include/boost/thread/mutex.hpp:18:2: error: #error "Boost threads unavailable on this platform" In file included from /usr/local/include/boost/thread/detail/thread.hpp:13:0, from /usr/local/include/boost/thread/thread.hpp:22, from ../../../src/main/main.cpp:32: /usr/local/include/boost/thread/detail/thread_heap_alloc.hpp:19:2: error: #error "Boost threads unavailable on this platform" In file included from /usr/local/include/boost/thread/detail/thread_group.hpp:9:0, from /usr/local/include/boost/thread/thread.hpp:24, from ../../../src/main/main.cpp:32: /usr/local/include/boost/thread/shared_mutex.hpp:18:2: error: #error "Boost threads unavailable on this platform" In file included from /usr/local/include/boost/thread/thread.hpp:22:0, from ../../../src/main/main.cpp:32: /usr/local/include/boost/thread/detail/thread.hpp:40:9: error: expected class-name before ‘{’ token /usr/local/include/boost/thread/detail/thread.hpp:68:9: error: expected class-name before ‘{’ token /usr/local/include/boost/thread/detail/thread.hpp:88:9: error: expected class-name before ‘{’ token /usr/local/include/boost/thread/detail/thread.hpp:113:17: error: ‘mutex’ in namespace ‘boost’ does not name a type /usr/local/include/boost/thread/detail/thread.hpp:114:9: error: ‘thread_data_ptr’ in namespace ‘boost::detail’ does not name a type /usr/local/include/boost/thread/detail/thread.hpp:118:49: error: expected ‘)’ before ‘data’ /usr/local/include/boost/thread/detail/thread.hpp:120:9: error: ‘thread_data_ptr’ in namespace ‘boost::detail’ does not name a type In file included from /usr/local/include/boost/thread/thread.hpp:22:0, from ../../../src/main/main.cpp:32: /usr/local/include/boost/thread/detail/thread.hpp:134:23: error: ‘thread_data_ptr’ in namespace ‘boost::detail’ does not name a type /usr/local/include/boost/thread/detail/thread.hpp:139:23: error: ‘thread_data_ptr’ in namespace ‘boost::detail’ does not name a type /usr/local/include/boost/thread/detail/thread.hpp:319:17: error: ‘thread_data_base’ in namespace ‘boost::detail’ does not name a type /usr/local/include/boost/thread/detail/thread.hpp:320:9: error: ‘native_handle_type’ does not name a type /usr/local/include/boost/thread/detail/thread.hpp: In constructor ‘boost::thread::thread(F, typename boost::disable_if<boost::is_convertible<T&, boost::detail::thread_move_t<T> >, boost::thread::dummy*>::type)’: /usr/local/include/boost/thread/detail/thread.hpp:189:13: error: class ‘boost::thread’ does not have any field named ‘thread_info’ /usr/local/include/boost/thread/detail/thread.hpp: In constructor ‘boost::thread::thread(boost::detail::thread_move_t<T>)’: /usr/local/include/boost/thread/detail/thread.hpp:197:13: error: class ‘boost::thread’ does not have any field named ‘thread_info’ /usr/local/include/boost/thread/detail/thread.hpp: In constructor ‘boost::thread::thread(boost::detail::thread_move_t<boost::thread>)’: /usr/local/include/boost/thread/detail/thread.hpp:204:13: error: ‘thread_info’ was not declared in this scope /usr/local/include/boost/thread/detail/thread.hpp:204:28: error: ‘class boost::thread’ has no member named ‘thread_info’ /usr/local/include/boost/thread/detail/thread.hpp:205:16: error: ‘class boost::thread’ has no member named ‘thread_info’ /usr/local/include/boost/thread/detail/thread.hpp: In constructor ‘boost::thread::thread(F, A1)’: /usr/local/include/boost/thread/detail/thread.hpp:237:13: error: class ‘boost::thread’ does not have any field named ‘thread_info’ /usr/local/include/boost/thread/detail/thread.hpp: In constructor ‘boost::thread::thread(F, A1, A2)’: /usr/local/include/boost/thread/detail/thread.hpp:243:13: error: class ‘boost::thread’ does not have any field named ‘thread_info’ /usr/local/include/boost/thread/detail/thread.hpp: In constructor ‘boost::thread::thread(F, A1, A2, A3)’: /usr/local/include/boost/thread/detail/thread.hpp:250:13: error: class ‘boost::thread’ does not have any field named ‘thread_info’ .... /usr/local/include/boost/thread/detail/thread_group.hpp: In member function ‘void boost::thread_group::remove_thread(boost::thread*)’: /usr/local/include/boost/thread/detail/thread_group.hpp:55:13: error: ‘lock_guard’ is not a member of ‘boost’ /usr/local/include/boost/thread/detail/thread_group.hpp:55:31: error: ‘shared_mutex’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:55:51: error: ‘m’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:55:52: error: ‘guard’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp: In member function ‘void boost::thread_group::join_all()’: /usr/local/include/boost/thread/detail/thread_group.hpp:65:13: error: ‘shared_lock’ is not a member of ‘boost’ /usr/local/include/boost/thread/detail/thread_group.hpp:65:32: error: ‘shared_mutex’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:65:52: error: ‘m’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:65:53: error: ‘guard’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp: In member function ‘void boost::thread_group::interrupt_all()’: /usr/local/include/boost/thread/detail/thread_group.hpp:77:13: error: ‘shared_lock’ is not a member of ‘boost’ /usr/local/include/boost/thread/detail/thread_group.hpp:77:32: error: ‘shared_mutex’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:77:52: error: ‘m’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:77:53: error: ‘guard’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp: In member function ‘size_t boost::thread_group::size() const’: /usr/local/include/boost/thread/detail/thread_group.hpp:89:13: error: ‘shared_lock’ is not a member of ‘boost’ /usr/local/include/boost/thread/detail/thread_group.hpp:89:32: error: ‘shared_mutex’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:89:52: error: ‘m’ was not declared in this scope /usr/local/include/boost/thread/detail/thread_group.hpp:89:53: error: ‘guard’ was not declared in this scope make: *** [main.o] Error 1 Could anyone help me to understand what do these all errors mean? I'm on Ubuntu 13.04, gcc version is 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1) Ksenia

2 1

[boost::thread] Starting thread at specific time
by Kyle Ketterer 09 Mar '14

09 Mar '14

Hello all, I am working on an application which I originally wrote as a console app and am now transforming into a Windows service. Basically, looking for a little advice. My goal is to have an independent service which starts at a specific time and only runs for a set amount of hours. The code I am currently contemplating looks like this: ---------------------------------------------------------------- int start_hour = 18; //6pm time_t t = time(0); //current time struct tm* now = localtime ( &t ); //total time the app should run for boost::posix_time::time_duration run_duration ( 10, 0, 0, 0 ); //current time relative duration boost::posix_time::time_duration start_duration ( now->tm_hour, now->tm_min, now->tm_sec ); //get duration until service start boost::posix_time::time_duration diff = boost::posix_time::hours(start_hour) - boost::posix_time::milliseconds (start_duration.total_milliseconds() ); //dont start thread until designated start time boost::thread thr ( &ServiceWorkerThread ); //sleep this thread until ready to start boost::this_thread::sleep( boost::posix_time::milliseconds( diff.total_milliseconds() ) ); if ( thr.timed_join( run_duration ) ) { //do stuff } ------------------------------------------------------------- Basically, I am trying to make use of the time_duration class to achieve this. Based on the code above, I want to run the service for 10 hours, but not start it until the correct hour. Somewhere near the end of the service entry I will restart the service and the service *should* until the correct time and only execute for X hours. I am looking for further suggestions/improvements based on the above. Thanks!

4 4

boost::geometry::index::rtree with different CoordinateSystem
by Ola Martin Lykkja 08 Mar '14

08 Mar '14

Hi, I am trying to build a rtree index with a collection if waypoint (about 30.000) each represented by longitude and latitude. When I use Cartesian coordinates rtree.query works as expected. However the results are slightly wrong because of my use of longitude,latitude in the cartesian domain. I then tried to refine the datatypes to use spherical_equatorial and geographic CoordinateSystem. Now I encounter two problems: a) With geographic, it does not compile. b) With spherical_equatorial query(nearest) gives clearly wrong results. Do you have any clues on what I am doing wrong? Attached is two images illustrating the query results. Search target is dot with label on it. I am using boost 1.55.0 on Linux with g++ 4.4.3 (same result with 4.6.3). typedef bg::model::point<double, 2, bg::cs::cartesian> geo_point; typedef bg::model::point<double, 2, bg::cs::spherical_equatorial<bg::degree> > geo_point_with_wrong_results; typedef bg::model::point<double, 2, bg::cs::geographic<bg::degree> > geo_point_does_not_compile; typedef std::pair<geo_point, unsigned int> geo_vg_value; void test() { iterate_over_all_waypoints (wp) { geo_point pt(wp->on, wp->lat); rtree.insert(std::make_pair(pt, wp->id)); } std::vector<geo_vg_value> result; geo_point here(targetLat, targetLat); rtree.query(bgi::nearest(here, 20), std::back_inserter(result)); } Kind regards, Ola Martin

2 1

don't give template arguments to make_iterator_range
by Matei David 07 Mar '14

07 Mar '14

Hi, I recently came across an issue with make_iterator_range(), which is used to externally construct iterator_range objects. The problem is that if a template argument is explicitly specified, gcc 4.8.2 refuses to compile the code. In the meantime, clang 3.4 compiles it without warnings. This runs contrary to the intuition that specifying a template argument can only help (speed up) compilation. You might want to make a note about this in the documentation to Boost Range: "Don't give an explicit template argument to make_iterator_range! If you do, the program will be ill-formed!" The heavily simplified problem is explained here: http://stackoverflow.com/questions/22258054/c-inconsistency-between-gcc-and… The internal Boost Range details are the following. As described here: http://www.boost.org/doc/libs/1_55_0/libs/range/doc/html/range/reference/ut… make_iterator_range has 5 overloads, all of which are template functions. Consider the 1st and 4th overloads: template <typename It> iterator_range<It> make_iterator_range(It, It); template <typename R> iterator_range<typename range_iterator<R>::type> make_iterator_range(Range&, typename range_difference<R>::type, typename range_difference<R>::type); The problem occurs if I write something like: Some_Iterator it; auto r = make_iterator_range<Some_Iterator>(it, it); Specifically, when gcc encounters this call to make_iterator_range, for a reason I don't fully understand (but others do, see the reply on SO), it does not eliminate the 2nd overload listed above from consideration, and instead it tries to instantiate the bogus type range_iterator<R> with R=Some_Iterator. I say "bogus" because the template argument of range_iterator is meant to be a range, not an iterator. In turn, this triggers a compilation error. In the meantime, clang happily eliminates the 2nd overload, probably based on the fact that it needs 3 arguments, not 2 as are given in the call. The problem disappears if I don't give an explicit template argument: auto r = make_iterator_range(it, it); even though the correct overload is indeed the first one, with argument Some_Iterator. Apparently giving an explicit template argument at that point makes the program ill-formed. I don't fully understand why, but see the SO comments. M

1 0

first time user
by Pubudu Bandara 07 Mar '14

07 Mar '14

I have downloaded boost and did build the boost libraries according to http://www.boost.org/doc/libs/1_55_0/more/getting_started/windows.html and configured VS2008 as well. but when i'm trying to use #include <boost/thread.hpp> it gives following set of compilation errors. 1>C:\Program Files\boost_1_55_0\boost/smart_ptr/detail/sp_counted_base_w32.hpp(74) : error C3861: '_InterlockedIncrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/smart_ptr/detail/sp_counted_base_w32.hpp(93) : error C3861: '_InterlockedCompareExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/smart_ptr/detail/sp_counted_base_w32.hpp(101) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/smart_ptr/detail/sp_counted_base_w32.hpp(110) : error C3861: '_InterlockedIncrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/smart_ptr/detail/sp_counted_base_w32.hpp(115) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/smart_ptr/detail/spinlock_w32.hpp(62) : error C3861: '_InterlockedExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/thread_data.hpp(130) : error C3861: '_InterlockedIncrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/thread_data.hpp(135) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(52) : error C3861: '_InterlockedExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(100) : error C3861: '_InterlockedCompareExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(118) : error C3861: '_InterlockedCompareExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(147) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(210) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(225) : error C3861: '_InterlockedExchangeAdd': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/basic_timed_mutex.hpp(248) : error C3861: '_InterlockedCompareExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/condition_variable.hpp(68) : error C3861: '_InterlockedIncrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/condition_variable.hpp(73) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/condition_variable.hpp(110) : error C3861: '_InterlockedIncrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/condition_variable.hpp(115) : error C3861: '_InterlockedDecrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/once.hpp(183) : error C3861: '_InterlockedCompareExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/once.hpp(202) : error C3861: '_InterlockedIncrement': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/once.hpp(205) : error C3861: '_InterlockedExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/once.hpp(218) : error C3861: '_InterlockedExchange': identifier not found 1>C:\Program Files\boost_1_55_0\boost/thread/win32/once.hpp(741) : error C3861: '_InterlockedIncrement': identifier not found help me on this issue. -- Pubudu Bandara Undergraduate Department of Computer Science and Engineering University of Moratuwa

1 0

boost::tribool "if ( someTriboolVar == indeterminate )" semantics is confusing
by Peter Hackett 06 Mar '14

06 Mar '14

I started using tribool recently. I just discovered that I was using it incorrectly. I had code that did something like: tribool triboolVar1 = indeterminate; if ( triboolVar1 == indeterminate ) { cout << "triboolVar1 is indeterminate" << endl; } else { cout << "triboolVar1 is NOT indeterminate" << endl; } I was expecting this to print "triboolVar1 is indeterminate". However it prints "triboolVar1 is NOT indeterminate". I ended up looking through "include/boost/logic/tribool.hpp" and after a bit of head scratching, I think I understand why this doesn't do what I expect: The above "if" line is "really" (pseudo-code): if ( operator==(tribool triboolVar1,tribool indeterminate) ) { where operator== returns a tribool, and (I think) tribool::operator safe_bool() const { return value == true_value? &dummy::nonnull : 0; } is used to turn the tribool into a bool. And give that operator== says: ... if (indeterminate(x) || indeterminate(y)) return indeterminate; ... Then clearly no matter what the value of triboolVar1 is, the "if" code will be false. I haven't had any schooling in what (I'm assuming) might be called something like "Multi-Level-Logic", but: Shouldn't an "indeterminate" value equal another "indeterminate" value? -- Peter Hackett Member of Technical Staff IC Manage http://icmanage.com phone (408) 358-8191 x6012

5 4

Boost Serialization Difference in Archive Versions
by Lynn Gilbert 06 Mar '14

06 Mar '14

Hope everyone is doing well. I'm having an issue with boost serialization. I have serialized a file on my ODroid U2 using Boost v1.53. I'm trying to deserialize the file on a computer which only has Boost v1.46; however, line 7 below causes the following error: CMyClass Exception thrown: unsupported version Code: 1 void CMyClass::enableDeserialize(std::string file, bool binary) { 2 filename = file ; 3 isBinary = binary ; 4 ifs = new std::ifstream(file.c_str()) ; 5 try { 6 if (isBinary) { 7 CMyClass::ib = new boost::archive::binary_iarchive(*ifs) ; 8 } else { 9 CMyClass::ia = new boost::archive::text_iarchive(*ifs) ; 10 } 11 } catch (boost::archive::archive_exception e) { 12 std::cout << "CMyClass Exception thrown: " << e.what() << std::endl ; 13 } 14 } The boost archive version for v1.53 (version I serialized with) is 10 and the boost archive version for v1.46 (the version I'm trying to deserialize with) is 9. Boost documentation hasn't helped me determine the differences between the 2 archive versions. I've only been able to find answers for how to deserialize an older archive. Please note, I don't do anything with BOOST_CLASS_VERSION. CMyClass hasn't changed at all. I can't imagine boost can handle the deserialization of a newer archive so I don't feel like I'm missing that answer. What I need to know if if there is a way I can serialize in v1.53 based on boost archive version 9 instead of 10. I'm hoping the new version of boost will still allow me to serialize at an older version. Then, I should be able to deserialize the archive just fine. Any advice you could provide is much appreciated! -- Lynn Coddington Gilbert Partner, Robotic Paradigm Systems www.roboticparadigmsystems.com www.facebook.com/RoboticParadigmSystems lynn(a)roboticparadigmsystems.com 678-428-0935

3 3

\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

[ASIO] Streambuf not containing full line
by Gonzalo Garramuno 27 Feb '14

27 Feb '14

I am using asio asynchronically. I have: void tcp_session::start_read() { // Set a deadline for the read operation. // input_deadline_.expires_from_now(boost::posix_time::seconds(30)); // input_deadline_.expires_at(boost::posix_time::pos_infin); // Start an asynchronous operation to read a newline-delimited message. boost::asio::async_read_until(socket(), input_buffer_, '\n', boost::bind(&tcp_session::handle_read, shared_from_this(), boost::asio::placeholders::error)); } void tcp_session::handle_read(const boost::system::error_code& ec) { if (stopped()) return; if (!ec) { // Extract the newline-delimited message from the buffer. std::string msg; std::istream is(&input_buffer_); is.exceptions( std::ifstream::failbit | std::ifstream::badbit | std::ifstream::eofbit ); try { while ( std::getline(is, msg) ) { // parse msg here (gets truncated to last 256 chars or so) std::cerr << msg << std::endl; } } catch ( const std::ios_base::failure& e ) { std::cerr << "getline failure " << e.what() << std::endl; } } My problem is that I am seeing messages that are not a full line, but a truncation of the line, as if a buffer gets full with 256 characters. I am unsure what I am doing wrong. I get a getline failure saying basic_ios::clear.

2 1

[fusion] nth runtime element of a sequence
by MM 26 Feb '14

26 Feb '14

Hello, I just wanted to confirm there's no provided method to get the n'th element of say a fusion vector where n is known at runtime, except of handling it explicitkly with a switch case? Thanks MM

4 9

Project link error with Wave on OSX
by Olivier Prat 26 Feb '14

26 Feb '14

I've just updated a project that was working under XCode 4 with boost 1.48 to XCode 5 and boost 1.55 (installed with MacPorts). Now I have a link error with Wave which wasn't the case before. This somehow baffles me as I thought everything was template based. I am also linking with libboost-wave.mt.a but that doesn't solve the problem. The linker errors are, among 6 others: Undefined symbols for architecture x86_64: "boost::wave::cpplexer::new_lexer_gen<__gnu_cxx::__normal_iterator<char*, std::string>, boost::wave::util::file_position<boost::wave::util::flex_string<char, std::char_traits<char>, std::allocator<char>, boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >, char*> > >, boost::wave::cpplexer::lex_token<boost::wave::util::file_position< boost::wave::util::flex_string<char, std::char_traits<char>, std::allocator<char>, boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >, char*> > > > >::new_lexer(__gnu_cxx::__normal_iterator<char*, std::string> const&, __gnu_cxx::__normal_iterator<char*, std::string> const&, boost::wave::util::file_position<boost::wave::util::flex_string<char, std::char_traits<char>, std::allocator<char>, boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >, char*> > > const&, boost::wave::language_support)", referenced from: I've tried forcing std::string as the BOOST_WAVE_STRINGTYPE, but that just changes the signatures of the undefined symbols. I fail to see what has changed and I am completely stuck. I would have understood if I had a compiler error but this is a link error. Is this something to do with the standard C++ library? For my project, C++ dialect is C++98 and the standard library is libstdc++. Thanks in advance, Olivier

2 4

Question on writing HTTP parser
by gomti 25 Feb '14

25 Feb '14

Hello. I'm newbie for boost library. I'm trying to write a HTTP Parser, which handles the HTTP message coming from the proxy server. I don't know much about the boost, so I'm really confused on what to use to write my functionality. When I search on the internet, some say that I need to used Boost.Asio and Some say Boost.Spirit. When I looked over the document for each, I found that Boost.Asio is like network library for C++ and Boost.Spirit is for writing compilers. As I mention above, I want to write a http parser. I think the relevant one is the following: https://github.com/joyent/http-parser Please give me some advice. Since this is my first posting, I don't know the culture in this mailing list so if I'm doing some mistake in here, please let me know. Thanks.

3 3

Parallel Dijkstra with Predecessors
by Florian Meier 25 Feb '14

25 Feb '14

Hi, I am trying to use the parallel Dijkstra implementation with predecessors, but I am not able to compile it. Please have a look at the following diff against boost_1_53_0/libs/graph_parallel/example/dijkstra_shortest_paths.cpp (You can find the modified version attached.) ------------------------------------------- @@ -45,8 +45,10 @@ /* An undirected, weighted graph with distance values stored on the vertices. */ +typedef adjacency_list_traits<vecS, distributedS<mpi_process_group, vecS>, undirectedS>::vertex_descriptor vertex_descriptor; + typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS, - /*Vertex properties=*/property<vertex_distance_t, float>, + /*Vertex properties=*/property<vertex_distance_t, float, property<vertex_predecessor_t, vertex_descriptor> >, /*Edge properties=*/property<edge_weight_t, float> > Graph; @@ -71,7 +73,7 @@ // Compute shortest paths from vertex 0 dijkstra_shortest_paths(g, start, - distance_map(get(vertex_distance, g))); + distance_map(get(vertex_distance, g)).predecessor_map(get(vertex_predecessor, g))); // Output a Graphviz DOT file std::string outfile = filename; ------------------------------------------- This (actually get(vertex_predecessor, g)) gives me ------------------------------------------- In file included from /usr/include/boost/property_map/parallel/distributed_property_map.hpp:706:0, from /usr/include/boost/property_map/property_map.hpp:645, from /usr/include/boost/graph/properties.hpp:19, from /usr/include/boost/mpi/graph_communicator.hpp:30, from /usr/include/boost/mpi.hpp:27, from /usr/include/boost/graph/distributed/mpi_process_group.hpp:30, from dijkstra_shortest_paths.cpp:16: /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp: In instantiation of ‘void boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::handle_message<Reduce>::handle_multiput(int, int, const std::vector<boost::unsafe_pair<typename boost::property_traits<StorageMap>::key_type, typename boost::property_traits<StorageMap>::value_type> >&, boost::graph::parallel::trigger_receive_context) [with Reduce = boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >; ProcessGroup = boost::graph::distributed::mpi_process_group; GlobalMap = boost::detail::parallel::global_descriptor_property_map<long unsigned int>; StorageMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t>; typename boost::property_traits<StorageMap>::value_type = boost::detail::parallel::global_descriptor<long unsigned int>; typename boost::property_traits<StorageMap>::key_type = long unsigned int]’: /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp:255:18: required from ‘void boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::handle_message<Reduce>::setup_triggers(boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::process_group_type&) [with Reduce = boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >; ProcessGroup = boost::graph::distributed::mpi_process_group; GlobalMap = boost::detail::parallel::global_descriptor_property_map<long unsigned int>; StorageMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, shor t int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t>; boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::process_group_type = boost::graph::distributed::mpi_process_group]’ /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp:35:3: required from ‘boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::distributed_property_map(const ProcessGroup&, const GlobalMap&, const StorageMap&, const Reduce&) [with Reduce = boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >; ProcessGroup = boost::graph::distributed::mpi_process_group; GlobalMap = boost::detail::parallel::global_descriptor_property_map<long unsigned int>; StorageMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, floa t> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t>]’ /usr/include/boost/graph/distributed/adjacency_list.hpp:3468:50: required from ‘typename boost::property_map<boost::adjacency_list<OutEdgeListS, boost::distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, Property>::type boost::get(Property, boost::adjacency_list<OutEdgeListS, boost::distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with Property = boost::vertex_predecessor_t; OutEdgeListS = boost::vecS; ProcessGroup = boost::graph::distributed::mpi_process_group; InVertexListS = boost::vecS; InDistribution = boost::defaultS; DirectedS = boost::undirectedS; VertexProperty = boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >; EdgeProperty = boost::property<boost::edge_weight_t, float>; GraphProperty = boost::no_property; EdgeL istS = boost::listS; typename boost::property_map<boost::adjacency_list<OutEdgeListS, boost::distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, Property>::type = boost::parallel::distributed_property_map<boost::graph::distributed::mpi_process_group, boost::detail::parallel::global_descriptor_property_map<long unsigned int>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<b oost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t> >]’ dijkstra_shortest_paths.cpp:77:106: required from here /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp:236:47: error: no match for call to ‘(boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >) (const long unsigned int&, boost::parallel::distributed_property_map<boost::graph::distributed::mpi_process_group, boost::detail::parallel::global_descriptor_property_map<long unsigned int>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t , float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t> >::value_type&, const boost::detail::parallel::global_descriptor<long unsigned int>&)’ values[i].second)); ^ In file included from /usr/include/boost/graph/distributed/breadth_first_search.hpp:23:0, from /usr/include/boost/graph/breadth_first_search.hpp:404, from /usr/include/boost/graph/dijkstra_shortest_paths.hpp:21, from dijkstra_shortest_paths.cpp:19: /usr/include/boost/graph/parallel/properties.hpp:90:11: note: candidates are: class apply ^ /usr/include/boost/graph/parallel/properties.hpp:95:9: note: T boost::property_reduce<boost::vertex_predecessor_t>::apply<T>::operator()(T) const [with T = boost::detail::parallel::global_descriptor<long unsigned int>] T operator()(T key) const { return key; } ^ /usr/include/boost/graph/parallel/properties.hpp:95:9: note: candidate expects 1 argument, 3 provided /usr/include/boost/graph/parallel/properties.hpp:96:9: note: T boost::property_reduce<boost::vertex_predecessor_t>::apply<T>::operator()(T, T, T) const [with T = boost::detail::parallel::global_descriptor<long unsigned int>] T operator()(T key, T, T y) const { return y; } ^ /usr/include/boost/graph/parallel/properties.hpp:96:9: note: no known conversion for argument 1 from ‘const long unsigned int’ to ‘boost::detail::parallel::global_descriptor<long unsigned int>’ ------------------------------------------- What is wrong here? Greetings, Florian

2 1

boost/graph/metric_tsp_approx.hpp patch, is there interest?
by Paolo Bolzoni 25 Feb '14

25 Feb '14

Dear list, In the boost/graph/metric_tsp_approx.hpp:224 is a note // TODO: This is will be O(n^2) if vertex storage of g != vecS. Since I am exactly in this situation I made a patch for my use, I added a bundled property to MSTImpl's vertices to contain a descriptor to keep track of the original graph vertices. It is a small modification, but since there is a TODO perhaps there is interest? If so how should I share it? Of course any comment is welcome. Your sincerely, Paolo

1 0

[icl] Icl broken for c++11's hint semantics. Fix provided.
by Joachim Faulhaber 25 Feb '14

25 Feb '14

Dear Icl users, due to a subtle effect of the changed hint semantics for associative containers, the icl library is broken in versions <= 1.55.0 when used with new STL-libraries that implement the new c++11 standard. This bug is fixed in the upcoming Boost 1.56.0. (see regression tests at http://www.boost.org/development/tests/master/developer/icl.html) Since the release of boost 1.56.0 seems to take longer than planned due to restructuring efforts for modular-boost, users of Boost.Icl affected by the problem may choose to pull the fixed Boost.Icl directly from the git repository and replace your_boost_1_55_0/boost/icl with the new code. The libs/icl part does not need an update. Another possibility is to apply the patch-file diff_icl_1_55_0_and_master.patch that is attached to this post to your local boost library 1.55.0: 1. cd to your_boost_1_55_0 root directory. your_boost_1_55_0> 2. From the command line type your_boost_1_55_0> patch -p2 < diff_icl_1_55_0_and_master.patch You may check the patched library by moving to your_boost_1_55_0/libs/icl/test and run your_boost_1_55_0/libs/icl/test> bjam Sorry for the inconvenience. Best regards, Joachim P.S.: For those interested in details of the issue here is a report: The semantics of insertion with hint in associative containers changed in c++11 form insert-after-hint (c++98/03) to insert-before-hint (c++11) see e.g. proposal N1780: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html so for an associative container c of type C, a value x and an iterator hint c.insert(hint, x); //tries to insert x right after hint in c++98 c.insert(hint, x); //tries to insert x before hint in c++11 In accordance with this behavior, if using the insert function std::pair<bool, iterator> C::insert(value_type const& x); (success, hint) = c.insert(x); the iterator hint of unsuccessful insertion is the matching hint, pointing to [c++98] the last element y in c that is not greater x, so x can be inserted *after* that hint. [c++11] the first element z in c that is greater than x, so x can be inserted *before* that hint. In Boost.Icl I used the returned hint-iterator of the insert function, that always returned the last overlapping interval y for an inserted interval x given the interval's exclusive-less ordering under c++98. With the changed hint semantics, this returned hint-iterator did not point to the last interval y overlapping x anymore but to the first interval z not overlapping x. Therefore the code was broken and returned false results. -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

1 0