May 2006 - Boost - lists.boost.org

[serialization] test setup how-to?
by Nicola Musatti 20 May '06

20 May '06

Hallo, Robert. I wonder if there's any documentation on how the serialization tests are setup? I'm trying to run test_delete_pointer on its own, but I keep getting "Test setup error" messages. Cheers, Nicola Musatti

2 1

[Range] upgrade in cvs
by Thorsten Ottosen 20 May '06

20 May '06

FYI, The new version is now in cvs. Hopefully it will not cause too many problems, though I do expect some. The breaking changes are - boost::end( CharT[N]) does not differ from boost::end(T[N]) - boost::range_iterator<const T> is not a mutable iterator anymore - boost::size(rng) requires random access iterators - boost_range_begin ADL hooks renamed range_begin (ditto for boost_range_end) - mutable iterators must be defined as a specialization of boost::range_mutable_iterator Some additions are - new traits: * range_category * range_pointer * range_reference - fewer specializations needed to implement the concepts (and no specializations for const X) * range_iterator or range_mutable_iterator and range_const_iterator * range_size * range_begin/range_end All other traits/function are synthesized - new functions * distance(rng) * as_literal(rng) * as_array(rng) best regards -Thorsten

5 14

[in_place_factory] doc error
by Jeff Flinn 20 May '06

20 May '06

The example is missing a ')' in http://www.boost.org/libs/utility/in_place_factories.html#framework void foo() { C c( in_place(123,"hello" ) ; } should be void foo() { C c( in_place(123,"hello") ) ; } Out of curiosity are others using this library? Experiences? Thanks, Jeff

2 1

[optional] boost/bind/apply.hpp bad interaction
by Daniel Wallin 20 May '06

20 May '06

#include <boost/bind/apply.hpp> #include <boost/optional.hpp> Results in: dev/boost/boost/optional/optional.hpp: In member function 'void boost::optional_detail::optional_bas e<T>::construct(const Expr&, const boost::in_place_factory_base*)': dev/boost/boost/optional/optional.hpp:309: error: invalid use of 'struct boost::apply<T>' On GCC4.0.2. The offending line is: factory.BOOST_NESTED_TEMPLATE apply<value_type>(m_storage.address()) ; A simple fix is to move the apply() call out of the boost namespace. The attached patch fixes the problem. OK to commit? -- Daniel Wallin Index: optional.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/optional/optional.hpp,v retrieving revision 1.9 diff -u -r1.9 optional.hpp --- optional.hpp 10 Feb 2006 20:52:25 -0000 1.9 +++ optional.hpp 18 Mar 2006 11:40:32 -0000 @@ -76,6 +76,16 @@ #define BOOST_OPTIONAL_WEAK_OVERLOAD_RESOLUTION #endif +namespace boost_optional_construct +{ + + template <class T, class Factory> + void construct(Factory const& factory, void* address) + { + factory.BOOST_NESTED_TEMPLATE apply<T>(address); + } + +} // namespace boost_optional_construct namespace boost { @@ -295,7 +305,9 @@ void construct ( Expr const& factory, in_place_factory_base const* ) { BOOST_STATIC_ASSERT ( ::boost::mpl::not_<is_reference_predicate>::value ) ; - factory.BOOST_NESTED_TEMPLATE apply<value_type>(m_storage.address()) ; + boost_optional_construct::construct<value_type>( + factory, m_storage.address() + ); m_initialized = true ; }

2 1

explicit-failure-markups.xml broken
by JOAQUIN LOPEZ MU?Z 20 May '06

20 May '06

A recent change has broken this file, according to xmlvalidation.com the problem is: 390: 20 Open quote is expected for attribute "name" associated with an element of type "test". and the offending 390th line is <test name=limits_test""> I don't have CVS write access right now, so I can't fix this myself, would be grateful is someone did it. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Re: [boost] Random Access to Files (RAF) - any interest ?
by Jonathan Ray 20 May '06

20 May '06

Olaf van der Spek <olafvdspek(a)gmail.com> wrote: >Is it possible to read a range of bytes with a single function call? >Or would that require one function call per byte? One function call per byte would be extremely inefficient because of I/O latency unless the library, the driver, or the drive itself does a lot caching with some prefetching. Generally drivers will work faster when you declare what you want to do in as few calls as possible rather than splitting it up into many sequential function calls, because the all-at-once approach gives the driver more latitude in which to optimize the operation. I read the Performance section of the RAF paper and it seems they forgot to declare the units of the table and omitted any discription of the hardware that they ran the tests on. Those details are crucial. Cheers, Jonathan Ray

2 1

1.34
by Reed Kotler 20 May '06

20 May '06

Probably this question has been asked but I did not see any info on the web site.... Is there a projected date for boost 1.34

2 1

compressed_pair initialization
by David Abrahams 19 May '06

19 May '06

I find myself creating this class member: compressed_pair< storage , compressed_pair< Lookup , compressed_pair< GetUnstored , SetUnstored > > > members; I imagine this sort of usage is pretty common. The problem is that it's hard to initialize this member efficiently: you have to build and copy too many compressed_pairs. I propose to extend compressed_pair with overloaded ctors, as follows: compressed_pair( first_param_type f , typename second_type::first_param_type sf , typename second_type::second_param_type ss); compressed_pair( first_param_type f , typename second_type::first_param_type sf , typename second_type::second_type::first_param_type ssf , typename second_type::second_type::second_param_type sss ); ... etc. If SFINAE doesn't take out these declarations when the second type is not a (compressed_)pair, we can always template them. Thoughts? -- Dave Abrahams Boost Consulting www.boost-consulting.com

7 12

Infinite precision integer
by Maarten Kronenburg 19 May '06

19 May '06

Currently I'm working for LWG on a spec for tr2 for an infinite precision integer, which is almost finished. When it is finished I will put it here for you all to read and comment. Also I have a C++ implementation that will be submitted to boost some time. It will be a version that is pure C++, but that can also link in assembler code for performance. Currently I have the assembler for 32-bit x86 processors using MMX/SSE. The implementation compiles with Borland C++ Builder, Visual C++ and Gnu C++, with matching assemblers. Assembler speeds up the implementation considerably. So my implementation should bring together the best of C++ and assembler. Regards, Maarten.

6 9

Re: [boost] [review][pimpl_ptr] Pimpl Pointer review begins
by Martin Bonner 19 May '06

19 May '06

----Original Message---- From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of Asger Mangaard Sent: 19 May 2006 09:28 To: boost(a)lists.boost.org Subject: Re: [boost] [review][pimpl_ptr] Pimpl Pointer review begins > Tobias Schwinger wrote: >>> Could you give an example? >>> >> >> Let's see (untested and incomplete code for illustration only): >> .... > > It seems like you assume that two pimpl_ptr instances can hold the > same pointer. This is _not_ the case. Each instance of pimpl_ptr > will have its own instance of T, thus the COW (copy on non const > access) isn't needed. I thought Tobias' code was supposed to be an example of how to use a putative COW_pimpl_ptr, not an example of how to use the current code. For such a class obviously two instances _can_ hold the same pointer (that would be the whole POINT of the class!) -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 203894

1 0