- Boost - lists.boost.org

typeof: type registration
by Arkadiy Vertleyb 25 Jul '04

25 Jul '04

Hi all, Based on the discussion on this subject, I am going to switch to the automatic scheme of ID genereation. As I understand, the need to specify a unique ID could introduce just enough inconvenience to make the system unattractive to use. I will put registration classes inside anonimous namespace, to avoid ODR violation when typeof os used from a CPP. When typeof is used in templates, or enywhere else inside a header (except classes also defined in anonimous namespaces), the system will not be ODR-complient. The compilers will probably not care (since there is no runtime code generated, but this will have to be tested. I will make the changes and post them sometime soon. Anybody has any problems with this approach? Arkadiy

1 0

[config] _WIN32 question
by Vladimir Prus 25 Jul '04

25 Jul '04

Hello, in my library I use _WIN32 macro to detect the case when I'm on windows (e.g. to get the right header for 'environ'). However, Boost.Config has more complex logic: #elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32) // win32: .... Does it mean I have to use the same conditional? Which compilers define __WIN32__ or WIN32, but don't define _WIN32? Shouldn't there be a single BOOST_WINDOWS macros to help in this cases? FWIW, filesystem defines such macro internally: # if !defined( BOOST_WINDOWS ) && !defined( BOOST_POSIX ) # if defined(_WIN32) || defined(__WIN32__) || defined(WIN32) || defined(__CYGWIN__) # define BOOST_WINDOWS # else # define BOOST_POSIX # endif # endif - Volodya

3 6

[Boost.Thread] mutex Win32 implementation changes
by Michael Glassford 25 Jul '04

25 Jul '04

I've just checked in changes to Win32 implementations of the mutex and recursive_mutex classes. They now use a Win32 critical section instead of a mutex whenever possible for the normal and try_ variations, though not for the timed_ variations. These are changes that were started on the mutex classes quite some time back on the thread_dev branch; I've finished the changes and applied them to the recursive_mutex classes as well. In addition, the thread_dev branch has code that allows a mutex to be named, which allows it to be shared between two or more processes. This change was begun by Bill Kempf, but is only implemented for Win32. Any suggestions about the best way to add this feature to the pthreads and MPTasks implementations? Mike

4 35

Boost Software License Status Update?
by Stephan T. Lavavej 25 Jul '04

25 Jul '04

Hi, How is the move to the Boost Software License going? I managed to compile bcp for myself (after updating bjam to 3.1.10), but I have no clue how to use it in order to check the license status of the libraries. Stephan T. Lavavej

1 0

[assign] std regression for CW8
by Rene Rivera 24 Jul '04

24 Jul '04

In this test CW8 fails to do the operator lookup within the function scope. That is doing a "using namespace boost::assign" doesn't add the += operators to the resolution path for CW8. The workaround is to move the "using namespace" to the file scope: =================================================================== RCS file: /cvsroot/boost/boost/libs/assign/test/std.cpp,v retrieving revision 1.2 diff -u -r1.2 std.cpp --- std.cpp 21 Jul 2004 11:36:11 -0000 1.2 +++ std.cpp 24 Jul 2004 16:25:35 -0000 @@ -15,6 +15,7 @@ #include <string> using namespace std; +using namespace boost::assign; template< typename K, typename V > inline pair<K,V> P( K k, V v ) @@ -46,7 +47,6 @@ template< class C > void test_int_sequence() { - using namespace boost::assign; C c; BOOST_CHECK_EQUAL( c.size(), 0u ); @@ -59,7 +59,6 @@ template< class C > void test_string_sequence() { - using namespace boost::assign; C c; BOOST_CHECK_EQUAL( c.size(), 0u ); @@ -74,7 +73,6 @@ template< class C > void test_tuple_sequence() { - using namespace boost::assign; C c; BOOST_CHECK_EQUAL( c.size(), 0u ); @@ -88,7 +86,6 @@ template< class M > void test_map() { - using namespace boost::assign; M m; m += P( "january", 31 ), P( "february", 28 ), P( "march", 31 ), P( "april", 30 ), @@ -112,7 +109,6 @@ void test_tuple() { - using namespace boost::assign; vector<three> v_three; vector<four> v_four; vector<five> v_five; @@ -131,7 +127,6 @@ void check_std() { - using namespace boost::assign; test_int_sequence< deque<int> >(); test_int_sequence< list<int> >(); test_int_sequence< vector<int> >(); =================================================================== This make the test work on CW8, and still work on vc7.1 and mingw. And this fix should also apply to CW9. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com - 102708583/icq

2 1

Jamfile.v2 failing for several doc directories
by Larry Evans 24 Jul '04

24 Jul '04

How do I avoid the following errors? <------------- cd /home/evansl/prog_dev/boost-cvs/boost/libs/variant/doc/ bjam --v2 /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/tools/boostbook.jam:322: in construct warning: rulename $(base-target).depends expands to empty string /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/build/targets.jam:1025: in object(boostbook-target-class)(a)1.generate /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/build/targets.jam:546: in generate-really /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/build/targets.jam:519: in object(main-target)(a)1.generate /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/build/targets.jam:203: in object(project-target)(a)11.generate /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/build-system.jam:160: in load /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/kernel/modules.jam:259: in import /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/kernel/bootstrap.jam:120: in boost-build /home/evansl/prog_dev/boost-cvs/boost/boost-build.jam:12: in module scope /home/evansl/prog_dev/boost-cvs/boost/tools/build/v2/tools/boostbook.jam:326: in construct warning: rulename $(target).set-path expands to empty string >---------------- TIA. Larry

1 2

[assign] list_inserter regression for CW8
by Rene Rivera 24 Jul '04

24 Jul '04

The failure on this test is caused by CW8's inability to do a function_template -> function_pointer -> template_type translation automatically. The workaround is to help it along by introducing a cast for the function_template -> function_pointer translation: =================================================================== RCS file: /cvsroot/boost/boost/libs/assign/test/list_inserter.cpp,v retrieving revision 1.2 diff -u -r1.2 list_inserter.cpp --- list_inserter.cpp 21 Jul 2004 11:36:10 -0000 1.2 +++ list_inserter.cpp 24 Jul 2004 15:44:55 -0000 @@ -53,7 +53,7 @@ using namespace boost::assign; vector<int> v; - make_list_inserter( &function_ptr<int> )( 5 ),3; + make_list_inserter( (void (*)(int))&function_ptr<int> )( 5 ),3; make_list_inserter( functor() )( 4 ),2; make_list_inserter( bind( &vector<int>::push_back, &v, _1 ) )( 6 ),4; BOOST_CHECK_EQUAL( v.size(), 2u ); =================================================================== That makes this test pass for CW8, and vc7.1, and mingw. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com - 102708583/icq

1 0

RE: [boost] Re: counting_iterator_test.hpp fails on aC++
by DY, JERRY U (SBCSI) 24 Jul '04

24 Jul '04

Dave, The only workaround I have is to surround the static assertion with guards: #if !defined (__HP_aCC) BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(random_access_traversal_tag) #endif The assumption is that if "advance" is called, the compiler errors eventually anyway so this change should be harmless (and lets aC++ compile the code). I had to do the same for "decrement" and "distance_to" member functions. Is this workaround okay? I probably should check this in only after 1.32 release in any case. -Jerry -----Original Message----- From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of David Abrahams Sent: Thursday, July 22, 2004 10:36 AM To: boost(a)lists.boost.org Subject: [boost] Re: counting_iterator_test.hpp fails on aC++ "DY, JERRY U $SBCSI$" <jd2419(a)sbc.com> writes: > The problem is that since my_int2 is not a random access iterator, class > iterator_adaptor's member function "advance" would not compile because > of the static assertion below trying to convert > random_access_traversal_tag to bidirectional_traversal_tag > (my_traversal). It should never be instantiated, because it should never be called. This is a compiler bug. -- Dave Abrahams Boost Consulting http://www.boost-consulting.com _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

boost/test/detail/algorithm.hpp: request for promotion and/or fast review
by Gennadiy Rozental 24 Jul '04

24 Jul '04

Hi, I added several algorithms that extent STL algorithms set. I use them in my Boost.Test development. But since they seems to be generic and IMO should be present in STL I propose to push them in boost/algorithm.hpp (or under boost/algorithm). I remember there was a discussion already about these algorithms. Here is the list (I hope name and spec is self -explanatory): template <class InputIter1, class InputIter2> inline std::pair<InputIter1, InputIter2> mismatch( InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2 ); template <class InputIter1, class InputIter2, class Predicate> inline std::pair<InputIter1, InputIter2> mismatch( InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Predicate pred ); template<class ForwardIterator1, class ForwardIterator2> inline ForwardIterator1 find_first_not_of( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2 ); template<class ForwardIterator1, class ForwardIterator2, class Predicate> inline ForwardIterator1 find_first_not_of( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred ); template<class BidirectionalIterator1, class ForwardIterator2> inline BidirectionalIterator1 find_last_of( BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2 ) template<class BidirectionalIterator1, class ForwardIterator2, class Predicate> inline BidirectionalIterator1 find_last_of( BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred ); template<class BidirectionalIterator1, class ForwardIterator2> inline BidirectionalIterator1 find_last_not_of( BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2 ); template<class BidirectionalIterator1, class ForwardIterator2, class Predicate> inline BidirectionalIterator1 find_last_not_of( BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred ); Implementation together with doxigen docs is here: http://tinyurl.com/35pfj Test is here: http://tinyurl.com/yvlgu If we don't find this header eligible for review I would like to ask then for permision to at least put this algorithm in boost namespace (currently boost::unit_test), for it inconvenience for me to keep it in deep namespace. Gennadiy.

7 13

help with iterator_value and BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION
by Thorsten Ottosen 24 Jul '04

24 Jul '04

Hi, The boost.iterator docs says On compilers that don't support partial specialization, such as Microsoft Visual C++ 6.0 or 7.0, you may need to manually invoke BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION on the value_type of pointers that are passed to these metafunctions. Can anyone show how this must be used. I have no idea on how to apply this workaround. Thanks Thorsten

3 4