- Boost-users - lists.boost.org

Extracting a boost::function from a boost::signals2::signal
by Chris Stankevitz 19 Jul '12

19 Jul '12

Hello, I would like to create an "Interceptor" class that can generically receive a void-returning signal with n arguments (as something like a boost::function<void()>) and, at runtime, decide whether the signal will be delivered to the final slot. Or perhaps even deliver the signal at some later time. Psuedocode might look like this: class Interceptor { template<class Signal> void Connect(Signal& signal, const Signal::slot_type& slot) { signal.connect_generic(slot, bind(&Interceptor::Dispatch, this, _1)); } void Dispatch(const boost::function<void()>& Function) { if (DispatchNow()) { Function(); } else if (DispatchLater()) { DispatchLater.push_back(Function); } } }; Is such a thing possible? Thank you, Chris

1 0

[BJam] managing including order
by Marc-Antoine ARNAUD 19 Jul '12

19 Jul '12

Hi, I'm currently tring to use including ordering into BJam files. I have 2 libraries - boostHack (header only library) defined by: alias boostHack : # no sources : # no build requirements : # no default build : <include>. ; and - libSupport defined with: project : requirements <include>$(BOOST_HACK)&&$(BOOST_LIBS) <include>include <link>static : usage-requirements <include>include <include>../../tuttle/src : build-dir $(BUILD)/openFX/Support ; lib Support : # which using boost system library [ glob-tree *.cpp ] : /boost//system/<link>static ; like it mentionned here http://www.boost.org/doc/libs/1_36_0/doc/html/bbv2/faq.html, headers are included with alphabetical order, and I try to change order with <include>$(BOOST_HACK)&&$(BOOST_LIBS). But with using the boost system library, it include the BOOST_ROOT directory before the BoostHack header library. In the command, I found: -I"/datas/mrn/dev/TuttleOFX/3rdParty/boost" -I"/datas/mrn/dev/TuttleOFX/libraries/boostHack" -I"/datas/mrn/dev/TuttleOFX/3rdParty/boost" and I want: -I"/datas/mrn/dev/TuttleOFX/libraries/boostHack" -I"/datas/mrn/dev/TuttleOFX/3rdParty/boost" Can someone know how to change this including order between include directory and library dependencies ? -- Marc-Antoine* *ARNAUD Software Engineer Mikros Image - Digital Post-Production for Video and Film www.mikrosimage.eu

1 0

Starting with boost
by Ronny Herzog 19 Jul '12

19 Jul '12

Dear all, I want to start using boost and tried the steps provided in http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html. <http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html#auto…> My system is Windows 7 with MS VC 2008 and I would like to use boost from the command line. I run bootstrap.bat and bjam.exe to build all libraries. However, when I want to compile the example file (http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html#link…) which uses the 'regex' library it does not find it. Command: c:\Users\Duke\My_Projects\boost_python>cl /EHsc /I c:\boost_1_50_0 testBoost.cpp /link /LIBPATH:C:\boost_1_50_0\libs\ Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 15.00.21022.08 for 80x86 Copyright (C) Microsoft Corporation. All rights reserved. testBoost.cpp Microsoft (R) Incremental Linker Version 9.00.21022.08 Copyright (C) Microsoft Corporation. All rights reserved. /out:testBoost.exe /LIBPATH:C:\boost_1_50_0\libs\ testBoost.obj LINK : fatal error LNK1104: cannot open file 'libboost_regex-vc90-mt-s-1_50.lib' c:\Users\Duke\My_Projects\boost_python> Why does it not find the library? Do I have to set a variable for the library path for MSVC 2008? How? Any help is very much appreciated! Thanks, Ronny

3 3

Parsing a Windows/DOS file path with Spirit
by Yves Dolce 19 Jul '12

19 Jul '12

I've started learning Spirit a couple of days ago and I'd like to know if anyone already implemented a parser for a Windows file path. A local one with a drive letter, not a general UNC. If so, can you share it? That would help me quite a lot to go past the number/xml related examples in the tutorials. Thanks.

1 0

Build Boost 1.50 on Windows XP for MSVS2008
by Boost lzw 19 Jul '12

19 Jul '12

Hi there, I am wondering if anyone here have built 1.50 on Windows XP for MSVS2008 and can kindly share what exact commands in command line that I should use to manaully build everything from the sorce for use with MSVS2008. I have downloaded boost 1.50 and placed it under "C:\Program Files\boost_1_50_0\" folder and can modify the folder when building. I read here that someone tried something like: cd "C:\Program Files\boost_1_50_0\" bootstrap.bat bjam.exe but I could not find "bjam.exe". I also suspect the building process might not be so simple. Thanks in advance for your help. Robert

5 11

Distributed breadth first search MPI_Unpack runtime error
by Clara Moore 18 Jul '12

18 Jul '12

