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

Boost.MSM: Executable size
by RaRi 08 Jan '13

08 Jan '13

Hi all, I'm using boost.MSM for a productive embedded system. My concern is, that my compiler produces a executable size of all most 2MB for a state machine consisting of 4 sub-machine and nearly 40 transition for the complete state machine, but with no action and guard code. My compilation system is as follows: - eclipse juno - mingw 4.7.0 - Compiler settings for the release of the binary are: "-O3 -Wall -c -fmessage-length=0" Is this a good size or should I be worried about this nearly 2 MB for the release executable? I'm asking as like stated in http://www.boost.org/doc/libs/1_52_0/libs/msm/doc/HTML/ch04s02.html <http://www.boost.org/doc/libs/1_52_0/libs/msm/doc/HTML/ch04s02.html> the executable size for a good sized state machine could reach a size of almost 600kB, and my state machine is still not finished (50 % more code has to be added for further submachine...) Using the "-Os" produces a executable size which is almost 20% smaller as with the "-O3". In case I compile the state machine with the default debug level (-g) the binary is allmost 35MB big.... The compilation takes around 1m:30sec ( using the *favor_compile_time* policy)... Best regard, RaRi -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-MSM-Executable-size-tp4641132.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Problem with installation
by Evan Driscoll 08 Jan '13

08 Jan '13

Hi, I'm having problems with the installation procedure. I'm using the 1.53 beta. I have run the following: ./bootstrap.sh --prefix=/unsup/boost-1.53.0/beta/common --exec-prefix=/unsup/boost-1.53.0/beta/amd64_rhel6 ./b2 --prefix=/unsup/boost-1.53.0/beta/common --exec-prefix=/unsup/boost-1.53.0/beta/amd64_rhel6 -j12 ./b2 --prefix=/unsup/boost-1.53.0/beta/common --exec-prefix=/unsup/boost-1.53.0/beta/amd64_rhel6 -j12 install however it is ignoring my --exec-prefix and installing everything to /unsup/boost-1.53.0/beta/common. I actually haven't really used --exec-prefix before I think, and have just manually moved stuff around post-installation instead. But I figured I'd try to do it "right" this time and actually use the tools I've been given. :-) What am I doing wrong? [Disclaimer: I made a typo originally and ran both bootstrap.sh and b2 with both --prefix and --exec-prefix set to ..../common. I did run './b2 clean' after that though.] Evan

1 0

How to use geometry::within with a polygon that encompasses a pole
by Cameron Sabol 08 Jan '13

08 Jan '13

Hi, I'm have an issue with polygons from the geometry library using the spherical_equatorial coordinates when the polygon is meant to wrap a pole. e.g. namespace bg = boost::geometry; typedef bg::model::point < double, 2, bg::cs::spherical_equatorial<bg::degree> > LonLatPoint; bg::model::polygon < LonLatPoint> northPoleBoundary; double lon = -180; while (lon <= 180) { bg::append(northPoleBoundary, LonLatPoint(lon, 88)); lon += 5; } LonLatPoint northPole(90, 0); bool isInNorthPole = bg::within(northPole, northPoleBoundary); This code is giving me isInNorthPole == false. Am I constructing my polygon incorrectly? Is this a bug? Or is this behavior simply not implemented? Thanks for your help!

2 2

[MultiArray, Intrusive] Instantiating a multi_array of intrusive lists as a class member
by Jiri Vyskocil 08 Jan '13

08 Jan '13

Hello, I want to try Boost Intrusive list instead of std::list in a performance and memory critical part of code. I have a Domain object, which contains a boost::multi_array of cells. each cell contains a list of particles std::list<Particle>. This sample code works as expected (std::list): #include <list> #include <iostream> #include <boost/multi_array.hpp> struct Particle { unsigned number; Particle(unsigned n){ number = n; } }; typedef std::list<Particle> ParticleList; typedef boost::multi_array<ParticleList, 3> ParticleArray; class Domain { public: ParticleArray particles; Domain(int x, int y, int z) : particles(boost::extents[x][y][z]) { } }; int main(){ Domain* dom = new Domain(10,10,10); dom->particles[5][5][5].push_back(Particle(1)); std::cout << dom->particles[5][5][5].front().number << std::endl; return 0; } When I try to swap the std::list for an intrusive list, I get a compile error on Domain instantiation. Minimal code leading to the error: #include <boost/intrusive/list.hpp> #include <boost/multi_array.hpp> typedef boost::intrusive::list_base_hook<> BaseHook; struct Particle : BaseHook { unsigned number; }; typedef boost::intrusive::list<Particle> ParticleList; typedef boost::multi_array<ParticleList, 3> ParticleArray; class Domain { public: ParticleArray particles; Domain(int x, int y, int z) : particles(boost::extents[x][y][z]) { } }; int main(){ Domain* dom = new Domain(10,10,10); return 0; } When I try to compile the above code, gcc tells me: In file included from /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_tempbuf.h:61:0, from /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_algo.h:64, from /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/algorithm:63, from /usr/include/boost/move/move.hpp:37, from /usr/include/boost/intrusive/detail/has_member_function_callable_with.hpp:22, from /usr/include/boost/intrusive/detail/memory_util.hpp:112, from /usr/include/boost/intrusive/pointer_traits.hpp:26, from /usr/include/boost/intrusive/detail/utilities.hpp:17, from /usr/include/boost/intrusive/list_hook.hpp:19, from /usr/include/boost/intrusive/list.hpp:20, from intrusive.cc:1: /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_construct.h: In function ‘void std::_Construct(_T1*, const _T2&) [with _T1 = boost::intrusive::list<Particle>, _T2 = boost::intrusive::list<Particle>]’: /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_uninitialized.h:189:3: instantiated from ‘static void std::__uninitialized_fill_n<_TrivialValueType>::__uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = boost::intrusive::list<Particle>*, _Size = long unsigned int, _Tp = boost::intrusive::list<Particle>, bool _TrivialValueType = false]’ /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_uninitialized.h:225:7: instantiated from ‘void std::uninitialized_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = boost::intrusive::list<Particle>*, _Size = long unsigned int, _Tp = boost::intrusive::list<Particle>]’ /usr/include/boost/multi_array.hpp:477:5: instantiated from ‘void boost::multi_array<T, NumDims, Allocator>::allocate_space() [with T = boost::intrusive::list<Particle>, long unsigned int NumDims = 3ul, Allocator = std::allocator<boost::intrusive::list<Particle> >]’ /usr/include/boost/multi_array.hpp:186:5: instantiated from ‘boost::multi_array<T, NumDims, Allocator>::multi_array(const boost::detail::multi_array::extent_gen<NumDims>&) [with T = boost::intrusive::list<Particle>, long unsigned int NumDims = 3ul, Allocator = std::allocator<boost::intrusive::list<Particle> >]’ intrusive.cc:18:49: instantiated from here /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_construct.h:84:7: error: passing ‘const boost::intrusive::list<Particle>’ as ‘this’ argument of ‘boost::intrusive::list<T, O1, O2, O3>::operator boost::rv<boost::intrusive::list<T, O1, O2, O3> >&() [with T = Particle, O1 = boost::intrusive::none, O2 = boost::intrusive::none, O3 = boost::intrusive::none]’ discards qualifiers [-fpermissive] This is just a minimal sample code to trigger an error. In the actual code, both Domain and Particle objects are more complicated. The last line of error output is sligtly different: /usr/lib/gcc/x86_64-pc-linux-gnu/4.6.3/include/g++-v4/bits/stl_construct.h:84:7: error: no matching function for call to ‘boost::intrusive::list<Particle>::list(const boost::intrusive::list<Particle>&)’ followed by a note with a list of candidate functions. If I define the multi_array so that it contains pointers to ParticleArray, i.e.: typedef boost::multi_array<ParticleList*, 3> ParticleArray; there seems to be no benefit over the std::list approach, since I have to hold the additional pointer. In a test simulation, this variant eats about 10% more RAM, which is of concern in our situation. Any ideas how to replace std::list with boost::intrusive::list in a multi_array in a way which wouldn't consume more memory than the std::list approach? (I would want to see if it also brings the much needed performance benefit) Jiri Vyskocil

2 5

[Iterator] filter_iterator over greedy?
by Robert Jones 07 Jan '13

07 Jan '13

Hi Folks, Somewhat to my surprise this code, simply creating a filter_iterator, evaluates the predicate until an element satisfying the predicate is found. This seems wrong to me. Shouldn't evaluation of the predicate be delayed until the filter_iterator is dereferenced? Thx, Rob. #include <iostream> #include <boost/range.hpp> #include <boost/iterator/filter_iterator.hpp> bool predicate( int i ) { std::cout << "predicate(" << i << ")" << std::endl; return true; } int main( ) { int array[] = { 0, 1 }; boost::make_filter_iterator( predicate, boost::begin( array ), boost::end( array ) ); } > [Run] predicate(0) >

2 1

Using OvenToBoost 'taken'.
by Robert Jones 07 Jan '13

07 Jan '13

Hi Folks This question is about using the OvenToBoost port, not currently part of Boost, but likely to be soon, I understand. The code below evaluates the predicate for the first and second elements of the array. The evaluation of the second element seems to me to be unnecessary and wrong, since the 'taken' adaptor knows the range is ended after the first element is taken. Thoughts? Thx, Rob. #include <boost/range/adaptor/filtered.hpp> #include <boost/range/adaptor/taken.hpp> #include <boost/range/algorithm/for_each.hpp> #include <iostream> bool predicate( int i ) { std::cout << "predicate(" << i << ")" << std::endl; return true; } void doNothing( int ) { } int main( ) { int array[ ] = { 0, 1, 2, 3, 4, 5 }; for_each( array | boost::adaptors::filtered( predicate ) | boost::adaptors::taken( 1 ), doNothing ); }

2 2

[Property Tree] Complexity of find and get methods
by Elizabeta 07 Jan '13

07 Jan '13

Hi I want to know the complexity of boost property tree find and get methods. I tried the following link http://www.boost.org/doc/libs/1_41_0/doc/html/boost/property_tree/basic_ptr… but it seems that the complexity is not specified. Also can find function accept string paths or it just finds immediate childs? Thank you

2 1

Problem finally found!
by Gonzalo Garramuno 06 Jan '13

06 Jan '13

