September 2008 - Boost - lists.preview.boost.org

Re: [boost] Is self assignment test valid?
by David Abrahams 11 Sep '08

11 Sep '08

on Mon Sep 08 2008, "Niels Dekker - no return address" <noreply-AT-this.is.invalid> wrote: > Andrei Alexandrescu wrote: >> JoshuaMaurice (at) gm...com wrote: >>> As an aside, the way I've generally done it is as follows, which >>> I assume to be equivalent to the two previous examples. >>> >>> struct T >>> { >>> T& operator= (T const& x) >>> { >>> T(x).swap(*this); >>> return *this; >>> } >>> void swap(T& x); >>> }; >> >> That's the politically correct version. It turns out that, when a >> function needs to make a copy of its argument, it better takes it by >> value in the first place. That way, if an rvalue is passed in, the >> compiler can directly fuse the rvalue to the parameter thus saving a >> copy. > > Do you think this is still relevant when operator= is inline, and it's just > doing "T(x).swap(*this)"? Absolutely. The compiler is allowed to elide the implicit copy when the argument is an rvalue if the corresponding parameter is taken by-value. However, when you write T(x) and x is an lvalue (as it is inside the operator= above), the compiler is required to honor your explicit instruction to make a copy of x. > If so, I might consider submitting another ticket regarding > boost::function, which still copy-assigns in the "politically correct" > way at the moment. As so many of us do :-) Could you do that for all the other libraries too? I'm serious, I've been meaning to make a sweep across the source code to fix this. >> See http://www.erdani.org/publications/cuj-02-2003.html > > Thanks! Looking a the example of passing the result of MakeUrl() to the > function Connect(const String& url), you wrote: "For a compiler to optimize > away the copy, it has to do the Herculean job of (1) getting access to > Connect's definition (hard with separately compiled modules), (2) parse > Connect's definition to develop an understanding of it, and (3) alter > Connect's behavior so that the temporary is fused with finalUrl." > > Now is it still such a Herculean job for a compiler to do so for an /inline/ > assignment operator that's only just swapping a temporary copy? Honestly, I > haven't done any profiling on this, so I just hope you did so already :-) Yes, it's still a fairly herculean job. The compiler would have to prove that the entire program works exactly the same way with or without the copy, proving that nothing about the address or identity of the new T is significant. While it's possible that someone might implement that optimization for some cases where T's copy constructor, swap, and destructor are all inlined, that level of understanding is not typically developed in optimizers. In the case of copy-elision for by-value arguments and return values, the compiler is explicitly allowed to _assume_ there is no semantic difference between the original rvalue and its copy. That's low-hanging fruit for a compiler writer, that pays huge dividends. -- Dave Abrahams BoostPro Computing http://www.boostpro.com

10 38

HP-UX_pa_risc_aCC test failure
by Emil Dotchevski 11 Sep '08

11 Sep '08

I'm looking at this failure: http://www.boost.org/development/tests/trunk/developer/output/HP-UX_pa_risc… The assertion is an indication that a particular function that throws an exception returned without throwing an exception. Does this platform support exception handling? If not, shouldn't BOOST_NO_EXCEPTIONS be #defined? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

5 5

Re: [boost] Improving the assignment operators of various Boosttypes
by Gevorg Voskanyan 11 Sep '08

11 Sep '08

David Abrahams wrote: > on Wed Sep 10 2008, "Scott McMurray" wrote: > > > On Wed, Sep 10, 2008 at 21:23, Joe Gottman wrote: > >> Joel Falcou wrote: > >>> > >>> I may come late and maybe like an unwanted guest in this discussion but I > >>> am curious to know how i can know that for a given class of mine, the swap > >>> value operator= is better than the by const ref operator= ? > >>> > >> > >> My rule of thumb is that if your assignment operator might throw an > >> exception and you want assignment to fulfill the strong exception safety > >> guarantee (i.e. either the assignment succeeds or the target remains > >> unchanged) then you should consider the swapping operator=. > >> > > > > I would even go slightly more expansive than that and say "Use the > > swapping operator= unless you've explicitly decided you want less > > exception safety (like for efficiency reasons in std::vector)". > > > > It means one fewer place that needs updating when members change, and > > I suspect -- though I have no supporting data -- that the optimizer > > should make the swapping version "good enough" in most cases. > > Swapping and taking the parameter by value are orthogonal issues; the > latter has only to do with copy elision and not with exception safety. > Please see this thread: > http://groups.google.com/group/comp.lang.c++.moderated/browse_frm/thread/97… AFAIU, a swapping assignment operator taking the parameter by const ref adheres to the strong exception safety guarantee, whereas the one taking the parameter by value fulfills the nothrow guarantee. Not sure how practical and/or relevant the difference in this context is, though. Is my observation above correct? Best Regards, Gevorg

