- Boost - lists.boost.org

Boost's on the map
by John Maddock 23 Jun '12

23 Jun '12

Literally in this case: http://softwaremaniacs.org/media/alenacpp/cppmap-2012.png John.

4 3

Re: [boost] Boost and exceptions
by Brian Wood 23 Jun '12

23 Jun '12

John Maddock: > This actually looks compelling enough to me, that we should probably mandate > use of BOOST_THROW_EXCEPTION. Are you going to take away their library card if an author doesn't want to do this? ;) Cheers, Brian Wood Ebenezer Enterprises http://webEbenezer.net <http://webebenezer.net/>

1 0

Re: [boost] Boost and exceptions
by Brian Wood 23 Jun '12

23 Jun '12

Fabio Fracassi: > That is how modular development works, you let go of some control in > exchange for synergy effects and free added functionality. > Yes, it creates communication overhead but the win (for the users) is huge. I skipped Boost 1.49 and have been updating these results using Boost 1.50 -- http://webEbenezer.net/comparison.html<http://webebenezer.net/comparison.html> . I haven't noticed any performance improvements in the serialization library that's in Boost from 1.48 to the latest version. Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net <http://webebenezer.net/>

1 0

Linked map
by Kannan R 23 Jun '12

23 Jun '12

Recently i wrote a json parser. I used stl map to store the json objects. Everything was fine except the order of the objects. Is it worth to build something in boost to have the map which provides an iterator to get the elements in same order? Please advise.

3 2

exception handling in multithreaded applications (was: RE: Boost and exceptions)
by Thomas Klimpel 22 Jun '12

22 Jun '12

Fabio Fracassi wrote: > Yes it is, because in reality boost exception solves problems for the > users of any library that uses it. When using boost exception I can > safely let exceptions escape threads and have them rethrown in the > starting thread, for instance. I would be interested to learn how you do this. With open-mp (and mpi), my current way to add exception handling code really adds much noise: bool cancel = false; #pragma omp parallel shared(cancel) { try { ... the real code } catch (std::exception& r) { cancel = true; store_exception(r); } } if (cancel) { rethrow_exception(); } Regards, Thomas

2 1

emulating concepts in C++11
by lcaminiti 22 Jun '12

22 Jun '12

Hello all, I was not able to find Boost.Generic source code (I asked Matt Calabrese but no reply): http://blip.tv/boostcon/boost-generic-concepts-without-concepts-5262126 Are you aware of any trick (e.g., the tricks used by Boost.Generic) to emulate concepts in C++11? Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-emulating-concepts-in-C-11-tp46317… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

Still a monolithic library? Or a bunch of independent ones?
by hello world 21 Jun '12

21 Jun '12

Hello, It's been a few years since I didn't come around boost.org, and I was just wondering... Is boost still a monolithic library? or Is it a collection of separate libraries now? Or to state it another way: Is it ``easy'' to take only one library's files from the boost distribution and use it. Or do I have to carry everything around even If I'm using just one library? I understand that this must be library specific, but I'm just asking this to know what your general feel overall. Thanks.

3 2

Interest in a "breadth first" algorithm?
by Gary Powell 21 Jun '12

21 Jun '12

A while ago I needed to serialize and de-serialize a std::map and I realized that the only interface was begin(), end() which of course meant that re-creating this same map was the least efficient way possible, as all the elements were added in sorted order. Because I wrote them out using begin() -> end() So I wrote a breadth first template which takes a container, a template to use as the core of a queue, a template for the allocator, the container and a function to apply to the elements. It doesn't quite do a true breadth first traversal because I don't look at the inner data structure of the map, (works with sets as well) but instead does a middle, then right, left push until it's hit all of the nodes. And it doesn't copy the elements, it pushes the iterators, and calls the function on that iterator when the length is 1. It ended up speeding up my map recreation by about 20% (because I start with a center enough node that it should never have to be rebalanced) at a cost of about 5% to write it this way (It's more expensive to create the queue, and traverse the map from center on out), for a roughly 15% gain in speed. Is there any interest this for boost? I've got working code but not any documentation. And rather than spend a huge amount of time on that I'm looking to see if anyone else has an interest in this. -Gary- -- ------------------ powellg(a)gmail.com "Come gather 'round people wherever you roam. And admit that the waters around you have grown. And accept it that soon you'll be drenched to the bone. If your time to you is worth savin'. Ahh you better start swimmin' or you'll sink like a stone. For the times they are a-changin'" Bob Dylan

4 4

Integrating CUDA nvcc into bjam
by jombi01821 21 Jun '12

21 Jun '12

I would like to know how to take an existing project that build with bjam and have it understand how to handle .cu CUDA files -- View this message in context: http://boost.2283326.n4.nabble.com/Integrating-CUDA-nvcc-into-bjam-tp463163… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[1.50] Is it too late for fixes?
by John Maddock 21 Jun '12

21 Jun '12

I have a trivial fix for 1.50 if it's not too late (missing include guards on a header), see https://svn.boost.org/trac/boost/ticket/7001 Is it too late now, suspect it is? Thanks, John.

1 0