My problem was that acceptor_ was called twice and two sessions were created. The first session was used properly while the second session missed the socket setup. class server { public: server(boost::asio::io_service& io_service, const tcp::endpoint& listen_endpoint, mrv::ViewerUI* v) : io_service_(io_service), acceptor_(io_service, listen_endpoint), ui_( v ) { start_accept(); } void start_accept() { tcp_session_ptr new_session( boost::make_shared<tcp_session>( boost::ref( io_service_ ), boost::ref(ui_) ) ); std::cerr << "******** TCP SESSION " << new_session << std::endl; acceptor_.async_accept(new_session->socket(), boost::bind(&server::handle_accept, this, new_session, _1)); } void handle_accept(tcp_session_ptr session, const boost::system::error_code& ec) { if (!ec) { session->start(); } start_accept(); // BAD } Changed to: void handle_accept(tcp_session_ptr session, const boost::system::error_code& ec) { if (!ec) { session->start(); } else { start_accept(); } } I still don't know why this is so and the problem is not fully resolved, as only the server change in the timeline works only once, but at least the server now works.

3 3

[interprocess] (OS X) waiting on condition variable = CPU 100% + fans running loud
by Francisco Lopes 06 Jan '13

06 Jan '13

Hi, I was implementing a kind of server using shared memory. The server should keep idle, waiting for a request and I do this by waiting on a condition variable, of course. I then noticed my fans running high when I let the server waiting a little longer while testing and discovered this happens simply because of some busy loop implementation for condition waiting. Is there any reason for that? Given the interprocess library age, no way for implementing a non-busy interprocess condition variable waiting is available? https://svn.boost.org/trac/boost/ticket/6108 Regards, Francisco Lopes

2 1

MPL vs. Proto for EDSL dev?
by Chris Russell 05 Jan '13

05 Jan '13

Hello, all. I'm reading the MPL book (again) and tinkering with some ideas for a new library for building complex FSM hierarchies [1]. I've got a minimal runtime library written that codifies the important concepts but now want to try to make it a native C++ EDSL and am wondering if it makes more sense to concentrate on MPL, Proto (or both)? For pure education on the subject of C++ template metaprogramming the MPL and the amazing Abrahams/Gurtovoy book seems like the right starting place but would appreciate any advice you folks are willing to share with me. Thanks, Chris [1] I am aware of other FSM libs (e.g. StateChart, MSM) and likely some of what I'm planning is redundant. That's okay: my goal is to gain deeper understanding of C++ template metaprogramming by working through a non-trivial problem.

2 2

boost-mpi assertion during recv fails
by Kyle Joseph Berger 04 Jan '13

04 Jan '13

Hello, I am using boost-mpi and I am getting an error that I am having a hard time figuring out. I am using a recv call and an assertion in the boost code fails: void boost::mpi::binary_buffer_iprimitive::load_impl(void *, int): Assertion `position+l<=static_cast<int>(buffer_.size())' This is from the file binary_bffer_iprimitive.hpp located in boost/mpi/detail/. This does not occur the first time I am receiving so I know it's not a general error with every send/recv call I make. I think this assertion is checking whether the buffer is large enough to accommodate the data being received, but I'm not even sure about that. If that is the case, what could cause the buffer to not be large enough? Shouldn't that be taken care of by the underlying boost? Thanks, Kyle

2 2

[Locale] Security bug announcement - UTF-8 validation
by Artyom Beilis 04 Jan '13

04 Jan '13

Hello, Boost.Locale library in Boost 1.48 to 1.52 including has a security flow. boost::locale::utf::utf_traits accepted some invalid UTF-8 sequences. Applications that used these functions for UTF-8 input validation could expose themself to security threats as invalid UTF-8 sequece would be considered as valid. This bug is fixed in upcoming Boost 1.53. For more details see: https://svn.boost.org/trac/boost/ticket/7743 Users who can't upgrade to the latest versions may apply the following patch to fix the problem. http://cppcms.com/files/locale/boost_locale_utf.patch Regards, Artyom Beilis -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/

1 0

How to convert shared_ptr to pointer?
by young 03 Jan '13

03 Jan '13

I have shared_ptr<int> variable. I need to pass a int* pointer to a function call. How to pass shared_ptr<int> as int *? -- View this message in context: http://boost.2283326.n4.nabble.com/How-to-convert-shared-ptr-to-pointer-tp4… Sent from the Boost - Users mailing list archive at Nabble.com.

5 4

[Polygon] Boolean (Clipping) performance
by kusogray 03 Jan '13

03 Jan '13

Hi there, I input 200,000 to both polygon set A and B, with each polygon contains 5~8 points then do the A^B; however, this instruction cost about *30 minutes.* my question is: I thought the O(n logn) algorithm with n ~ 1,000,000 just cost about at most 2 or 3 mins I checked the XOR AND OR result is correct, but the performance is weird, did I do anything wrong or misunderstanding? Thanks for reading this! -- View this message in context: http://boost.2283326.n4.nabble.com/Polygon-Boolean-Clipping-performance-tp4… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[system] local static and threading in C++03
by Felipe Magno de Almeida 02 Jan '13

02 Jan '13

Hello, Boost.System returns the system_category this way: BOOST_SYSTEM_DECL const error_category & system_category() { static const system_error_category system_category_const; return system_category_const; } But couldn't this make double construction/double free in C++03 systems if system_category is ran concurrently? Regards, -- Felipe Magno de Almeida

4 11

[serialization] deserializing chunk by chunk
by Arash Abghari 02 Jan '13

02 Jan '13

Hi, I have an encrypted archive. I can decrypt the file chunk by chunk. I wonder if there is a way to deserialize each chunk on the fly. The main purpose is to reduce the memory footprint of the application since the archive can be a few hundred mega bytes. The problem as I mentioned is the file is encrypted and it has to be decrypted first in the memory and then deserialized. Thanks, Arash

2 2

[filesystem] segfault in path::imbue after upgrade to boost 1.52
by Shawn Chidester 02 Jan '13

02 Jan '13

Just upgraded from boost 1.47 to 1.52 and I'm experiencing segmentation faults in boost::filesystem::path::imbue. This is on 64-bit Ubuntu 12.04 and 12.10. Compiling with g++-4.6 Here is a stack trace from valgrind: ==26893== Memcheck, a memory error detector ==26893== Copyright (C) 2002-2012, and GNU GPL'd, by Julian Seward et al. ==26893== Using Valgrind-3.9.0.SVN and LibVEX; rerun with -h for copyright info ==26893== Command: bin/example ==26893== ==26893== Invalid read of size 4 ==26893== at 0x9843970: std::locale::locale(std::locale const&) (in /usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.17) ==26893== by 0x69FAD0F: boost::filesystem::path::imbue(std::locale const&) (path.cpp:918) ==26893== by 0x69FAC76: boost::filesystem::path::codecvt() (path.cpp:911) ==26893== by 0x69F8546: boost::enable_if<boost::filesystem::path_traits::is_pathable<boost::decay<char*>::type>, boost::filesystem::path&>::type boost::filesystem::path::operator=<char*>(char* const&) (path.hpp:202) ==26893== by 0x69F4737: boost::filesystem::detail::current_path(boost::system::error_code*) (operations.cpp:1077) ==26893== by 0x5AB0D2C: boost::filesystem::current_path() (operations.hpp:429) ==26893== by 0x5AB0447: __static_initialization_and_destruction_0(int, int) (example.cpp:53) ==26893== by 0x5AB0BB5: _GLOBAL__sub_I_example.cpp (example.cpp:1192) ==26893== by 0x400F315: call_init.part.0 (dl-init.c:85) ==26893== by 0x400F3EE: _dl_init (dl-init.c:52) ==26893== by 0x40016F9: ??? (in /lib/x86_64-linux-gnu/ld-2.15.so) The stack trace looks the same in GDB. In case it's of any use here's what "path_locale" looks like at path.cpp:918 (gdb) frame #1 0x00007ffff561ed10 in boost::filesystem::path::imbue (loc=...) at boost/libs/filesystem/src/path.cpp:918 918 std::locale temp(path_locale); (gdb) print path_locale $1 = {_M_impl = 0x0} I'm guessing the crash has to do with path_locale being uninitialized, but I don't know what to do about it (if that is indeed the problem). If anyone can provide some insight (or better yet, a solution) I would be very grateful! Thanks, Shawn

2 2

Re: [Boost-users] Server failing when BOOST_ASIO_ENABLE_HANDLER_TRACKING is active
by Gonzalo Garramuno 02 Jan '13

02 Jan '13

On 01/01/13 22:11, Gonzalo Garramuno wrote: > 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] > pure virtual method called > terminate called without an active exception > Aborted (core dumped) >

1 0

Converting a BOOST_FOREACH to use the new c++ 11 lambda syntax
by Sean Farrow 01 Jan '13

01 Jan '13

Hi Fokes: I'm trying to convert a BOOST_FOREACH loop to use the new lambda syntax: I have a ptree variable declared in a class of which the foreach is part. I also have a vector<std::wstring> that I need to use within my lambda. This all being the case, the following is the original BOOST_FOREACH: BOOST_FOREACH(boost::property_tree::ptree::value_type &v, IniTree) IniSections.push_back(ConvertToWString(v.first)); And the following is the converted lambda: std::for_each(IniTree.begin(), IniTree.end(), [&] (boost::property_tree::ptree::value_type &v) { IniSections.push_back(ConvertToWString(v.first)); }); Is this the right way to go about the conversion-have I missed anything? Any help appreciated. Regards Sean.

5 5

Re: [Boost-users] mpi isend to group
by Andreas Schäfer 31 Dec '12

31 Dec '12

On 23:12 Sun 30 Dec , Philipp Kraus wrote: > Sorry I have forgot a "main information": This calls are a preexecution of > the algorithm. The main algorithm is cycled and uses a MPI blocking > communication, so only the preexecution must be a little bit weak. Sorry, I don't quite get it. Could you elaborate on this? What is in this context the "preexecution", what is the main algorithm, and what do you mean by "must be a little bit weak"? > Thanks for the code, but this code is based on OpenMPI. My program must > be also work wirth MPI CH2 (MPI implemention on Windows based systems), > so I would like to create a boost-only solution. The code uses the MPI standard interface, it contains nothing specific to Open MPI (BTW: it's not called "OpenMPI", but that's just nitpicking). It thus works with MPICH2, too -- no matter if the OS is Linux or Windows. > I do it at the moment with: > > while (thread_is_running) { > > if (!l_mpicom.rank()) > for(std::size_t i=1; i < l_mpicom.size(); ++i) > l_mpicom.isend(i, 666, l_task.getID()); > else > if (boost::optional<mpi::status> l_status = l_mpicom.iprobe(0, 666)) > { > std::size_t l_taskid = 0; > l_mpicom.recv( l_status->source(), l_status->tag(), l_taskid ); > } > } You could rebuild the binary tree communication scheme I've illustrated using Boost MPI (I'm too lazy). I'm pretty sure calling isend() without ever waiting for completion is illegal according to the MPI standard and will result in a memory leak (plus the code won't scale thanks to the for loop). Cheers -Andreas -- ========================================================== Andreas Schäfer HPC and Grid Computing Chair of Computer Science 3 Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany +49 9131 85-27910 PGP/GPG key via keyserver http://www.libgeodecomp.org ========================================================== (\___/) (+'.'+) (")_(") This is Bunny. Copy and paste Bunny into your signature to help him gain world domination!

2 3

Some boost headers use Objective-C keywords
by Reiche, Albert F (Albert) 30 Dec '12

30 Dec '12

I am using boost 1.49.0. An example of this is boost\local.hpp" which includes "boost\locale\message.hpp" which defines "id" (an Objective-C keyword) as a local variable in one of its inline functions. This causes an issue when boost headers are included in any code that is parsed by the Objective-C compiler and makes it impossible to include some boost headers directly in Objective-C source files. Would be nice if you could avoid using Objective-C keywords in all public headers. Albert

5 5

mpi isend to group
by Philipp Kraus 30 Dec '12

30 Dec '12

Hello, I have got a problem to create a mpi::isend call. I have got a thread loop like: while (thread_is_running) { std::size_t id = 0; if (!mpicom.rank()) { try { id = getID(); mpicom.isend(id) } catch (...) { } } else { mpicom.ireceive(id); } if (id > 0) { mpi::barrier(); do something with id } boost::thread::yield(); } I would like to create a non-blocking communication over all nodes, so my node with rank 0 checks if a dataset exists, if it exists, the id should be send to all other hosts. After all hosts reveived this id, they should start the calculation. The nodes must be synchronized before the "working part" is startet, but if there is no data send to the host, they should do nothing. I don't know how to use isend to send a message to all hosts. I know only the mpi::any_source flag but I can not find an any_destination. IMHO the ireceive call must be written with iprobe like if (boost::optional<mpi::status> l_status = mpicom.iprobe( 0, myTag )) { std::size_t id = 0; mpicom.recv( l_status->source(), l_status->tag(), id ) } Is there a way to create a non-blocking group communication? How can I send if data exists, a message to all nodes and receive it on each node also with non-blocking communication? Thanks for your help Phil }

3 5

boost thread with class
by Philipp Kraus 30 Dec '12

30 Dec '12

Hello, I use a thread group for creating a blocking thread calculation. Each thread is created with a boost::bind to a member function, but I would like to create a own class for the thread eg class myThread { public some methods private some properties } The group should be boost::thread_group g; for(int i=0; i < 10; i++) g.add( myThread( i ) ) g.join_all(); Which structure must be implementated for the class myThread and from which class must be derived? Thanks Phil

3 5

How to use boost serialization and standard arrays?
by D. R. Evans 30 Dec '12

30 Dec '12

I've spent quite a bit of time searching and reading, but I can't understand why the following is happening. Given a simple function: (non-boost headers) . . . #include <boost/archive/binary_oarchive.hpp> #include <boost/serialization/array.hpp> . . . void archive_data(void) { ofstream ofs(context.archive_name()); boost::archive::binary_oarchive ar(ofs); array<int, 10> test; ar << test; } I get: /usr/include/boost/serialization/access.hpp:118:9: error: ‘struct std::array<int, 10u>’ has no member named ‘serialize’ ---- The documentation says: > This group of headers includes templates which implement serialization for > Standard Library or Boost Library templates. Any program which uses these > templates can invoke serialization of objects of these types just by > including the corresponding header. But it seems that including <boost/serialization/array.hpp> is insufficient. What am I missing? (Of course, in practice I'm not doing this with simple ints, but I've simplified greatly to get to the above example, which still fails.) This is my first attempt at using boost serialization, so I expect I've just misunderstood something quite simple. Doc Evans -- Web: http://www.sff.net/people/N7DR

2 3

socket.is_open returning false when it is in use
by Gonzalo Garramuno 30 Dec '12

30 Dec '12

I have a problem with my program and I traced it to socket.is_open which returns as closed even while the connection is active in my server program. The client, however, can still communicate with that supposedly closed socket. The program is similar to the timeouts example. I can post all the source code if needed.

4 12

compile some code with boost.python by mingw in win7-64bit
by simon zhang 30 Dec '12

30 Dec '12

I decided to make my program compatible with windows environment.But I have very little programming experience on windows.There are some errors need help. Environment: - os: win7-64bit, - ide: codeblocks12.11, - python: Python 2.7.3 Windows X86-64 Installer (Windows AMD64 / Intel 64 / X86-64 binary [1] -- does not include source) - compiler: mingw that come from codeblocks installation package. - boost: boost1.52 I only copy and test this "hello" code that come from ".\boost_1_52_0\libs\python\example\tutorial" Code: #include <iostream>#include <boost/python/module.hpp>#include <boost/python/def.hpp> char const* greet(){ return "hello, world"; } BOOST_PYTHON_MODULE(hello_ext){ using namespace boost::python; def("greet", greet);} using namespace std;int main(){ cout << "Hello world!" << endl; return 0;} Error info: mingw32-g++.exe -Wall -fexceptions -g -ID:\boost\include\boost-1_52 -IC:\Python27\include -c E:\project\snail-MW\test1\main.cpp -o obj\Debug\main.o mingw32-g++.exe -LD:\boost\lib\ -LC:\Python27\libs -o bin\Debug\test1.exe obj\Debug\main.o -static obj\Debug\main.o: In function `inithello_ext': E:/project/snail-MW/test1/main.cpp:11: undefined reference to `boost::python::detail::init_module(char const*, void (*)())' obj\Debug\main.o: In function `ZNK5boost6python9type_info4nameEv': D:/boost/include/boost-1_52/boost/python/type_id.hpp:165: undefined reference to `boost::python::detail::gcc_demangle(char const*)' obj\Debug\main.o: In function `ZNK5boost6python15to_python_valueIRKPKcEclES5_': D:/boost/include/boost-1_52/boost/python/converter/builtin_converters.hpp:161: undefined reference to `boost::python::converter::do_return_to_python(char const*)' ................ It have also do some errors that only compile by the command of "bjam toolset=gcc variant=release " in the station ".\boost_1_52_0\libs\python\example\tutorial".

1 0

thread-safe boost::random_device / boost:mt19937
by Philipp Kraus 27 Dec '12

27 Dec '12

Hello, I'm using boost::random_device & boost::mt19937 for creating random numbers. I would like to use both within different threads, are both object thread-safe, so I can use it without any thread locking? Thanks Phil

3 4

filesystem : home directory
by berenger.morel＠neutralite.org 27 Dec '12

27 Dec '12

Hello. I am would like to use path like "~/.config" in the filesystem. I've searched in documentation and find nothing about it, so I ended by doing something I do not really like, but which sounds to work (I did not tried it on windows, but I my software is not a linux-only one and so I hope people will use it on other OSes. My problem is that I only have an XP partition and there are no development softwares on it. I could add some, but it would mean I need to reboot to test a software, and on an old windows... :/ ), at least on linux. Here are copy/past (with todos, just ignore them) of related portions of my code: =========================== = utils.cpp = =========================== #ifdef WIN32 #define HOME "HOMEPATH" ///\todo check that it should not be %APPDATA% instead of %HOMEPATH% #else #define HOME "HOME" #endif ... std::string getUserConfigDir(void) { ///\todo find a better solution to follow freeDesktop.org's recommmandations std::string homepath(getenv(HOME));///\note flawfinder say I should use getenv with care const fs::path usualUserConfig(homepath + "/.autorealm/config"); if(fs::exists(usualUserConfig)) return usualUserConfig.string(); const fs::path xdgUserConfig(homepath + "/.config/autorealm/config"); if(fs::exists(xdgUserConfig)) return xdgUserConfig.string(); return std::string(); } =========================== Here, the thing I do not like is to need to use the getenv() function, which is portable, but introduces an #ifdef condition. More important, if I had used things like "~/config/" the source code would have been easier to read and would have avoided one string allocation and some concatenations. But maybe they would have been into filesystem... Another problem which will come from the usage of my system is that it only supports WIN32 and linux, maybe Mac OS, maybe other POSIX systems. As you can see, I can only say "maybe" for other OSes, and for non POSIX OSes (is there is any which is not MSW?) I have just no clue. If that feature was supported by a library, at least it would avoid hard-coded OS's dependent stuff. So, is there is a better way to portably use the $HOME shortcut linux users are used ('~')? If it is any other symbol, I do not care at all, too, I just want an unified way to do that. PS: Of course, if you have other remarks about that code snippet or other things, I would be grateful to hear them.

1 0

Fusion variadic vs. fusion numbered vector
by Андрей - 23 Dec '12

23 Dec '12

Hi Is there any converter ( such as boost::fusion::as_vector ) in fusion for convert numbered form type of boost::fusion::vector to variadic ? Another question is why boost::fusion::make_vector ad boost::fusion::as_vector returns numbered forms of vector but boost::fusion::vector_tie - variadic ?

1 0

Replacing task_io_service (using io_service with an external threadpool)
by Juan Ramírez 23 Dec '12

23 Dec '12

Hi! I created a (yet another) threapool library a few month ago and, at my company, we are starting to use it widely in different services. Using the library has lots of advantages for us, mainly because of it performance compared with similar libraries. The problem we are having is that we are using 'two' different kinds of thread pool in the same service: * The first one is the one I wrote above, the pool provided by my library, which is used to execute by the service to execute long or expensive operations. * And the second one, is the one created a the network level, where about a hundred threads are created in order to attend network requests. ** Actually calling new thread(io_service::run, ...) I wanted to move the thread-handling at the network level to my library, so I started to look at documentation about extending boost::asio and adapting my library to the io_service requirements. What I want to do now is to make the io_service object actually use the threadpool library for task execution. I have taken a look to use_service, add_service, and the io_service::service class, and I think I already have a pretty good implementation of a 'poor man's adaptor' between my library and boost asio. The question is, how do I force the io_service object to use my service implementation instead of the on provided by boost::asio::detail::task_io_service? I mean, I haven't tested yet but I have no idea about how does the io_service know which service should be used in each case. Do I have to force the removal of task_io_service? Do I have to call pool() somewhere or re-implement run() functions? Thanks in advance Best Regards __________ Saludos! Juan

2 1

[spirit][qi] on_error handler
by Diederick C. Niehorster 22 Dec '12

22 Dec '12

Hi All, I have struggled through getting a parser set up with qi, but in the end it all worked out. Its really a nice library once you get the hang of it a bit! I have one leftover question. I now have an inline function with phoenix for the error handler as per the example, but as i'm using it multiple times, i would like to make its own function that i can reuse. I have tried a function object, wrapped in a phoenix function or not, but never got it to work (either got number of argument mismatches or errors that const-volatile qualifiers were being dropped). So basically, how would i rewrite the below into a free function (object/etc)? qi::on_error<qi::fail> ( stimSpecVec // rule name , std::cout // the function << phoenix::val("Error! Expecting \"") << qi::_4 // what failed? << phoenix::val("\", but got: \"") << phoenix::construct<std::string>(qi::_3, qi::_2) // iterators to error-pos, end << phoenix::val("\"") << std::endl ); Thanks! Dee

2 2

Boost.MSM: Exit a composite state after an event has been fired from that composite state?
by RaRi 21 Dec '12

21 Dec '12

Hi list, I'm using boost.msm from the boost 1.52 library and trying to fire an event from a composite state to enter a state of a top level state machine. Unfortunatly this doesn't work. Please consider here for the following code: namespace { namespace msm = boost::msm; namespace msmf = boost::msm::front; namespace mpl = boost::mpl; // ----- Events struct Event1 {}; struct Event2 {}; struct EventSub1 {}; struct EventSub2 {}; // ----- State machine struct OuterSm_:msmf::state_machine_def<OuterSm_> { struct State1_:msmf::state_machine_def<State1_> { template <class Event,class Fsm> void on_entry(Event const&, Fsm&) const { std::cout << "State1::on_entry()" << std::endl; } template <class Event,class Fsm> void on_exit(Event const&, Fsm&) const { std::cout << "State1::on_exit()" << std::endl; } struct SubState1:msmf::state<> { template <class Event,class Fsm> void on_entry(Event const&, Fsm& fsm) const { std::cout << "SubState1::on_entry()" << std::endl; std::cout << "SubState1::fire event2()" << std::endl; fsm.process_event(Event2()); // Produces an assertion -> It is not possible to leave the submachine although the "Event2()" is defined as transition in the transition table of the outermachine. } template <class Event,class Fsm> void on_exit(Event const&, Fsm&) const { std::cout << "SubState1::on_exit()" << std::endl; } }; struct SubState2:msmf::state<> { template <class Event,class Fsm> void on_entry(Event const&, Fsm& a) const { std::cout << "SubState2::on_entry()" << std::endl; } template <class Event,class Fsm> void on_exit(Event const&, Fsm&) const { std::cout << "SubState2::on_exit()" << std::endl; } }; struct Exit1:msmf::exit_pseudo_state<msmf::none> {}; // Set initial state typedef mpl::vector<SubState1> initial_state; // Transition table struct transition_table:mpl::vector< // Start Event Next Action Guard msmf::Row < SubState1, EventSub1, SubState2, msmf::none, msmf::none > // Is there a possibility in MSM to exit a composite state if an event is fired from that // msmf::Row < SubState1, Event2, Exit1, msmf::none, msmf::none > I don't want this! > {}; }; struct State2:msmf::state<> { template <class Event,class Fsm> void on_entry(Event const&, Fsm&) const { std::cout << "State2::on_entry()" << std::endl; } template <class Event,class Fsm> void on_exit(Event const&, Fsm&) const { std::cout << "State2::on_exit()" << std::endl; } template <class Event, class Fsm, class SourceState, class TargetState> void operator()(Event const&, Fsm& f, SourceState&, TargetState&) const { std::cout << "Do function" << std::endl; } }; typedef msm::back::state_machine<State1_> State1; // Set initial state typedef State1 initial_state; // Transition table struct transition_table:mpl::vector< // Start Event Next Action Guard msmf::Row < State1, Event2, State2, State2, msmf::none > > {}; }; // Pick a back-end typedef msm::back::state_machine<OuterSm_> Osm; void test() { Osm osm; osm.start(); // osm.process_event(Event2()); // This works fine -> Leaving state "Substate1" of the submachine } } int main() { test(); return 0; } You see that the code calls f*sm.process_event(Event2())* within the state *SubState1* of the submachine to make a transition from the top-level state *State1* to *State2* of the outer statemachine. Unfortunately this doesn't work although the *Event2* is defined in the transition table of the outer-statemachine. On the other hand it a transition from *State1* to state *State2* works in case the event *Event2* is fired outside the submachine ( please refer to the void test() function in the code above). I actually don't want to define a transition in the transition table of submachine to enter an pseudo exit point like: msmf::Row < SubState1, Event2, Exit1, msmf::none, msmf::none > Is there a possibility in MSM to exit a composite state if an event is fired from that composite state? Thank you in advance for your time and help! Grüße ;), RaRi -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-MSM-Exit-a-composite-state-after-a… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

Install Boost 1.52.0 for Visual Studio 2012 on Windows 8
by Boost lzw 21 Dec '12

21 Dec '12

Hello All, I used the following Windows installer to install Boost in the past for Visual Studio 2008 Professional on Windows XP in the past: http://www.boostpro.com/download/ It seems to me that the above installer is not for Visual Studio 2012 on Windows 8. Is there anyone here who is aware of a Windows Installer for installing Boost 1.52.0 for Visual Studio 2012 on Windows 8 ? Thanks in advance. Happy Holidays, Robert

2 3

Is 'double' a signed type? (boost type traits)
by cdmh 21 Dec '12

21 Dec '12

Hi, I have found some surprising behaviour with boost type traits using MSVC2012 (v11). I used boost::is_signed<T>::value where T is double and it evaluates to false, but I expected true as double can hold negative numbers. More surprisingly, I found that, for double, is_unsigned is not the inverse of is_signed, and hence this static assert produces a compiler error. BOOST_STATIC_ASSERT(boost::is_unsigned<double>::value == !boost::is_signed<double>::value); I am missing a rationale for this, or it is a bug? Thanks -- Craig -- View this message in context: http://boost.2283326.n4.nabble.com/Is-double-a-signed-type-boost-type-trait… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

boost::bind for C function
by Philipp Kraus 21 Dec '12

21 Dec '12

Hello, I have got a a C library function call, which defines a function: typedef int (*CFunction) (State* K); So I would like to use boost::bind / boost::function to create the binding to a class method: boost::function<CFunction>( boost::bind(&MyClass::myMethod, this) ) so that I can use the class method with the CFunction signature. I would like to call a class method with the object context like a C function. Can anybody help me to create a correct binding? Thanks Phil

6 11

[Property Message] How to store variant in property tree
by Elizabeta 21 Dec '12

21 Dec '12

Hi I want to store variant object in my property tree. The variant for now will have only 3dPoint object, but it should vary multiple types in future. I tried the following code , and I am getting compiler errors. I know that maybe I need to write some kind of translation code for this to work,but don't know how to do that exactly and having hard time to grasp the concept. So how can I do this if possibly at all ? A code example would be great class 3dPoint { public: 3dPoint(double,double,double); double x; double y; double z; }; typedef boost::variant<ON_3dPoint> MyVariant; using namespace boost::property_tree; typedef basic_ptree<std::string,MyVariant> my_ptree; my_ptree pt; MyVariant point_variant = 3dPoint(1,2,3); pt.put("point",point_variant); MyVariant point_variant2 = pt.get("point"); boost::property_tree::xml_writer_settings<char> settings('\t', 1); write_xml("C:\\property.xml",pt,std::locale(),settings);

2 2

Symbol 'is_arithmetic' could not be resolved, Symbol 'is_const' could not be resolved, Symbol 'value' could not be resolved
by Tanya 21 Dec '12

21 Dec '12

Dear Boost Users, I have a code with: BOOST_STATIC_ASSERT(::boost::is_arithmetic<T>::value); and it gives error message: - Symbol 'is_arithmetic' could not be resolved - Symbol 'value' could not be resolved and, BOOST_STATIC_ASSERT(!::boost::is_const<T>::value); and it gives error message: - Symbol 'value' could not be resolved - Symbol 'is_const' could not be resolved what should I include to get rid of these error message? I use: - Boost 1.46.1. - Compiler : Mingw with gcc - IDE: Eclipse Indigo Indigo Service Release 2 - Windows XP Professional SP 3, v. 2002 Any help, hints, would be highly appreciated! Best Regards, Tanya

2 1

BOOST::ASIO load key.pem with passphrase
by Alvaro Leiva 21 Dec '12

21 Dec '12

Currently I'm working with this: ... ctx.use_certificate_chain_file("./C/cert.pem"); ctx.use_private_key_file("./C/key.pem", boost::asio::ssl::context::pem); ctx.load_verify_file("./C/ca.pem");... So far everything works perfect, but what I really need to do is load the same key.pem but with a passphrase, Looking at asio docs found ssl::context::set_password_callback<http://www.boost.org/doc/libs/1_52_0/doc/html/boost_asio/reference/ssl__con…> wich according to the info calls SSL_CTX_set_default_passwd_cb<http://www.openssl.org/docs/ssl/SSL_CTX_set_default_passwd_cb.html> and allows to handle encrypted PEM files, please remember that I'm much more familiarized with high level languages like python, so c++ is not my forte any help is appreciated, Thank you ! -- Alvaro Leiva

1 0

Link problem on Mac - tag_original_exception_type
by John M. Dlugosz 20 Dec '12

20 Dec '12

I'm getting a linker error when I build my program on the Mac, that __ZTSPN5boost27tag_original_exception_typeE is duplicate defined. This is the only symbol that is giving this problem. Any ideas what's special about that one, or what it might be?

1 0

[preprocessor]:issues with expansion.
by Littlefield, Tyler 20 Dec '12

20 Dec '12

hello all: I have the following code: #define REGISTER_MODULE(module)(\ #ifdef BOOST_PP_EQUAL(BOOST_PP_LIST_SIZE(MODULES), 0)\ //there are currently no modules in the list. #define MODULES((module), BOOST_PP_NIL) #else BOOST_PP_LIST_APPEND(MODULES, module)\ #endif ) I am somewhat of a newb at preprocessor magic, so any advice would be useful. For whatever reason this translates out to 'module)' when I try to compile it with -E -P. The idea is that it will add to the modules list (assuming the modules list exists) the module to be registered, which should just be a type. Thanks, -- Take care, Ty http://tds-solutions.net The aspen project: a barebones light-weight mud engine: http://code.google.com/p/aspenmud He that will not reason is a bigot; he that cannot reason is a fool; he that dares not reason is a slave.

3 3

C++ gurus - really dumb question regarding partial speciallization.
by Robert Ramey 20 Dec '12

20 Dec '12

I've got the following code which fails to compile. I'm really stumped by this. I've consulted the standard document on the subject and for the life of me I can't see anything wrong with it. It fails with the same message on vc 9.0 as well as gcc 4.5.3. It's so simple it can't be a compiler issue. I appoligize in advance for spaming the list here - but I'm really, really stuck. Robert Ramey // primary template template< class T, int MIN, int MAX > struct safe_range1{}; // instantiate primary as a test safe_range1<int, 0, 1> t1; // partial specialization # 1 template< int MIN, int MAX > struct safe_range1<int, MIN, MAX>{}; // instantiate partial specialization - what the ??? // fails with "too few template parameters" !!! safe_range1<0, 1> t2; // partial specialization # 2 template<class T> struct safe_range1<T, 0, 1> {}; // also fails with "too few template parameters" !!! safe_range1<int> t3;

3 3

[polygon] bug with self intersecting polygons ?
by Renaud Lepère 20 Dec '12

20 Dec '12

Hello, I'm trying to remove some internal loops on polygons as illustrated in the following drawing : +---------------+ +---------------+ | | / | / | |\ / | / | | X | X | |/ \ | \ | / \ | \ +----->---------+ +----->---------+ I need strong numerical robustness, i am using boost polyon with integer coordinates (using boost-1.52 + win32). It works on a lot of samples but i encounter a bug on an example. I reduced to the following sample which is roughtly a triangle (IMHO it should return a triangle). #include <boost/polygon/polygon.hpp> #include <vector> #include <iostream> using namespace boost::polygon; using namespace std; typedef point_data< int > point; typedef vector< point > points; typedef polygon_set_data< int > polygon_set; typedef polygon_with_holes_data< int > polygon_with_holes; typedef vector< polygon_with_holes > polygons_with_holes; /* * A triangle A, B, C with some nearly aligned points between B and C. * * A * + * |\ * | \ * | \ * | \ * | \ * | \ * | \ * | \ * | /-+ C * B +--- */ polygon_with_holes MakeRawPolygon() { points ps; ps.push_back(point(-181928106,288346744)); // A ps.push_back(point(-15311797,-289428209)); // B ps.push_back(point(56093690,-270295166)); ps.push_back(point(24502047,-278760121)); ps.push_back(point(57745146,-269852659)); ps.push_back(point(56791908,-270108078)); ps.push_back(point(-14613579,-289241121)); ps.push_back(point(82923673,-263106094)); // C polygon_with_holes poly; set_points(poly, ps.begin(), ps.end()); return poly; } int main() { polygon_with_holes polygon(MakeRawPolygon()); polygon_set ps; ps.insert(polygon); // first unrool polygons_with_holes unrolled_polygons; ps.get(unrolled_polygons); if (unrolled_polygons.size() == 0u) { std::cout << "error" << endl; } } Is there something wrong in my code ? or is this a real bug. Thanks for your help and time. Renaud

1 0

[Boost.Test] Command line arguments
by Noah Roberts 20 Dec '12

20 Dec '12

I want to add command line arguments to my unit test but I cannot find how to do so. I found the place to get argc and argv from the main suite, but when I pass in arguments that the framework doesn't already know about I get heap corruption. Is there a way to instruct the unit test framework about additional command line arguments you want to process in your test?

2 1

Boost.MSM -> Ignore events that were not explicitly defined for a state
by RaRi 19 Dec '12

19 Dec '12

Hello list, I'm experimenting a bit with *boost.msm* from the *boost 1.52* library. Please consider the following small code snippted which generally defines a state machine with the states *State1*, *State2* and *State3*, and the events *Event1* (triggers the transition from State1 to State2) and *Event2* (triggers the transition from State2 to State3): #include <iostream> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/front/functor_row.hpp> namespace { namespace msm = boost::msm; namespace msmf = boost::msm::front; namespace mpl = boost::mpl; // ----- Events struct Event1 {}; struct Event2 {}; // ----- State machine struct Sm1_:msmf::state_machine_def<Sm1_> { // States struct Init:msmf::state<> {}; struct State1:msmf::state<> { // Entry action template <class Event,class Fsm> void on_entry(Event const&, Fsm&) { std::cout << "State1::on_entry()" << std::endl; } // Exit action template <class Event,class Fsm> void on_exit(Event const&, Fsm&) { std::cout << "State1::on_exit()" << std::endl; } }; struct State2:msmf::state<> { // Entry action template <class Event,class Fsm> void on_entry(Event const&, Fsm&) { std::cout << "State2::on_entry()" << std::endl; } // Exit action template <class Event,class Fsm> void on_exit(Event const&, Fsm&) { std::cout << "State2::on_exit()" << std::endl; } }; struct State3:msmf::state<> { // Entry action template <class Event,class Fsm> void on_entry(Event const&, Fsm&) { std::cout << "State3::on_entry()" << std::endl; } // Exit action template <class Event,class Fsm> void on_exit(Event const&, Fsm&) { std::cout << "State3::on_exit()" << std::endl; } }; // Set initial state typedef State1 initial_state; // Actions struct InitAction { template <class Event, class Fsm, class SourceState, class TargetState> void operator()(Event const&, Fsm&, SourceState&, TargetState&) const { std::cout << "InitAction()" << std::endl; } }; struct transition_table:mpl::vector< // Start Event Next Action Guard msmf::Row < State1, Event1, State2, msmf::none, msmf::none >, msmf::Row < State2, Event2, State3, msmf::none, msmf::none > > {}; }; // Pick a back-end typedef msm::back::state_machine<Sm1_> Sm1; void test() { Sm1 sm1; sm1.start(); std::cout << "> Send Event2" << std::endl; sm1.process_event(Event2()); std::cout << "> Send Event1" << std::endl; sm1.process_event(Event1()); } } int main() { test(); return 0; } If I compile and execute the code above the software crashes due to the fact, that *Event2* is received in the state *State1*. My understanding of a state machine and boost.msm was, that all events which are not defined for a particular state, will be just ignored and the state receiving this unknown event (here *Event2*) will keept. Is there a possibility in boost.msm ( maybe by adopting to the transition table) to stay in the current state if an event was received which was not assigned to this state? Thank you in advance! Best regards, RaRi -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-MSM-Ignore-events-that-were-not-ex… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

[MPL] HAS_XXX gives the wrong answer after "enable_if" on incomplete type in GCC 4.6/7
by Duncan Exon Smith 19 Dec '12

19 Dec '12

I've run into an unexpected behaviour, and I'm not sure if the compiler has a bug, if Boost.MPL has a bug, or if I have the wrong expectations. I am using Boost v1.49.0, but I also tested r82084 of the Boost trunk. In particular, I have: BOOST_MPL_HAS_XXX_TRAIT_DEF(trait) // skipping important code here struct traitor_1 { typedef void *trait; }; struct traitor_2 { typedef void *trait; }; static_assert(has_trait<traitor_1>::value, "traitor_1::trait is missing"); static_assert(has_trait<traitor_2>::value, "traitor_2::trait is missing"); and the compiler tells me that "has_trait<traitor_1>::value" is "false", while "has_trait<traitor_2>::value" is "true". The above listing skips some key code involving boost::enable_if that appears to break "has_trait". The full listing is below. I would appreciate if any experts could tell me if this behaviour is expected. The complete code listing is below. I've tried: g++-4.6 -std=gnu++0x -I/usr/include/boost-1_49 -c -o/dev/null traitor.cpp g++-4.7 -std=gnu++0x -I/usr/include/boost-1_49 -c -o/dev/null traitor.cpp Thanks very much, Duncan // traitor.cpp # include <boost/utility/enable_if.hpp> # include <boost/mpl/has_xxx.hpp> BOOST_MPL_HAS_XXX_TRAIT_DEF(trait) class C { struct enabler { }; public: template <class T> C(const T &, typename boost::enable_if<has_trait<T>, enabler>::type = enabler()); }; struct traitor_1; void g(const C &); void g(const traitor_1 &); void f(const traitor_1 &t1) { g(t1); } struct traitor_1 { typedef void *trait; }; struct traitor_2 { typedef void *trait; }; static_assert(has_trait<traitor_1>::value, "traitor_1::trait is missing"); static_assert(has_trait<traitor_2>::value, "traitor_2::trait is missing");

3 4

[Getting Started] Library Naming section is out of date
by Colin Powers 19 Dec '12

19 Dec '12

Hi all, apologies for any bad form in this email as it's my first posting, The getting started guide (current link: http://www.boost.org/doc/libs/1_52_0/more/getting_started/unix-variants.htm… ) states "Libraries built without multithreading support can be identified by the absence of -mt". However having done a bit of googling around I think this is no longer true, at least not necessarily. It seems the naming convention changed around Boost 1.40 and this documentation has never been updated. Here are some Stack Overflow links that suggest as much: http://stackoverflow.com/questions/1768943/building-boost-on-linux-library-… http://stackoverflow.com/questions/8940249/boost-how-bjam-constructs-a-libr… http://stackoverflow.com/questions/2293962/boost-libraries-in-multithreadin… I have also done a bit of a play around building Boost 1.49 and confirmed this seems to be the case. Should the wording in the getting started guide be redone to make this clear? It worried me for a moment when I thought I had not been using multithreaded libraries because there was no -mt in the filenames. Cheers -Colin

1 0

[xpressive] compiler errors in c++11 mode with trunk
by Nathan Ridge 19 Dec '12

19 Dec '12

Hello, The following code: #include <string> #include <boost/xpressive/xpressive_static.hpp> void foo(const boost::xpressive::sregex& regex) { std::string input; boost::xpressive::regex_replace(input, regex, ""); } when compiled with GCC (I tested with 4.6/4.7/4.8) in C++11 mode, gives the following compiler error: In file included from boost/boost/xpressive/detail/core/regex_impl.hpp:21:0, from boost/boost/xpressive/match_results.hpp:54, from boost/boost/xpressive/detail/core/access.hpp:21, from boost/boost/xpressive/detail/core/state.hpp:18, from boost/boost/xpressive/detail/core/matcher/alternate_end_matcher.hpp:20, from boost/boost/xpressive/detail/core/matchers.hpp:17, from boost/boost/xpressive/regex_primitives.hpp:22, from boost/boost/xpressive/xpressive_static.hpp:24, from test.cpp:2: boost/boost/xpressive/detail/utility/tracking_ptr.hpp: In instantiation of 'struct boost::xpressive::detail::tracking_ptr<boost::xpressive::detail::regex_impl<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char> > > >': boost/boost/proto/detail/preprocessed/expr_variadic.hpp:50:49: required from 'struct boost::proto::exprns_::expr<boost::proto::tagns_::tag::terminal, boost::proto::argsns_::term<boost::xpressive::detail::tracking_ptr<boost::xpressive::detail::regex_impl<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char> > > > >, 0l>' boost/boost/xpressive/basic_regex.hpp:53:8: required from 'struct boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char> > >' boost/boost/xpressive/regex_algorithms.hpp:916:5: required from 'BidiContainer boost::xpressive::regex_replace(BidiContainer&, const boost::xpressive::basic_regex<BidiIter>&, const typename boost::iterator_value<BidiIter>::type*, boost::xpressive::regex_constants::match_flag_type, typename boost::disable_if<boost::xpressive::detail::is_char_ptr<BidiRange> >::type*) [with BidiContainer = std::basic_string<char>; BidiIter = __gnu_cxx::__normal_iterator<const char*, std::basic_string<char> >; typename boost::iterator_value<BidiIter>::type = char; typename boost::disable_if<boost::xpressive::detail::is_char_ptr<BidiRange> >::type = void]' test.cpp:7:53: required from here boost/boost/xpressive/detail/utility/tracking_ptr.hpp:440:73: error: no type named 'unspecified_bool_type' in 'class boost::intrusive_ptr<boost::xpressive::detail::regex_impl<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char> > > >' It works fine if I don't compile in C++11 mode. It used to work fine even in C++11 mode in the 1.51 release (don't have 1.52 around to test ATM). Any suggestions for a fix/workaround? Thanks, Nate

2 2

Multiple containers within same boost shared memory file
by Rajalakshmi Iyer 18 Dec '12

18 Dec '12

Hello, Is it possible to have 2 separate boost inter-process containers within the same shared memory file , each guarded by its own named mutex? Please advise. Thanks, Raj -- *Twitter: @Blismedia <http://twitter.com/#%21/blismedia> BlisMedia 32 Percy Street, London W1T 2DE www.blismedia.com* *This email and any attachments to it may be confidential and are intended solely for the use of the individual to whom it is addressed. Any views or opinions expressed are solely those of the author and do not necessarily represent those of Blis Media Ltd, a company registered in England and Wales with registered number 06455773. Its registered office is 32 Percy Street, London W1T 2DE, United Kingdom.* *If you are not the intended recipient of this email, you must neither take any action based upon its contents, nor copy or show it to anyone. Please contact the sender if you believe you have received this email in error. *

2 1

Calling dijkstra_shortest_paths while including boost/graph/graphviz.hpp fails
by Brammert Ottens 18 Dec '12

18 Dec '12

Hi, when I try to compile the following code it fails, but when I remove the graphviz part of the code it works just fine. Below I've added both my code and the error I get. Am I doing something wrong, or is this a bug in boost? The method ParseDIMECSGraph::ParseGraph simply parses a DIMECS challenge graph. #include "stdafx.h" #include "ParseDIMECSGraph.h" #include <boost/config.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> using namespace boost; int _tmain(int argc, _TCHAR* argv[]) { typedef adjacency_list<listS, vecS, directedS, no_property, property < edge_weight_t, int >> Graph; typedef graph_traits < Graph >::edge_descriptor edge_descriptor; Graph g = *ParseDIMECSGraph::ParseGraph("sample.gr"); std::ofstream ofs( "test.dot" ); write_graphviz(ofs, g); ofs.flush(); ofs.close(); typedef boost::graph_traits < Graph >::vertex_descriptor Vertex; std::vector<Vertex> predecessor(boost::num_vertices(g)); std::vector<int> distances(boost::num_vertices(g)); Vertex source = vertex(0, g); Vertex target = vertex(5, g); property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g); property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g); boost::dijkstra_shortest_paths( g, source, &predecessor[0], &distances[0], weightmap, indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0, default_dijkstra_visitor()); return 0; } ------ Build started: Project: kShortestPath, Configuration: Release Win32 ------ 1>Compiling... 1>kShortestPath.cpp 1>C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(225) : warning C4996: 'std::fill_n': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' 1> C:\Program Files (x86)\Microsoft Visual Studio 8\VC\include\xutility(3073) : see declaration of 'std::fill_n' 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(223) : while compiling class template member function 'boost::xpressive::detail::sub_match_impl<BidiIter> *boost::xpressive::detail::sequence_stack<T>::push_sequence(size_t,const T &,boost::xpressive::detail::fill_t)' 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> T=boost::xpressive::detail::sub_match_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/match_results.hpp(96) : see reference to class template instantiation 'boost::xpressive::detail::sequence_stack<T>' being compiled 1> with 1> [ 1> T=boost::xpressive::detail::sub_match_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/smart_ptr/intrusive_ptr.hpp(96) : see reference to class template instantiation 'boost::xpressive::detail::results_extras<BidiIter>' being compiled 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/smart_ptr/intrusive_ptr.hpp(95) : while compiling class template member function 'boost::intrusive_ptr<T>::~intrusive_ptr(void)' 1> with 1> [ 1> T=boost::xpressive::detail::results_extras<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/match_results.hpp(1345) : see reference to class template instantiation 'boost::intrusive_ptr<T>' being compiled 1> with 1> [ 1> T=boost::xpressive::detail::results_extras<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/regex_algorithms.hpp(257) : see reference to class template instantiation 'boost::xpressive::match_results<BidiIter>' being compiled 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(71) : see reference to function template instantiation 'bool boost::xpressive::regex_match<std::string,std::_String_const_iterator<_Elem,_Traits,_Alloc>>(BidiRange &,const boost::xpressive::basic_regex<BidiIter> &,boost::xpressive::regex_constants::match_flag_type,void *)' being compiled 1> with 1> [ 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Alloc=std::allocator<char>, 1> BidiRange=std::string, 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(262) : see reference to function template instantiation 'std::string boost::escape_dot_string<std::string>(const T &)' being compiled 1> with 1> [ 1> T=std::string 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(290) : see reference to function template instantiation 'void boost::write_graphviz<Graph,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,boost::vec_adj_list_vertex_id_map<Property,Vertex>>(std::ostream &,const Graph &,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,VertexID,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> Graph=Graph, 1> VertexPropertiesWriter=boost::default_writer, 1> EdgePropertiesWriter=boost::default_writer, 1> GraphPropertiesWriter=boost::default_writer, 1> Property=boost::no_property, 1> Vertex=__w64 unsigned int, 1> VertexID=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/graphviz.hpp(301) : see reference to function template instantiation 'void boost::write_graphviz<Graph,boost::default_writer,boost::default_writer,boost::default_writer>(std::ostream &,const Graph &,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> Graph=Graph, 1> VertexPropertiesWriter=boost::default_writer, 1> EdgePropertiesWriter=boost::default_writer, 1> GraphPropertiesWriter=boost::default_writer 1> ] 1> .\kShortestPath.cpp(22) : see reference to function template instantiation 'void boost::write_graphviz<Graph>(std::ostream &,const Graph &,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> Graph=Graph 1> ] 1>C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(113) : warning C4996: 'std::fill_n': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' 1> C:\Program Files (x86)\Microsoft Visual Studio 8\VC\include\xutility(3073) : see declaration of 'std::fill_n' 1> C:\Program Files (x86)\boost\boost_1_51\boost/xpressive/detail/utility/sequence_stack.hpp(99) : while compiling class template member function 'boost::xpressive::detail::sub_match_impl<BidiIter> *boost::xpressive::detail::sequence_stack<T>::grow_(size_t,const T &)' 1> with 1> [ 1> BidiIter=std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>, 1> T=boost::xpressive::detail::sub_match_impl<std::_String_const_iterator<char,std::char_traits<char>,std::allocator<char>>> 1> ] 1>C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(140) : error C2784: 'EdgeIndex boost::detail::get(const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &,const boost::detail::csr_edge_descriptor<Vertex,EdgeIndex> &)' : could not deduce template argument for 'const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &' from 'int *__w64 ' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/detail/compressed_sparse_row_struct.hpp(68) : see declaration of 'boost::detail::get' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(88) : see reference to function template instantiation 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,DistanceMap,BinaryFunction,BinaryPredicate>::gray_target<boost::detail::edge_desc_impl<Directed,Vertex>,const IncidenceGraph>(Edge,Graph &)' being compiled 1> with 1> [ 1> UniformCostVisitor=boost::dijkstra_visitor<>, 1> UpdatableQueue=MutableQueue, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> BinaryFunction=boost::closed_plus<int>, 1> BinaryPredicate=std::less<int>, 1> Directed=boost::directed_tag, 1> Vertex=__w64 unsigned int, 1> IncidenceGraph=Graph, 1> Edge=boost::detail::edge_desc_impl<boost::directed_tag,__w64 unsigned int>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(105) : see reference to function template instantiation 'void boost::breadth_first_visit<IncidenceGraph,Buffer,BFSVisitor,ColorMap,__w64 unsigned int*>(const IncidenceGraph &,SourceIterator,SourceIterator,Buffer &,BFSVisitor,ColorMap)' being compiled 1> with 1> [ 1> IncidenceGraph=Graph, 1> Buffer=MutableQueue, 1> BFSVisitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>>, 1> SourceIterator=__w64 unsigned int * 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(333) : see reference to function template instantiation 'void boost::breadth_first_visit<Graph,MutableQueue,boost::detail::dijkstra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,DistanceMap,BinaryFunction,BinaryPredicate>,ColorMap>(const IncidenceGraph &,__w64 unsigned int,Buffer &,BFSVisitor,ColorMap)' being compiled 1> with 1> [ 1> Graph=Graph, 1> UniformCostVisitor=boost::dijkstra_visitor<>, 1> UpdatableQueue=MutableQueue, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> BinaryFunction=boost::closed_plus<int>, 1> BinaryPredicate=std::less<int>, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>>, 1> IncidenceGraph=Graph, 1> Buffer=MutableQueue, 1> BFSVisitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(385) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths_no_init<VertexListGraph,DijkstraVisitor,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistZero,ColorMap>(const Graph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistZero,DijkstraVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> DijkstraVisitor=boost::dijkstra_visitor<>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistZero=int, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(356) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<VertexListGraph,DijkstraVisitor,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,boost::two_bit_color_map<IndexMap>>(const VertexListGraph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> DijkstraVisitor=boost::dijkstra_visitor<>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistInf=std::numeric_limits<int>::_Ty, 1> DistZero=int, 1> ColorMap=boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(404) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<VertexListGraph,DijkstraVisitor,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,char,boost::detail::unused_tag_type,boost::no_property>(const VertexListGraph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor,const boost::bgl_named_params<T,Tag> &,boost::graph::detail::no_parameter)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> DijkstraVisitor=boost::dijkstra_visitor<>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistInf=std::numeric_limits<int>::_Ty, 1> DistZero=int, 1> T=char, 1> Tag=boost::detail::unused_tag_type 1> ] 1> .\kShortestPath.cpp(46) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<Graph,boost::dijkstra_visitor<>,__w64 unsigned int*__w64 ,int*__w64 ,boost::adj_list_edge_property_map<Directed,Value,Ref,Vertex,Property,Tag>,boost::vec_adj_list_vertex_id_map<boost::no_property,Vertex>,std::less<_Ty>,boost::closed_plus<T>,std::numeric_limits<int>::_Ty,int>(const VertexListGraph &,__w64 unsigned int,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor)' being compiled 1> with 1> [ 1> Directed=boost::directed_tag, 1> Value=int, 1> Ref=int &, 1> Vertex=__w64 unsigned int, 1> Property=boost::property<boost::edge_weight_t,int>, 1> Tag=boost::edge_weight_t, 1> _Ty=int, 1> T=int, 1> VertexListGraph=Graph, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::vec_adj_list_vertex_id_map<boost::no_property,__w64 unsigned int>, 1> Compare=std::less<int>, 1> Combine=boost::closed_plus<int>, 1> DistInf=std::numeric_limits<int>::_Ty, 1> DistZero=int, 1> DijkstraVisitor=boost::dijkstra_visitor<> 1> ] 1>C:\Program Files (x86)\boost\boost_1_51\boost/graph/dijkstra_shortest_paths.hpp(140) : error C2784: 'EdgeIndex boost::detail::get(const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &,const boost::detail::csr_edge_descriptor<Vertex,EdgeIndex> &)' : could not deduce template argument for 'const boost::detail::csr_edge_index_map<Vertex,EdgeIndex> &' from 'int *__w64 ' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/detail/compressed_sparse_row_struct.hpp(68) : see declaration of 'boost::detail::get' 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(45) : see reference to function template instantiation 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,DistanceMap,BinaryFunction,BinaryPredicate>::gray_target<boost::detail::edge_desc_impl<Directed,Vertex>,Graph>(Edge,Graph &)' being compiled 1> with 1> [ 1> UniformCostVisitor=boost::dijkstra_visitor<>, 1> UpdatableQueue=MutableQueue, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> PredecessorMap=__w64 unsigned int *__w64 , 1> DistanceMap=int *__w64 , 1> BinaryFunction=boost::closed_plus<int>, 1> BinaryPredicate=std::less<int>, 1> Directed=boost::directed_tag, 1> Vertex=__w64 unsigned int, 1> Graph=Graph, 1> Edge=boost::detail::edge_desc_impl<boost::directed_tag,__w64 unsigned int> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(37) : while compiling class template member function 'void boost::BFSVisitorConcept<Visitor,Graph>::constraints(void)' 1> with 1> [ 1> Visitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/concept/detail/has_constraints.hpp(42) : see reference to class template instantiation 'boost::BFSVisitorConcept<Visitor,Graph>' being compiled 1> with 1> [ 1> Visitor=boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>, 1> Graph=Graph 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/concept/detail/msvc.hpp(53) : see reference to class template instantiation 'boost::concepts::not_satisfied<Model>' being compiled 1> with 1> [ 1> Model=boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>,Graph> 1> ] 1> C:\Program Files (x86)\boost\boost_1_51\boost/graph/breadth_first_search.hpp(68) : see reference to class template instantiation 'boost::concepts::require<Model>' being compiled 1> with 1> [ 1> Model=boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>,MutableQueue,boost::adj_list_edge_property_map<boost::directed_tag,int,int &,__w64 unsigned int,boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::less<int>>,Graph> 1> ] 1>kShortestPath - 2 error(s), 2 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========

2 1

allocate_shared and allocation size
by Olivier Tristan 18 Dec '12

18 Dec '12

Hi Guys, What would be the best way to get the size required by the allocation of a shared_ptr used when using allocate_shared ? So far, it looks like to be something related to the sizeof sp_counted_impl_pda< P, D, A >, but I would like to know the cleaner way of getting this info. The goal is to preallocate my pool with the right number of planned shared_ptr in order to avoid allocation.(real time thread) Thanks ! -- Olivier Tristan uvi.net

1 0

[Boost.MultiArray]: size question
by gast128 18 Dec '12

18 Dec '12

Dear all, we use here the multi_array as a 2 dimensional matrix. Often we want to resize the row or column dependent on some GUI event. Code could be: void Bla::ResizeRows(size_t nRows) { m_matrix.resize(boost::extents[nRows][m_matrix[0].size()]); } However this uses the 0-index of row count (i.e. 'm_matrix[0].size()') to determine the size of the columns. Will this not crash if you have 0 rows? And if so is there a better alternative? wkr.

3 8

Boost MPI on homogeneous machines
by Kyle Joseph Berger 17 Dec '12

17 Dec '12

Hello, Has anyone successfully used the homogeneous options in boost MPI before? I build boost mpi after uncommenting the appropriate line in the boost mpi config.cpp file and enabled BOOST_IS_BITWISE_SERIALIZABLE([classname]) for several of my classes that I pass, but I saw no change in performance, so I am not sure if it is enabled. The documentation says the following: More optimizations are possible on homogeneous machines, by avoiding MPI_Pack/MPI_Unpack calls but using direct bitwise copy. This feature can be enabled by defining the macro BOOST_MPI_HOMOGENEOUS when building Boost.MPI and when building the application. In addition all classes need to be marked both as is_mpi_datatype and as is_bitwise_serializable, by using the helper macro of Boost.Serialization: I defined the macro when building boost and marked the classes, but I could find no information anywhere on what to do when building the application, so I am thinking maybe this is what I am missing. Any help would be much appreciated. Thanks, Kyle

1 0

error while installing boost 1.36 and 1.52
by naveen kumar 17 Dec '12

17 Dec '12

Dear Boost user, while installing boost, i am getting many error messages as below, how to overcome these errors, please help me thanking you in advance Naveen Building the Boost C++ Libraries. Performing configuration checks - 32-bit : no - 64-bit : yes - x86 : yes - has_icu builds : no warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam - iconv (libc) : yes - icu : no - icu (lib64) : no - gcc visibility : yes - long double support : yes warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. Component configuration: - chrono : building - context : building - date_time : building - exception : building - filesystem : building - graph : building - graph_parallel : building - iostreams : building - locale : building - math : building - mpi : building - program_options : building - python : building - random : building - regex : building - serialization : building - signals : building - system : building - test : building - thread : building - timer : building - wave : building ...patience... ...patience... ...patience... ...patience... ...found 8697 targets... ...updating 824 targets... gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi/bzip2.o libs/iostreams/src/bzip2.cpp:20:56: error: bzlib.h: No such file or directory libs/iostreams/src/bzip2.cpp:31: error: ‘BZ_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:32: error: ‘BZ_RUN_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:33: error: ‘BZ_FLUSH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:34: error: ‘BZ_FINISH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:35: error: ‘BZ_STREAM_END’ was not declared in this scope libs/iostreams/src/bzip2.cpp:36: error: ‘BZ_SEQUENCE_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:37: error: ‘BZ_PARAM_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:38: error: ‘BZ_MEM_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:39: error: ‘BZ_DATA_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:40: error: ‘BZ_DATA_ERROR_MAGIC’ was not declared in this scope libs/iostreams/src/bzip2.cpp:41: error: ‘BZ_IO_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:42: error: ‘BZ_UNEXPECTED_EOF’ was not declared in this scope libs/iostreams/src/bzip2.cpp:43: error: ‘BZ_OUTBUFF_FULL’ was not declared in this scope libs/iostreams/src/bzip2.cpp:44: error: ‘BZ_CONFIG_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp:48: error: ‘BZ_FINISH’ was not declared in this scope libs/iostreams/src/bzip2.cpp:49: error: ‘BZ_RUN’ was not declared in this scope libs/iostreams/src/bzip2.cpp: In static member function ‘static void boost::iostreams::bzip2_error::check(int)’: libs/iostreams/src/bzip2.cpp:62: error: ‘BZ_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:63: error: ‘BZ_RUN_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:64: error: ‘BZ_FLUSH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:65: error: ‘BZ_FINISH_OK’ was not declared in this scope libs/iostreams/src/bzip2.cpp:66: error: ‘BZ_STREAM_END’ was not declared in this scope libs/iostreams/src/bzip2.cpp:68: error: ‘BZ_MEM_ERROR’ was not declared in this scope libs/iostreams/src/bzip2.cpp: In constructor ‘boost::iostreams::detail::bzip2_base::bzip2_base(const boost::iostreams::bzip2_params&)’: libs/iostreams/src/bzip2.cpp:80: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:80: error: expected ‘)’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp: In destructor ‘boost::iostreams::detail::bzip2_base::~bzip2_base()’: libs/iostreams/src/bzip2.cpp:83: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:83: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:83: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:83: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:83: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:83: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::before(const char*&, const char*, char*&, char*)’: libs/iostreams/src/bzip2.cpp:88: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:88: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:88: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:88: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:88: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:88: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:88: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::after(const char*&, char*&)’: libs/iostreams/src/bzip2.cpp:97: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:97: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:97: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:97: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:97: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:97: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:97: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘int boost::iostreams::detail::bzip2_base::check_end(const char*, const char*)’: libs/iostreams/src/bzip2.cpp:104: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:104: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:104: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:104: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:104: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:104: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:104: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::end(bool)’: libs/iostreams/src/bzip2.cpp:118: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:118: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:118: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:118: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:118: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:118: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:118: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp:121: error: ‘BZ2_bzCompressEnd’ was not declared in this scope libs/iostreams/src/bzip2.cpp:122: error: ‘BZ2_bzDecompressEnd’ was not declared in this scope libs/iostreams/src/bzip2.cpp: In member function ‘int boost::iostreams::detail::bzip2_base::compress(int)’: libs/iostreams/src/bzip2.cpp:128: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:128: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:128: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:128: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:128: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp: In member function ‘int boost::iostreams::detail::bzip2_base::decompress()’: libs/iostreams/src/bzip2.cpp:133: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:133: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:133: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:133: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:133: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp: In member function ‘void boost::iostreams::detail::bzip2_base::do_init(bool, void* (*)(void*, int, int), void (*)(void*, void*), void*)’: libs/iostreams/src/bzip2.cpp:144: error: ‘bz_stream’ was not declared in this scope libs/iostreams/src/bzip2.cpp:144: error: ‘s’ was not declared in this scope libs/iostreams/src/bzip2.cpp:144: error: expected type-specifier before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:144: error: expected ‘>’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:144: error: expected ‘(’ before ‘bz_stream’ libs/iostreams/src/bzip2.cpp:144: error: expected primary-expression before ‘>’ token libs/iostreams/src/bzip2.cpp:144: error: expected ‘)’ before ‘;’ token libs/iostreams/src/bzip2.cpp:161: error: ‘BZ2_bzCompressInit’ was not declared in this scope libs/iostreams/src/bzip2.cpp:164: error: ‘BZ2_bzDecompressInit’ was not declared in this scope "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_DYN_LINK=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi/bzip2.o" "libs/iostreams/src/bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi>libboost_iostreams.so.1.52.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi>bzip2.o... ...skipped <pstage/lib>libboost_iostreams.so.1.52.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.4.6/release/threading-multi>libboost_iostreams.so.1.52.0... ...skipped <pstage/lib>libboost_iostreams.so for lack of <pstage/lib>libboost_iostreams.so.1.52.0... gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/posix/posix_backend.o common.mkdir bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/codecvt.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/collate.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/converter.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/numeric.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/std/std_backend.o gcc.compile.c++ bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/util/gregorian.o gcc.link.dll bin.v2/libs/locale/build/gcc-4.4.6/release/threading-multi/libboost_locale.so.1.52.0 common.copy stage/lib/libboost_locale.so.1.52.0 ln-UNIX stage/lib/libboost_locale.so common.mkdir bin.v2/libs/math/build common.mkdir bin.v2/libs/math/build/gcc-4.4.6 common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi/.. common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi/../src common.mkdir bin.v2/libs/math/build/gcc-4.4.6/release/threading-multi/../src/tr1 . . . . . . . gcc.link.dll bin.v2/libs/program_options/build/gcc-4.4.6/release/threading-multi/libboost_program_options.so.1.52.0 common.copy stage/lib/libboost_program_options.so.1.52.0 ln-UNIX stage/lib/libboost_program_options.so common.mkdir bin.v2/libs/python common.mkdir bin.v2/libs/python/build common.mkdir bin.v2/libs/python/build/gcc-4.4.6 common.mkdir bin.v2/libs/python/build/gcc-4.4.6/release common.mkdir bin.v2/libs/python/build/gcc-4.4.6/release/threading-multi gcc.compile.c++ bin.v2/libs/python/build/gcc-4.4.6/release/threading-multi/numeric.o In file included from ./boost/python/detail/prefix.hpp:13, from ./boost/python/numeric.hpp:8, from libs/python/src/numeric.cpp:6: ./boost/python/detail/wrap_python.hpp:50:23: error: pyconfig.h: No such file or directory ./boost/python/detail/wrap_python.hpp:75:24: error: patchlevel.h: No such file or directory ./boost/python/detail/wrap_python.hpp:78:2: error: #error Python 2.2 or higher is required for this version of Boost.Python. ./boost/python/detail/wrap_python.hpp:142:21: error: Python.h: No such file or directory In file included from ./boost/python/object/pointer_holder.hpp:14, from ./boost/python/to_python_indirect.hpp:10, from ./boost/python/converter/arg_to_python.hpp:10, from ./boost/python/call.hpp:15, from ./boost/python/object_core.hpp:14, from ./boost/python/object.hpp:9, from ./boost/python/tuple.hpp:10, from ./boost/python/numeric.hpp:10, from libs/python/src/numeric.cpp:6: ./boost/python/instance_holder.hpp:34: error: ‘PyObject’ has not been declared ./boost/python/instance_holder.hpp:41: error: expected ‘;’ before ‘(’ token ./boost/python/instance_holder.hpp:45: error: ‘PyObject’ has not been declared In file included from ./boost/python/object/pointer_holder.hpp:21, . . . . .

3 2

Deadline extension: C++ Now 2013, Call for Submissions
by Hartmut Kaiser 15 Dec '12

15 Dec '12

Please see below for the extended deadline. ---------------------------------------------------------------------------- C++ NOW CONFERENCE 2013 - Aspen CO, USA, May 13-17, 2013, www.cppnow.org ---------------------------------------------------------------------------- CALL FOR SUBMISSIONS -------------------- We invite you to submit session proposals to the 2nd annual C++ Now Conference (Aspen CO, USA, May 13-17, 2013). Building upon the resounding success of C++ Now 2012 and five years of BoostCon, C++ Now 2013 will present leading speakers from the whole C++ community. The C++ Now Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++ Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. At C++ Now 2013 we would like to focus on parallel and distributed computing with C++. However, by no means this is intended to restrict the topics of proposals we hope to see. Any other topic related to C++ as outlined below is perfectly fine for submission. IMPORTANT DATES --------------- New proposal submissions due: January 5th, 2013. Proposals decisions sent (tentative program available): January 30th, 2013. Fully scheduled program available: February 24th, 2013. BEST PRESENTATION AWARDS ------------------------ We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++ Now website for that year and a plaque containing all the C++ Now conference information. SESSION TOPICS -------------- Topics of interest include, but are not restricted to, the following: * Parallelism in the new C++11 standard * Parallel, distributed and GPGPU topics relating to C++ * C++11 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standards library, and one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to C++ users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions Or multiples of 90-minutes. Fractional proposals will be grouped into 90 Minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS ------------------ All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2013. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++ Now website and will be available to attendees. For general information on the C++ Now 2013 paper submission or the scope of technical papers solicited; please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2013(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Dave Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

[regex] match_results: signatures of position(sub) and length(sub) are different, why?
by Frédéric Bron 14 Dec '12

14 Dec '12

Hi, On the following link, we can see that length and position member functions have different signatures: http://www.boost.org/doc/libs/1_52_0/libs/regex/doc/html/boost_regex/ref/ma… difference_type length(int sub = 0) const; difference_type position(unsigned int sub = 0) const; Why int for length(sub) and unsigned int for position(sub)? Frédéric

2 4

[boost-python] some general questions
by Ovanes Markarian 14 Dec '12

14 Dec '12

Hello *, we are now considering to use some Python/C++ bindings and here came Boost Python to my mind. I would like to ask what is the state of the library? Is it still maintained? As far as I can see the library's doc is dated back to 2003 (some of the doc's parts are from 2005) and the latest python version to be known to work is Python 2.2.2. Is Python 2.7.2 going to work or supported at all? I also searched for some docs on how Boost Python bindings are going to work with PyPy. Found some really old post describing the problems to support Boost Python binding and some messages from the mailing list, which describe, which functions must be implemented to support Boost Python in PyPy. Any info would be great! Thanks, Ovanes

2 3

[preprocessor] BOOST_PP_VARIADIC_SIZE() and g++ in 1.52
by Nat Linden 13 Dec '12

13 Dec '12

I'm trying to use a variadic macro to solve a problem. We use a third-party function I can't modify -- actually a family of functions of arbitrary arity. Before each call to that function, I want to examine and possibly modify its first argument. (So not completely arbitrary arity: there's always at least one argument.) What I'd really like is a variadic function. Unfortunately the compilers we use don't yet support those. We do have cross-platform support for variadic macros, albeit with idiosyncratic syntax. My problem is that I need: intercept(first, second, third) to expand to: targetfunc(transform(first), second, third) but I need: intercept(first) to expand to: targetfunc(transform(first)) // <= no trailing comma This is the role of BOOST_PP_COMMA_IF(). In Visual Studio 2010 I can write BOOST_PP_COMMA_IF(BOOST_PP_VARIADIC_SIZE(__VA_ARGS__)), and the code behaves as expected. In g++ 4.1, 4.2 and 4.4, however, my first problem is that BOOST_PP_VARIADICS is not set by default. When I set it explicitly, as permitted by the documentation[0], a call such as intercept("first", "second") (comma required) succeeds, but a call such as intercept("first") (comma forbidden) fails. Using -E and examining the preprocessed output from intercept("first") makes clear that BOOST_PP_COMMA_IF() is expanding to a comma, hence BOOST_PP_VARIADIC_SIZE() is expanding to nonzero. In fact, when I change the definition of the intercept() macro below to: #define intercept(FIRST, ARGS...) \ targetfunc(transform(FIRST) \ , boost::lexical_cast<std::string>(BOOST_PP_VARIADIC_SIZE(ARGS))) I see that BOOST_PP_VARIADIC_SIZE() expands to 1 for intercept("first") as well as for intercept("first", "second"). Is it possible to achieve what I want with my present suite of compilers? Is there some workaround we could use until (at some point in the indefinite future) we've upgraded all our compilers so that even the oldest of them supports variadic functions? [0] http://www.boost.org/doc/libs/1_52_0/libs/preprocessor/doc/topics.html ================ source code follows ================ #include <iostream> #include <string> #include <boost/preprocessor/variadic/size.hpp> #include <boost/preprocessor/punctuation/comma_if.hpp> // no targetfunc(void) void targetfunc(const std::string& first) { std::cout << "targetfunc('" << first << "')\n"; } void targetfunc(const std::string& first, const std::string& second) { std::cout << "targetfunc('" << first << "', '" << second << "')\n"; } // ... assume a family of targetfunc() arities ... // want to implicitly "do something" to targetfunc()'s first arg std::string transform(const std::string& arg) { return "transformed " + arg; } #if defined(_MSC_VER) // anonymous variadic arguments and __VA_ARGS__ keyword #define intercept(FIRST, ...) \ targetfunc(transform(FIRST) \ BOOST_PP_COMMA_IF(BOOST_PP_VARIADIC_SIZE(__VA_ARGS__)) \ __VA_ARGS__) #else // collectively-named variadic arguments #define intercept(FIRST, ARGS...) \ targetfunc(transform(FIRST) \ BOOST_PP_COMMA_IF(BOOST_PP_VARIADIC_SIZE(ARGS)) \ ARGS) #endif int main(int argc, char *argv[]) { std::cout << "BOOST_PP_VARIADICS = " << BOOST_PP_VARIADICS << "\n"; intercept("first", "second"); intercept("first"); // <= this line has trouble with g++ 4.1, 4.2, 4.4 return 0; }

4 6

(no subject)
by Rydinare 12 Dec '12

12 Dec '12

http://internetwealthbuilderinstitute.com/wp-content/plugins/akismet/google…

1 0

[Exception] Expected<T> C++03
by Szymon Gatner 12 Dec '12

12 Dec '12

Hi, I trying to implement Andrei's Expected<T> from his "Systematic Error Handling in C++" talk ( http://channel9.msdn.com/Shows/Going+Deep/C-and-Beyond-2012-Andrei-Alexandr…) in C++03 / BOOST In short: Expected<T> holds either T or exception_ptr holding exception that prevented T's creation. Think of single threaded future<T>. One of main purposes of this type is efficiency - code that computes T would normally throw in case of errors but instead it returns exception by value which causes Expected<T> to be initiated with exception type instead of actual value of T. Important part is that no throwing happens in library code (making it fast). As with future<T> throwing of stored exception only happens upon client's request - a call to get() in case of invalid computation (Expected<T>::valid() may be called beforehand to check if computation succeeded). To the point: Andrei's code uses std::make_exception_ptr() which I assume is std version of boost::copy_exception(). Now problem with copy_exception() is that it actually throws! So the whole idea of not throwing is gone by the fact that I don't know how to transform (const Exception&) into boost::exception_ptr (without throwing via copy_exception()). How does std::make_exception_ptr() work (as I assume it does not throw & return current_exception() as boost::copy_exception does)? Any suggestions welcome. Cheers. Szymon Gatner

3 3

boost::fusion::set
by Lukasz K 12 Dec '12

12 Dec '12

Could someone explain to me why the following is a valid definition of a boost::fusion::set? typedef boost::fusion::set<char,char,char> S; S s('a','b','c'); Especially, given that according to description: "set is an Associative Sequence of heteregenous typed data elements. Type identity is used to impose an equivalence relation on keys. The element's type is its key. A set may contain at most one element for each key. Membership testing and element key lookup has constant runtime complexity (see Overloaded Functions). " Src: http://www.boost.org/doc/libs/1_52_0/libs/fusion/doc/html/fusion/container/… Thanks, Lukasz

1 0

Compile boost for Windows Phone 8
by stren tler 12 Dec '12

12 Dec '12

Hi, i need to compile "date_time" and "system" for the windows phone 8 development enviroment. Any advice how setup bjam? thx

1 0

[serialization] performance issue when deserializing long string in a xml file
by jean-charles.quillet＠alyotech.fr 12 Dec '12

12 Dec '12

Hello, Since I discovered the boost serialization library, I'm using it in every single project I'm working on. I just cant figure how I was doing before. Makes life so much easier. I usually serialize all my objects in XML format. On my current project, I have a couple of big 500x500 complex matrices (ublas) that need to be serialized in my files. Serializing the matrices with the default boost functions results quite big files. So I've implemented the following: - I serialize the matrix in memory in binary format - I compress the data with the zlib - I encode the resulting data in base64 then copy it in a string - And I serialize the resulting string in my file It's working great but I've found out that deserializing this long string takes a huge amount of time. It bothers me and I don't really understand why. As I've got a filter reporting the bytes read to watch the progress. It seems that the time is spent after that all data has been read ! It confuses me. Has anybody experienced this or have any idea to solve my problem ? Thanks, Jean-Charles

2 3

Slow build with clang?
by Richard Hadsell 12 Dec '12

12 Dec '12

I have been building the Boost libraries with g++ for many years. Someone recommended trying Clang, so I downloaded 1.52.0 and built it first with g++ 4.5.1 on Fedora 14. Then I started a build with clang 3.3, and it is taking forever. I have not made any measurements, but it must be at least an order of magnitude slower than g++. The math library seems to take the longest, but maybe there are other slow-building libraries yet to come. Am I doing something wrong, or should I expect the clang build to be very slow? In myuser-config I have this: using clang : 3.3 : /directory_where_we_installed_clang/bin/clang :<compileflags>"-fPIC"<linkflags>"-fPIC" ; The command line is this: bin/bjam --user-config=myuser-config threading=multi instruction-set=core2 address-model=64 variant=release link=static,shared --stagedir=stageF14C clean The clang version is: clang version 3.3 (trunk 169541) (llvm/trunk 169537) The OS is Linux Fedora 14. -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studios http://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560

3 4

Regular expression problem using literals
by Neil Sutton 11 Dec '12

11 Dec '12

Hello, I am learning the basics of regular expression syntax and have been looking at the following example: #include <iostream> #include <fstream> #include <string> #include <boost/regex.hpp> #include <boost/xpressive/xpressive.hpp> using namespace boost::xpressive; int main() { std::ifstream input("myfile"); if(input) std::cout << "Success\n"; else std::cout << "fail\n"; std::string line; std::string data; while (getline(input, line)) { data += line; } std::string const &ref = data; mark_tag day(1), month(2), year(3), delim(4); sregex date = (month= repeat<1,2>(_d)) // find the month ... >> (delim= (set= '/','-')) // followed by a delimiter ... >> (day= repeat<1,2>(_d)) >> delim // and a day followed by the same >> (year= repeat<1,2>(_d >> _d)); // and the year. smatch what; if( regex_search(ref, what, date ) ) { std::cout << what[0] << '\n'; // whole match std::cout << what[day] << '\n'; // the day std::cout << what[month] << '\n'; // the month std::cout << what[year] << '\n'; // the year std::cout << what[delim] << '\n'; // the delimiter } return 0; } My problem is very simple and I am sorry to be asking about it. I want to include some literal wording in my regular expression. For example, before the program outputs the date it also searches for the words "Football results for" - (then date is output). Please can you show me how to prefix this regular expression with the literal words? My compiler see the 'for' as a c++ keyword, without more. Kind Regards

2 1

Property Tree with boost:any
by Olivier Tristan 11 Dec '12

11 Dec '12

Hello, I'm trying to use a property tree with a boost::any like in custom_data_type.cpp from the examples folder. So far, so good. My only issue arise when I'm trying to use write_json from json_parser. I understand that boost::any do not provide direct conversion to something that can be written into a stream, but I was wondering if there is a way to provide some conversion function just like it's done for get and put inside the property tree itself. Thanks ! -- UVI <http://www.uvi.net/> Olivier Tristan| Research & Development o.tristan(a)uvi.net Facebook <http://www.facebook.com/UVI.Official> Twitter <http://twitter.com/UVIofficial> Youtube <http://www.youtube.com/user/UVIofficial> SoundCloud <http://soundcloud.com/uvi-official> Blog UVI <http://blog.uvi.net/>

2 2

Building Boost for backwards compatibility
by Tim Burgess 11 Dec '12

11 Dec '12

Hi, I'm using Boost to build projects for the Mac. What I don't understand is how to build the libraries to support previous Mac OSX SDK versions. I'm having to build using XCode 4.5 on Mountain Lion (10.8), but want to ensure that my projects will run on 10.7 as a minimum. All advice gratefully accepted. Best wishes. Tim Burgess Raised Bar Ltd. Tel: +44 (0)1827 719822 Web: http://www.raisedbar.net

1 0

Registration for C++Now 2013 is now open
by Boris Kolpackov 11 Dec '12

11 Dec '12

The seventh annual C++Now Conference (formerly BoostCon) will be held at the Aspen Center for Physics in Aspen, Colorado, May 12th to 17th, 2013. "We are thrilled to announce the second annual C++Now conference, the whole-language edition of BoostCon covering all the coolest topics in C++," said Dave Abrahams, Conference Co-Chair. "In 2012, we broadened the conference scope by adding a third track and offering more C++11 coverage than any other event, and the community responded with an unprecedented number of registrations. In 2013, we are going to build on that success with foundational sessions integrating what we've all learned about using C++11 during the past year, while continuing the exploration of cutting-edge topics that BoostCon attendees have come to expect." Early Bird Savings Deadlines! Early Bird conference registration, which ends April 14th, 2013, costs $599. After that date, the registration fee is $699. Register now at our registration page <http://www.eventbrite.com/event/2717332615>. Early Bird hotel registration ends December 31st, 2012 and saves $20 per night. Please reserve your room using the Aspen Meadows online reservation system <https://resweb.passkey.com/go/cplusplusnow2013> Speakers If you are interested in presenting, we are currently accepting proposals <http://cppnow.org/2013-call-for-submissions/>. Registration fee is waived for one speaker of every standard session presentation. Shorter sessions are prorated. Student/Volunteers Registration fees will be waived for a limited number of individuals that wish to attend as volunteers. Volunteer work consists of helping to run the conference and will not prevent volunteers from attending sessions. This is the first year this opportunity is being offered. If you are interested in applying to attend as a volunteer, contact us at <organizers(a)cppnow.org>. Sponsors For a copy of the conference Sponsorship Prospectus contact sponsorship(a)cppnow.org. C++Now is presented by Boost in-cooperation with ACM. Permanent link for this announcement is: http://cppnow.org/2013-registration-announcement/

1 0

boost mpi message truncated error
by Kyle Joseph Berger 10 Dec '12

10 Dec '12

Hello, I am using boost mpi and I am having issues getting the message truncation error upon receiving a message. It is not always the same message, but it does always happen and I have been unable to figure out why. Here is the code of interest: //send particles for(int i=0;i<world.size();i++) { world.isend(i,i,particles_to_be_sent[i]); } //receive particles int receive_counter=0; boost::optional<boost::mpi::status> msginfo=world.iprobe(mpi::any_source, world.rank()); while (receive_counter<world.size()) { if (msginfo) { world.recv(msginfo->source(),world.rank(),particles_received); for (unsigned int i=0;i<particles_received.size();i++) { //add particle to its associated box in the particle grid particle_grid[particles_received[i].location_number()].insert(pair<int,Particle>(particles_received[i].global_part_num(),particles_received[i])); //check to see if the particle is contained within the box if (particles_received[i].position().y()>grid_locations[particles_received[i].location_number()].bottom() && particles_received[i].position().y()<grid_locations[particles_received[i].location_number()].top() && particles_received[i].position().x()>grid_locations[particles_received[i].location_number()].west() && particles_received[i].position().x()<grid_locations[particles_received[i].location_number()].east() && particles_received[i].position().z()>grid_locations[particles_received[i].location_number()].south() && particles_received[i].position().z()<grid_locations[particles_received[i].location_number()].north()) { //if particle is in box, then denote it as such in the particle properties particle_properties[particles_received[i].global_part_num()].particle_in_box()[particles_received[i].location_number()]=true; } } receive_counter++; } msginfo=world.iprobe(mpi::any_source, world.rank()); } I have left out variable definitions, but everything has the right type (including sending and receiving the same type-particles_to_be_sent[i] and particles_received are both vector<Particle>, where Particle is a type I've created). I thought that boost mpi is supposed to take care of making the receive buffer the right size on its own, but something isn't working here. Any help would be appreciated. Thanks, Kyle

2 1

[exception, system] using boost::system::error_code with boost::exception
by Marco Craveiro 10 Dec '12

10 Dec '12

Hi boost users, I'm a very happy user of both error_code and exception, but now I found a new use case which is to combine them. So I'm looking for an example of how to add an error_code into an exception and get it all nicely formatted with diagnostic_information. I can see how to use error_info [1] but not error_code. Any pointers would be appreciated. Cheers Marco -- So young, and already so unknown -- Pauli blog: http://mcraveiro.blogspot.com [1] http://www.boost.org/doc/libs/1_52_0/libs/exception/doc/tutorial_transporti…

2 1

Oven, regular and Boost
by Robert Jones 10 Dec '12

10 Dec '12

The 'Oven' port... http://dl.dropbox.com/u/1682460/git/OvenToBoost/libs/range/doc/html/range_e… makes much of its 'regular' operator, which is used to fix this problem using boost::lambda::_1; for_each_(r | filtered(_1 % 2 == 0), f); // Error! Can't default construct/copy assign for_each_(r | filtered(regular(_1 % 2 == 0)), f); // OK However, AFAICS this is not a problem in current-ishBoost (1.47). Has this ever been a problem? Can anyone comment on its general provenance? Thx, Rob.

3 5

[Range] Sliced... less than it could be.
by Robert Jones 10 Dec '12

10 Dec '12

I was disappointed to discover that I can't write range | filtered( some_predicate ) | sliced( n, m ) | ..... because sliced requires a random access range, and filtered produces a forward range! Piffle. It seems such a useful and obvious use-case. Is this restriction really necessary? Thx, Rob.

3 6

[overloaded_function] Why does it define f_ as const?
by Felipe Magno de Almeida 10 Dec '12

10 Dec '12

Hello, I'm trying to use overloaded_function. But unfortunately it defines f_ as const, which makes it not Assignable. Which seems to me, like a unnecessary limitation. I looked at the docs, but couldn't find any mention of assignment nor a rationale for this behavior. Is there a specific reason for overloaded_function to not be Assignable? Regards, -- Felipe Magno de Almeida

1 0

How to implement a custom hash function for __uint128_t?
by Scott Smedley 10 Dec '12

10 Dec '12

Hi all, How can I implement a hash function for a __uint128_t type that is compatible with Boost? I tried this: #include <boost/functional/hash.hpp> #include <unordered_set> #ifdef USE_64 typedef uint64_t MyId; // works fine #else typedef __uint128_t MyId; #endif inline std::size_t hash_value (const MyId &x) { // not a very good hash function, but I just want to get it working first! return static_cast<std::size_t>(x); } int main (int argc, char *argv[]) { std::unordered_set<MyId, boost::hash<MyId>> s; s.insert(42); } but I get 144 lines of errors (!) using g++-4.7.2 with Boost v1.51.0 on 64-bit Scientific Linux 6.2: error: no matching function for call to 'hash_value(const __int128 unsigned&)' Any pointers/help would be muchly appreciated. Scott. :)

3 2

Re: [Boost-users] text_file_backend with append and rotate (Victor Yankee)
by Victor Whiskey Yankee 09 Dec '12

09 Dec '12

Anyone, Would someone show me what I am doing wrong setting up this logger? I posted on the boost log site too but got no reply there either. Thanks, Vic > Hello everyone! > > How to create a text_file_backend that appends to existing log file and > also has rotation. The init function below always creates a new file every > time I run my program no matter the rotation settings. > > I am using svn version 774 (latest as of Dec 5, 2012. I tried many ways but > no joy. There is not an example like this, and there does not seem to be a > test for appending either, so maybe it is not supported, but that would be > bad. So I must be doing something wrong. > > Here is my function to set up the logger (using my custom severity levels): > > void init() > { > typedef boost::log::sinks::synchronous_sink<boost::log::sinks::text_file_backend > FileSink_t; > > boost::shared_ptr< FileSink_t> mySink(new FileSink_t( > boost::log::keywords::file_name = "%Y%m%d_%H%M%S_%5N.log" > , boost::log::keywords::rotation_size = 16 * 1024 * 1024 /3 > , boost::log::keywords::time_based_rotation =boost::log::sinks::file::rotation_at_time_point(0,0,0) > , boost::log::keywords::auto_flush = true > , boost::log::keywords::open_mode=(std::ios::out |std::ios::app) // seems to have no effect > )); > > // this method of setting append does not seem to work either, so Imust be doing something wrong > mySink->locked_backend()->set_open_mode(std::ios::out|std::ios::app); > > > mySink->locked_backend()->set_file_collector(boost::log::sinks::file::make_collector( > boost::log::keywords::target = "logs" > , boost::log::keywords::max_size = 16 * 1024 * 1024 > , boost::log::keywords::min_free_space = 2 * 16 * 1024 * 1024)); > > mySink->set_filter(boost::log::filters::attr< LOGGING::LOG_LEVEL("Severity", std::nothrow) >= LOGGING::warning); > mySink->locked_backend()->scan_for_files(); mySink->set_formatter( > boost::log::formatters::format("[%1% | %2%] %3%") > % boost::log::formatters::date_time< boost::posix_time::ptime("TimeStamp") > % boost::log::formatters::attr< LOGGING::LOG_LEVEL >("Severity",std::nothrow) > % boost::log::formatters::message()); > > boost::log::core::get()->add_sink(mySink); > boost::log::core::get()->add_global_attribute("TimeStamp",boost::log::attributes::local_clock()); > }

1 0

Boost Filesystem references in static/shared library
by Miguel Guedes 09 Dec '12

09 Dec '12

Hello List, I was using boost::filesystem previously in a project that built an executable but it has now grown and the requirements changed, and I now have to build a portion of the code as a library; preferably an so. Since I've started building code as a library I've been getting errors about invalid references to boost::filesystem. Here's how I'm building the library: $ g++ -DBOOST_ALL_NO_LIB -fPIC -lrt -lstdc++ -shared -pthread -lboost_system -lboost_thread -lboost_filesystem -L/usr/local/lib -ldl -lpthread -lstdc++ -lclang -o libomnis.so cout.o command_line_processor.o command_options_container.o commands_container.o command_base.o command_option_base.o command_option.o command_option_multi.o command_option_integer.o command_option_flag.o command_serve.o command_send.o command_help.o command_version.o register.o unsaved_file.o clang_parameters.o ustring_vector.o string_vector.o request_strings.o source_file.o reply.o omnisource.o omnis.o As you can see I've tried building it with (as well as without) the BOOST_ALL_NO_LIB macro defined. I then compile the main executable as given: $ g++ libomnis.so client.o omnis_command_line_processor.o request_handler.o request_handler_1.0.o request_parser.o server.o connection.o omnisource_loader.o omnis_app.o main.o -o omnis -pthread -lboost_system -lboost_thread -lboost_filesystem -L/usr/local/lib -ldl -lpthread -lstdc++ -lclang -L. -lomnis And this results in the following output: ./libomnis.so: undefined reference to `boost::filesystem2::detail::dir_itr_close(void*&, void*&)' ./libomnis.so: undefined reference to `boost::filesystem2::detail::dir_itr_first(void*&, void*&, std::string const&, std::string&, boost::filesystem2::file_status&, boost::filesystem2::file_status&)' ./libomnis.so: undefined reference to `boost::filesystem2::detail::dir_itr_increment(void*&, void*&, std::string&, boost::filesystem2::file_status&, boost::filesystem2::file_status&)' ./libomnis.so: undefined reference to `boost::filesystem2::detail::status_api(std::string const&, boost::system::error_code&)' ./libomnis.so: undefined reference to `boost::filesystem2::detail::not_found_error()' collect2: error: ld returned 1 exit status What am I missing here? PS: No errors occurred previously when I was just building the executable. -- Miguel

1 0

Why is cref required in this nested bind example?
by Chris Stankevitz 08 Dec '12

08 Dec '12

Hello, Can someone please explain why a cref is needed in the last line of the attached code snippet? Thank you, Chris === #include <boost/bind.hpp> #include <boost/function.hpp> using boost::bind; using boost::cref; using boost::function; void a() { } void b(function<void()>) { } void f() { //bind(b, bind(a)); bind(b, cref(bind(a))); }

4 7

boost shared_ptr with own dtor
by Philipp Kraus 08 Dec '12

08 Dec '12

Hello, I'm using boost::shared_ptr for using a C pointer. The ctor and all functions are called without any problem, but I have got a problem with the dtor. I need to call a C function on the dtor eg cptr_close( mypointer ) How can I this used with boost::shared_ptr? I need the cptr_close call on the pointer member of the dtor on the shared_ptr. Thanks a lot Phil

3 7

[Interprocess] message queue Cannot Allocate Memory
by cons_Pavignani, Antonio 08 Dec '12

08 Dec '12

Dear all, I use the message queue. I create a queue inside a thread (called Thread A) and I use it in another thread (called Thread B). I get this error: Cannot Allocate memory. This is the code related to the Thread A: message_queue::remove(InterprocessQueueName.c_str()); message_queue mq(open_or_create,InterprocessQueueName.c_str(),MAX_INTERPROCESS_SEND_QUEUE_SIZE,CalculatingSizeStructure::maxSizeHMIExtMessage); for(;;) { try { unsigned int priority; std::size_t recvd_size; mq.receive(msgBuffer, CalculatingSizeStructure::maxSizeHMIExtMessage, recvd_size, priority); ... } catch (interprocess_exception &ex) { ... } } This is the code related to the Thread B: boost::interprocess::message_queue *mq = InterprocessQueueManager::getInstance()->openQueue("Library_Queue"); if((mq->try_send(&msgCmdSendStatusToLibraryInfoR,sizeof(LibraryInfo),0))==false) {... } I've looked for that exception, and it seems to be related to the POSIX queue. I've also tried some solutions without results. Any ideas? Thanks in advance, Best Regards Antonio

2 1

Manually cleaning up TSS data in boost 1.49
by Andrew Harvey 08 Dec '12

08 Dec '12

Hi, I am using boost::thread for a plug-in that is loaded by a third-party Linux application. I have no control over the host's threading or when it chooses to unload my code. Unfortunately I experience a crash every time the host thread unloads the .so and terminates. I get the following backtrace: (gdb) bt #0 0x00007fffde12c460 in ?? () #1 0x00000032cf607889 in start_thread () from /lib64/libpthread.so.0 #2 0x00000032cf2e5ccd in clone () from /lib64/libc.so.6 Not much to go on... I am pretty confident the crash is happening in a pthread key destructor registered by Boost. The only parts of the boost::thread library I am currently using are the synchronization classes: shared_mutex, shared_lock, unique_lock, upgrade_lock, upgrade_to_unique_lock I'm not directly using any thread-specific storage myself. What I would like to do is force boost to call its TSS destructor in my plug-in's destroy_dso() function. Is this at all possible? Many thanks, - Andrew

2 5

[boost][mpl] Detect a type sequence type
by Klaim - Joël Lamotte 07 Dec '12

07 Dec '12

Hi, I am writing some functions and classes that accept a sequence of type ( boost::mpl::vector/list currently) as template parameter. I'm looking for a way to enhance type checking by making sure the provided types are... type sequences. I didn't find anything relevant in standard or boost type_trait libraries. So far, I'm guessing there is no way to check that, mainly because such types would be template instances, which make checking this like checking if a type is an instance of a template which is impossible right now (as far as I know anyway). My question is: what are possible ways to enhance type checking on type sequence types? I know some boost developers around here make great efforts to make sure their meta programming libraries make early and good error reporting so maybe they have a solution? PS: I'm using Visual Studio 2012 so I can't use variadic template yet ;___; (can't rely on the CTP) Joel Lamotte

2 3

[Graph] Labeled graph bug
by Kikohs xxx 07 Dec '12

07 Dec '12

Hello, I have created a labeled graph:

2 3

Clients controlling server and other clients
by Gonzalo Garramuno 07 Dec '12

07 Dec '12

I am writing an application in which one of multiple clients need to control the server and the other clients. The example is the timeline of a flipbook player. If one client sets the timeline to 125, both the server and the other clients need to jump to frame 125. If the server's timeline is modified to 200, indeed the timeline needs to be set to the new value in all clients. I am puzzled on how to write this with asio. Any help is appreciated.

2 2

Re: [Boost-users] [Graph] How to do multi source shortest path
by ratnesh kumar 07 Dec '12

07 Dec '12

Hi All, I need to use the parallel dijkstra for multiple source shortest path as mentioned before in this thread. I copied the part of last email below. Is this feature now implemented in BGL ? Thanks Ratnesh

1 0

text_file_backend with append and rotate
by Victor Yankee 06 Dec '12

06 Dec '12

Hello everyone! How to create a text_file_backend that appends to existing log file and also has rotation. The init function below always creates a new file every time I run my program no matter the rotation settings. I am using svn version 774 (latest as of Dec 5, 2012. I tried many ways but no joy. There is not an example like this, and there does not seem to be a test for appending either, so maybe it is not supported, but that would be bad. So I must be doing something wrong. Here is my function to set up the logger (using my custom severity levels): void init() { typedef boost::log::sinks::synchronous_sink< boost::log::sinks::text_file_backend > FileSink_t; boost::shared_ptr< FileSink_t> mySink( new FileSink_t( boost::log::keywords::file_name = "%Y%m%d_%H%M%S_%5N.log" , boost::log::keywords::rotation_size = 16 * 1024 * 1024 /3 , boost::log::keywords::time_based_rotation = boost::log::sinks::file::rotation_at_time_point(0,0,0) , boost::log::keywords::auto_flush = true , boost::log::keywords::open_mode=(std::ios::out | std::ios::app) // seems to have no effect )); // this method of setting append does not seem to work either, so I must be doing something wrong mySink->locked_backend()->set_open_mode(std::ios::out|std::ios::app); mySink->locked_backend()->set_file_collector(boost::log::sinks::file::make_collector( boost::log::keywords::target = "logs" , boost::log::keywords::max_size = 16 * 1024 * 1024 , boost::log::keywords::min_free_space = 2 * 16 * 1024 * 1024 )); mySink->set_filter(boost::log::filters::attr< LOGGING::LOG_LEVEL >("Severity", std::nothrow) >= LOGGING::warning); mySink->locked_backend()->scan_for_files(); mySink->set_formatter( boost::log::formatters::format("[%1% | %2%] %3%") % boost::log::formatters::date_time< boost::posix_time::ptime >("TimeStamp") % boost::log::formatters::attr< LOGGING::LOG_LEVEL >("Severity", std::nothrow) % boost::log::formatters::message() ); boost::log::core::get()->add_sink(mySink); boost::log::core::get()->add_global_attribute("TimeStamp", boost::log::attributes::local_clock()); }

1 0

Why does gcc require explicit template arguments with my boost::bind
by Chris Stankevitz 06 Dec '12

06 Dec '12

Hello, Below I implement a function "Chain" that takes two functions and executes them both. The first approach succeeds: direct function call. The second approach succeeds: call via bind with explicit template arguments The third and fourth approaches fail: call via bind without explicit template arguments (with/without boost::protect) Question: Why do I have to use explicit template arguments when using bind with Chain? Thank you, Chris === #include <boost/bind.hpp> #include <boost/function.hpp> template <typename TAFunc1, typename TAFunc2> void Chain(const TAFunc1& Func1, TAFunc2& Func2) { Func1(); Func2(); } void f() { } void foo() { boost::function<void()> x = boost::bind(f); boost::function<void()> y = boost::bind(f); Chain(x, y); boost::bind(Chain<boost::function<void()>, boost::function<void()> >, x, y)(); boost::bind(Chain, x, y)(); boost::bind(Chain, boost::protect(x), boost::protect(y))(); }

3 3

Experience with dealing with warnings from the Clang toolset?
by Paul A. Bristow 06 Dec '12

06 Dec '12

I have added a little information on dealing with warnings when using the Clang toolset at https://svn.boost.org/trac/boost/wiki/Guidelines/WarningsGuidelines but I am sure there are people using Clang who can provide more detailed information and suggestions from their experiences. Please tell me if you have anything to add. Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 3

Boost::Asio read_until and streambuf usage
by Gonzalo Garramuno 06 Dec '12

06 Dec '12

I have a server that sends three lines, each of which have to be parsed independently. I am using read_until but have a problem with its usage. When read_until reads once, the streambuf seems to contain the three lines but not in the istream and only when I call read_until several times, I get the lines. I am wondering how can I safely read_until the buffer is empty (the 3 or more lines are read) and then exit the loop. boost::asio::streambuf buf; while( 1 ) { size_t reply_length = boost::asio::read_until( socket_, buf, '\n' ); std::istream is(&buf); std::string reply; std::getline(is, reply); // only 1 line obtained }

3 4

Re: [Boost-users] boost msm - differed events
by Kamel Zaarouri, Mr 05 Dec '12

05 Dec '12

Hi guys, I realized that I asked a very unclear question yesterday. I will try to reformulate :) Let's say I have 2 states, an Active state and an Idle state. If I receive some events in Active state I would like to defer them and execute them when I go back to Idle state. But when I go back to Idle State is there a way to chose which previously deferred event to process? or is there a way to prioritize them or even ignore few of them? Thank you!

2 1

C++11, boost::filesystem::path, no std::hash specialization
by Benjamin Kircher 05 Dec '12

05 Dec '12

Hi there, I cannot use boost::filesystem::path with an e.g. unordered_set because std::hash seems not to be specialized for this type. Is this intended? Should I file a bug? Or am I completely misguided? I use 1.52 libraries with -DBOOST_FILESYSTEM_NO_DEPRECATED. I searched the bug database but did not find anything relevant (other than this https://svn.boost.org/trac/boost/ticket/5650 ticket). Thanks in advance, -Benjamin

2 2

Boost.Serialization type-dependent serialization
by Roman Suvorov 05 Dec '12

05 Dec '12

Hi! I have a list of objects of the following structure: > class Obj > { > // a number simple fields > int field1() const; > > // ... > > // reference to an object containing large amount of data > const blob_type & mega_blob() const; > }; The list is to be serialized in the following way: 1) simple fields of each object are to be serialized into a single xml file; 2) mega_blobs' are to be serialized into separate binary files. The idea of doing it is to write custom archive that has operator<< specialized for blob_type which does the magic. Following the Boost.Serialization reference (http://www.boost.org/doc/libs/1_52_0/libs/serialization/doc/archive_referen…) I wrote the code in order to proof the concept: http://pastebin.com/ekbXXvxF My test project is built using CMake and G++-4.6.3 (Debian Wheezy) (that seems to be ok - other code that uses Boost.Serialization compiles well): http://pastebin.com/WVRUKLD2 As a result I get the following linker errors: http://pastebin.com/rM05nkqw The questions: 1) am I using xml_oarchive_impl wrong way or that problem is not boost-related? 2) maybe there are more elegant ways of solving my task? Cheers, Suvorov Roman.

1 1

Re: [Boost-users] Boost-users Digest, Vol 3288, Issue 1
by Shcherbina Vladimir 05 Dec '12

05 Dec '12

Hi, Could you try it with MS compiler and any release prior to the 1.52.0? -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of boost-users-request(a)lists.boost.org Sent: 04 December 2012 17:29 To: boost-users(a)lists.boost.org Subject: Boost-users Digest, Vol 3288, Issue 1 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: Boost 1.49.0 compilation issue (Marshall Clow) 2. Re: boost msm - Multiple differed events (Kamel Zaarouri, Mr) 3. [serialization] versioning for class nested within template class (Gabriel Redner) 4. Re: Asio and software interrupts (Steve Lorimer) 5. Spirit guidance needed (Arkadiy and Marina Vertleyb) 6. [boost][polygon]Errors with minkowski sum (renaud lepere) 7. Re: Spirit guidance needed (Igor R) 8. Experience with dealing with warnings from the Clang toolset? (Paul A. Bristow) ---------------------------------------------------------------------- Message: 1 Date: Mon, 3 Dec 2012 09:29:59 -0800 From: Marshall Clow <mclow.lists(a)gmail.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Boost 1.49.0 compilation issue Message-ID: <BA420D66-6A77-4CF9-AB4C-E1005A770684(a)gmail.com> Content-Type: text/plain; charset=us-ascii On Dec 2, 2012, at 1:47 AM, Shcherbina Vladimir <Vladimir.Shcherbina(a)elbitsystems.com> wrote: > I tried to compile this boost dependent class with VS2008 and VS2010 > (error lines are in bold) Another data point: I was able to successfully compile your code with clang. and the 1.52.0 release. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki ------------------------------ Message: 2 Date: Mon, 3 Dec 2012 21:08:57 +0000 From: "Kamel Zaarouri, Mr" <kamel.zaarouri(a)mail.mcgill.ca> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] boost msm - Multiple differed events Message-ID: <E7E49CA8DA97024ABF8B81BBF85E325412D63A(a)EXMBX2010-3.campus.MCGILL.CA> Content-Type: text/plain; charset="us-ascii" Hi Guys, Let's say that we have 2 states, S1 and S2. with this transition table: S1 -> S2 on event Es2 S2 -> S1 on event Es1 also let's say that S1 can also accept Ev1 and Ev2 but S2 cannot accept them so it differs them. Now when let's say that S2 receives 2 events Ev1 and Ev2 and differs them. Now, when S2 goes back to S1 would S1 handle both events in order? or how does it work? Thanks, ------------------------------ Message: 3 Date: Mon, 3 Dec 2012 17:51:40 -0500 From: Gabriel Redner <gredner(a)gmail.com> To: boost-users <boost-users(a)lists.boost.org> Subject: [Boost-users] [serialization] versioning for class nested within template class Message-ID: <CAO0m-H+t-bfAOe7JoV27MEMeHPXs6pVzDV9yqJC1Csp2Av6ESA(a)mail.gmail.com> Content-Type: text/plain; charset=windows-1252 Hi folks, I am having trouble incrementing the serialization version of a regular class nested within a template class. I'm not sure if the problem is with boost or with my own understanding of the issue. My code looks like: ============================== template <typename A, typename B> struct Foo { struct Bar { int data1; int data2; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, unsigned int version) { ar & data1; if (version >= 2) { ar & data2; } else { data2 = 0; } } }; }; ============================== My attempt at setting the version looks like: ============================== namespace boost { namespace serialization { template <typename A, typename B> struct version<typename Foo<A, B>::Bar> { BOOST_STATIC_CONSTANT(unsigned int, value = 2); }; } // namespace serialization } // namespace boost ============================== However, g++ gives an error: ============================== main.cpp:31:8: error: template parameters not used in partial specialization: main.cpp:31:8: error: ?A? main.cpp:31:8: error: ?B? ============================== Strangely, clang 3.0 compiles the code but issues some warnings: ============================== main.cpp:31:8: warning: class template partial specialization contains template parameters that can not be deduced; this partial specialization will never be used struct version<typename Foo<A, B>::Bar> ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:30:20: note: non-deducible template parameter 'A' template <typename A, typename B> ^ main.cpp:30:32: note: non-deducible template parameter 'B' template <typename A, typename B> ^ 1 warning generated. ============================== I'd appreciate any pointers! Thanks, -Gabe ------------------------------ Message: 4 Date: Tue, 4 Dec 2012 10:17:33 +1100 From: Steve Lorimer <steve.lorimer(a)gmail.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Asio and software interrupts Message-ID: <CAE-NPOiR0Z3rGhmfBftGxpRLrJHTBW=6eMjGac27SaW+OvgJVw(a)mail.gmail.com> Content-Type: text/plain; charset="iso-8859-1" On 4 December 2012 01:51, Joseph Sulewski <joemacher(a)gmail.com> wrote: > *When I call socket->bind I provide it with an endpoint. When I > create the endpoint I'm currently using the multicast address, what > should I use for the address? * > If you bind to INADDR_ANY then the OS will use its ip routing tables to work out which the best local nic to use is. You can force it to use a specific local nic by providing its address. Most applications will use INADDR_ANY *If I'm binding to multiple multicast addresses it doesn't make sense to > bind to one of them.* > Because UDP is connectionless there is no way for the kernel / network stack to know which pid to deliver datagrams to for a particular port unless you bind your socket's file descriptor to that port. (note, if you want to allow other file descriptors to be able to bind to that port you need to set SO_REUSEADDR to 1) > *Finally, it appears I can join multiple multicast groups but they > need to be the same port. Is this correct?* > The reason for this is as my previous point above. What you would do is create as many sockets as there are different ports, and have each socket join the multicast addresses which are on that port > >

1 0

[Filesystem] Movable fstreams
by Szymon Gatner 04 Dec '12

04 Dec '12

Hi, Could move (via boost.move) support be added to file streams provided by filesystem library? Would be very useful when returning for example ifstream from function. Cheers, Simon -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

1 0

Boost.Math - Statistical Distribution Explorer - updated to Boost 1.52
by Paul A. Bristow 04 Dec '12

04 Dec '12

Just to note that I have recently updated the Microsoft Windows C# 'app' that allows one to explore various properties of statistical distributions and calculate their Cumulative Distribution Function CDF, Probability Distribution Function PDF, or quantiles/percentiles. This revision includes some new distributions and all the bug fixes and improvements in Boost.Math for 1.52. I have also now aligned the application version numbering with Boost release numbering. For full information and download http://sourceforge.net/projects/distexplorer/ It works on all the 'this-millennium' versions of Windows. If anyone knows how to produce a *nix version, please contact me. Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

Spirit guidance needed
by Arkadiy and Marina Vertleyb 04 Dec '12

04 Dec '12

Hi all, Can somebody direct me to a part/facility inside the Spirit library to do the following: I need to pre-parce a boolean expression (once) and save it somewhere. Then I need to evaluate this expression (many times, performance important) based on different values of tokens. Will Spirit.Classic do? Or do I need to use any of the newer libraries inside Spirit? Thanks for any help. Arkadiy

2 1

[boost][polygon]Errors with minkowski sum
by renaud lepere 04 Dec '12

04 Dec '12

I need to implement robust minkowski sum operations on polygons. I have seen that this could be implemented easily using boost::polygon, the tutorial is here http://www.boost.org/doc/libs/1_52_0/libs/polygon/doc/gtl_minkowski_tutoria… The example works fine, however i need more precision than "int" (32 bits on my plateform win32-msvc10-32bits). I tried to replace to replace int -> double typedef boost::polygon::point_data< int > point; with typedef boost::polygon::point_data< double > point; But this leads to strange errors deep into the code (operator< is "bad") if (!_Pred(_Left, _Right)) return (false); else if (_Pred(_Right, _Left)) _DEBUG_ERROR2("invalid operator<", _File, _Line); called after scan_data_.insert(*insert_itr); // line 1197 in scan_arbitrary.hpp What can i do to avoid it, if i use "long long" type it works but it sends a lot of warning at compile time. Any idea of what i should do ? Is "double" type supported ?

1 0

Asio and software interrupts
by Joseph Sulewski 03 Dec '12

03 Dec '12

Hello, I’m use the Boost::Asio libraries to read data from multicast sockets. This is a high rate application that needs to listen to data coming on a large number of multicast addresses (up to 500 different addresses). I would like to funnel all the multicast traffic to a single class where the data can get handled very quickly. I have the code working now using the socket->async_receive_from() method but the system is getting bogged down handling a large number of software interrupts. 51% of the CPU time is spent handling software interrupts. I create each multicast socket (up to 500 of them) like so: socket = new udp::socket(io_service); socket->open(listenEndPoint.protocol()); socket->set_option(boost::asio::ip::udp::socket::resuse_address(true)); socket->bind(listenEndPoint); socket->set_option(boost::asio::ip::multicast::join_group(multicastAddress.to_v4())); Slightly after that I register for data like so: socket->async_receive_from(buffer,senderEndPoint,boost::bind(&EthernetCapture::receiveData,this,boost::asio::placeholders::bytes_transferred)); Is there a more efficient way to receive multicast data without incurring so many software interrupts? By the way this is for an application to run on 32 bit Linux for an embedded application. Thanks

3 8

[serialization] versioning for class nested within template class
by Gabriel Redner 03 Dec '12

03 Dec '12

Hi folks, I am having trouble incrementing the serialization version of a regular class nested within a template class. I'm not sure if the problem is with boost or with my own understanding of the issue. My code looks like: ============================== template <typename A, typename B> struct Foo { struct Bar { int data1; int data2; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, unsigned int version) { ar & data1; if (version >= 2) { ar & data2; } else { data2 = 0; } } }; }; ============================== My attempt at setting the version looks like: ============================== namespace boost { namespace serialization { template <typename A, typename B> struct version<typename Foo<A, B>::Bar> { BOOST_STATIC_CONSTANT(unsigned int, value = 2); }; } // namespace serialization } // namespace boost ============================== However, g++ gives an error: ============================== main.cpp:31:8: error: template parameters not used in partial specialization: main.cpp:31:8: error: ‘A’ main.cpp:31:8: error: ‘B’ ============================== Strangely, clang 3.0 compiles the code but issues some warnings: ============================== main.cpp:31:8: warning: class template partial specialization contains template parameters that can not be deduced; this partial specialization will never be used struct version<typename Foo<A, B>::Bar> ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:30:20: note: non-deducible template parameter 'A' template <typename A, typename B> ^ main.cpp:30:32: note: non-deducible template parameter 'B' template <typename A, typename B> ^ 1 warning generated. ============================== I'd appreciate any pointers! Thanks, -Gabe

1 0

Re: [Boost-users] boost msm - Multiple differed events
by Kamel Zaarouri, Mr 03 Dec '12

03 Dec '12

Hi Guys, Let's say that we have 2 states, S1 and S2. with this transition table: S1 -> S2 on event Es2 S2 -> S1 on event Es1 also let's say that S1 can also accept Ev1 and Ev2 but S2 cannot accept them so it differs them. Now when let's say that S2 receives 2 events Ev1 and Ev2 and differs them. Now, when S2 goes back to S1 would S1 handle both events in order? or how does it work? Thanks,

1 0

Boost 1.49.0 compilation issue
by Shcherbina Vladimir 03 Dec '12

03 Dec '12

2down votefavorite<http://stackoverflow.com/questions/13628685/boost-1-49-0-compilation-issue> I tried to compile this boost dependent class with VS2008 and VS2010 (error lines are in bold) #include <boost/interprocess/ipc/message_queue.hpp> #include <boost/interprocess/sync/scoped_lock.hpp> #include <boost/interprocess/sync/named_mutex.hpp> #include <boost/interprocess/sync/named_condition.hpp> struct SafeShardQueue { typedef boost::interprocess::scoped_lock<boost::interprocess::named_mutex> scoped_mutex; SafeShardQueue()//: { } ~SafeShardQueue() { remove(); } void wait_msg() { scoped_mutex locker(*mu); data_avail_condition->wait(locker); } void wait_space() { scoped_mutex locker(*mu); queue_empty_condition->wait(locker); } boost::shared_ptr<boost::interprocess::message_queue> msgs; boost::shared_ptr<boost::interprocess::named_condition> data_avail_condition; boost::shared_ptr<boost::interprocess::named_mutex> mu; boost::shared_ptr<boost::interprocess::named_condition> queue_empty_condition; static SafeShardQueue* open() { SafeShardQueue* tmp = new SafeShardQueue(); boost::interprocess::open_only_t open_create_type; tmp->msgs.reset(new boost::interprocess::message_queue (open_create_type, "message_queue")); tmp->mu.reset(new boost::interprocess::named_mutex(open_create_type, "shared_queue_mutex")); tmp->data_avail_condition .reset(new boost::interprocess::named_condition(open_create_type, "data_avail_condition")); tmp->queue_empty_condition .reset(new boost::interprocess::named_condition(open_create_type, "queue_empty_condition")); return tmp; } static SafeShardQueue* create() { remove(); SafeShardQueue* tmp = new SafeShardQueue(); boost::interprocess::create_only_t open_create_type; std::stringstream ss; try { tmp->msgs.reset(new boost::interprocess::message_queue(open_create_type, "message_queue", 256, 1024)); tmp->mu.reset(new boost::interprocess::named_mutex(open_create_type, "shared_queue_mutex")); tmp->data_avail_condition .reset(new boost::interprocess::named_condition(open_create_type, "data_avail_condition")); tmp->queue_empty_condition .reset(new boost::interprocess::named_condition(open_create_type, "queue_empty_condition")); } catch (const boost::interprocess::interprocess_exception& e) { ss << e.what(); } return tmp; } static void remove() { boost::interprocess::message_queue::remove("message_queue"); boost::interprocess::named_mutex::remove("shared_queue_mutex"); boost::interprocess::named_condition::remove("data_avail_condition"); boost::interprocess::named_condition::remove("queue_empty_condition"); } }; I got the following error message: 1>\boost\boost\interprocess\ipc\message_queue.hpp(254) : error C2039: 'priority_functor' : is not a member of 'boost::interprocess::ipcdetail::ipcdetail' 1>\boost\boost\interprocess\ipc\message_queue.hpp(425) : see reference to class template instantiation 'boost::interprocess::ipcdetail::mq_hdr_t<VoidPointer>' being compiled 1> with 1> [ 1> VoidPointer=boost::interprocess::offset_ptr<void> 1> ] 1>\boost\boost\interprocess\ipc\message_queue.hpp(425) : while compiling class template member function 'unsigned int boost::interprocess::message_queue_t<VoidPointer>::get_mem_size(unsigned int,unsigned int)' 1> with 1> [ 1> VoidPointer=boost::interprocess::offset_ptr<void> 1> ] 1>\boost\boost\interprocess\ipc\message_queue.hpp(465) : while compiling class template member function 'boost::interprocess::message_queue_t<VoidPointer>::message_queue_t(boost::interprocess::open_only_t,const char *)' 1> with 1> [ 1> VoidPointer=boost::interprocess::offset_ptr<void> 1> ] 1>\**sharedqueue.h(42)** : see reference to class template instantiation 'boost::interprocess::message_queue_t<VoidPointer>' being compiled 1> with 1> [ 1> VoidPointer=boost::interprocess::offset_ptr<void> 1> ] 1>\boost\boost\interprocess\ipc\message_queue.hpp(254) : error C2955: 'boost::interprocess::ipcdetail::priority_functor' : use of class template requires template argument list 1>\boost\boost\interprocess\ipc\message_queue.hpp(209) : see declaration of 'boost::interprocess::ipcdetail::priority_functor' 1>\boost\boost\interprocess\ipc\message_queue.hpp(254) : error C2143: syntax error : missing ',' before '<' It seems that you cannot use both interprocess::message_queue and interprocess:named_condition in the same class. Any ideas? I would greatly appreciate your help in this issue. Best Regards, Vladimir The information in this e-mail transmission contains proprietary and business sensitive information. Unauthorized interception of this e-mail may constitute a violation of law. If you are not the intended recipient, you are hereby notified that any review, dissemination, distribution or duplication of this communication is strictly prohibited. You are also asked to contact the sender by reply email and immediately destroy all copies of the original message.

2 1

[Who's using boost?] Algocoders : books on c++11, Boost and Beyond
by Algocoders . 03 Dec '12

03 Dec '12

Algocoders <http://www.algocoders.com> Algocoders has been using boost since last 6+ years with a mission to help people build a better software eco-system by standing on the shoulder of giants. If it wasn't not for boost, then it could have been really difficult for us to build our framework based on sound mathematical foundation of computer science using modern C++. It is the pioneering efforts at boost towards "Using and Extending C++11, Boost and Beyond" which has motivated us to devote ourself in developing bullet-size capsules in the form of tiny booklets with industrial-set framework to lift the thin veil with initial focus on practical usage of C++11 vis-a-vis mathematical foundation behind it. Web Page : http://www.algocoders.com Enthused by boost, we are working tirelessly towards *publishing a series of books(or booklets) which will bridge the gap between esoteric and street-side ones. Initial focus will be on C++11, Boost, Loki, STL, Algorithms, Data Structures, Multi-threading, Design Patterns, gcc, clang, valgrind.* *First book in this series is :*(will be available by end of November 2012) *Foundation of Algorithms in C++11, Volume 1* Using and Extending C++11, Boost and BeyondList of books(in progress): - *C++11 Algorithms : *Using and Extending C++11, Boost and Beyond - *Smart Pointers** : Tips and Techniques in C++ :* Using and Extending C++11, Boost and Beyond - *C++11 FAQs :* Using and Extending C++11, Boost and Beyond - *Concepts & Traits C++ **:* Using and Extending C++11, Boost and Beyond and so on. We use almost all the libraries under boost including trunk and branches, especially Spirit, Phoenix, Proto, MPL, Fusion to mention a few. Thanks, Algocoders www.algocoders.com

2 2