May 2007 - Boost - lists.boost.org

Interest in a static-sized version of cvalarray
by Michael Tegtmeyer 07 Jul '07

07 Jul '07

Some time ago I posted a message to this list about interest in a static-sized version of cvalarray. I'll include the original message for reference. I received some emails stating that there was interest. The implementation has been in the sandbox for some time now. I'd like to guage interest again to determine if it is worth working to add to boost. The implementation has not been boostified because it is in active use here where I work (autotool land) so if there is interest, some additional work needs to be done to absorb the boost framework. The implementation is complete without any known bugs. There is only one header but you can go though the normal ./configure, make, make install to put it somewhere. Tests can be run using 'make check' and documentation is in the doc directory. Of additional interest since my previous post: the implementation will now automaticallty unroll all numeric ops at compile time (subject to the compiler) up to a predefined array size. My original post: Hello, I am trying to guage interest in a fixed sized version of valarray. I frequently found myself using small(-ish) compile-time known sized numeric arrays that don't justify the overhead of operator new in std::valarray but needed the math interface that valarray provided. I wrote a static-sized version of valarray for this purpose. It is modeled after std::valarray and implements about 90% of valarray's interface (obviously resizing is not included, neither is gslice due to the result not being known at compile time). Examples of it's use are: float _v[10] = {...}; size_t _i[5] = {...}; cvalarray<float,10> v1(_v); cvalarray<float,5> v2 = v1[cslice<0,5,2>()]; v1[cslice<0,3,3>()] = 0.0f; cvalarray<size_t,5> ind(_i); cvalarray<float,5> cvalB = v1[ind]; v2 *= (v2 + v1) / 2.0; //all of the usual math ops I have a complete implementation that models std::valarray in every possible way (with compile-time known limitations) including expression-template support for the numeric ops. My testing indicates a decent performance increase over gcc4's valarray for small number of elements <1000. If anyone has any interest, I'll put together some docs and throw it in the sandbox. Mike Tegtmeyer

7 23

[BGL] Adapter from bidirectional to undirected graph
by Benoit 05 Jul '07

05 Jul '07

Hello everyone, I have been using the BGL for quite some time with both directed and bidirectional graphs (with adjacency_list). Sometimes i need to use these graphs in algorithms as if they were undirected... AFAICT, this is currently not possible because out_edges() exists in all cases, but don't do the same... The obvious solution consists in writing a dedicated adapter used for translating a bidirectional graph into a directed one at least for out_edges(), and optionally for other stuff (internal properties, vertex and edge descriptors?) to make this subtle change as transparent as possible. Can you think of another way ? Is there already such an adapter somewhere (i have unsuccessfully tried to find one...) ? In case it didn't exist, would anyone else be interested to have one ? Benoît PS : I'd like to thank the authors of the BGL, it's a pleasure to work with it everyday !

3 2

[Boost-bugs] [ boost-Support Requests-1707948 ] Assertion failed in token_iterator.hpp
by SourceForge.net 03 Jul '07

03 Jul '07

Support Requests item #1707948, was opened at 2007-04-26 03:08 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1707948&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Assertion failed in token_iterator.hpp Initial Comment: Using BOOST.1.33.1 with Borland C++. I've suddenly got a Message Box saying: Assertion failed: valid_, file ...boost/token_iterator.hpp, line 52 Line 52 in token_iterator.hpp is: assert(valid_); in void increment(){}. Could anybody give me a clue as to what might be going on and why it has suddenly started happening, please? With thanks in anticipation, Paul Collins (paul(a)screen.subtitling.com) ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1707948&group_… ------------------------------------------------------------------------- This SF.net email is sponsored by DB2 Express Download DB2 Express C - the FREE version of DB2 express and take control of your XML. No limits. Just data. Click to get it now. http://sourceforge.net/powerbar/db2/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

2 1

[math toolkit]
by Leopoldo Peralta 02 Jul '07

02 Jul '07

