June 2013 - Boost-users - lists.boost.org

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[Range, Phoenix] What am I missing...
by Robert Jones 25 Apr '17

25 Apr '17

Hi Folks Can anyone explain the output of this program... #include <iostream> #include <boost/range/algorithm/copy.hpp> #include <boost/range/counting_range.hpp> #include <boost/range/adaptor/reversed.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> int f( int i ) { return i * 2; } int main( ) { using boost::adaptors::reversed; using boost::adaptors::transformed; using boost::counting_range; using boost::copy; using boost::phoenix::arg_names::_1; copy( counting_range( 1, 5 ) | reversed | transformed( f ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; copy( counting_range( 1, 5 ) | reversed | transformed( bind( f, _1 ) ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; } Which is... 8 6 4 2 1768406272 1768406272 1768406272 1768406272 I'm using Gcc 4.6.2 & Boost 1.53 Thx All.

3 4

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

[Thread] Read-write locks
by lfrfly＠icqmail.com 18 Sep '14

18 Sep '14

I'm trying to create a standard read/write lock using Boost Threads, and I'm having a bit of difficulty mapping the Boost concepts onto the usual ones. A read/write lock should have several states: Locked for reading (multiple threads may lock at once), locked for writing (only one thread may lock, and no threads may be locked for reading at the same time), and unlocked. Ideally it would be nice if an RWL which is locked for reading may temporarily upgrade to locked for writing, then return to the locked for reading state. Boost supports several relevant notions of locking: shared locking, upgrade locking, and exclusive locking. This to me is a confusing distinction. In particular, a shared_mutex seems appropriate as the basis for a RWL, but is lock_upgrade() the equivalent of a write lock and lock_shared the equivalent of a read lock? This is unclear. If "upgrade locking" is not the same as "exclusive locking", then is an upgrade lock actually exclusive? Could someone please clarify this.

4 3

[Statechart] How to decide between post_event and process_event atrun time ?
by Philippe DAVID 22 Jul '14

22 Jul '14

Hi, I have a method in which I want to post/process an event. The thing is, this method can be called from outside the state machine (so I need to call process_event), or indirectly by a reaction of the state machine (in this case I must call post_event since process_event is not reentrant). I don't want to write 2 distinct methods to do this (one that calls post, and the other process), I would much rather prefer adding a 'if' in my method that tells me if I have to call process_event or post_event (if I'm being called indirectly by the state machine or not). Is there a way to do this with statechart ? regards, Philippe

3 3

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

