May 2009 - Boost - lists.boost.org

Review Request: Algorithm.Sorting
by Steven Ross 15 May '09

15 May '09

I have uploaded algorithm_sorting.zip for a formal review to become Boost.Algorithm.Sorting, if people feel that is appropriate. It is 3 templated hybrid radix-based/comparison-based algorithms, specialized to sort certain types of data more efficiently. All 3 have superior worst-case and average-case performance to std::sort, based upon my testing. None of these algorithms use much additional memory. All of them can sort key + data, and as they do fewer swaps, tend to do so much faster than std::sort. As a general rule, the speedup of these algorithms relative to std::sort increases as data set size increases. These algorithms tend to be faster relative to std::sort when comparisons are slow, as they do less (or no) comparisons. string_sort, which sorts strings in O(n*length) time, as compared to O(n*length*log(n)) for pure comparison-based algorithms. It is consistently faster than std::sort in string sorting, by a little more than a factor of 2 based upon my testing. float_sort, which sorts IEEE floating-point numbers as integers, but attaining the same ordering as std::sort, with the exception of -0.0 and NaNs, both of which cannot be ordered based upon their comparison function. float_sort is roughly twice as fast as std::sort on UNIX-type OSes I've tested on, and roughly 7X as fast on Windows. I believe this speedup to be because floating-point comparisons are slow on Windows. integer_sort, which sorts integers around 60% faster than std::sort on UNIX-type OSes, and 25% faster on Windows. On Windows with MSVC, std::sort sorts already-sorted and small range data extremely quickly, and integer_sort processes already-sorted data slower than it by as much as a factor of 3X. I believe this to be due to some optimization for already-sorted data, as integer_sort takes substantially less absolute time on already-sorted data than unsorted data. So integer_sort on Windows has a tradeoff: better worst-case and average-case performance, but worse best-case performance. integer_sort and float_sort share some tuning parameters. I have set values that seem to work well on both UNIX-type and Windows OSes, but people are welcome to try to see what values are best for their system and problem type. The ideal values for integers and floats may be different on some systems (such as Windows), but for simplicity they are kept the same. A tuning/testing script named tune.pl is included, for those who wish to see how fast these algorithms are on their system (and verify correctness). I don't recommend using it for tuning without the -large option, and that takes days. If you do use it for tuning, I also recommend the -verbose option, to see what it's doing.

6 19

[exception] current_exception mishandling standard exceptions
by Adam Badura 15 May '09

15 May '09

It seems that current_exception mishandles standard exceptions. I noted two problems: 1) Some standard exceptions are not handled at all. This includes std::runtime_error and its derived (std::overflow_error, std::range_error, std::underflow_error), std::domain_error (handled by general std::logic_error), std::length_error (handled by general std::logic_error) and std::ios_base::failure (handled by general std::exception). Why is it so? 2) Non-standard exceptions derived from standard exceptions are sliced by current_exception. It detects those types by throwing and caching and thus will catch also derived types (like null_pointer : public std::invalid_argument). But during construction of internal structures the standard exception type is used and thus copy construction slices the original exception object. If typeid was used instead of throwing/catching (or dynamic_cast) to detect the type current_exception could at least detect that is will slice the original object and use a different type so it would not pretend everything is OK. Adam Badura

3 6

[property_tree] XML parser broken in 1.39.0
by Boris Schaeling 14 May '09

14 May '09

Calling boost::property_tree::xml_parser::read_xml() to parse a XML file and populate a property_tree doesn't work anymore in Boost 1.39.0 (at least not in Visual C++ 2008). The compiler error I see is: boost\iterator\iterator_adaptor.hpp(230) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] The property_tree headers include boost\spirit\home\classic\iterator\position_iterator.hpp which includes boost\iterator\iterator_adaptor.hpp. I also see this warning: Warning: This header is deprecated. Please use: boost/spirit/include/classic.hpp Warning: This header is deprecated. Please use: boost/spirit/include/classic_position_iterator.hpp It looks like as if a change in Boost.Spirit or Boost.Iterator broke the XML parser. Does Boost.PropertyTree have a maintainer who can look into this? Boris PS: As it turns out it's broken in Boost 1.38.0, too. With 1.36.0 I don't get a compile error (1.37.0 I don't have installed and can't test).

3 5

Re: [boost] [rfc] Unicode GSoC project
by Graham 14 May '09

14 May '09

> 1. The vast majority of characters (by frequency of use) are > on the BMP. > 2. For seamless integration with the majority of existing > software with good Unicode support. > >I don't find either of those claims very convincing. I hope that your >library will not try to make UTF-16 some sort of default encoding, or >otherwise give it special treatment. Phil, I think each application needs to be assessed on its own merits. For example: For data storage on mainly ASCII text I use UTF-8. For text manipulation I often use UTF-16. For a Unicode text editor I use UTF-32. There is not a one size fits all. Yours, Graham

1 0

New version of C++ Middleware Writer now on line
by Brian Wood 14 May '09

14 May '09