This Fatal Error occurs when trying to compile a MSVC 2003 (SP1) project using the proposed Math Toolkit: C:\boost_1_34_0_beta\boost_1_34_0\boost\math\special_functions\log1p.hpp(195 ): error C2785: 'tools::promote_args<T>::type boost::math::log1p(T)' and 'double boost::math::log1p(double)' have different return types Any fix to this error? Leopoldo Peralta

2 8

Any interest in an "opaque iterator" library?
by lists＠mr-edd.co.uk 29 Jun '07

29 Jun '07

Hi folks, I've been working on an "opaque iterator" library that is designed to do for iterators what the pimpl idiom does for classes in general. A motivating example and some experimental code can be found here: http://www.mr-edd.co.uk/?p=36 Before I take it further I'd like to know if there's any interest in having such a library within the boost collection so I can start refactoring it in the rough direction needed for formal review. Thanks, Edd

5 8

[ptr_container] feature request: BOOST_PTR_CONTAINER_NO_SERIALIZATION
by Sebastian Ramacher 25 Jun '07

25 Jun '07

As of version 1.34, Boost.PtrContainer supports serialization as defined by Boost.Serialization. Now I'd like to propose a switch to disable this feature. The attached patch adds checks if BOOST_PTR_CONTAINER_NO_SERIALZATION is defined around the serialization related code blocks and enables/disables serialization support. It's not that I don't like serialization support but on a Debian system you have to install libboost-serialization-dev and libboost-serialization1.34.0 just to use Boost.PtrContainer. The patch was created against CVS HEAD but I'd gladly provide a patch against 1.34 if it finds any interest. Regards, Sebastian Index: ptr_array.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/ptr_container/ptr_array.hpp,v retrieving revision 1.9 diff -u -r1.9 ptr_array.hpp --- ptr_array.hpp 16 Feb 2006 23:38:36 -0000 1.9 +++ ptr_array.hpp 28 May 2007 13:35:29 -0000 @@ -190,6 +190,7 @@ return this->c_private()[idx] == 0; } +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION public: // serialization template< class Archive > @@ -214,7 +215,7 @@ } BOOST_SERIALIZATION_SPLIT_MEMBER() - +#endif }; ////////////////////////////////////////////////////////////////////////////// Index: ptr_map_adapter.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/ptr_container/ptr_map_adapter.hpp,v retrieving revision 1.26 diff -u -r1.26 ptr_map_adapter.hpp --- ptr_map_adapter.hpp 8 Mar 2006 23:16:00 -0000 1.26 +++ ptr_map_adapter.hpp 28 May 2007 13:36:09 -0000 @@ -291,6 +291,7 @@ return replace( where, x.release() ); } +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION public: // serialization template< class Archive > @@ -305,6 +306,7 @@ ar & ptr_container_detail::serialize_as_const( i->second ); } } +#endif }; } // ptr_container_detail @@ -472,6 +474,7 @@ return transfer( from.begin(), from.end(), from ); } +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION public: // serialization template< class Archive > @@ -493,7 +496,7 @@ } BOOST_SERIALIZATION_SPLIT_MEMBER() - +#endif }; ///////////////////////////////////////////////////////////////////////// @@ -647,6 +650,7 @@ BOOST_ASSERT( from.empty() ); } +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION public: // serialization template< class Archive > @@ -668,7 +672,7 @@ } BOOST_SERIALIZATION_SPLIT_MEMBER() - +#endif }; template< class I, class F, class S > Index: ptr_vector.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/ptr_container/ptr_vector.hpp,v retrieving revision 1.10 diff -u -r1.10 ptr_vector.hpp --- ptr_vector.hpp 18 Feb 2006 01:41:14 -0000 1.10 +++ ptr_vector.hpp 28 May 2007 13:35:09 -0000 @@ -53,6 +53,7 @@ this->c_private().reserve( n ); } +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION public: // serialization template< class Archive > @@ -66,7 +67,7 @@ } BOOST_SERIALIZATION_SPLIT_MEMBER() - +#endif }; ////////////////////////////////////////////////////////////////////////////// Index: detail/reversible_ptr_container.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/ptr_container/detail/reversible_ptr_container.hpp,v retrieving revision 1.24 diff -u -r1.24 reversible_ptr_container.hpp --- detail/reversible_ptr_container.hpp 6 Mar 2006 20:09:50 -0000 1.24 +++ detail/reversible_ptr_container.hpp 28 May 2007 13:35:10 -0000 @@ -35,7 +35,11 @@ #include <boost/utility/enable_if.hpp> #include <boost/type_traits/is_pointer.hpp> #include <boost/type_traits/is_integral.hpp> + +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION #include <boost/serialization/split_member.hpp> +#endif + #include <algorithm> #include <exception> #include <memory> @@ -46,12 +50,13 @@ namespace ptr_container_detail { - +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION template< class T > inline T const& serialize_as_const( T const& r ) { return r; } +#endif template< class CloneAllocator > struct clone_deleter @@ -545,6 +550,7 @@ return replace( idx, x.release() ); } +#ifndef BOOST_PTR_CONTAINER_NO_SERIALIZATION // // serialization // @@ -602,7 +608,7 @@ } BOOST_SERIALIZATION_SPLIT_MEMBER() - +#endif }; // 'reversible_ptr_container'