[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

Server failing when BOOST_ASIO_ENABLE_HANDLER_TRACKING is active
by Gonzalo Garramuno 22 Jan '14

22 Jan '14

Trying to track down when the socket closes on my program, I turned on asio debugging. Server fails when BOOST_ASIO_ENABLE_HANDLER_TRACKING is active. Its stack trace is: g Scanning dependencies of target mrViewer [ 9%] Building CXX object mrViewer/src/CMakeFiles/mrViewer.dir/core/mrvServer.o Linking CXX executable ../../../bin/mrViewer [100%] Built target mrViewer # gga@gga-laptop1 /media/Linux/code/applications/mrViewer # mar ene 01 10:04 [8] $ mrViewer /media/Linux/movies/Tangled.mov [opengl] Using hardware shader profile: NVidia NV30 [opengl] mrViewer supports YUV images through shaders. [psql] Connected to database 'assets2d_development'. The code: boost::asio::io_service io_service; tcp::endpoint listen_endpoint(tcp::v4(), s->port); server rp(io_service, listen_endpoint, s->ui); io_service.run(); fails with: @asio|1357088683.200673|0|socket@0x7f303d8d2d00.close Got signal 11, faulty address is 0x1, from 0x4d222a [bt] Execution path: [bt] mrViewer(_ZN5boost4asio6detail15task_io_service16shutdown_serviceEv+0x3a) [0x4d222a] [bt] mrViewer(_ZN5boost4asio6detail15task_io_service16shutdown_serviceEv+0x3a) [0x4d222a] [bt] mrViewer() [0x4dd2c9] [bt] mrViewer(_ZN3mrv13server_threadEPKNS_10ServerDataE+0x408) [0x4e0e58] [bt] /usr/lib/libboost_thread.so.1.48.0(+0xdda9) [0x7f304e191da9] [bt] /lib/x86_64-linux-gnu/libpthread.so.0(+0x7e9a) [0x7f304f7f0e9a] [bt] /lib/x86_64-linux-gnu/libc.so.6(clone+0x6d) [0x7f304da1ccbd] without the #define the code works reliably except sometimes the socket closes unexpectedly.

4 5

Question for Boost.Threads and Boost.Test
by young 20 Jan '14

20 Jan '14

According to Boost document, Boost.Test can only be statically linked. Boost.Threads can only be dynamically linked. Then what boost_unit_test_framework-vc100-mt-1_53.lib for? Is it for dynamically linked dll? what libboost_thread-vc100-mt-1_53.lib for? Is it for static library? -- View this message in context: http://boost.2283326.n4.nabble.com/Question-for-Boost-Threads-and-Boost-Tes… Sent from the Boost - Users mailing list archive at Nabble.com.

4 6

[Test] Where to learn about boost::itest::mock_object?
by Mateusz Loskot 20 Jan '14

20 Jan '14

Hi, I'm looking for a simple mocking library to use together with Boost.Test. There is Turtle (aka Boost.Mock) and googlemock. During retrospection of the big thread on Boost.Test future [1], I found this curious post by Gennadiy [2] about mock_object. I had no idea such facility lives in Boost.Test and it looks it's been there for very long time. I can't find any documentation about mock_oboject, only a couple of examples. So, I have a few questions: Is the mock_object an internal feature or is it dedicated (and ready) to use by Boost.Test users? What are basic features of this mocking facility? How does it compare to Turtle or googlemock? [1] http://thread.gmane.org/gmane.comp.lib.boost.devel/234297 [2] http://thread.gmane.org/gmane.comp.lib.boost.devel/234297/focus=234621 [3] find /home/mloskot/dev/boost/_svn/trunk/libs/test -type f | xargs grep mock_object Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

4 4

Does Boost.Test cover 'golden file approach'?
by Journeyer J. Joh 13 Jan '14

13 Jan '14

Hello, I know almost nothing about 'golden file approach'. http://weblogs.java.net/blog/alexeyp/archive/2007/02/testing_command.html >From this blog, you can find the term 'golden file approach'. I want to know if Boost.Test cover this kind of testing. Can I implement 'golden file approach' with Boost.Test? If so please provide me more information about it. Thank you very much. ---------------------------------------- Journeyer J. Joh o o s a p r o g r a m m e r a t g m a i l d o t c o m ----------------------------------------

3 5

[boost.test] How to register custom exception for auto test?
by Jörg Becker 13 Jan '14

13 Jan '14

Hi, I'm using the test library of boost 1.49.0 for my unit tests. It works fine so fare, but if my program throws an error, I get the default error message unknown location(0): fatal error in "excption1_test": unknown type, witch hides the original error message. I tried to register an error translator, but without success. Here is what I tried (modified test/test/custom_exception_test.cpp to use auto test with global fixture): #define BOOST_TEST_MODULE "boost test custom_exception_test" #include <boost/test/unit_test.hpp> #include <boost/test/unit_test_monitor.hpp> using namespace boost::unit_test; BOOST_AUTO_TEST_SUITE( custom_exception_testsuite ) struct my_exception1 { explicit my_exception1( int res_code ) : m_res_code( res_code ) {} int m_res_code; }; void throw_my_exception1() { throw my_exception1( 12 ); } void my_exception1_translator( my_exception1 ) { BOOST_TEST_MESSAGE( "Caught my_exception1" ); } class my_config { public: my_config () { unit_test_monitor.register_exception_translator<my_exception1>( &my_exception1_translator ); } }; BOOST_GLOBAL_FIXTURE( my_config ) BOOST_AUTO_TEST_CASE( excption1_test ) { throw_my_exception1(); } BOOST_AUTO_TEST_SUITE_END() Can anybody tell me what I'm missing? Thanks, Jörg

3 5

Max Boost Fusion tuple parameters
by Rodrigo Madera 15 Sep '13

15 Sep '13

Hello, What is the maximum Boost Fusion tuple param count? I was thinking of using it for about 200-300 elements. Anyone done this? I've heard of defines for this, but never actually *knew* of anyone actually doing it. Thanks, Rodrigo Madera

4 11

using boost with net-snmp
by moshe levi 12 Sep '13

12 Sep '13

I wrote an example on how to integrate net-snmp with boost. please checkout http://blog-moshe.blogspot.co.il/

2 1

[BGL] Having a cost function as weight map
by Maxime van Noppen 06 Sep '13

06 Sep '13

Hi, I can't find how to do this pretty basic thing : having a function instead of a field to compute the cost of edges for various path finding algorithms. I couldn't find the answer in the documentation and Google was of no help. Did I miss something obvious ? Example : ------------------- #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> struct my_edge { double cost() const { return cost_ * 2; } double cost_; }; struct my_node { }; int main() { typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, my_node, my_edge > graph_t; typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_t; graph_t graph; vertex_t v /*= ... */; using boost::weight_map; // Works : boost::dijkstra_shortest_paths(graph, v, weight_map(boost::get(&my_edge::cost_, graph))); // Doesn't compile : //boost::dijkstra_shortest_paths(graph, v, // weight_map(boost::get(&my_edge::cost, graph))); } ------------------- Thanks ! -- Maxime

4 8

Identify cycles in a undirected graph
by NsPx 20 Aug '13

20 Aug '13

Hi all, I use undirected_dfs to detect all cycles in a undirected graph. I detect a cycle with DFSVisitor.back_edge(e,g) but how can I get the list of vertices defining this cycle ? Thanks by advance

4 4

[multiprecision] Compiler Warnings
by Michael Olea 23 Jul '13

23 Jul '13

Hi. I'm getting compiler warnings for narrowing conversions when I write a cpp_int to a stream. This is with boost 1_53_0 on OS X 10.8.3 using Xcode version 4.6.2 with clang: /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang --version Apple LLVM version 4.2 (clang-425.0.28) (based on LLVM 3.2svn) Target: x86_64-apple-darwin12.3.0 Thread model: posix Here's a short example causing the problem: // // main.cpp // #include <boost/multiprecision/cpp_int.hpp> #include <iostream> int main(int argc, const char * argv[]) { using namespace boost::multiprecision; cpp_int u = 1; for(unsigned i = 1; i <= 100; ++i) u *= i; std::cout << "100! using arbitrary precision cpp_int:\n"; std::cout << u << std::endl; // prints 100! return 0; } The short compiler messages: In file included from /Users/olea/code/mjaal/learn/boost/build/xcode/mp_warner/mp_warner/main.cpp:5: /usr/local/include/boost/multiprecision/cpp_int.hpp:1573:34: warning: implicit conversion loses integer precision: 'unsigned long' to 'int' [-Wshorten-64-to-32] int pos = result.size() - 1; ~~~ ~~~~~~~~~~~~~~^~~ /usr/local/include/boost/multiprecision/cpp_int.hpp:1653:14: note: in instantiation of member function 'boost::multiprecision::backends::cpp_int_backend<0, 0, 1, 0, std::__1::allocator<unsigned int> >::do_get_string' requested here return do_get_string(f, trivial_tag()); ^ /usr/local/include/boost/multiprecision/number.hpp:576:24: note: in instantiation of member function 'boost::multiprecision::backends::cpp_int_backend<0, 0, 1, 0, std::__1::allocator<unsigned int> >::str' requested here return m_backend.str(digits, f); ^ /usr/local/include/boost/multiprecision/number.hpp:1650:22: note: in instantiation of member function 'boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<0, 0, 1, 0, std::__1::allocator<unsigned int> >, 1>::str' requested here std::string s = r.str(d, os.flags()); ^ /Users/olea/code/mjaal/learn/boost/build/xcode/mp_warner/mp_warner/main.cpp:16:12: note: in instantiation of function template specialization 'boost::multiprecision::operator<<<boost::multiprecision::backends::cpp_int_backend<0, 0, 1, 0, std::__1::allocator<unsigned int> >, 1>' requested here std::cout << u << std::endl; // prints 100! ^ In file included from /Users/olea/code/mjaal/learn/boost/build/xcode/mp_warner/mp_warner/main.cpp:5: /usr/local/include/boost/multiprecision/cpp_int.hpp:1606:34: warning: implicit conversion loses integer precision: 'unsigned long' to 'int' [-Wshorten-64-to-32] int pos = result.size() - 1; ~~~ ~~~~~~~~~~~~~~^~~ /usr/local/include/boost/multiprecision/cpp_int.hpp:1639:23: warning: implicit conversion loses integer precision: 'size_type' (aka 'unsigned long') to 'unsigned int' [-Wshorten-64-to-32] unsigned n = result.find_first_not_of('0'); ~ ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 3 warnings generated. The compile command: CompileC /Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/Objects-normal/x86_64/main.o mp_warner/main.cpp normal x86_64 c++ com.apple.compilers.llvm.clang.1_0.compiler cd /Users/olea/code/mjaal/learn/boost/build/xcode/mp_warner setenv LANG en_US.US-ASCII /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/clang -x c++ -arch x86_64 -fmessage-length=0 -std=gnu++11 -stdlib=libc++ -Wno-trigraphs -fpascal-strings -O0 -Wno-missing-field-initializers -Wno-missing-prototypes -Wreturn-type -Wno-non-virtual-dtor -Wno-overloaded-virtual -Wno-exit-time-destructors -Wformat -Wno-missing-braces -Wparentheses -Wswitch -Wno-unused-function -Wno-unused-label -Wno-unused-parameter -Wunused-variable -Wunused-value -Wempty-body -Wuninitialized -Wno-unknown-pragmas -Wno-shadow -Wno-four-char-constants -Wno-conversion -Wconstant-conversion -Wint-conversion -Wenum-conversion -Wshorten-64-to-32 -Wno-newline-eof -Wno-c++11-extensions -DDEBUG=1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.8.sdk -fasm-blocks -fstrict-aliasing -Wdeprecated-declarations -Winvalid-offsetof -mmacosx-version-min=10.8 -g -fvisibility-inlines-hidden -Wno-sign-conversion -iquote /Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/mp_warner-generated-files.hmap -I/Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/mp_warner-own-target-headers.hmap -I/Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/mp_warner-all-target-headers.hmap -iquote /Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/mp_warner-project-headers.hmap -I/Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Products/Debug/include -I/usr/local/include -I/Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/DerivedSources/x86_64 -I/Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/DerivedSources -F/Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Products/Debug -MMD -MT dependencies -MF /Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/Objects-normal/x86_64/main.d --serialize-diagnostics /Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/Objects-normal/x86_64/main.dia -c /Users/olea/code/mjaal/learn/boost/build/xcode/mp_warner/mp_warner/main.cpp -o /Users/olea/Library/Developer/Xcode/DerivedData/mp_warner-fvjhjlwtkmsewtfsdqsuzhczhlxd/Build/Intermediates/mp_warner.build/Debug/mp_warner.build/Objects-normal/x86_64/main.o

2 3

[exception] exception_ptr missing virtual base parameters
by Michael Caisse 13 Jul '13

13 Jul '13

The basic problem I'm experiencing is that getting an exception_ptr results inherited parameters getting lost when virtual inheritance is used. The code below demonstrates a simple example. "bar" is lost in the print. Changing derived_except to be: struct derived_except : base_except { int i; }; will cause the inherited values to be copied into the exception_ptr; however, this has all the standard problems associated that come with not using virtual inheritance. This looks like a bug to me. The C++11 equivalent behaves has expected and inherited values are maintained in the exception_ptr. Any thoughts? michael -------------- boost::exception_ptr version -------------- #include <boost/exception/all.hpp> #include <string> #include <iostream> struct base_except { std::string s; }; struct derived_except : virtual base_except { int i; }; int main() { derived_except e; e.i = 8; e.s = "bar"; boost::exception_ptr ptr = boost::copy_exception(e); try { boost::rethrow_exception(ptr); } catch(derived_except & e) { std::cout << "derived_except: " << e.s << " " << e.i << std::endl; } catch(...) {} return 0; } -------------- c++11 version --------------------- #include <exception> #include <string> #include <iostream> struct base_except { std::string s; }; struct derived_except : virtual base_except { int i; }; int main() { derived_except e; e.i = 8; e.s = "bar"; std::exception_ptr ptr = std::make_exception_ptr(e); try { std::rethrow_exception(ptr); } catch(derived_except & e) { std::cout << "derived_except: " << e.s << " " << e.i << std::endl; } catch(...) {} return 0; } -- Michael Caisse ciere consulting ciere.com

3 3

[msm] interrupt_state with more then one event that ends interrupt?
by Alexander Mingalev 09 Jul '13

09 Jul '13

Hi, Subj, Is that possible? for example, one event continues processing, the another one finishes the whole state-machine (some clean-up actions etc). I tried struct Interrupt : public msmf::interrupt_state< boost::mpl::vector<Foo, Bar> > {}; and struct Interrupt : public msmf::interrupt_state< msmf::ActionSequence_< boost::mpl::vector<Foo, Bar> > > {}; - has no effect. Is there another way to achieve this?

3 5

[multi_index] emplace support
by Brian Wood 06 Jul '13

06 Jul '13

I'm wondering about emplace support in multi_index. Any news on that is of interest. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 2

Confused with Depth-First-Search method, forward or cross edge found on a undirected graph ?
by lizy10b 03 Jul '13

03 Jul '13

Hi there I have a problem with the DFS method (Boost 1.53). I found when invoking the DFS method on a undirected graph, the "forward_or_cross_edge" was called more than one times. But as the document says "In an undirected graph this method is never called". http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/DFSVisitor.html I performed the test based on the file_dependencies.cpp example (examples/file_dependencies.cpp; http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/file_dependency_example…) 1) Change the graph type from "bidirectionalS" to "undirected". 2)Implement all the 8 DFS vistor "event methods" (Initialize Vertex, Start Vertex, Discover Vertex, Examine Edge, Tree Edge, Back Edge, Forward or Cross Edge, Finish Vertex) in the cycle_detector struct to print the vertex names, edge sources and targets. 3)comment out some code at the begining of the example cpp files as the topological_sort method raise exception upon the undirected graph. The results: the forward_or_cross_edge method was called five times. initialize_vertex: dax.h initialize_vertex: yow.h initialize_vertex: boz.h initialize_vertex: zow.h initialize_vertex: foo.cpp initialize_vertex: foo.o initialize_vertex: bar.cpp initialize_vertex: bar.o initialize_vertex: libfoobar.a initialize_vertex: zig.cpp initialize_vertex: zig.o initialize_vertex: zag.cpp initialize_vertex: zag.o initialize_vertex: libzigzag.a initialize_vertex: killerapp start_vertex: dax.h discover_vertex: dax.h examine_edge: dax.h --> foo.cpp tree_edge: dax.h --> foo.cpp discover_vertex: foo.cpp examine_edge: foo.cpp --> dax.h back_edge: foo.cpp --> dax.h examine_edge: foo.cpp --> zow.h tree_edge: foo.cpp --> zow.h discover_vertex: zow.h examine_edge: zow.h --> foo.cpp back_edge: zow.h --> foo.cpp finish_vertex: zow.h examine_edge: foo.cpp --> foo.o tree_edge: foo.cpp --> foo.o discover_vertex: foo.o examine_edge: foo.o --> foo.cpp back_edge: foo.o --> foo.cpp examine_edge: foo.o --> libfoobar.a tree_edge: foo.o --> libfoobar.a discover_vertex: libfoobar.a examine_edge: libfoobar.a --> foo.o back_edge: libfoobar.a --> foo.o examine_edge: libfoobar.a --> bar.o tree_edge: libfoobar.a --> bar.o discover_vertex: bar.o examine_edge: bar.o --> bar.cpp tree_edge: bar.o --> bar.cpp discover_vertex: bar.cpp examine_edge: bar.cpp --> dax.h back_edge: bar.cpp --> dax.h examine_edge: bar.cpp --> yow.h tree_edge: bar.cpp --> yow.h discover_vertex: yow.h examine_edge: yow.h --> dax.h back_edge: yow.h --> dax.h examine_edge: yow.h --> bar.cpp back_edge: yow.h --> bar.cpp examine_edge: yow.h --> zag.cpp tree_edge: yow.h --> zag.cpp discover_vertex: zag.cpp examine_edge: zag.cpp --> yow.h back_edge: zag.cpp --> yow.h examine_edge: zag.cpp --> boz.h tree_edge: zag.cpp --> boz.h discover_vertex: boz.h examine_edge: boz.h --> bar.cpp back_edge: boz.h --> bar.cpp examine_edge: boz.h --> zig.cpp tree_edge: boz.h --> zig.cpp discover_vertex: zig.cpp examine_edge: zig.cpp --> boz.h back_edge: zig.cpp --> boz.h examine_edge: zig.cpp --> zig.o tree_edge: zig.cpp --> zig.o discover_vertex: zig.o examine_edge: zig.o --> zig.cpp back_edge: zig.o --> zig.cpp examine_edge: zig.o --> libzigzag.a tree_edge: zig.o --> libzigzag.a discover_vertex: libzigzag.a examine_edge: libzigzag.a --> libfoobar.a back_edge: libzigzag.a --> libfoobar.a examine_edge: libzigzag.a --> zig.o back_edge: libzigzag.a --> zig.o examine_edge: libzigzag.a --> zag.o tree_edge: libzigzag.a --> zag.o discover_vertex: zag.o examine_edge: zag.o --> zag.cpp back_edge: zag.o --> zag.cpp examine_edge: zag.o --> libzigzag.a back_edge: zag.o --> libzigzag.a finish_vertex: zag.o examine_edge: libzigzag.a --> killerapp tree_edge: libzigzag.a --> killerapp discover_vertex: killerapp examine_edge: killerapp --> libzigzag.a back_edge: killerapp --> libzigzag.a finish_vertex: killerapp finish_vertex: libzigzag.a finish_vertex: zig.o finish_vertex: zig.cpp examine_edge: boz.h --> zag.cpp back_edge: boz.h --> zag.cpp finish_vertex: boz.h examine_edge: zag.cpp --> zag.o forward_or_cross_edge: zag.cpp --> zag.o !!!!!! finish_vertex: zag.cpp finish_vertex: yow.h examine_edge: bar.cpp --> boz.h forward_or_cross_edge: bar.cpp --> boz.h !!!!!! examine_edge: bar.cpp --> bar.o back_edge: bar.cpp --> bar.o finish_vertex: bar.cpp examine_edge: bar.o --> libfoobar.a back_edge: bar.o --> libfoobar.a finish_vertex: bar.o examine_edge: libfoobar.a --> libzigzag.a forward_or_cross_edge: libfoobar.a --> libzigzag.a !!!!!! finish_vertex: libfoobar.a finish_vertex: foo.o finish_vertex: foo.cpp examine_edge: dax.h --> bar.cpp forward_or_cross_edge: dax.h --> bar.cpp !!!!!! examine_edge: dax.h --> yow.h forward_or_cross_edge: dax.h --> yow.h !!!!!! finish_vertex: dax.h What is the problem? Thanks. Zhiyu 2013-06-24 lizy10b

