- Boost - lists.boost.org

[chrono] Motivation for Boost version evaporating
by Beman Dawes 13 May '09

13 May '09

The motivation for a Boost version of <chrono> seems to be evaporating since GCC 4.4.0 has shipped with an implementation and Microsoft has also signaled they intend to ship a C++0x standard library implementation sooner rather than later. Thus I'm no longer interested in working on a Boost version. If anyone else would like to take it on, that's OK with me, but I don't see enough benefit to Boost to make the effort worthwhile. --Beman

3 4

Re: [boost] Boost Bug Sprint Proposal
by Beman Dawes 13 May '09

13 May '09

On Tue, May 12, 2009 at 11:08 PM, Marshall Clow <marshall(a)idio.com> wrote: > A few weeks ago, Doug proposed a "Boost Bug Sprint", modeled on the Debian > one; to clean up the backlog of bugs, patches and feature request that have > grown in the Trac system. > > We currently have about 800 open issues. > > I am proposing that we start on Friday, May 29th and finish on Sunday, June > 7th. > That gives us a work week and two weekends, making time for both people who > can work during the week, and those who only have time to contribute to > boost on the weekends. Great idea! Those dates look good and I've added them to the Boost calendar. --Beman

1 0

Re: [boost] Boost Bug Sprint Proposal
by Daniel James 13 May '09

13 May '09

2009/5/13 Marshall Clow <marshall(a)idio.com>: >> What can you do? >> >> 1) You can fix bugs. >> * If you are a library author, you can commit changes. >> * If you are not a library author, you can fix a problem on your local >> machine (and test it!!), and then attach your fix as a patch to the Trac >> ticket for the library author to commit. If you do this, please provide a >> test case that exercises the problem; i.e, one that fails w/o your patch, >> and succeeds afterwards. I think library authors should also try to be more readily available for that week, maybe on IRC or by subscribing to the bug list. Daniel

1 0

[property_tree] streaming operators
by Chris Meyer 13 May '09

13 May '09

More on property_tree: It would be nice if the default translator did not use the << and >> operators by default. In my software, I use << to stream a debugging description of an object -- so it is useless for archiving purposes. Instead, the detail::translator could define and use template <class Ch, class T> inline void writeToStream(std::basic_ostream<Ch> &os, const T &value) { os << value; } template <class Ch, class T> inline void readFromStream(std::basic_istream<Ch> &is, T &value) { is >> value; } Then clients of the library would have more flexibility in implementing the streaming operations by providing specializations of these functions. (These functions would be used in place of the stream >> and << calls in detail::extractor::operator() and it's specializations). Is this list the right place for these requests or is there a better place to put them so that they get tracked?

2 1

property_tree iterators
by Chris Meyer 13 May '09

13 May '09

I've been using property_tree and it is very useful to me. It's easy to add typed data to the tree using something like MyType myvar[10]; for (i=0; i<10; ++i) pt.put(key, myvar[i], true); I can also implement my own translator to convert MyType to a string suitable for serializing to XML, JSON, or whatever. However, if I go to retrieve this data, things are less refined. Iterating over all elements with a given key requires something like this: ptree::key_compare comp; BOOST_FOREACH(ptree::value_type &v, pt) { if (!comp(v.first, key) && !comp(key, v.first)) { MyType myvar = convertStringToMyType(v.second.data()); doSomething(myvar); } } Perhaps there should be a templatized member function which uses the translator to automatically iterate all values of a particular key and have it converted to the desired data type. Then I could use something like: BOOST_FOREACH(MyType myvar, pt.get_all<MyType>(key)) { doSomething(myvar); } Is this possible? Or is there something I'm missing from the existing API that allows me to do this?

2 1

Boost Bug Sprint Proposal
by Marshall Clow 13 May '09

13 May '09

A few weeks ago, Doug proposed a "Boost Bug Sprint", modeled on the Debian one; to clean up the backlog of bugs, patches and feature request that have grown in the Trac system. We currently have about 800 open issues. I am proposing that we start on Friday, May 29th and finish on Sunday, June 7th. That gives us a work week and two weekends, making time for both people who can work during the week, and those who only have time to contribute to boost on the weekends. I am putting this out for comments: --- Proposal --- >What can you do? > >1) You can fix bugs. >* If you are a library author, you can commit changes. >* If you are not a library author, you can fix a problem on your >local machine (and test it!!), and then attach your fix as a patch >to the Trac ticket for the library author to commit. If you do this, >please provide a test case that exercises the problem; i.e, one that >fails w/o your patch, and succeeds afterwards. > >2) You can characterize bugs. >* You can attempt to replicate the bug on your system(s), and attach >information that you discover to the Trac ticket. This will make it >easier for other people to solve the problem, even if you cannot. >* You can write test cases demonstrating the problem, and attach >them to the Trac ticket. >* You can determine if the bug still exists; sometimes they get >fixed, and the ticket never gets closed. > >3) You can test patches. >* Some of the tickets in the trac system contain patches - some are >quite old. You can install these patches on your system, and >determine if they (a) build, and (b) work. >* You can write test cases for the patches, and attach them to the ticket. > >4) You can help implement new features. >* There are a whole set of "feature requests" in the Trac system. If >you have an idea about one of these, you can add comments to the >trac system. You can attempt to implement these new features, and >attach the patch to the ticket. (Don't forget the test cases!!). > --- End Proposal --- Please let me know what you think, and I will post an updated version. -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

2 1

Boost Libraries under development: Bitfields
by vicente.botet 13 May '09

13 May '09

Hi, I have adapted the Bitfield library from Emile Cormier with its permision. Boost.Bitfield consists of: a.. a generic bitfield traits class providing generic getter and setter methods. b.. a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. struct X { typedef boost::ubig_32 storage_type; storage_type d0; typedef unsigned int value_type; BOOST_BITFIELD_DCL(storage_type, d0, unsigned int, d00, 0, 10); BOOST_BITFIELD_DCL(storage_type, d0, unsigned int, d01, 11, 31); }; The library is quite stable but I want to add some test with Boost.Endian before adding it to the formal review schedule list. Here is the link from which you can get the library code + documentation + test https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Bitf… I'd appreciate if people could take a look, test it on their compiler and give me some feedback. Thanks for all, _____________________ Vicente Juan Botet Escribá

2 2

[1.40.0] OK to build release?
by Beman Dawes 13 May '09

13 May '09

There has been little feedback on the 1.40.0 beta release. I'm hoping that is a good sign:-) Unless someone objects, I'll start building the actual release in an hour or so. --Beman

9 28

Boost Install Target
by Esben Stien 13 May '09

13 May '09

I guessed that I had to run bjam install and it worked, but this was not mentioned in the manual, getting started guide. -- Esben Stien is b0ef@e s a http://www. s t n m irc://irc. b - i . e/%23contact sip:b0ef@ e e jid:b0ef@ n n

2 1

[sorting] Implementation of histogram sort
by Jeremiah Willcock 12 May '09

12 May '09

Does the proposed Boost sorting library contain an implementation of histogram sort or some other in-place variant of bucket sort (American flag sort, etc)? I would like to use an integer sort for a problem I have but need to save as much memory as possible. Having one element of temporary storage per bucket is fine, though. -- Jeremiah Willcock

3 2