July 2010 - Boost - lists.preview.boost.org

[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

preprocessor library
by Wolf Lammen 19 Jul '10

19 Jul '10

Hi, Within the last two weeks, I submitted two patches to boosts ticket system, one correcting a bug in the preprocessor library, one slightly extending a macro improving symmetry when converting list types. I spotted more dubious code in the library, for example, I could easily remove hundreds of lines of dead code from preprocesser/seq/fold_left.hpp, and simplify BOOST_PP_SEQ_FOLD_LEFT saving between 15% and 90% of its execution costs (measured in macro replacements), depending on the input. When submitting the patches I followed the instructions on the bug reporting page of boosts web site. There has been no reaction so far. Did I get something wrong? Would like to learn how patches like these are going to be handled. with kind regards Wolf Lammen -- GMX DSL: Internet-, Telefon- und Handy-Flat ab 19,99 EUR/mtl. Bis zu 150 EUR Startguthaben inklusive! http://portal.gmx.net/de/go/dsl

2 1

[mpl] Request for permission to merge a minor change to release
by Daniel Walker 19 Jul '10

19 Jul '10

Hi all, I just noticed a missing include in boost/mpl/has_xxx.hpp and committed a fix to trunk. https://svn.boost.org/trac/boost/changeset/64144 May I please merge this changeset to release? Daniel Walker

2 1

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 18 Jul '10

18 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2975, Issue 2 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

3 2

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

17 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. please find the sample code to reproduces the problem and execution output in attachment to . a part of the execution output : leaving: Stopped entering: Playing entering: Playing::PseudoEntry1 leaving: Playing::PseudoEntry1 entering: test1Sm::initial leaving: test1Sm::initial entering: test1Sm::TestPseudoExit1 no transition from state 1 on event struct `anonymous namespace'::finish Is it a bug or I'm doing something wrong ?. Br. Richie

1 0

Help with patch
by Christian Henning 17 Jul '10

17 Jul '10

Hi there, this is probably offtopic but I need some help with applying a patch for boost::gil. First of all, I don't have much experience with patch and I need to change that. I read some tutorials online on how to patch with subversion and it seems pretty straightforward. I did some little testing myself and everything works as expected. Nice tool, I like it! Now, my first real life try with patch and I'm running into a problem immediately. I get this error with subversion: --------------------------- TortoiseMerge --------------------------- The patch seems outdated! The file line TIFF *_tp; and the patchline TIFF *_tp; do not match! --------------------------- OK --------------------------- The patch file was send to boost mailing list and maybe some lines got shifted by a whitespace but I cannot really tell. I uploaded that patch file here: http://code.google.com/p/gil-contributions/source/browse/trunk/gil_fix/tiff… Could someone tell me what's wrong with that patch file and how to fix it? Thanks, Christian

2 4

[range] permission to merge
by Neil Groves 17 Jul '10

17 Jul '10

Please may I merge changes to Boost.Range to add overloads to various Range functions to better support the use with temporary results? These changes have been tested on the trunk over the last three days without issue. Regards, Neil Groves

3 2

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 17 Jul '10

17 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2975, Issue 1 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

Bug in boost graph library
by Arne Schwabe 17 Jul '10

17 Jul '10

Hello, first I do not if this is the right list. I new to the boost mailling lists. I found a bug in the edge_range function of adjancency list. I condensed a short example. When compiled with MSVC 9 and Debug settings I get a debug assertion, "sequence not ordered". From my understanding the edge_range function needs the stored edge list to be sorted for the std::equal_range function. If I inspect "c" with the debugger the edges are not sorted but in the same order as they were added to the graph. Arne P.S.: If this not the right place for reporting bugs can you point to the right bug tracker/etc?

3 5

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 16 Jul '10

16 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2974, Issue 3 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0