3 23

Boost.Test on Windows x64
by User 8583 02 Jul '13

02 Jul '13

Hello, I am trying to use Boost.Test 1.53 on a Windows 7 x64 platform and VS2012. I compiled the libraries using .\b2 variant=release link=static threading=multi runtime-link=shared toolset=msvc-11.0 address-model=64 Linking the libraries with my (x64) test program produces the following error: libboost_unit_test_framework-vc110-mt-gd-1_53.lib(unit_test_suite.obj) : fatal error LNK1112: module machine type 'X86' conflicts with target machine type 'x64' I am surprised as I have used the boost serialization library compiled with the same command line in x64 programs without such error. Any help appreciated, Bob

3 8

Problem in building the BGL Python 0.95 on Windows
by lizy10b 01 Jul '13

01 Jul '13

Hi there, I have got the latest BGL-Python 0.95 from svn (thanks to John), but I can't build it. My environment: Windows 7 x64, Python 2.66 x86, MPICH2 1.32 x86, VS2010 I have tried the following steps: 1. The boost 1.53 source code distribution dir (newly extracted from the zip package) is E:\boost_1_53_0, the BGL Python 0.95 source code dir is E:\bgl-python_svn_095 2. Add a new environment variable, name: BOOST_ROOT, value: E:\boost_1_53_0 3. Append the boost 1.53 source code distribution dir (E:\boost_1_53_0) to the environment variable "PATH" to expose later built bjam.exe file. 4. Add some lines to the file user-config.jam (E:\boost_1_53_0\tools\build\v2\user-config.jam) import toolset : using ; using python : 2.6 : "C:\\Python266" : "C:\\Python266\\include" : "C:\\Python266\\libs" ; using mpi : : <find-static-library>mpi <library-path>"D:\\Program Files (x86)\\MPICH2\\lib" <include>"D:\\Program Files (x86)\\MPICH2\\include" : "\"D:\\Program Files (x86)\\MPICH2\\mpiexec\"" ; 5. Open the vs2010 commandline window (Visual Studio Command Prompt 2010) 6. Navigate to boost 1.53 source code distribution dir to build the bjam.exe: type bootstrap.bat 7. Then navigate to the BGL-Python-0.95 source code dir and type bjam --prefix=E:\boost_1_53_0\release32 stage toolset=msvc-10.0 variant=release link=static address-model=32 architecture=x86 threading=multi runtime-link=shared install The outputs are: Jamfile.v2:198: in load-aux rule python.get-python-interpreter unknown in module Jamfile</E:/bgl-python_svn_ 095> E:/boost_1_53_0/tools/build/v2/build\project.jam:323: in load-jamfile E:/boost_1_53_0/tools/build/v2/build\project.jam:62: in load E:/boost_1_53_0/tools/build/v2/build\project.jam:168: in project.find E:/boost_1_53_0/tools/build/v2\build-system.jam:570: in load E:\boost_1_53_0\tools\build\v2/kernel\modules.jam:283: in import E:\boost_1_53_0\tools\build\v2/kernel/bootstrap.jam:142: in boost-build E:\boost_1_53_0\boost-build.jam:17: in module scope E:\bgl-python_svn_095> and the building process stopped. So what is the problem? Thanks. Zhiyu Li