2 1

[review] Dataflow Review starts today, September 1st
by jarvi＠cs.tamu.edu 11 Sep '08

11 Sep '08

The review of Stjepan Rajko's Dataflow library starts today, September 1st, and will run until September 10th. --------------------------------------------------------- Description of the library: Dataflow is a generic library for dataflow programming. Dataflow programs can typically be expressed as a graph in which vertices represent components that process data, and edges represent the flow of data between the components. As such, dataflow programs can be easily reconfigured by changing the components and/or the connections. This review focuses on the Dataflow.Signals layer of the library. For its data transport mechanism, Dataflow.Signals uses Boost.Signals which can be used to make lasting dataflow connections based on function calls. Dataflow.Signals provides the following to facilitate signals-based dataflow networks: * A number of useful general-purpose components, and building blocks for implementing new components. * Various free functions and operators for connecting and using components. The library documentation provides some concrete examples of how Dataflow.Signals layer can be used. Some examples are: * Implementing distributed dataflow applications using Dataflow.Signals and Boost.Asio * An image processing network using Dataflow.Signals and Boost.GIL * A GUI dataflow editor (located in the Dataflow.Blueprint documentation) While the Dataflow library contains other layers, only the Dataflow.Signals layer is ready for review. Reviewers are welcome to provide feedback for any part of the library, but please be aware that the documentation and implementation for the other layers may be lacking (for example, there is the generic support layer, which provides concepts applicable to different dataflow frameworks, and can be used to develop generic dataflow code, as well as the Dataflow.Blueprint layer which provides run-time reflection and modeling of dataflow networks in a Boost Graph Library graph for any dataflow framework with implemented Dataflow library support). For the time being, please consider these other layers as implementation details or proof-of-concept examples, as appropriate. The library is accessible as a tarball at: http://www.boostpro.com/vault/index.php?&directory=Dataflow The documentation can be accessed here: http://www.dancinghacker.com/code/dataflow/ The documentation particular to the Dataflow.Signals layer under review: http://www.dancinghacker.com/code/dataflow/dataflow/signals.html Dataflow depends on many existing Boost libraries, such as Fusion and MPL. The Dataflow.Signals layer builds functionality over Boost.Signals. The Dataflow library has been tested using a recent version of the Boost trunk, as well as the 1.35 release. Tests and examples have been built successfuly on OS X (GCC 4.0, 4.2), Linux (GCC 4.2), and Windows (MSVC 8.0 and to some degree MinGW GCC 4.2). --------------------------------------------------------- --------------------------------------------------------- Questions you may want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? In particular, please remember to answer the following question explicitly: - Do you think the library should be accepted as a Boost library? Jaakko Järvi Review Manager

16 49

[exception] library update
by Emil Dotchevski 10 Sep '08

10 Sep '08

I've finished a major refactoring of the Exception library: 1) Thanks to Peter Dimov's boost/detail/sp_typeinfo.hpp, it now works with or without RTTI support. 2) I would like to thank Dave and Robert for complaining about the added weight to boost/throw_exception.hpp. I managed to reduce that cost to less than 400 lines total, all contained in boost/exception/exception.hpp which now does not #include anything (not even standard headers.) If there are more concerns about this issue, let's discuss them now. The latest documentation can be viewed at http://svn.boost.org/svn/boost/trunk/libs/exception/doc/boost-exception.html. Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

5 10

shared_ptr/shared_count and the cost of use counter allocation
by Hendrik Schober 10 Sep '08

10 Sep '08

Hi, I have taken the task to replace a proprietary smart pointer (a fork of an earlier 'shared_ptr' variant) used in a library used for rendering of 3D scenes by the boost's current 'shared_ptr'. The reason is that I have found a couple of syntactic problems with the proprietary smart pointer that 'shared_ptr' doesn't have. While I succeeded syntactically, in certain performance tests the proprietary smart pointer performs about 20 times better than 'shared_ptr'. It seems that this is caused by the allocation of the use counter. For the proprietary smart pointer this allocation can be tweaked by passing allocators as template arguments, while 'shared_ptr' seems not to allow this. I have yet to find out what that performance difference means for real projects, but according to those familiar with the library the reason the allocators where introduced is that there's code that very extensively creates and destroys smart pointers which suffered badly from allocation costs. Is there a way for me to tweak 'shared_ptr's performance other than by again forking into a proprietary smart pointer and introducing allocators for that one? or is there any interest in the boost community for doing this? Thanks, Schobi