Hi, I'm having a runtime error that I can't seem to figure out how to fix. When I create and breadth first search a graph with 1,000,000 vertices my code works fine, but if I create and breadth first search a graph with 2,000,000 vertices then I get an MPI_Unpack runtime error. From a stack trace I believe that the code is failing on a call to synchronize the first time that the queue is checked for being empty within the breadth first search code. Can anyone tell me what is wrong in my code please? I'm using version 1.48.0 if that helps any. My code is: #include <boost/graph/use_mpi.hpp> #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <boost/graph/distributed/concepts.hpp> #include <boost/graph/adj_list_serialize.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/random/linear_congruential.hpp> #include <boost/graph/distributed/breadth_first_search.hpp> #include <boost/graph/rmat_graph_generator.hpp> using namespace boost; using namespace graph; using namespace distributed; int main(int argc, char* argv[]) { mpi::environment env(argc, argv); mpi::communicator world; int verts = 20; if(argc > 1){ verts = atoi(argv[1]); } int edgs = 12*verts; if(argc > 2){ edgs = atoi(argv[2]); } typedef adjacency_list<listS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; minstd_rand gen_rmat; typedef rmat_iterator<minstd_rand, Graph> RMATgen; Graph g(RMATgen(gen_rmat, verts, 12*verts, 0.33, 0.15, 0.49, 0.03), RMATgen(), verts); world.barrier(); synchronize(g.process_group()); world.barrier(); breadth_first_search(g, vertex(0, g), visitor(bfs_visitor<null_visitor>())); world.barrier(); return 0; } And the runtime error I get is: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::mph::exception> >' what(): MPI_Unpack: MPI_ERR_ARG: invalid argument of some other kind

1 0

boost numeric bindings - lartg
by Peter Man 18 Jul '12

18 Jul '12

Hi, I'm using the numeric bindings library, and am trying to generate a plane rotation. I've done this using the blas::rotg function, but was hoping to try out the more accurate lapack::lartg function. However, I cannot find this function. Is this missing from the library or have I just not looked hard enough? Thanks in advance! Peter

2 1

Re: [Boost-users] filesystem directory_iterator run-time error during construction after upgrading to OSX Lion
by Thibaut LEPAGE 18 Jul '12

18 Jul '12

Hello, I have a program using a directory_iterator which worked well until yesterday (Mac OSX Lion, g++ version 4.2 and boost version 1.49). Then I upgraded g++ to 4.7 and now the program produces a runtime error "pointer being freed was not allocated" when trying to create the directory_iterator. Thibaut Lepage

1 0

How to make is_arithmetic true for a UDT
by Paul A. Bristow 17 Jul '12

17 Jul '12

I am facing the need to get my User Defined Type to return true from boost::is_arithmetic (This is to meet a check for autoprefixing in Boost.Units) There was some discussion on this issue before, http://lists.boost.org/boost-users/2007/10/31538.php but I am not clear if it reached a satisfactory conclusion. (Nor that I fully understand what is being proposed). A cut-down example is a Trivial UDT that does exactly same as double. (My actual example has template parameter for floating-point type of two members, a value and an uncertainty, and others). Suggestions? Paul -- - Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

3 6

[Phoenix] for_each calling push_back for stl containers
by Ryan 17 Jul '12

17 Jul '12

Hello, In upgrading from boost 1.39 to 1.47 I changed my use of the Phoenix library (which was within Spirit) to the stand alone Phoenix library. This caused my below code to stop working. /**** Code Start ***/ static boost::char_separator<char> seperator(":"); boost::tokenizer< boost::char_separator<char> > tokens(s, seperator); //s is a passed in std::string std::vector<std::string> string_tokens; namespace phx = boost::phoenix; //This line fails to compile now. std::for_each(tokens.begin(), tokens.end(), phx::bind(&std::vector<std::string>::push_back, &string_tokens, phx::arg_names::arg1)); /**** Code Stop ***/ This lead me to three questions. 1. What changed about phoenix bind that caused this not to work any more? 2. I tried using the lazy version of push_back to bypass the bind issue. In the documentation there are not any examples of multiple algorithm and container methods calling each other to show how the arguments of one method is passed to another. std::for_each(tokens.begin(), tokens.end(), phx::push_back(&string_tokens, phx::arg_names::arg1)); This compiles but nothing is placed into string_tokens. So I'm assuming the argument from for_each isn't being passed to push_back. What needs to changed in this method call? 3. Can that entire line of question 2 be replaced with the lazy version of the method calls or does the outer most call need to be a non-lazy method? phx::for_each(phx::arg_names::arg1, phx::push_back(phx::arg_names::arg2, phx::arg_names::arg3))(tokens, string_tokens, ???); If the entire line can be a lazy version then how would I map for_each to push_back for arg3? Any help for these three questions would really be appreciated. Ryan

5 23