2 3

[program_options] copy option_description from one options_description to another
by Ghyslain Leclerc 30 Jun '13

30 Jun '13

Hello. First post here. Not a programmer by trade, but a medical physicist, so my apologies if my question seems too much of a newbie question. And hopefully, my programing jargon won’t be too bad. I have searched on Google and played with my code all day yesterday and I have not found the answer to my problem, so I thought I would try the mailing list. We have a number of small command line utilities (approx. 10) that we are developing for our clinic. We want to try and make a base class that would contain all our usual program options in it and would allow customization for our various little programs. Thus, I need to store a options_description object with our usual options and a function in the class to add options to the stored object. That way, the interfaces would be more homogeneous and we would not need to recode all the logic of option handling for every application and maintain them all. Simply create a derived class and add a few options_description to it. Then use that class for our application. My first approach was to store a options_description object directly, but I can't seem to assign to it. So if I want to reset the object to a completely new one, for instance in a special case where the usual options don't make any sense, I run into problems. I switched to holding a pointer to it (tr1 shared_ptr). That allows me to easily change the object all together if I need to. In either case (pointer or object), my actual problem comes when I want to add options to a options_description. I can easily use the add function : myOptionsDescriptionObject.add( theOtherOptionsDescriptionObject ); but that adds empty lines in the output format and creates artificial grouping of options, which I would like to avoid if possible. That being said, given the current state of our code, I will implement this version now as this is the "best" solution that works. The way I am trying to get around that is to extract for each option_description contained in the options_description object the name, the description and the value_semantic and then use these three extracted values with the add_options() function like so: muOptionsDescriptionObject.add_options()( other.options()->name(), other.options()->semantic().get(), other.options()->description() ); Works perfectly for name and description, but fails for value_semantic. It compiles, but generates a "The program has unexpectedly finished." message. My hypothesis for what is happening is that I am using the .get() to extract the raw pointer from the shared_ptr returned, but the shared_ptr somehow deletes the memory and my pointer becomes invalid. Here is a short version of what I came up with. The problem is probably in the implementation of the function addGenOpts(). Can anybody help with this? Sorry if this is a ridiculous question or if my post makes no sense. English is not my first language. In advance, thanks. Ghyslain --------------------------- namespace bpo = boost::program_options; class BaseCli { public: BaseCli(); virtual ~BaseCli() {} void parseCmdLineOpts( int argc, const char* argv[] ); void parseCfgFileOpts(); void run(); bool checkPresent( const std::string& optionStrg ); const bpo::options_description& genOpts( ); void addGenOpts( const bpo::options_description& opts ); void setGenOpts( const bpo::options_description& opts ); private: bpo::variables_map optionsMap_; std::tr1::shared_ptr< bpo::options_description > genOpts_; //virtual void runNoInteraction_() = 0; //virtual void runWithInteraction_() = 0; }; void BaseCli::addGenOpts( const bpo::options_description& opts ) { using std::vector; using std::string; // Loop through every option in opts for( auto optIter = opts.options().begin(); optIter != opts.options().end(); ++optIter ) { ... CODE REMOVED TO SAVE SPACE ... ... SIMPLE STRING MANIPULATION STUFF ... // Combine names into program_options option string string combinedName( longName ); if ( !shortName.empty() ) { combinedName += string( "," ) + shortName; } genOpts_->add_options()( combinedName.c_str(), (*optIter)->semantic().get(), (*optIter)->description().c_str() ); } } ---------------------------

2 1