8 11

[thread_pool] Dependencies between tasks
by vicente.botet 10 Sep '08

10 Sep '08

Hi, the tread_pool pattern is very useful to improve parallelism. But sometimes we need to constraint this parallelism, for example when several task are related to the same 'instance' it could be safer to sequence them. Is there a mechanism that allows to do thinks like that on the thread_pool library? Best, Vicente

4 11

boost graph: How to add existing subgraphs to the root graph and how to use boost::write_graphviz with subgraphs?
by Lisa Wilhelm 10 Sep '08

10 Sep '08

Hi, I am a newbie in using boost libraries and template programming, and I try to get familiar with the graph library at the moment. My first problem is, that I want to create subgrahps in "sub-functions" and create the whole graph out of these subgraphs in the calling function. I tried to create the subgraph in the calling function and pass it to the sub-function, but then, the new vertices were added to the root-graph and not to the subgraph. I solved this in the calling-function with adding all the new vertices and their edges again to the subgraph. Is there a better way to do that? My second problem is just as mentioned in the subject line. How to use boost::write_graphviz to print out subgraphs? It works for "normal" graphs but not for subgraphs. I hope this is the right place to ask these questions. Thanks for your answers. Lisa __________________________________________________ Do You Yahoo!? Sie sind Spam leid? Yahoo! Mail verfügt über einen herausragenden Schutz gegen Massenmails. http://mail.yahoo.com __________________________________________________ Do You Yahoo!? Sie sind Spam leid? Yahoo! Mail verfügt über einen herausragenden Schutz gegen Massenmails. http://mail.yahoo.com

1 0

Any interest in a Simple Thread Pool Library?
by Koushik Biswas 10 Sep '08

10 Sep '08

Hi, I am a new subscriber to boost mailing list, though I am a long time boost user. Recently, I needed a simple thread pool for my application, but did not find anything on Boost. I went ahead and developed my own. I believe that with some modifications to make it more generic, it will be a valuable addition to Boost. Following the guidelines specified in "Boost Library Submission Process" page, I am trying to gauge the interest. Synopsis: 1. Will be header only. User will derive from class "ThreadPoolJob" and override its DoJob() method with any action he wants the thread pool to perform. 2. User will instantiate an object of the Pool (can mention initial size), and simply call SubmitJob() with the pointer of an instance of his derived Thread Pool Job class - and the job will be get done. 3. In my current version, a job submission simply accepts the pointer to a new job class, hence the user has to wait until the job is done and then needs to clean up the memory. In the final library, I will take ownership of the memory while accepting a submitted job by using smart pointers. 4. Features: Dynamic shrinking/ expansion of the pool, ability to assign priorities to jobs, schedule future job execution, etc. are ion the roadmap - though I do not need any of these for my own application, the design is generic enough to add these features. Can somebody guide me to the next steps if approved? I could not log in to the boost vault with my mailing list user name and password. Do I need to create a new set? Thanks & Regards, Koushik Biswas Principal Technical Yahoo, Yahoo! Inc.

2 2

boost::throw_exception / exception library update
by Emil Dotchevski 09 Sep '08

09 Sep '08

This is a repost of my original message, with a better subject line as suggested by Felipe, to perhaps attract more readers for this important discussion. Here is a link to the original thread: http://www.nabble.com/-exception--library-update-tt19377623.html Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode On Mon, Sep 8, 2008 at 10:59 AM, Emil Dotchevski <emil(a)revergestudios.com> wrote: > I've finished a major refactoring of the Exception library: > > 1) Thanks to Peter Dimov's boost/detail/sp_typeinfo.hpp, it now works > with or without RTTI support. > > 2) I would like to thank Dave and Robert for complaining about the > added weight to boost/throw_exception.hpp. I managed to reduce that > cost to less than 400 lines total, all contained in > boost/exception/exception.hpp which now does not #include anything > (not even standard headers.) If there are more concerns about this > issue, let's discuss them now. > > The latest documentation can be viewed at > http://svn.boost.org/svn/boost/trunk/libs/exception/doc/boost-exception.html.

1 0