4 10

proto::tag naming convention
by Maurizio Vitale 22 Jun '07

22 Jun '07

What is the rationale for not having proto::tags match the corresponding mpl metafunctions? For instance mpl has plus and proto has add (but unary_plus). Since people will often mix the two, it would be nice to have the same name. (I basically have to look them up everytime I use one of them) If the intention was to make them different so that they can be mixed without namespace qualification I think they're not different enough. Given divide and divides, which is proto's and which is mpl's? Clearly one gets used to these things, but maybe it is something to consider before finalizing proto for inclusion in boost. regards Maurizio

7 25

Concurrent async requests
by Владислав Чернышов 08 Jun '07

08 Jun '07

Hi! If I do something like this can I be sure that async requests will run concurrently? boost::asio::io_service io_service; client c(io_service, argv[1], argv[2]); client c1(io_service, argv[1], argv[2]); boost::thread tr1(boost::bind(&boost::asio::io_service::run, &io_service)); io_service.run(); tr1.join(); The client class is a class from boost.asio example. Vlad

2 3

[multi_index] use cases for iterator_to()
by "JOAQUIN LOPEZ MU?Z" 08 Jun '07

08 Jun '07

Hello, More than a year ago a request was made for Boost.MultiIndx to provide the ability to get an iterator to an element x from x alone: iterator iterator_to(const value_type& x); I can provide this functionality in constant time, and the internal implementation is trivial, but I got thinking about the potential use cases for such capability and cannot come up with something convincing. Do you see usefulness in having iterator_to()? Can you describe a potential usage scenario? At first blush, seems like this is at least as useful as the homonym functionality in Boost.Intrusive, but if you think about the obvious scenarios applying to B.I, it turns out they do not immediately translate to B.MI. Thank you! Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

5 6

binary_iostreams library
by Ares Lagae 07 Jun '07

07 Jun '07

I have developed a small library for binary I/O, called binary_iostreams, and I am using it in several of my own projects. I was wondering if there is interest for such a binary_iostreams library? The binary_iostreams is a small library, very similar to the iostreams library. Compared to iostreams, the unformatted I/O operators remain, and the formatted I/O operators now do binary I/O. This makes the binary_iostreams library easy to use for anyone acquainted with the iostreams library. The binary_iostreams library allows to set the endianness of the output stream. Together with <cstdint>, this allows for portable binary I/O, although binary_iostreams does not claim to be a full blown serialization library. Direct link to a motivating example: http://www.cs.kuleuven.ac.be/~ares/binary_iostreams/test.cpp The library: http://www.cs.kuleuven.ac.be/~ares/binary_iostreams/binary_iostreams-0.1.ta… The documentation: http://www.cs.kuleuven.ac.be/~ares/binary_iostreams/doc/html Best regards, -- Ares Lagae Computer Graphics Research Group, Katholieke Universiteit Leuven http://www.cs.kuleuven.be/~ares/

10 23