Shalom Version 1.9 of the C++ Middleware Writer is now available. This version adds support for Boost Array and it also has a command line interface that allows users to bypass the web interface. In other words, it makes it easy to integrate the C++ Middleware Writer into your build process. http://webEbenezer.net/build_integration.html<http://webebenezer.net/build_integration.html> -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net <http://www.webebenezer.net/>

1 0

Binary compatibility of boost releases. Is there such a thing at all?
by Alexander Churanov 14 May '09

14 May '09

Hi folks! I am working on boost port for FreeBSD. At present I am investigating into versioning of shared libraries. Historically, versions of boost shared libraries on FreeBSD do not match boost release version. Some FreeBSD folks beleive that application should not be recompiled just because the boost was updated, say from 1.37 to 1.39 and that shared library version for 1.39 may stay the same as it was for 1.37. I'm afraid it's not correct. I've read that there is no binary compatibility for boost shared libraries from different releases, and that application must use exactly the same library it was compiled for. However, these documents are of 2003-2004. Here is the question: What is the actual status of binary compatibility for boost? Alexander Churanov, maintainer of devel/boost

3 3

[future] usage question for new accepted library
by Alan Patterson 14 May '09

14 May '09

Hi, I see Anthony William's future implementation has been accepted over Braddock Gaskill's. I have been using Braddocks implementation and in particular a couple of features which I believe are not in Anthony's implementation. So I am looking for some pointers for how I might do the following with the accepted futures implementation. 1) Using the implicit cast of future<T> to T. I have an application where I can submit jobs to a scheduler, have them executed and provide me with a return value. My scheduler uses a policy for implementation: scheduler<single_threaded_policy> scheduler<threadpool_policy> The user submits a task and gets the result like result_type r = scheduler.submit(some_task()); where result_type is obtained from the scheduler and can either be of type T for single_threaded or future<T> for threadpools. Either way the client doesn't care which, because he can use a T or future<T> identically IF future<T> casts to T. I like this because the client never knows anything about futures, he treats all result_types as type T. I guess the way to do this with the accepted future implementation is to create a template function that does the following: T actual_r = get<result_type>(r); which call get() if it is a future or just returns r if not. But this is no where near as nice IMHO. The user no longer just uses the result_type of his task directly for what seems to be a basic type. 2) callbacks when future is set I have a usage scenario where I submit a batch of tasks where I collect results until I either have the result I want or collect enough that I can return what I have. This is neither a wait_for_any or a wait_for_all, more a kind of wait_until_i_have_enough. I currently implement this by submitting the batch of tasks and getting a batch of futures. I then register a callback on each future that gets called as each future gets set. The callback collects results as they come in and can decide to bail out early if it has enough results. How would I go about implementing this usage with the new futures implementation? Thanks in advance and sorry for the long post. Alan

2 1

Comment spam in bugs
by Sebastian Redl 14 May '09

14 May '09

There's comment spam in this bug: https://svn.boost.org/trac/boost/ticket/1989 Is there a unified way for reporting this, aside from posting here? Sebastian

1 0

[RFC] thread::access_monitor
by Gregory Petrosyan 14 May '09

14 May '09

I would like to hear your comments on the idea behind access_monitor template, which ensures (at compile-time) that data, protected by it, can be accessed only with associated lock held. It can be useful when you want to expose all the native interface of your data type (STL container, for example): in such a case, using ordinary monitor pattern is almost impossible. Example usage: typedef access_monitor<data_type, mutex_type> data_access_monitor; void f(data_access_monitor const& d) { data_access_monitor::value_type const* data; data_access_monitor::lock_type lock; boost::tie(data, lock) = d.const_lock(); // do something with data here } Code: #include <boost/thread.hpp> #include <boost/tuple/tuple.hpp> template <typename T, typename Lockable> struct access_monitor { typedef T value_type; typedef boost::unique_lock<Lockable> lock_type; private: typedef boost::detail::thread_move_t<lock_type> lock_move_type; public: boost::tuple<value_type const*, lock_move_type> const_lock() const { lock_type lock(mutex_); return boost::make_tuple(&data_, lock.move()); } boost::tuple<value_type*, lock_move_type> lock() { lock_type lock(mutex_); return boost::make_tuple(&data_, lock.move()); } private: // mutex_ is guaranteed to be locked when you access data_ mutable Lockable mutex_; T data_; }; Sorry for draft-quality code (however, something like the above compiles with MSVC 9). Please CC me, because I am not subscribed. Gregory

2 1

[random] cross-platform secure seeding methods planned?
by Sebastian Nowozin 14 May '09

14 May '09

Hello everybody, I like the flexibility boost::random offers. However, a severe drawback of the current library is that it does not offer a safe way of generating seeds. Of course the methods for providing this feature would vary quite a lot across platforms (e.g. on some systems its safe to use /dev/random, on some it is not). However, as the library is currently, many users will resort to ad-hoc or unsafe seeding methods instead of implementing a safe solution themselves. Hence, is a cross-platform secure seeding feature planned for boost::random in the future? Thanks, Sebastian

2 1