- Boost - lists.preview.boost.org

[Serialization] Query
by Alapkumar Sinha 23 Jul '10

23 Jul '10

Hi, I am trying to use the serialization library in the following scenario. 1. I create one instance of an object in one process 2. Serialize it either with binary/text archive 3. Then send it through unix local socket to another process where the process deserializes Whatever examples available, it shows just archiving like below std::ofstream ofs("filename"); // use it to build and archive boost::archive::text_oarchive oa(ofs); // write class instance being pointed to // to the archive oa << g; /************/ But after this 1. I would like to copy the archived data to a buffer 2. Send the buffer throught a socket something like boost::asio::write(socket, boost::asio::buffer( buffer, sizeof(buffer)); Can someone help on how I can get this done. One more question: does the call boost::asio::write does serialization internally? If yes, still I would need how to get the buffer as mentioned in the query above a my transmission mechanism might change. Thanks, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

[Query] __sync_val_compare_and_swap_4
by Alapkumar Sinha 23 Jul '10

23 Jul '10

Hi , I am trying to use the Boost Interposes, specifically the message queue. When Im doing cross compiling boost libraries on Cronus mips board, I am getting below error undefined reference to `__sync_val_compare_and_swap_4' Upon analysis we found that in boost/interprocess/details/atomic.hpp, was throwing this error. I found the solution. I replaced this returned statement ( __sync_val_compare_and_swap_4 ) and included assembly language code in atomic.hpp. (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp) { /* return __sync_val_compare_and_swap(const_cast<boost::uint32_t *>(mem), cmp, with);*/ boost::uint32_t result; asm volatile(".set\tpush\n\t" ".set\tnoreorder\n\t" ".set\tnomacro\n\t" "1:\n\t" "ll\t%[result],0(%[mem])\n\t" "bne\t%[result],%[with],2f\n\t" "move\t%[result],$0\n\t" // delay slot "move\t%[result],%[mem]\n\t" "sc\t%[result],0(%[mem])\n\t" "beq\t%[result],$0,1b\n\t" "nop\n\t" // delay slot "2:\n\t" ".set\tpop" : [result] "=&r" (result) : [mem] "r" (mem), [cmp] "r" (cmp), [with] "r"(with) : "memory"); return result; } After this I was able to execute the message queue program successfully on the mips platform. Can someone confirm if this is the right solution? Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

[interprocess] x86-64 bug?
by Bartosz Marcinkiewicz 23 Jul '10

23 Jul '10

Hello, I have modified a little an example doc_complex_map.cpp in order to use vector of integers which is a member (int_vector_) of structure stored as a shared map value (complex_data). Program works as expected on x86 (32bits). I get core dump on x86-64: (gdb) bt #0 0x000000000041ecfe in boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index> > >::priv_push_back (this=0x7f3435ae9260, x=@0x7fff77fe9eac) at /home/bma/opt/include/boost/interprocess/containers/container/vector.hpp:1239 #1 0x000000000041ed57 in boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index> > >::push_back (this=0x7f3435ae9260, x=@0x7fff77fe9eac) at /home/bma/opt/include/boost/interprocess/containers/container/vector.hpp:904 #2 0x0000000000401cf1 in operator() (this=0x7fff77fea0ee, x=@0x7f3435ae9218) at doc_complex_map.cpp:109 #3 0x0000000000401e8c in main () at doc_complex_map.cpp:146 Valgrind output is: [bma@dev2 example]$ vg ./doc_complex_map ==18738== Memcheck, a memory error detector. ==18738== Copyright (C) 2002-2007, and GNU GPL'd, by Julian Seward et al. ==18738== Using LibVEX rev 1804, a library for dynamic binary translation. ==18738== Copyright (C) 2004-2007, and GNU GPL'd, by OpenWorks LLP. ==18738== Using valgrind-3.3.0, a dynamic binary instrumentation framework. ==18738== Copyright (C) 2000-2007, and GNU GPL'd, by Julian Seward et al. ==18738== For more details, rerun with: -v ==18738== ==18738== Invalid write of size 4 ==18738== at 0x41ECFE: boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0l>, boost::interprocess::iset_index> > >::priv_push_back(int const&) (vector.hpp:1239) ==18738== by 0x41ED56: boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0l>, boost::interprocess::iset_index> > >::push_back(int const&) (vector.hpp:904) ==18738== by 0x401CF0: main::test_struct::operator()(complex_data&) (doc_complex_map.cpp:109) ==18738== by 0x401E8B: main (doc_complex_map.cpp:146) ==18738== Address 0x104c0f989 is not stack'd, malloc'd or (recently) free'd This is on boost 1.43. I am attaching source code. Thanks for any hints. -- Bartosz Marcinkiewicz e-mail: bma(a)epcon.pl, bartosz.marcinkiewicz(a)epcon.pl EPCON Sp. z o.o. www.epcon.pl

1 1

boost::bind result type
by David Sankel 23 Jul '10

23 Jul '10

I'm wondering if there's a way I can generically get the result type of boost bind. I'd like to write something along these lines: template< typename StreamT, typename Sink > typename boost::result_of< boost::Bind( StreamT, boost::arg<1>, Sink ) >::type apSink( StreamT t, Sink sk ) { return boost::bind( t , _1 , sk ); } I'm not interested in a boost::function solution because I require that uses apSink's result can be inlined. Any ideas? Perhaps one of these other bind-like libraries has an answer to this. Thanks, David -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

5 15

Problem in proto library
by Jorge Lodos Vigil 23 Jul '10

23 Jul '10

Hi The addition of macro BOOST_PROTO_EXTENDS_USING_ASSIGN in literal.hpp broke compilation with /clr option in MSVC. The problem is that the macro is used as BOOST_PROTO_EXTENDS_USING_ASSIGN(literal) and literal is a variable modifier for managed C++. Adding a private typedef: typedef literal<T, Domain> literal_t; and replacing the macro parameter with: BOOST_PROTO_EXTENDS_USING_ASSIGN(literal_t) solves the problem for us. Tested with VS2008. Please note that this problem prevents compilation of xpressive and any other library that uses proto with /clr. Thank you for boost and particularly for proto and xpressive :-) Best regards Jorge

2 1

[GIL] bits64
by fabien.castan＠free.fr 22 Jul '10

22 Jul '10

Hi, 64 bits pixels are interesting for accumulation buffers or internal computations. I think it could be a good thing to add these typedefs in gil. Is there any reason not to do it? Best regards, Fabien Castan

3 2

Re: [boost] [GIL] scoped_channel_value type
by fabien.castan＠free.fr 22 Jul '10

22 Jul '10

>> So if you want to extract this, you will have to special-case >> scoped_channel_value anyway. So in this case you don't need a typedef >> inside. >> You can just define a specialization like this: >> >> Template <typename ChannelValue> >> Struct base_channel_value { >> typedef ChannelValue type; >> }; >> >> Template <typename ChannelValue, typename MinV, typename MaxV> >> Struct base_channel_value<scoped_channel_value<ChannelValue, MinV, MaxV> > >> { >> typedef ChannelValue type; >> }; >> > >I really have to write that one down. I keep on forgetting this trick. Thanks ! Maybe this utility structure can be added (like channel_type, etc.) ?

1 0

[GIL] scoped_channel_value type
by fabien.castan＠free.fr 22 Jul '10

22 Jul '10

Hi, I would like to get the value type of the channels depending on an image view. So I can get the scoped channel type, from MyView type, like this: typedef typename boost::gil::channel_type<MyView>::type MyScopedChannel; But I can't get the primitive type used by the scoped channel. For example, if the type is scoped_channel_value<float,float_zero,float_one>, I can't get the float type. /// \ingroup ScopedChannelValue /// \brief A channel adaptor that modifies the range of the source channel. Models: ChannelValueConcept template <typename BaseChannelValue, // base channel (models ChannelValueConcept) typename MinVal, typename MaxVal> // classes with a static apply() function returning the minimum/maximum channel values struct scoped_channel_value { typedef BaseChannelValue base_channel_t; //< missing typedef //... } So this will allows to use: typedef typename boost::gil::channel_type<MyView>::type::base_channel_t ChannelBaseType; Are you agree to add this typedef ? Best regards, Fabien Castan

3 3

fixed size vector in boost::numeric::ublas?
by Markus Grabner 22 Jul '10

22 Jul '10

Hi all! In boost::numeric::ublas, there exist different vector variants (unbounded and bounded). All of them can be resized dynamically (up to a maximum size defined at compile time in the case of the bounded vector). Therefore the vector class (or the underlying storage array) have a size member which indicates the current size of the vector. However, it would be extremely useful to have a vector of fixed size, i.e., one which can't be resized dynamically, but has its size statically defined at compile time. Such a vector does not require a size member and only consumes N*sizeof(T) bytes of storage, where N is the (static) vector size and T the value type. Many libraries dealing with geometric data (OpenGL and OpenInventor being prominent examples) store their data in compact arrays in their native data types, e.g., the values (x0,y0,z0,x1,y1,z1,x2,y2,z2) stored in consecutive memory locations define three points in 3D space. By means of a fixed size vector, the entire boost::numeric::ublas functionality could be applied to such arrays by a simple reinterpret_cast on each element. This is not possible with the bounded or unbounded vectors since the vector must be constructed before with its size member properly initialized, and the actual vector data must therefore be copied explicitly before use. I tried to create a fixed_array class to implement this proposal (see attachment), it can be used, e.g., to create the equivalent of the OpenInventor "SbVec3f" data type as follows: typedef boost::numeric::ublas::vector<float,fixed_array<float,3> > vec3d_t; It is probably not the cleanest solution, and I skipped the serialization stuff altogether, but it demonstrates an approach how this can be done. What do you think about adding such an extension to improve boost's interoperability with other libraries? Thanks & kind regards, Markus -- Markus Grabner Institute for Computer Graphics and Vision Graz University of Technology, Inffeldgasse 16a/II, 8010 Graz, Austria WWW: http://www.icg.tugraz.at/Members/grabner

2 1

[ref] incompatibility with c++0x
by Andy Venikov 21 Jul '10

21 Jul '10

The latest c++0x FCD defines the single argument constructor for reference_wrapper(T &) as non-explicit. The boost version is explicit. Was it done on purpose? Should it be changed to non-explicit? BTW, I think original standard drafts did have it as explicit since gcc 4.3.3 still defines it as explicit. But in the final draft (as in gcc 4.5) it's non-explicit. I know that boost::reference_wrapper is not the same as std::reference_wrapper, but still it would be nice to have some uniformity. Thanks, Andy.

2 2

info about boost process
by Conoscenza Silente 21 Jul '10

21 Jul '10

Hi All Do you know whether "boost.process" will become part of the boost library at some point? I need some C++ way to start-stop processes and getting the console output produced by them and it seems that this library is doing right that. I see it in the BOOST VAULT that the development is stopped since 2008. Do you know what are the plans for it and if there is some alternative I can use in current/future boost library? Thanks AFG

2 1

[Graph] Problems customizing edge storage for adjacency_list
by Alex Betts 21 Jul '10

21 Jul '10

Hello! I can't seem to use a custom container for storing edge data when using adjacency_list (this is with gcc 4.1.0 on Linux, but it won't work for gcc 4.3.0 either). I understand that I need to create push() and erase() functions for the custom container, but the compiler never seems to see my implementations of these two functions, as it always gives an error like: boost/pending/container_traits.hpp:414: error: no matching function for call to ‘container_category(...)’ ...from the default implementation of push() defined in container_traits.hpp. I've tried moving push() and erase() in and out of the boost::graph_detail namespace, but that doesn't seem to help. I've attached the source for the program in question, & appreciate any help! thanks, -- Alex

2 2

boost graph.
by Giorgio Zoppi 21 Jul '10

21 Jul '10

Hi, I've a problem with multiple links on the same vertexes. For example we've vertex A and vertex B and we want identify two different edges that they connects to these edges, i.e. A-->B with cost 6 A-->B with cost 8 Is there any way to tag or label these links and using the dijkstra algorithm on the graph? Cheers, Giorgio. -- Quiero ser el rayo de sol que cada día te despierta para hacerte respirar y vivir en me. "Favola -Moda".

2 1

[Serialization & Archive ]
by Alapkumar Sinha 21 Jul '10

21 Jul '10

Hi, Can someone tell me what is the difference between the Archive & Serialization library and what are the scenarios in which one has to chose one over the other? Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

Is there any compile time/static rational numbers library in BOOST ?
by Reetesh Mukul 21 Jul '10

21 Jul '10

Hi, Is there any compile time/static rational numbers library in BOOST ? I can see that static GCD/LCM libraries are there, but could not find it for static rationals. Another question, is there any compile time library which calculates ceil value of division of one integer by another one ? With Regards, Reetesh Mukul

1 0

First set of Boostcon 2010 videos are available
by Marshall Clow 21 Jul '10

21 Jul '10

Almost all of the Transactional Memory sessions from Boostcon are now available, with the exception of Tatiana Shpeisman's presentation on the "Draft Specification of Transactional Language Constructs for C++". That talk should (hopefully) be available tomorrow. Here are the links Maurice Herlihy : Transactional Memory Today - Keynote: http://blip.tv/file/3900047/ Justin Gottschlich:TBoost.STM Engine: http://blip.tv/file/3900167/ Tatiana Shpeisman: Draft Specification of Transactional Language Constructs for C++: <coming soon> Michael Wong: IBM's TM Research: http://blip.tv/file/3900242/ Mark Moir: Sun's / Oracle's TM Research: http://blip.tv/file/3905166/ Tatiana Shpeisman: Intel's TM Research: http://blip.tv/file/3905189/ Hartmut - I apologize for removing your (very nice) introduction for Maurice from the video. Unfortunately, Maurice was wearing the microphone, and none of what you said could be heard. -- Marshall

5 4

[Serialization] Documentation
by Alapkumar Sinha 21 Jul '10

21 Jul '10

Hi, Can someone help me to get the pdf document for boost serialization library? I could not find the documentation in the doc folder of boost tar. The only reference I could find was " http://www.boost.org/doc/libs/1_43_0/libs/serialization/doc/index.html ". I would like to have local copy rather than access it from net every time even if it is not pdf. Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

Trouble caused by MPL's metafunction arity limit
by Stefan 21 Jul '10

21 Jul '10

Hello everyone. I'm working as a student on this year's GSoC and I have ran into a small problem while using MPL in my code. In a nutshell, I have a class template which takes 6 template parameters, and I would like to use it with some MPL algorithms. The problem is, MPL is configured by default to be capable of working with 5 template params only, so lambda expressions of my class won't work with MPL metafunctions. My code is header-only, meaning I cannot (re)define BOOST_MPL_LIMIT_METAFUNCTION_ARITY appropriately, as the MPL headers might have been included before my headers. Out of my 6 template params, 3 are optional, in case this is relevant or can be exploited in any way. Is there any workaround to my problem?

4 4

Re: [boost] New name of bjam.exe
by Tan, Tom (Shanghai) 20 Jul '10

20 Jul '10

How about calling it "baby"? >Subject: [boost] New name of bjam.exe >Message-ID: <201007201245.08070.ghost(a)cs.msu.su> >Content-Type: Text/Plain; charset="us-ascii" > >Does anybody have comments, or better suggestions? > >Thanks, >Volodya

16 19

[optional_io] Request permission to merge simple fix to optional extraction operator
by Fernando Cacciola 20 Jul '10

20 Jul '10

Hi All, It was brought to my attention that extracting an *empty* optional<> from a stream using the default provided operators (in optional_io.hpp), leaves one character behind, preventing any further extraction. This is clearly a bug so I can only guess that no one is using it (except for the user that reported it). The fix is quite trivial: https://svn.boost.org/trac/boost/changeset/64206 And I've updated the test accordingly to make sure it works. Can I marge the fix into the release branch? TIA --- Fernando Cacciola SciSoft Consulting, Founder http://www.scisoft-consulting.com

2 4

BoostCon 2010 website
by Robert Ramey 20 Jul '10

20 Jul '10

I have a couple of requests regarding the BoostCon 2010 website. First of all , This link is very interesting and important to me. Yet it's devilish difficult to find. I shouldn't be "private". http://www.boostcon.com/community/wiki/show/private/2010/ Second, could marshal's links to the video be added to the presentation materials page? Finally could the presentation materials for each presentation be linked from the program page: http://www.boostcon.com/program Robert Ramey

2 2

FW: New name of bjam.exe
by Tan, Tom (Shanghai) 20 Jul '10

20 Jul '10

Or, babe = Build Another Build Environment. It sound so simple and crisp, just as Bing and Google. -----Original Message----- From: Tan, Tom (Shanghai) Sent: Tuesday, July 20, 2010 7:17 PM To: 'boost(a)lists.boost.org' Subject: RE: [boost] New name of bjam.exe How about calling it "baby"? >Subject: [boost] New name of bjam.exe >Message-ID: <201007201245.08070.ghost(a)cs.msu.su> >Content-Type: Text/Plain; charset="us-ascii" > >Does anybody have comments, or better suggestions? > >Thanks, >Volodya

3 2

[Proto] Inlining failure on gcc 4.x on 64bits linux
by joel falcou 20 Jul '10

20 Jul '10

I'm reporting this performances problem we encountered today. We have a large expression operating on table of 51200000 elements; In 32bits mode, our proto code for NT² works perfectly and output a gprofile like: http://codepad.org/Uyyvkq4X rutniem performance sis somethign like 1.5s for the whoel computation. In 64bits on linus using gcc 4.4 or 4.3, we got a massive 8.6s of runtime (!!) and the profile is: http://codepad.org/6VgRsbyR As it seems the call to proto::default_ is not inlined (hence the 5.12M calls) and take 80% of the runtime. I don't thing anything is 32/64bits specific in proto so is it a bug in gcc ? I don't have code handy here but will do tomorrow.

3 2

Re: [boost] [msm] nested pseudo exits with same event ending up in no trans in the most outer state machine.
by Christophe Henry 20 Jul '10

20 Jul '10

Hi Richard, >Is it not allowed to use derived classes as backends ?. Actually, I don't know. I mean, I don't know of a C++ rule forbidding it, but I'm not a language lawyer. What I know is that this problem used to happen sporadically with eUML in the 2.0, but only with VC, and in this case, I see it happen also with g++ 4.4. I'd say it's a compiler bug but usually, g++ is right so I'm not sure. >I was not a ware of it. Is it mentioned in the documentation ? Probably not because I didn't see it happen any more with MSM v2.10. It used to happen with the 2.0 and only with VC and eUML. >If only composite state machines can not be derived classes of >msm:backend than this is fine because I had only one place till now >which I have changed already. We are moving inside uncharted territory. All what I can say is that it used to happen sporadically and only for eUML composites or substates. I never, in any version, saw it happen with the main fsm. Let's try to find a way around. Why do you need to use the back-end as base class? Could you elaborate? And will the need go away after I implement the previously discussed feature that you can pass to the back-end concrete substates instead of default-constructed ones? Something like what Dave suggested: player p(/* for the front-end*/ 3, "a", backend_args = ( init1=Paused("something"), init2=Playing("more data")) ); If you describe your use case, I'll try to find a solution. It'd not be the first time I find a way around compiler bugs ;-) Regards, Christophe

1 0

[msm] nested pseudo exits with same event ending up in no trans in the most outer state machine.
by Christophe Henry 19 Jul '10

19 Jul '10

>Hi All > >I have run in to the following problem : >if I have 3 state machines where 1st has a composite state which has >one more composite state than the most inner one enters to a pseudo >exit state which sends finish event. >The middle one has a transaction from the most inner pseudo exit with >even finish to a pseudo exit middle state which sends finish again. >The most outer state machine has a transition from the middle pseudo >exit with event finish to a internal state. >when the most inner pseudo state sends event finish it ends in a NO >transition on the most outer state machine instead of triggering the >transition in the middle state machine. <snip> Hi Richard, Remove these lines: //struct test1 : msm::back::state_machine< test1Sm > //{ //}; //typedef test1 Test1Player; And replace them with: typedef msm::back::state_machine< test1Sm > Test1Player; And it should work. Regards, Christophe

2 2