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

[fusion, phoenix, spirit2] C++ orientation
by Michael Powell 26 Feb '13

26 Feb '13

Hello, It's been a little while since I've gone into much depth in C++. Been in the C# world for recent years and have a fairly advanced view of that world, through concepts like push-oriented dependency injection, pull-oriented inversion of control (less preferred), functional style programming using anonymous actions, functions, lambdas, and so on. I am working on a project now where we are adopting C++ into the mix, and I would like to get a much better sense for Spirit (likely Spirit2) for purposes of how to run sequences of complex data through various calculations, finds, counts, etc, probably needing to dynamically parse these calculations. Our data will be a series of spiked tuples (one or more) of n-dimensional packed values, and we'll probably need to dynamically parse calculations on the n-dimensions to determine did we satisfy the solution. I don't know if that makes any sense to anyone. It's all very conceptual, very abstract, at this stage of the game. I know, or have a sense, exactly how I might do it in C#, .NET 4, and so on. A little less so what's available in C++, much less boost, spirit, phoenix, fusion, etc. Any insight where to begin would be helpful. Regards, Michael

10 19

[Regex] MSVC 2008 (VC9) fails to compile regex_raw_buffer.hpp on 1_49
by Larry 26 Feb '13

26 Feb '13

I get an error just including regex.hpp in a program that used to work on earlier VC versions. 1>c:\boost\include\boost-1_49\boost\regex\v4\regex_raw_buffer.hpp(184) : error C2665: 'operator new' : none of the 6 overloads could convert all the argument types 1> c:\program files (x86)\microsoft visual studio 9.0\vc\include\new(57): could be 'void *operator new(size_t,void *) throw()' 1> c:\program files (x86)\microsoft visual studio 9.0\vc\include\new(86): or 'void *operator new(size_t,const std::nothrow_t &) throw()' 1> while trying to match the argument list '(const char [64], long)' 1>c:\boost\include\boost-1_49\boost\regex\v4\perl_matcher_non_recursive.hpp(110) : error C2059: syntax error : '*' inline raw_storage::raw_storage(size_type n) { start = end = static_cast<pointer>(::operator new(n)); <--- offending line for first error BOOST_REGEX_NOEH_ASSERT(start) last = start + n; } struct save_state_init { saved_state** stack; save_state_init(saved_state** base, saved_state** end) : stack(base) { *base = static_cast<saved_state*>(get_mem_block()); *end = reinterpret_cast<saved_state*>(reinterpret_cast<char*>(*base)+BOOST_REGEX_BLOCKSIZE); --(*end); (void) new (*end)saved_state(0); <---- offending line for second error ........... I looked to see if this was a known failure but apparently missed it if it was already covered. It is probably not a Boost problem. The earlier versions were compiled on 32 bit systems and this is a 64 bit system (Win7). I assume I have probably missed some configuration item to make this work. I am fairly certain I did compile this before under VC9 on a 32 bit system (Vista). (Boost was built from source on this system and this compiler.) Any pointers for resolution would be appreciated. Larry

3 4

Boost user's guide or getting started guide?
by John Lilley 25 Feb '13

25 Feb '13

Greetings! I feel that many questions I have about Boost.Geometry are really questions about the "Boost way and true path". Is there a good place to get started with Boost.Geometry specifically or Boost in general? I feel that I am locking in some basic understanding of how all of these templates fit together, what are Ranges, what are "concepts" etc. Where do I RTFM? Thanks, john

4 3

nest mpl::lambda
by Niitsuma Hirotaka 25 Feb '13

25 Feb '13

I would like to use mpl::lambda in nest. In this case works fine. --------- typedef boost::mpl::lambda<boost::mpl::max<boost::mpl::_1,boost::mpl::_2> > my_max; typedef boost::mpl::fold< boost::mpl::vector_c<int,1,7,0,-2,5,-1> , boost::mpl::int_<6> //, boost::mpl::max<boost::mpl::_1,boost::mpl::_2> , my_max >::type r2; BOOST_MPL_ASSERT(( boost::is_same< r2, boost::mpl::integral_c<int, 7> > )); --------- However --------- typedef boost::mpl::lambda< boost::mpl::fold< boost::mpl::_1 ,boost::mpl::front<boost::mpl::_1> ,my_max >::type >::type my_max_types; typedef my_max_types::apply<boost::mpl::vector_c<int,1,7,0,-2,5,-1> >::type r3; BOOST_MPL_ASSERT(( boost::is_same< r3, boost::mpl::integral_c<int, 7> > )); ///error => becomes boost::mpl::integral_c<int, 1> --------- How to define such nest lambda in mpl?

2 6

Re: [Boost-users] [parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi ./b2 libs/graph_parallel/example No it didnt work. Tasos ####### "typeinfo for boost::mpi::exception", referenced from: typeinfo for boost::exception_detail::error_info_injector<boost::mpi::exception>in dijkstra_shortest_paths.o "vtable for boost::mpi::exception", referenced from: boost::mpi::exception::exception(boost::mpi::exception const&)in dijkstra_shortest_paths.o NOTE: a missing vtable usually means the first non-inline virtual member function has no definition. ld: symbol(s) not found for architecture x86_64 collect2: ld returned 1 exit status "g++" -L"/usr/local/Cellar/open-mpi/1.6.3/lib" -o "bin.v2/libs/graph_parallel/example/darwin-4.2.1/debug/dijkstra_shortest_paths" "bin.v2/libs/graph_parallel/example/darwin-4.2.1/debug/dijkstra_shortest_paths.o" "bin.v2/libs/system/build/darwin-4.2.1/debug/libboost_system.dylib" "bin.v2/libs/graph_parallel/build/darwin-4.2.1/debug/libboost_graph_parallel.dylib" "bin.v2/libs/serialization/build/darwin-4.2.1/debug/libboost_serialization.dylib" -lm -lmpi -lmpi_cxx -g ...failed darwin.link bin.v2/libs/graph_parallel/example/darwin-4.2.1/debug/dijkstra_shortest_paths... ...failed updating 2 targets...

2 1

Re: [Boost-users] [parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi Jeremiah, I can confirm that ParallelBGL that comes with 1.53 compiles. The problem with this one is that when I try to compile the example (again from 1.53) I get this problem: /usr/local/include/boost/graph/distributed/mpi_process_group.hpp:419:28: No viable conversion from 'shared_ptr<boost::graph::distributed::mpi_process_group::impl>' to 'bool' 1) Any ideas? 2) Any location that I can find more examples of the Parallel BGL? Best, Tasos

3 3

Re: [Boost-users] [parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi, I used the BFS example from "lib/graph_parallel/example/" Maybe Im not linking the right files? Thanks, Tasos

2 1

MSVC Visualizer for Fusion Vectors
by Rodrigo Madera 25 Feb '13

25 Feb '13

Are there any plans (or actual implementations) for Visual Studio debug visualizers for Fusion Vectors? Thank you, Rodrigo

2 2

Re: [Boost-users] Boost-users Digest, Vol 3370, Issue 2
by Brammert Ottens 25 Feb '13

25 Feb '13

> Brammert Ottens > > Hi, > > I've had a closer look and I was too quick in dismissing your solution. however, the on_label_popped(cur_label) gets a const reference to the label. I've used a const_cast to remove the const (see code below), but now the code crashes when cleaning up the labels using deallocate. Any ideas on what could be wrong? > > template<class Label, class Graph> > void QRCSPPVisitor::on_label_popped( const Label& label, const Graph& graph ) > { > RCSPPVisitorData().IncrementLabelsPopped(); > > if ( TimedOut() || GetMillis(StartTime()) > MaxMillis() ) > { > this->SetTimedOut(); > const_cast<Label&>(label).b_is_dominated = true; > } > } I think you can just change the parameter declaration to be a non-const reference. Can you please check where the crash occurs and whatever information you can get about the cause? Thanks. -- Jeremiah Willcock Hi, The crash occurs in the final loop, where you are going over vec_vertex_labels. It crashes when calling l_alloc.deallocate( (*csi).get(), 1 );. We use the standard std::allocator. Unfortunately the code has been encapsulated into a much larger project, and the only information that I have is what windows gives me: Problem Event Name: APPCRASH Application Name: QServer_D64.exe Application Version: 2013.6.6145.0 Application Timestamp: 512b792f Fault Module Name: KERNELBASE.dll Fault Module Version: 6.1.7601.18015 Fault Module Timestamp: 50b8479b Exception Code: 40010006 Exception Offset: 0000000000009e5d OS Version: 6.1.7601.2.1.0.256.1 Locale ID: 1043 Additional Information 1: 02d5 Additional Information 2: 02d5a24c112729571ddd0daf5f60defb Additional Information 3: 563e Additional Information 4: 563e19c789cadcf1ddb48080eecb0875 Removing the const from Label doesn't help, the code still crashes. So if you can put a visitor that allows to jump out of the loop prematurely that would be immensely helpful! Thanks already for the quick help. Brammert

1 0

Re: [Boost-users] Boost-users Digest, Vol 3369, Issue 2
by John M. Dlugosz 25 Feb '13

25 Feb '13

On 2/24/2013 12:44 PM, boost-users-request-at-lists.boost.org |Boost/Allow to home| wrote: > Are you implying this of Boost libraries in general ? If so I beg to > differ. Boost libraries cover more than .Net libraries do in the realm > of general purpose programming. The .Net API very nicely covers APIs > specific to Windows programming and some general purpose APIs, but not > nearly so much as Boost does of the latter. > > I do not mean to start an opinion war but I think your reply above gives > the OP the wrong idea about the strengths of Boost libraries, especially > as he is new to Boost. And yes I have programmed in .Net ( both C# and > C++/CLI ) pretty extensively. <http://channel9.msdn.com/Events/GoingNative/GoingNative-2012/Interactive-Pa…> at about 30 Minutes, “no large libraries [for C++]” <http://channel9.msdn.com/Events/GoingNative/GoingNative-2012/C-11-VC-11-and…> Thesis starts at 1:15, lasts till nearly the end. Now I would agree that his counting picks up a lot of "bloat" from API wrappers, but he does mention more specific examples of libraries that are needed for standard C++. Could you elaborate on your remarks, using this as a starting point of where we are coming from? —John

1 0

[parallel graph] error building parallel BGL
by The Maschine 25 Feb '13

25 Feb '13

Hi all, My boost.mpi test seems ok: ####################### ➜ Temp mpic++ -I/usr/local/include/boost/mpi/ mpitest2.cc - L/usr/local/lib/ -lboost_mpi-mt -lboost_serialization-mt ➜ Temp ./a.out I am process 0 of 1. ➜ Temp mpirun -n 6 ./a.out I am process 1 of 6. I am process 4 of 6. I am process 0 of 6. I am process 3 of 6. I am process 5 of 6. I am process 2 of 6. ###################### But when I try to build parallelBGL I get the following error: ###################### ➜ parallelBGL-Mac cmake ../parallelBGL/ -- The C compiler identification is Clang 4.2.0 -- The CXX compiler identification is Clang 4.2.0 -- Check for working C compiler: /usr/bin/cc -- Check for working C compiler: /usr/bin/cc -- works -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Check for working CXX compiler: /usr/bin/c++ -- Check for working CXX compiler: /usr/bin/c++ -- works -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Boost version: 1.53.0 -- Found the following Boost libraries: -- mpi -- serialization -- filesystem -- system -- thread -- Configuring done -- Generating done -- Build files have been written to: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL-Mac ➜ parallelBGL-Mac make Scanning dependencies of target boost_graph_mpi [ 2%] Building CXX object libs/graph_parallel/src/CMakeFiles/boost_graph_mpi.dir/mpi_process_group.cpp.o Linking CXX static library ../../../lib/libboost_graph_mpi.a [ 5%] Built target boost_graph_mpi Scanning dependencies of target adjlist_build_test [ 8%] Building CXX object libs/graph_parallel/test/CMakeFiles/adjlist_build_test.dir/adjlist_build_test.cpp.o In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:51: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/named_graph.hpp:345:12: warning: reference 'self' is not yet bound to a value when used here [-Wuninitialized] : self(self), name(other.name), committed(other.committed) ^ In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:3961: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:97:27: error: no viable conversion from 'boost::filesystem::path' to 'std::string' (aka 'basic_string<char>') std::string process_name = i->path().filename(); ^ ~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/4.2.1/bits/basic_string.h:434:7: note: candidate constructor not viable: no known conversion from 'boost::filesystem::path' to 'const std::basic_string<char> &' for 1st argument basic_string(const basic_string& __str); ^ /usr/include/c++/4.2.1/bits/basic_string.h:469:7: note: candidate constructor not viable: no known conversion from 'boost::filesystem::path' to 'const char *' for 1st argument basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); ^ In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:3961: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:841:37: error: no type named 'retag_property_list' in namespace 'boost::detail' typedef typename boost::detail::retag_property_list< ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:841:56: error: expected unqualified-id typedef typename boost::detail::retag_property_list< ^ /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:876:25: error: unknown type name 'edge_property_type'; did you mean 'edge_property_tag'? , static_cast<edge_property_type const&>(get(edge_all_t(), g, e)) ^~~~~~~~~~~~~~~~~~ edge_property_tag /usr/local/include/boost/graph/properties.hpp:69:10: note: 'edge_property_tag' declared here struct edge_property_tag { }; ^ In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/libs/graph_parallel/test/adjlist_build_test.cpp:10: In file included from /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjacency_list.hpp:3961: /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:955:37: error: no type named 'retag_property_list' in namespace 'boost::detail' typedef typename boost::detail::retag_property_list< ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /Users/varoudis/Dropbox/Projects/Libraries/parallelBGL/boost/graph/distributed/adjlist/serialization.hpp:955:56: error: expected unqualified-id typedef typename boost::detail::retag_property_list< ^ 1 warning and 6 errors generated. make[2]: *** [libs/graph_parallel/test/CMakeFiles/adjlist_build_test.dir/adjlist_build_test.cpp.o] Error 1 make[1]: *** [libs/graph_parallel/test/CMakeFiles/adjlist_build_test.dir/all] Error 2 make: *** [all] Error 2 ########################## Best, Tasos

2 1

Re: [Boost-users] time out for r_c_shortest_paths
by Brammert Ottens 25 Feb '13

25 Feb '13

> Hi, > > I want to be able to put a time out on the r_c_shortest_paths, and still > be able to get the optimal paths that have been found so far. Currently, > I changed the REF such that it always returns false as soon as the time > out has reach, in effect emptying the unprocessed_labels queue. The > problem with this is that the algorithm still needs quite some time to > actually empty the queue. > > I tried to have the on_label_popped(cur_label) throw an exception when > the timeout has been reached. The timeout itself works like a charm, but > because the pareto_optimal_solutions container is only filled after the > while loop I can't access the already found optimal solutions. You might want to have on_label_popped(l, g) take l by reference and set l.b_is_dominated to true. You'll still need to empty the queue, but (if that approach works) it should be faster that way. -- Jeremiah Willcock Hi Jeremiah, Thanks for your suggestion, but if I understand correctly it would mean a change to the code. I do not want to change the code, because if ever there is an update to boost I just want to be able to replace the old libraries with the new ones. If I would change the code, I would keep the exception and put a try/catch statement around the while-loop. Then you go around the problem of having to empty the queue. Is there any change to get something like a graceful timeout supported in the boost graph algorithms? Brammert Ottens Hi, I've had a closer look and I was too quick in dismissing your solution. however, the on_label_popped(cur_label) gets a const reference to the label. I've used a const_cast to remove the const (see code below), but now the code crashes when cleaning up the labels using deallocate. Any ideas on what could be wrong? template<class Label, class Graph> void QRCSPPVisitor::on_label_popped( const Label& label, const Graph& graph ) { RCSPPVisitorData().IncrementLabelsPopped(); if ( TimedOut() || GetMillis(StartTime()) > MaxMillis() ) { this->SetTimedOut(); const_cast<Label&>(label).b_is_dominated = true; } } regards, Brammert Ottens

2 1

Re: [Boost-users] time out for r_c_shortest_paths
by Brammert Ottens 25 Feb '13

25 Feb '13

On Thu, 21 Feb 2013, Brammert Ottens wrote: > Hi, > > I want to be able to put a time out on the r_c_shortest_paths, and still > be able to get the optimal paths that have been found so far. Currently, > I changed the REF such that it always returns false as soon as the time > out has reach, in effect emptying the unprocessed_labels queue. The > problem with this is that the algorithm still needs quite some time to > actually empty the queue. > > I tried to have the on_label_popped(cur_label) throw an exception when > the timeout has been reached. The timeout itself works like a charm, but > because the pareto_optimal_solutions container is only filled after the > while loop I can't access the already found optimal solutions. You might want to have on_label_popped(l, g) take l by reference and set l.b_is_dominated to true. You'll still need to empty the queue, but (if that approach works) it should be faster that way. -- Jeremiah Willcock Hi Jeremiah, Thanks for your suggestion, but if I understand correctly it would mean a change to the code. I do not want to change the code, because if ever there is an update to boost I just want to be able to replace the old libraries with the new ones. If I would change the code, I would keep the exception and put a try/catch statement around the while-loop. Then you go around the problem of having to empty the queue. Is there any change to get something like a graceful timeout supported in the boost graph algorithms? Brammert Ottens

2 1

Boost.Geometry: please help; using buffer() extensions
by John Lilley 25 Feb '13

25 Feb '13

Something of a repost, but I've learned a bit more on the path to being truly confused. It appears that boost\geometry\extensions\algorithms\buffer\buffer_inserter.hpp contains some specializations for buffering other shape types? But I'm out of my depth here... is there an example? What do I need to do in order to buffer: a point? A linestring? A vector of polygons? A heterogeneous collections of shapes? Is this generalization of buffer also going to work as a "deflate" for polygons? If someone can tell me "include these headers, use these algorithms", it will help a lot! Thanks John

2 1

[Fusion] Associate arbitrary compile/runtime annotations with members of fusion sequence
by Kozlov Taras 25 Feb '13

25 Feb '13

Started to use Boost.Fusion in my project I quick realized that it would be very convenient if fusion adapt macroses like BOOST_FUSION_DEFINE_STRUCT would give ability to associate additional information with members. Second problem is that BOOST_FUSION_DEFINE_STRUCT and such doesn`t support inheritance. So I did a small utility library that allow to define fusion sequences with arbitrary list of annotations associated with each member, and want to share it with community :) http://tarasko.github.com/cppan/ Will appreciate for any comments

3 6

[MSM] How to access event-attributes through a "kleene"-event?
by Deniz Bahadir 24 Feb '13

24 Feb '13

Hello everyone, I am trying to use Boost.MSM with the eUML front-end and I must say: That is a pretty cool thing! :-) However, I stumbled across some points that raised several questions, which I hoped someone of you could answer. One of these points is the usage of the "kleene" event (with eUML). The questions that came to mind are the following: 1. Is there a way to access an attribute of an (original) event if the transition-table uses the "kleene" event? 2. If there is a way, can I access it directly from the guard or actions-list in the transition-table? 3. If there is not a way, is it planned to be implemented (if possible) and when? For better understanding I insert here a simple example which explains what I am trying to do: In my special case, all my events have an attribute "EventNo" which is a unique number for each event(-type). Now, I need a transition for the events with "EventNo" greater than a special number (e.g. 7). So I thought, I could do something like this: // The attribute: BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, EventNo) BOOST_MSM_EUML_ATTRIBUTES((attributes_ << EventNo), EventNoAttr) // All events that contain this attribute: BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(event1, EventNoAttr) BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(event2, EventNoAttr) /* ... */ BOOST_MSM_EUML_EVENT_WITH_ATTRIBUTES(eventN, EventNoAttr) // Entry-action of FSM which initializes these event-numbers: BOOST_MSM_EUML_ACTION(init_all_events) { template <class Evt, class Fsm, class State> void operator()(Evt const&, Fsm&, State&) { event1.get_attribute(EventNo) = 1; event2.get_attribute(EventNo) = 2; /* ... */ eventN.get_attribute(EventNo) = N; }; } // Some states: BOOST_MSM_EUML_STATE((), State1) BOOST_MSM_EUML_STATE((), State2) // The transition table which contains all the logic: BOOST_MSM_EUML_TRANSITION_TABLE(( State1 + kleene [event_(EventNo) > Int_<7>()] // <-- Not working! == State2, State1 + event1 == State3 /* event2 to event7 are ignored! */ ), stt) // The FSM front-end and back-end: BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( stt, init_ << init_all_events ), FsmFrontend; typedef msm::back::state_machine<FsmFrontend> Fsm; However, the expression "event_(EventNo)" in the transition-guard fails to compile with the following error: error: no match for call to ‘(boost::msm::front::euml::GetEvent_<EventNo_>) (const boost::msm::front::euml::kleene_&, boost::msm::back::state_machine< boost::msm::front::euml::func_state_machine<FsmFrontendtag, ...’ I read in the documentation of the Functor front-end that I should use boost::any::type() to access the original event in transition actions, but I do not really know how to go on with it. I am also not sure if this applies to the eUML front-end at all (especially in the transition-guard). I hope someone can help me and answer these questions!? Thanks in advance, Deniz Bahadir

2 6

[asio] Adding methods directly to the IO_Service for it to call.
by Ryan 24 Feb '13

24 Feb '13

Boost Community, I've created a basic class that wrapped the boost asio framework receive/send functionality. My wrapper class gave the packet buffer to whatever processing function that it was created with and when the function was done sent any buffers it was given. This let me create classes that processed data without any knowledge of the transport layer. This concept has worked well since the asio sockets have an async_receive and async_send. I was able to setup all of my classes and then call io_service.run() to get everything going. I now have to receive data from a customer dll and they only support polling. Is there a way to add to the io_service a specific method to call once the io_service is running. I've included the ReceiveProcessSend.hpp with a comment above the two async_receive calls I need to replace. Also, below is a very basic example of how I setup classes that I pass into the ReceiveProcessSend. Any help on how to add calling methods to the io_service would be really appreciated. Ryan class DoSomeProcessing { private: typedef std::vector<unsigned char> t_ucvector; typedef boost::shared_ptr<t_ucvector> t_boostVector; typedef std::list<t_boostVector> t_boostList; public: t_boostList const processMessage(t_boostVector message, t_ucvector::size_type messageSize) { t_boostList outputList; //Do processing here and create output buffer. return outputList; } }; int main(int argc, char * argv[]) { DoSomeProcessing myProcess; ReceiveProcessSend::Arguments myArguments; boost::asio::io_service io_service; ReceiveProcessSend rps( io_service, boost::bind(&DoSomeProcessing::processMessage, &myProcess, _1, _2), myArguments); io_service.run(); return 0; }

1 0

Comparing two mpl::vector types
by Rodrigo Madera 23 Feb '13

23 Feb '13

Hello all, Can anyone give me a hint on how to call a functor on the differences of two same size mpl::vector types? For example, given: typedef boost::mpl::vector<int, char, short, double> v0_type; typedef boost::mpl::vector<int, int, short, std::string> v1_type; We can see that the second and third elements don't match, so I wish to call a functor twice, with the following signature: struct SomeFunctor { template <typename T, typename U> void operator()(T t, U u) const { // do something nice here } }; In this example, functor would be called twice: once with [T=char, U=int] and another with [T=short, U=std::string], along with their values. Thanks for any light, Rodrigo

2 2

Geometry buffer algorithm: complete or not?
by John Lilley 22 Feb '13

22 Feb '13

I was looking here: http://www.boost.org/doc/libs/1_52_0/libs/geometry/doc/html/geometry/refere… And saw this: "The current implemetation only enlarges a box, which is not defined by OGC. A next version of the library will contain a more complete implementation" It looks like Boost::Geometry is incapable of buffering an arbitrary polygon. But various forum discussions refer to the buffer() algorithm like it actually works for the general case. Which is correct? John Lilley

2 8

Building / installing only the geometry library
by John Lilley 22 Feb '13

22 Feb '13

Is there a recommended approach to building/installing only the geometry library and its required headers? I understand that geometry is header-only, so I don't really need the libraries at all, but the build process that I am seeing to move the headers to the target folder builds them anyway. I am trying to get a minimal checkin to our version control that contains only those headers needed for geometry. Thanks, john

2 2

[LockFree] a queue of std::shared_ptr?
by Scott Smedley 22 Feb '13

22 Feb '13

Hi all, Is it possible to store std::shared_ptr objects in a boost::lockfree::queue? eg. boost::lockfree::queue<std::shared_ptr<Message>> q; gcc 4.7.2 with Boost 1.53.0 is giving a static assertion failure. It wants: boost::has_trivial_destructor<T>::value and boost::has_trivial_assign<T>::value Any help would be muchly appreciated. Scott.

4 4

scope_lock question
by Jeff Dunlap 22 Feb '13

22 Feb '13

I plan to start using Boost Thread, but for now I have a multithreaded Win32 application that does not use boost. Although the threads were not created with Boost Thread, can I use boost::mutex::scoped_lock to protect some new functions I write for the app? Example: boost::mutex mutex; void whatever() { boost::mutex::scoped_lock lock(mutex); // will this be protected even though the // thread was not created using Boost? } Thank you

3 2

[Building] Weird crash on windows while trying to build boost
by Alessandro Stamatto 21 Feb '13

21 Feb '13

Hi, I'm trying to build Boost on windows 7, I'm using rubenv mingw+gcc-4.8 (from here: http://sourceforge.net/projects/mingw-w64/files/Toolchains%20targetting%20W… ). I tried the usual way: "bootstrap gcc" and ".\b2". But at the beginning of the building process a weird crash happens with a windows message dialog of "Keyboard History Utility has stopped working". It happens even with the suppressing option ('-d0'). In the process list I see that this Keyboard Utility is called "doskey.exe". What is happening? Is it possible to build boost with gcc-4.8 on windows? Thanks for your attention, Alessandro Stamatto.

1 0

New gil::io has been added
by Christian Henning 21 Feb '13

21 Feb '13

Hi all, I have successfully replaced the old gil::io extension with the new gil::io. The new io has been developed on and off over the last few years and I believe it's a great improvement over the old one. Before going into details I like thank everyone that has been helping me out along the way. I have learned a lot of things and I'm very grateful for the experience! There are numerous improvements and perhaps it's best to study the documentation before using it. Here are some noteworthy points that come to my mind: * updating code that uses the old version only requires to change the header from "boost/extension/io/jpeg_io.hpp" to "boost/extension/io/jpeg/jpeg_io_old.hpp" * new formats: bmp, pnm, raw, targa * read numerous meta information from images. See boost/gil/extension/io/png_tags.hpp for example. * use all sorts of file metaphers or file names, like FILE*, ifstream, stringstream, wstring, filesystem::path, etc * in-memory images are supported * read large images with a scanline_read_iterator * have access to the file format backend * etc. There are some items left for which I need help from the boost maintainers. * How do I hook up the gil::io documentation so it's build when all boost documentation is build? * Same for the test suite. * Should I update boost_release? Or should the new extension "simmer" for a while? Again thanks for everything, Christian

2 1

time out for r_c_shortest_paths
by Brammert Ottens 21 Feb '13

21 Feb '13

Hi, I want to be able to put a time out on the r_c_shortest_paths, and still be able to get the optimal paths that have been found so far. Currently, I changed the REF such that it always returns false as soon as the time out has reach, in effect emptying the unprocessed_labels queue. The problem with this is that the algorithm still needs quite some time to actually empty the queue. I tried to have the on_label_popped(cur_label) throw an exception when the timeout has been reached. The timeout itself works like a charm, but because the pareto_optimal_solutions container is only filled after the while loop I can't access the already found optimal solutions. Does anybody have an idea on how to do this in a better way, without having to request an addition to the boost API? Regards, Brammert

2 1