- Boost - lists.preview.boost.org

[utility] declval addition? [type_traits] add_rvalue_reference addition?
by vicente.botet 14 Aug '10

14 Aug '10

Hi, I was wondering if we can add the declval utility function template to the Boost.Utility library 20.3.4 Function template declval [declval] 1 The library provides the function template declval to simplify the definition of expressions which occur as unevaluated operands (Clause 5). template <class T> typename add_rvalue_reference<T>::type declval() noexcept; // as unevaluated operand 2 Remarks: If this function is used (as defined by (3.2)), the program is ill-formed. 3 Remarks: The template parameter T of declval may be an incomplete type. [ Example: template <class To, class From> decltype(static_cast<To>(declval<From>())) convert(From&&); declares a function template convert which only participats in overloading if the type From can be explicitly converted to type To. For another example see class template common_type (20.7.6.6). -end example ] BTW, add_rvalue_reference is not available on Boost.TypeTraits, add_rvalue_reference_layer. Any problem to add it? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

1 0

Need help with boost iostreams
by Martin Sundhaug 14 Aug '10

14 Aug '10

Hello! I am having some difficulties understanding the docs on boost-iostreams, I would appreciate if someone here joined the project to help with among other boost.

1 0

What happened to the subject line here? (was: �)
by Dave Abrahams 14 Aug '10

14 Aug '10

I'm seeing a bunch of threads with garbage subjects. What's going on? -- Dave Abrahams BoostPro Computing http://www.boostpro.com

2 1

[interprocess] Checking for existence Named Mutex
by Brian Davis 13 Aug '10

13 Aug '10

How do I check for the existence of a named resource in using boost interprocess without wrapping a open_only in a try catch block and waiting for the exception?

1 0

[shared_ptr] Detect shared_ptr argument at compile time
by Ralf Globisch 13 Aug '10

13 Aug '10

Hi, I'm not sure if this is the correct mailing list for this question: Is there a way to determine if a template parameters is of type boost::shared_ptr at compile time? I would like to do something like: template<class A> void doSomething( const A& a) { // if "a" is of type boost::shared_ptr<SomeType> a->someMethod(); // else a.someMethod(); } Is this possible at all? Regards, Ralf

4 3

Re: [boost] Problem with program_options on FreeBSD 8 (gcc 4.2)
by elekktretterr＠exemail.com.au 13 Aug '10

13 Aug '10

> Hi Petr, > > My mistake, I, somehow, thought to read that you wanted the static > libraries. Looking at your cmake-code, I would say it appears correct > for finding the static libraries. Did you check whether you really > have those static libraries? Second, are you on windows and could the > auto-linking be in the way? Third, you may need to specify > BOOST_ALL_DYN_LINK as a compile-definition. > Thanks Andre, Im using FBSD 8. -r--r--r-- 1 root wheel 964726 Jul 23 10:22 /usr/local/lib/libboost_program_options.a lrwxr-xr-x 1 root wheel 29 Jul 23 10:23 /usr/local/lib/libboost_program_options.so -> libboost_program_options.so.4 -r--r--r-- 1 root wheel 472959 Jul 23 10:23 /usr/local/lib/libboost_program_options.so.4 I suppose this means that I have both static and dynamic versions of boost. I'll try BOOST_ALL_DYN_LINK next. Petr

1 0

SVN Trac - can't login :-(
by Paul A. Bristow 13 Aug '10

13 Aug '10

Oops. Trac detected an internal error: OperationalError: database is locked There was an internal error in Trac. It is recommended that you notify your local Trac administrator with the information needed to reproduce the issue. To that end, you could ==== How to Reproduce ==== While doing a GET operation on `/login`, Trac issued an internal error. ''(please provide additional details here)'' Request parameters: {{{ {} }}} User agent: `Mozilla/5.0 (Windows; U; Windows NT 6.0; en-GB; rv:1.9.2.8) Gecko/20100722 Firefox/3.6.8 ( .NET CLR 3.5.30729; .NET4.0C)` ==== System Information ==== ''System information not available'' ==== Enabled Plugins ==== ''Plugin information not available'' ==== Python Traceback ==== {{{ Traceback (most recent call last): File "build/bdist.linux-i686/egg/trac/web/main.py", line 513, in _dispatch_request dispatcher.dispatch(req) File "build/bdist.linux-i686/egg/trac/web/main.py", line 235, in dispatch resp = chosen_handler.process_request(req) File "build/bdist.linux-i686/egg/trac/web/auth.py", line 115, in process_request self._do_login(req) File "build/bdist.linux-i686/egg/trac/web/auth.py", line 153, in _do_login @self.env.with_transaction() File "build/bdist.linux-i686/egg/trac/db/api.py", line 77, in transaction_wrapper fn(ldb) File "build/bdist.linux-i686/egg/trac/web/auth.py", line 159, in store_session_cookie int(time.time()))) File "build/bdist.linux-i686/egg/trac/db/util.py", line 65, in execute return self.cursor.execute(sql_escape_percent(sql), args) File "build/bdist.linux-i686/egg/trac/db/sqlite_backend.py", line 78, in execute result = PyFormatCursor.execute(self, *args) File "build/bdist.linux-i686/egg/trac/db/sqlite_backend.py", line 56, in execute args or []) File "build/bdist.linux-i686/egg/trac/db/sqlite_backend.py", line 48, in _rollback_on_error return function(self, *args, **kwargs) OperationalError: database is locked The action that triggered the error was: GET: /login (Got same error yesterday.) (But can view tickets OK) --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

1 0

Re: [boost] Problem with program_options on FreeBSD 8 (gcc 4.2)
by elekktretterr＠exemail.com.au 13 Aug '10

13 Aug '10

> Petr, > > Specify that you want to "find" the static boost libs in your > cmakelists.txt, just before calling find_package( Boost ) > > set( Boost_USE_STATIC_LIBS On ) > find_package( Boost REQUIRED COMPONENTS program_options ) > Hi Andre, Thanks, but that is exactly my problem. I want dynamic linking, but it keeps getting linked statically. Ive got this: find_package( Boost 1.43.0 COMPONENTS program_options) set(Boost_USE_STATIC_LIBS OFF) set(Boost_USE_MULTITHREADED ON) if(Boost_FOUND) include_directories(${Boost_INCLUDE_DIRS}) add_executable(...) target_link_libraries(tbone ${Boost_LIBRARIES}) endif()

2 1

[concept] forward declarations and `BOOST_CONCEPT_REQUIRES()`
by Lorenzo Caminiti 13 Aug '10

13 Aug '10

Hello all, Can I forward declare a function template that checks concepts using `BOOST_CONCEPT_REQUIRES()`? In the following example, MSVC gives me an ambiguous call error when I try to do that... (I have not yet tried other compilers). Example "c00.cpp": #include <boost/concept/requires.hpp> #include <boost/concept_check.hpp> #include <vector> // (1) Forward declaration with concepts. template<class Iter, class T> BOOST_CONCEPT_REQUIRES( ((boost::ForwardIterator<Iter>)) ((boost::EqualityComparable<T>)) , (bool) ) all_equals(Iter first, Iter last, const T& val); // (2) Actual definition. template<class Iter, class T> BOOST_CONCEPT_REQUIRES( ((boost::ForwardIterator<Iter>)) ((boost::EqualityComparable<T>)) , (bool) ) all_equals(Iter first, Iter last, const T& val) { for (Iter i = first; i < last; ++i) { if (*i != val) return false; } return true; } int main() { std::vector<double> v; // MSVC error: Cannot resolved ambiguous call between (1) and (2). all_equals(v.begin(), v.end(), double()); return 0; } MSVC error: Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 14.00.50727.42 for 80x86 Copyright (C) Microsoft Corporation. All rights reserved. c00.cpp c00.cpp(28) : error C2668: 'all_equals' : ambiguous call to overloaded function c00.cpp(18): could be 'bool all_equals<std::_Vector_iterator<_Ty,_Alloc>,double>(Iter,Iter,const T &)' with [ _Ty=double, _Alloc=std::allocator<double>, Iter=std::_Vector_iterator<double,std::allocator<double>>, T=double ] c00.cpp(11): or 'bool all_equals<std::_Vector_iterator<_Ty,_Alloc>,double>(Iter,Iter,const T &)' with [ _Ty=double, _Alloc=std::allocator<double>, Iter=std::_Vector_iterator<double,std::allocator<double>>, T=double ] while trying to match the argument list '(std::_Vector_iterator<_Ty,_Alloc>, std::_Vector_iterator<_Ty,_Alloc>, double)' with [ _Ty=double, _Alloc=std::allocator<double> ] Thank you very much. -- Lorenzo

6 14

Re: [boost] Problem with program_options on FreeBSD 8 (gcc 4.2)
by elekktretterr＠exemail.com.au 13 Aug '10

13 Aug '10

Oh, I see. My problem was actually not specifing -lboost_program_options on the command line which gave linker error. I'm using cmake now, and it seems that program_options get statically linked. How can I get it to dynamic link instead? I know this is more of a cmake question, so sorry. Thanks, Petr

1 0

[fusion] Variadic template support
by Ravi 12 Aug '10

12 Aug '10

Hi, What is the plan for merging variadic template support from the GSOC project into the release branch? It is already immensely useful. Regards, Ravi

2 1

Problem with program_options on FreeBSD 8 (gcc 4.2)
by elekktretterr＠exemail.com.au 12 Aug '10

12 Aug '10

Hi, I'm new to Boost and I've decided to use it in my C++ project. My first attempt is to use boost::program_options. However, Im hitting a slag and I can't figure out whats the problem. ive got this: #include "boost/program_options.hpp" int main() { return 0; } then I run: g++ -I/usr/local/include -L/usr/local/lib test.cpp but I get this error that doesn't make any sense to me: In file included from /usr/local/include/boost/program_options/value_semantic.hpp:14, from /usr/local/include/boost/program_options/options_description.hpp:13, from /usr/local/include/boost/program_options.hpp:15, from test.cpp:1: /usr/local/include/boost/type_traits/is_unsigned.hpp: In instantiation of 'boost::detail::is_ununsigned_helper<short int>': /usr/local/include/boost/type_traits/is_unsigned.hpp:73: instantiated from 'boost::detail::is_unsigned_imp<short int>' /usr/local/include/boost/type_traits/is_unsigned.hpp:123: instantiated from 'boost::is_unsigned<short int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:110: instantiated from 'boost::detail::make_unsigned_imp<short int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:130: instantiated from 'boost::make_unsigned<short int>' /usr/local/include/boost/lexical_cast.hpp:846: instantiated from here /usr/local/include/boost/type_traits/is_unsigned.hpp:40: warning: comparison between 'enum boost::detail::is_unsigned_values<short int>::<anonymous>' and 'enum boost::detail::is_unsigned_values<short int>::<anonymous>' /usr/local/include/boost/type_traits/is_unsigned.hpp: In instantiation of 'boost::detail::is_ununsigned_helper<int>': /usr/local/include/boost/type_traits/is_unsigned.hpp:73: instantiated from 'boost::detail::is_unsigned_imp<int>' /usr/local/include/boost/type_traits/is_unsigned.hpp:123: instantiated from 'boost::is_unsigned<int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:110: instantiated from 'boost::detail::make_unsigned_imp<int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:130: instantiated from 'boost::make_unsigned<int>' /usr/local/include/boost/lexical_cast.hpp:860: instantiated from here /usr/local/include/boost/type_traits/is_unsigned.hpp:40: warning: comparison between 'enum boost::detail::is_unsigned_values<int>::<anonymous>' and 'enum boost::detail::is_unsigned_values<int>::<anonymous>' /usr/local/include/boost/type_traits/is_unsigned.hpp: In instantiation of 'boost::detail::is_ununsigned_helper<long int>': /usr/local/include/boost/type_traits/is_unsigned.hpp:73: instantiated from 'boost::detail::is_unsigned_imp<long int>' /usr/local/include/boost/type_traits/is_unsigned.hpp:123: instantiated from 'boost::is_unsigned<long int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:110: instantiated from 'boost::detail::make_unsigned_imp<long int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:130: instantiated from 'boost::make_unsigned<long int>' /usr/local/include/boost/lexical_cast.hpp:874: instantiated from here /usr/local/include/boost/type_traits/is_unsigned.hpp:40: warning: comparison between 'enum boost::detail::is_unsigned_values<long int>::<anonymous>' and 'enum boost::detail::is_unsigned_values<long int>::<anonymous>' /usr/local/include/boost/type_traits/is_unsigned.hpp: In instantiation of 'boost::detail::is_ununsigned_helper<long long int>': /usr/local/include/boost/type_traits/is_unsigned.hpp:73: instantiated from 'boost::detail::is_unsigned_imp<long long int>' /usr/local/include/boost/type_traits/is_unsigned.hpp:123: instantiated from 'boost::is_unsigned<long long int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:110: instantiated from 'boost::detail::make_unsigned_imp<long long int>' /usr/local/include/boost/type_traits/make_unsigned.hpp:130: instantiated from 'boost::make_unsigned<long long int>' /usr/local/include/boost/lexical_cast.hpp:889: instantiated from here /usr/local/include/boost/type_traits/is_unsigned.hpp:40: warning: comparison between 'enum boost::detail::is_unsigned_values<long long int>::<anonymous>' and 'enum boost::detail::is_unsigned_values<long long int>::<anonymous>' I tried including other libraries like foreach and thread and they compile & link fine. Can someone please help me? Thanks, Petr

2 1

[1.44] Beta 1 available
by Beman Dawes 12 Aug '10

12 Aug '10

Boost release 1.43.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/ There are two new libraries (Meta State Machine and Polygon) in this release, and lots of fixes and improvements to existing libraries. For details of what's in the release, see http://beta.boost.org/users/news/version_1_44_0. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

4 7

[boostcon] Where is the viterbi library from boostcon 2009?
by Ravi 11 Aug '10

11 Aug '10

Hello, Does anyone have a copy of the Viterbi (dynamic programming) library from boostcon 2009? My google-fu is insufficient to locate it. An email to the author's email address from the boostcon presentation failed to elicit any response. In case anyone is wondering which talk from boostcon prompted my request, here is a link: http://www.mefeedia.com/watch/32045638 Ravi

3 2

Permission to merge documentation
by Daniel Walker 11 Aug '10

11 Aug '10

Hi all, I have some documentation changes that I hope can make it into the release. Neither of these changes affect the beta pdf files. Change set 64705 updates the MPL documentation to include docs for HAS_XXX_TEMPLATE_DEF, etc. Thanks to Steven Watanabe for his help with building the html files. Change sets 64695 and 64696 update the result_of documentation explaining how to enable the use of decltype and adding new examples. Daniel Walker

3 4

[1.44][bcp] Is it too late to merge tools to release?
by John Maddock 11 Aug '10

11 Aug '10

There are some patches in Trunk for the bcp tool that fix various issues when extracting "all of Boost" that I forgot to merge to release (my bad), the changes don't effect anything else, is it acceptable to merge these to release? Diffs attached, in case they help, Cheers, John

3 3

Boost Newbie Start point
by Dev Null 11 Aug '10

11 Aug '10

Hello All, I am new to Boost library. I would like to contribute to the Boost library. Could you please guide me to start understanding the Boost library and entire directory tree? Thanks, Dev Null

2 1

[boost.Serialization V1.42.0] Question about BOOST_SERIALIZATION_SPLIT_FREE and non-public members
by gmkdroid 11 Aug '10

11 Aug '10

Hello, I'm trying to add Boost serialization to a class which has private data members. I'm using the "non-intrusive" free save/load split method. I've added "friend class boost::serialization::access;" to my class, but I still receive a "cannot access private member..." compiler error. How can I give the load/save functions friend access to my class? I'm using Visual Studio 2008 with Boost Version 1.42.0. Thanks, Glen

5 10

[boostcon] site down
by Michael Caisse 11 Aug '10

11 Aug '10

http://www.boostcon.com/ is returning 500 - Internal Server Error -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

2 1

[accumulator] Undocumented rolling_window_plus1 accumulator
by vicente.botet 10 Aug '10

10 Aug '10

Hi, rolling_count depends on rolling_window_plus1which is not documented. rolling_count The rolling count is the current number of elements in the rolling window. Result Type std::size_t Depends On rolling_window_plus1 The same applies to rolling_sum. Could this documentation issue be managed? Best _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 2

[svn sandbox]
by Jeffrey Lee Hellrung, Jr. 10 Aug '10

10 Aug '10

When I try to SVN update the sandbox, I get the following error message: Update Can't create directory 'D:\boost-svn\boost-sandbox\statistics\support\boost\assign\v2\chain\aux': The directory name is invalid. It doesn't look so invalid. Is anyone else having any issues, or have any suggestions? I've tried "clean up", no help. I'm not an expert in SVN. Windows 7; TortoiseSVN 1.6.10, Build 19898 - 64 Bit (latest version AFAIK). Should I just recheckout the repo? (I'm sending a mailing list message first as checking out the repo takes a lot of bandwidth and time.) Thanks in advance, - Jeff

3 3

[1.44] Beta progress?
by Beman Dawes 10 Aug '10

10 Aug '10

It will be Wednesday before I can start pulling the 1.44 beta together. In the meantime, does anyone have any serious issues we need to tackle before the beta? Thanks, --Beman

15 125

[1.44] Beta version of PDF docs available
by John Maddock 10 Aug '10

10 Aug '10

A PDF build of the docs for Boost-1.44-beta is now available from https://sourceforge.net/projects/boost/files/boost-docs/1.44.0/boost_1_44_p… if library authors would like to give their docs a once-over to check for SNAFU's that would be great. Regards, John.

5 6

Any interest in creating new CORBA IDL to C++ mapping?
by Johnny Willemsen 10 Aug '10

10 Aug '10

Hi all, We are talking with various users of TAO to see if we can create a new modern IDL to C++ mapping. The idea is to drop all old compilers which lead to the current mapping and make a new IDL to C++ mapping that is using the latest draft C++0x standard. We want to use full STL, shared_ptr, r-value, and everything else we could need. The idea is to prototype this first in TAO and than see if on the long term we can propose a new IDL to C++ V2 mapping to the OMG I did find some discussions on this list about 2 years ago, are people interested in this effort, any input is welcome. Johnny Willemsen Remedy IT www.theaceorb.nl

12 22

[chrono] Compatibility issues with 1.44
by Roland Bock 10 Aug '10

10 Aug '10

Hi Vicente, do you have an estimate for an update of Boost.Chrono which is compatible with the upcoming 1.44 version of boost? I just tried the daily snapshot provided by Beman with the current Chrono zip: * Compilation of Boost.Chrono fails * Boost.Chrono zip contains changes for parts of Boost.Thread Are these still needed/compatible? Also (not related to 1.44, but also 1.41, at least), there are many warnings issued by the compiler. It seems to me that they are somehow related to the constructors of duration, but I haven't been able to figure them out. These also occur when compiling client code. A log file is attached. Generated on Ubuntu-10.4, 64bit, gcc-4.4.3 Regards, Roland PS: Snapshot: http://boost.cowic.de/rc/ (boost-posix-2010-08-02.tar.bz2) Boost.Chrono: http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=System http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. [...] common.mkdir build/boost/bin.v2/libs/chrono common.mkdir build/boost/bin.v2/libs/chrono/build common.mkdir build/boost/bin.v2/libs/chrono/build/gcc-4.4.3 common.mkdir build/boost/bin.v2/libs/chrono/build/gcc-4.4.3/release common.mkdir build/boost/bin.v2/libs/chrono/build/gcc-4.4.3/release/threading-multi gcc.compile.c++ build/boost/bin.v2/libs/chrono/build/gcc-4.4.3/release/threading-multi/chrono.o In file included from libs/chrono/src/chrono.cpp:40: libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::system_clock::now()’: libs/chrono/src/posix/chrono.cpp:27: error: no matching function for call to ‘boost::system::system_error::system_error(int&, const boost::system::error_category& (&)(), const char [21])’ ./boost/system/system_error.hpp:43: note: candidates are: boost::system::system_error::system_error(int, const boost::system::error_category&, const char*) ./boost/system/system_error.hpp:39: note: boost::system::system_error::system_error(int, const boost::system::error_category&, const std::string&) ./boost/system/system_error.hpp:36: note: boost::system::system_error::system_error(int, const boost::system::error_category&) ./boost/system/system_error.hpp:33: note: boost::system::system_error::system_error(boost::system::error_code, const char*) ./boost/system/system_error.hpp:30: note: boost::system::system_error::system_error(boost::system::error_code, const std::string&) ./boost/system/system_error.hpp:27: note: boost::system::system_error::system_error(boost::system::error_code) ./boost/system/system_error.hpp:25: note: boost::system::system_error::system_error(const boost::system::system_error&) libs/chrono/src/posix/chrono.cpp:31: warning: suggest parentheses around ‘&&’ within ‘||’ In file included from ./boost/type_traits.hpp:42, from ./boost/ratio.hpp:38, from ./boost/chrono/chrono.hpp:73, from libs/chrono/src/chrono.cpp:14: ./boost/type_traits/is_convertible.hpp: At global scope: ./boost/type_traits/is_convertible.hpp: In instantiation of ‘const bool boost::detail::is_convertible_basic_impl<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >&, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::value’: ./boost/type_traits/is_convertible.hpp:295: instantiated from ‘const bool boost::detail::is_convertible_impl<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::value’ ./boost/type_traits/is_convertible.hpp:418: instantiated from ‘boost::is_convertible<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >’ ./boost/utility/enable_if.hpp:36: instantiated from ‘boost::enable_if<boost::is_convertible<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >, void>’ libs/chrono/src/posix/chrono.cpp:31: instantiated from here ./boost/type_traits/is_convertible.hpp:136: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/type_traits/is_convertible.hpp: In instantiation of ‘const bool boost::detail::is_convertible_basic_impl<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >&, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::value’: ./boost/type_traits/is_convertible.hpp:295: instantiated from ‘const bool boost::detail::is_convertible_impl<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::value’ ./boost/type_traits/is_convertible.hpp:418: instantiated from ‘boost::is_convertible<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >’ ./boost/utility/enable_if.hpp:36: instantiated from ‘boost::enable_if<boost::is_convertible<boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >, void>’ libs/chrono/src/posix/chrono.cpp:31: instantiated from here ./boost/type_traits/is_convertible.hpp:136: warning: initializing argument 1 of ‘static boost::type_traits::yes_type boost::detail::checker<T>::_m_check(T, int) [with T = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’ In file included from libs/chrono/src/chrono.cpp:14: ./boost/chrono/chrono.hpp: In copy constructor ‘boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::time_point(const boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >&)’: ./boost/chrono/chrono.hpp:838: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp:838: warning: suggest parentheses around ‘&&’ within ‘||’ In file included from libs/chrono/src/chrono.cpp:40: libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::system_clock::now()’: libs/chrono/src/posix/chrono.cpp:31: note: synthesized method ‘boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::time_point(const boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >&)’ first required here libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::system_clock::now(boost::system::error_code&)’: libs/chrono/src/posix/chrono.cpp:39: error: no matching function for call to ‘boost::system::error_code::assign(int&, const boost::system::error_category& (&)())’ ./boost/system/error_code.hpp:326: note: candidates are: void boost::system::error_code::assign(int, const boost::system::error_category&) libs/chrono/src/posix/chrono.cpp:45: warning: suggest parentheses around ‘&&’ within ‘||’ libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::system_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::system_clock::from_time_t(time_t)’: libs/chrono/src/posix/chrono.cpp:55: warning: suggest parentheses around ‘&&’ within ‘||’ libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::monotonic_clock::now()’: libs/chrono/src/posix/chrono.cpp:66: error: no matching function for call to ‘boost::system::system_error::system_error(int&, const boost::system::error_category& (&)(), const char [24])’ ./boost/system/system_error.hpp:43: note: candidates are: boost::system::system_error::system_error(int, const boost::system::error_category&, const char*) ./boost/system/system_error.hpp:39: note: boost::system::system_error::system_error(int, const boost::system::error_category&, const std::string&) ./boost/system/system_error.hpp:36: note: boost::system::system_error::system_error(int, const boost::system::error_category&) ./boost/system/system_error.hpp:33: note: boost::system::system_error::system_error(boost::system::error_code, const char*) ./boost/system/system_error.hpp:30: note: boost::system::system_error::system_error(boost::system::error_code, const std::string&) ./boost/system/system_error.hpp:27: note: boost::system::system_error::system_error(boost::system::error_code) ./boost/system/system_error.hpp:25: note: boost::system::system_error::system_error(const boost::system::system_error&) libs/chrono/src/posix/chrono.cpp:70: warning: suggest parentheses around ‘&&’ within ‘||’ In file included from libs/chrono/src/chrono.cpp:14: ./boost/chrono/chrono.hpp: In copy constructor ‘boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::time_point(const boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >&)’: ./boost/chrono/chrono.hpp:838: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp:838: warning: suggest parentheses around ‘&&’ within ‘||’ In file included from libs/chrono/src/chrono.cpp:40: libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::monotonic_clock::now()’: libs/chrono/src/posix/chrono.cpp:70: note: synthesized method ‘boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >::time_point(const boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > >&)’ first required here libs/chrono/src/posix/chrono.cpp: In static member function ‘static boost::chrono::time_point<boost::chrono::monotonic_clock, boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> > > boost::chrono::monotonic_clock::now(boost::system::error_code&)’: libs/chrono/src/posix/chrono.cpp:78: error: no matching function for call to ‘boost::system::error_code::assign(int&, const boost::system::error_category& (&)())’ ./boost/system/error_code.hpp:326: note: candidates are: void boost::system::error_code::assign(int, const boost::system::error_category&) libs/chrono/src/posix/chrono.cpp:84: warning: suggest parentheses around ‘&&’ within ‘||’ In file included from libs/chrono/src/chrono.cpp:14: ./boost/chrono/chrono.hpp: In constructor ‘boost::chrono::time_point<Clock, Duration>::time_point(const Duration&) [with Clock = boost::chrono::system_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’: libs/chrono/src/posix/chrono.cpp:31: instantiated from here ./boost/chrono/chrono.hpp:851: warning: suggest parentheses around ‘&&’ within ‘||’ libs/chrono/src/posix/chrono.cpp:31: instantiated from here ./boost/chrono/chrono.hpp:851: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp: In constructor ‘boost::chrono::time_point<Clock, Duration>::time_point() [with Clock = boost::chrono::system_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’: libs/chrono/src/posix/chrono.cpp:40: instantiated from here ./boost/chrono/chrono.hpp:850: warning: suggest parentheses around ‘&&’ within ‘||’ libs/chrono/src/posix/chrono.cpp:40: instantiated from here ./boost/chrono/chrono.hpp:850: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp: In member function ‘Duration boost::chrono::time_point<Clock, Duration>::time_since_epoch() const [with Clock = boost::chrono::system_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’: libs/chrono/src/posix/chrono.cpp:50: instantiated from here ./boost/chrono/chrono.hpp:864: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp: In constructor ‘boost::chrono::time_point<Clock, Duration>::time_point(const Duration&) [with Clock = boost::chrono::monotonic_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’: libs/chrono/src/posix/chrono.cpp:70: instantiated from here ./boost/chrono/chrono.hpp:851: warning: suggest parentheses around ‘&&’ within ‘||’ libs/chrono/src/posix/chrono.cpp:70: instantiated from here ./boost/chrono/chrono.hpp:851: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp: In constructor ‘boost::chrono::time_point<Clock, Duration>::time_point() [with Clock = boost::chrono::monotonic_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’: libs/chrono/src/posix/chrono.cpp:79: instantiated from here ./boost/chrono/chrono.hpp:850: warning: suggest parentheses around ‘&&’ within ‘||’ libs/chrono/src/posix/chrono.cpp:79: instantiated from here ./boost/chrono/chrono.hpp:850: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp: In static member function ‘static boost::chrono::duration<Rep, Period> boost::chrono::duration<Rep, Period>::zero() [with Rep = long int, Period = boost::ratio<1l, 1000000000l>]’: ./boost/chrono/chrono.hpp:850: instantiated from ‘boost::chrono::time_point<Clock, Duration>::time_point() [with Clock = boost::chrono::system_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’ libs/chrono/src/posix/chrono.cpp:40: instantiated from here ./boost/chrono/chrono.hpp:585: warning: suggest parentheses around ‘&&’ within ‘||’ ./boost/chrono/chrono.hpp:850: instantiated from ‘boost::chrono::time_point<Clock, Duration>::time_point() [with Clock = boost::chrono::system_clock, Duration = boost::chrono::duration<long int, boost::ratio<1l, 1000000000l> >]’ libs/chrono/src/posix/chrono.cpp:40: instantiated from here ./boost/chrono/chrono.hpp:585: warning: suggest parentheses around ‘&&’ within ‘||’ In file included from libs/chrono/src/chrono.cpp:40: ./boost/system/error_code.hpp: At global scope: ./boost/system/error_code.hpp:214: warning: ‘boost::system::posix_category’ defined but not used ./boost/system/error_code.hpp:215: warning: ‘boost::system::errno_ecat’ defined but not used ./boost/system/error_code.hpp:216: warning: ‘boost::system::native_ecat’ defined but not used "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_USES_STATIC_ASSERT -DBOOST_RATIO_USES_STATIC_ASSERT -DBOOST_SYSTEM_DYN_LINK=1 -DNDEBUG -I"." -c -o "build/boost/bin.v2/libs/chrono/build/gcc-4.4.3/release/threading-multi/chrono.o" "libs/chrono/src/chrono.cpp" ...failed gcc.compile.c++ build/boost/bin.v2/libs/chrono/build/gcc-4.4.3/release/threading-multi/chrono.o... ...failed updating 1 target... ...updated 328 targets...

5 15

[python] division operator in 3.1
by Trigve Siver 09 Aug '10

09 Aug '10

Hi, I've found bug in boost python with division operator. Division operator with custom types doesn't work with python 3.1. It is because there were some changes in this regard in python 3. I've created ticket with patch https://svn.boost.org/trac/boost/ticket/4497 . Can somebody look at it? Thanks Trigve

3 3

[1.44] Release notes
by Daniel James 09 Aug '10

09 Aug '10

Hello, If you haven't done so yet, with the beta coming out it's a good time to add your entries to the release notes so that people know what to test. You can edit the file in subversion here: http://svn.boost.org/svn/boost/website/public_html/beta/feed/history/ Or if you prefer, you can email me the details and I'll add it for you. If you're able to build the release notes, I better warn you that I've changed the build system a little. Recent versions of quickbook are generating slightly different mark up, and if that's used for old entries, they can appear as new in rss feeds. So to avoid that, it now stores a hash of the quickbook files to only update their entry if the source changes. It should just work, you just need to commit the '*-hashes.txt' files at the same time as the rss files. If you want to force an update, you can delete the appropriate line in the text file. thanks, Daniel

5 7

[mpl] BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF
by Edward Diener 09 Aug '10

09 Aug '10

I found the BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF macro in the latest has_xxx.hpp of mpl on the trunk. Is BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF ( and its corresponding BOOST_MPL_HAS_XXX_TEMPLATE_DEF ) scheduled to be added to Boost in an upcoming release ? I find it useful for TMP introspection in much the same way as BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF ( and its corresponding BOOST_MPL_HAS_XXX_TRAIT_DEF ).

5 10

Re: [boost] [GIL] color convert and color tranfer characteristics
by Fabien Castan 09 Aug '10

09 Aug '10

> Interesting! I would be interested in those implementation for the > toolbox extension. Let me know if you're interested submitting. I can > help out when needed. yes sure. > I'm not sure I follow here. Small code sample possible? You can see the code, it's just the beginning...: http://github.com/nrondaud/TuttleOFX/blob/master/plugins/image/process/colo… You can also see: * some utilities on gil we use (some are only a copy of standard functions adding a progress structure to get progress informations) and others needs a big clean: http://github.com/nrondaud/TuttleOFX/tree/master/libraries/tuttle/src/tuttl… * a copy of boost_gil_extensions with some modifications, in progress too: http://github.com/nrondaud/TuttleOFX/tree/master/3rdParty/boost_gil_extensi… > Right now color_convert doesn't supply passing the rgb_to_luminance > algorithm. But I 'm not sure if that's needed for your case. When you > use the algorithm copy_and_convert_pixels algorithm you pass as the > third parameter the color converter. In your case just define your own > color converter. Yes, but inside a templated function using abstract colors it's not always easy to do. Regards, Fabien

2 1

awesome visualization of Boost SVN repo
by Kenny Riddile 09 Aug '10

09 Aug '10

So I just discovered Gource ( http://code.google.com/p/gource/ ) and it is an absolutely amazing little program. I downloaded and converted the SVN log file for the Boost trunk repository and it was mesmerizing to watch Boost grow before my eyes over the course of 10 years. To save others the time and trouble, I've attached the converted log file so everyone can check it out. Just run: gource --log-format custom boost_gource.log or gource -WIDTHxHEIGHT -f --log-format custom boost_gource.log for full-screen. Have fun :) -Kenny Riddile

4 3

[intrusive] recursive intrusive data structures
by Tim Blechmann 09 Aug '10

09 Aug '10

hi all, is there an easy way to define recursive data structures? something like: struct my_node: boost::intrusive::list_base_hook<> { boost::intrusive::list<my_node> children; }; i am currently using a base class as helper, which causes very dirty code, since i explicitly need to cast from the base to the main class all over the place: struct my_node_base: boost::intrusive::list_base_hook<> {}; struct node: my_node_base { boost::intrusive::list<my_node_base> children; }; thanks, tim -- tim(a)klingt.org http://tim.klingt.org Life is really simple, but we insist on making it complicated. Confucius

2 4

Jamroot changes
by Vladimir Prus 09 Aug '10

09 Aug '10

Folks, I have just checked in a big refactoring of Jamroot. Over the time it has grown too big and too unstructured, so I've added a new module, boostcpp, and moved most of the scary logic there, also clarying that logical blocks. I have tested the changes the best I could, but it is possible something still breaks. So, if you observe some strange behaviour when building trunk, you might want to immediately report that to me. Thanks, Volodya

1 0

Re: [boost] [GIL] color_convert
by fabien.castan＠free.fr 08 Aug '10

08 Aug '10

Hi Christian, > Only for rgba gil is using partial specialization since it's using the > rgb equivalent to do the wanted conversion. I think it's best to stick > with total specialization to avoid confusions and/or breaking other > people's code. > >> The goal of creating this generic conversion is that I can still make the conversion using an intermediate rgb colorspace if there is no specialization. > I think I just said that. ;-) For me, we can do that for all colorspaces. Sorry, I'm not sure to understand your position. You are agree to remove total specialization, even for rgba ? Are you agree to create a generic conversion from Colorspace to C2 for all colorspaces ? default_color_converter_impl<C1,rgba_t> // to remove default_color_converter_impl<rgba_t,C2> // do the same thing for all colorspace > Even when converting from gray to cmyk you wanna create a temporary > rgb value? I believe this is a bad idea for various reasons. Please > correct me when I'm wrong. I think there is only two problems: * approximation * performance But if we want to correct these problems we have only to create the missing specialization. So I don't see any problem. It's always interesting to have all conversions. I don't think we will have a specialization to make the conversion from hsl to cmyk in a near futur. So in these cases propose a solution with approximation and performance cost sounds good to me. And it works fine with user custom colorspaces. Regards, Fabien

2 1

[1.44.0][Math] Requesting permission to merge to release.
by John Maddock 08 Aug '10

08 Aug '10

If possible, I'd like to fix this issue: https://svn.boost.org/trac/boost/ticket/4504 for the final 1.44 release. The fix is trivial: https://svn.boost.org/trac/boost/changeset?reponame=&new=64597%40trunk%2Fbo… but the actual bug manifests as a rather nasty numerical error. There's also a related patch to update the tests, which is slightly more risky in that it adds many new test cases: https://svn.boost.org/trac/boost/changeset?reponame=&new=64597%40trunk%2Fli…. Is it acceptable to merge these to release at this late stage? Thanks, John.

2 4

[bcp] Bcp namespace rename on 1.44 release beta 1 causes runtime errors on range lib and build tool
by Cliff Green 08 Aug '10

08 Aug '10

John (and others), I just tested a full Boost extract with namespace rename (and namespace alias) on 1.44 release beta 1. After bootstrap building bjam from the distribution, I built bcp and then attempted to extract all of Boost (libs and tools) with namespace rename and alias (this time using "." to extract everything). I'm getting runtime errors from bcp: **** exception(200): Invalid parameter detected by C runtime library I've isolated it down to one library and one tool - the range library, and the build tool. All other libraries and tools individually successfully extract (with namespace rename). I tried doing a Boost root library build (with bjam) after the extract, but missing critical pieces of build is causing problems (which makes sense). I assume this is a high pri (at least the build tools part), so I'll be happy to help in any way. Cliff

2 4

[config] Support for variadic macros
by Edward Diener 07 Aug '10

07 Aug '10

What is the boost macro which can be used to determine whether or not a compiler supports variadic macros ? I looked at the config macros but could not find the necessary macro documented there.

4 12

[proto][1.43] Problem with proto::matches
by Antoine de Maricourt 07 Aug '10

07 Aug '10

Hi Eric, I went into the following error with a grammar using terminals of T[N] (terminal<int[2]> in the example, gcc 4.5.0, boost 1.43): /usr/local/include/boost/proto/matches.hpp:1026:13: error: ambiguous class template instantiation for struct boost::proto::detail::lambda_matches<int [2], boost::proto::wildcardns_::_, -0x00000000000000001l> /usr/local/include/boost/proto/matches.hpp:119:13: error: candidates are: struct boost::proto::detail::lambda_matches<T, boost::proto::wildcardns_::_, -0x00000000000000001l> /usr/local/include/boost/proto/matches.hpp:129:13: error: struct boost::proto::detail::lambda_matches<T [M], U, -0x00000000000000001l> Adding the following specialization in matches.hpp solves it: template<typename T, std::size_t M> struct lambda_matches<T[M], proto::_ BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(-1)> : mpl::true_ {}; Best regards, Antoine

2 4

[config] Configuratiion support for variadic macro
by Edward Diener 07 Aug '10

07 Aug '10

Should not Boost have a configuration macro indicating compilers which have support for variadic macros ?

1 0

[1.44][beta] Patch for missing header in boost/random/subtract_with_carry.hpp
by Denis Arnaud 07 Aug '10

07 Aug '10

Hello, following is a small patch to fix a compilation issue with boost/random/subtract_with_carry.hpp: ------------------------------------------------------------------------------------- --- a/boost/random/subtract_with_carry.hpp +++ b/boost/random/subtract_with_carry.hpp @@ -30,7 +30,7 @@ #include <boost/random/detail/seed.hpp> #include <boost/random/detail/operators.hpp> #include <boost/random/linear_congruential.hpp> - +#include <boost/random/detail/generator_seed_seq.hpp> namespace boost { namespace random { ------------------------------------------------------------------------------------- That issue has been spotted by Fedora packagers in the building of the QuantLib library: https://bugzilla.redhat.com/show_bug.cgi?id=621631 Could someone add that patch to the 1.44 branch? Thanks in advance Best Regards Denis

3 2

[bcp] Enhancements to bcp extract and namespace rename
by Cliff Green 06 Aug '10

06 Aug '10

John, as promised, here's a couple of enhancement requests to bcp, relative to namespace renaming. I know time can be (very) limited, so I'll help in any way I can, or maybe we can see if someone is looking for a relatively small contribution they can make to Boost, in a useful utility. I can file trac tickets, if you'd like (I haven't before, so will need to look at the process). First, a statement of project needs (and I would expect others have similar needs): --- My workgroup provides software libraries (using Boost) to another group (this is within a large aerospace company in the Seattle area) that also uses Boost. Unfortunately the Boost versions can be (and typically are) different. Both sets of software (libraries) are compiled into the same executable. The namespace rename feature of bcp allows multiple versions of Boost to co-exist in the same executable. The one restriction is that for a given translation unit (.cpp file), the same version of Boost must be used. (I know Artyom, I believe, also has a tool that allows multiple versions of Boost even in the same translation unit, but this is not something we need, and I would guess is a corner case for most developers.) Enhancement requests: -- I couldn't find a way to "wildcard" extract and rename all Boost libraries. I ended up performing the extract / rename one-by-one. I suppose I could generate a list of the libraries and compose an invocation of bcp with all libraries explicitly listed (assuming command line buffers won't be exhausted), or write a script to do this, but it seems that it wouldn't be hard for bcp to do it inside the code. -- Related to above, when extracting (and renaming) one-by-one, the same dependent libraries are copied out (and overwritten) over and over. With a "wildcard" (or "full list of libraries") I assume that shared dependent libraries would only be copied once. -- Related to above, if there's a "full copy, rename namespace for all libraries" facility, managing multiple shared dependent libraries becomes a moot point, since all libraries will be copied (dependent or not). And related to this is copying the few remaining non-source files that make up a release. So it comes down to using bcp not to extract a subset of dependent libraries, but instead to perform a full copy of a release, renaming namespaces in source code as appropriate. What do you think? Again, thanks for the quick and excellent help, Cliff

3 3

SVN either down or slowing to a crawl?
by John Maddock 06 Aug '10

06 Aug '10

Anyone any ideas? SVN has been almost impossibly slow the last few days, and today I can't connect at all :-( Cheers, John.

6 9

[Boost] [Random] reproducing numbers generated by R.
by Ronan Trépos 06 Aug '10

06 Aug '10

Dear Boost community, For validity concerns, I'm trying to reproduce pseudo random numbers generated by the sofware R with boost::random library. The R default number generator is the Mersenne-Twister with period 2^19937 -1 . 1. In R I tried : > set.seed(13) > runif(1) 0.7103224 2. With boost I tried : boost::mt19937 rng(13); boost::uniform_01<boost::mt19937> zeroone(rng); std::cout << zeroone() << std::endl; 0.777702 Has someone already experienced that ? Is it possible to reproduce the same numbers ? Maybe the mismatch comes from the fact that generated integers are translated into [0;1).. Thanks, Ronan Trépos -- Trépos Ronan INRA unité BIA, équipe MAD, Toulouse http://carlit.toulouse.inra.fr/wikiz/index.php/Ronan_TREPOS tel : 05 61 28 53 34

2 2

[website] Documentation up again.
by Daniel James 06 Aug '10

06 Aug '10

Hi, The documentation should be up again now, although only for the last two versions of boost. Daniel

1 0

docs website unaccessible
by Andrey Asadchev 06 Aug '10

06 Aug '10

hello I seem to be getting access forbidden for any file in http://www.boost.org/doc/

2 1

[preprocessor] Can it be used with C?
by Andy Venikov 06 Aug '10

06 Aug '10

It's not explicitly stated in the documentation, but since the preprocessor is supposed to be the same between C++ and C, can boost.preprocessor be used in C code? Thanks, Andy.

2 1

[offtopic] cygwin and wchar
by Eric Niebler 05 Aug '10

05 Aug '10

I see that the cygwin toolset now expects wchar support, and I've heard that cygwin does indeed support wchar now, but I don't know what I need to do to get it. Simply running the cygwin installer and letting it update everything doesn't seem to do the trick. Help? -- Eric Niebler BoostPro Computing http://www.boostpro.com

5 10

[1.44] Beta release candidate available
by Beman Dawes 05 Aug '10

05 Aug '10

Release candidate files for the 1.44.0 beta are available at http://boost.cowic.de/rc/ As always, the release managers appreciate it if you download the candidate of your choice and give it a try. Report both success and failure. I'm concerned about the number of failures showing for Build, Python, and Thread libraries. See http://beta.boost.org/development/tests/release/developer/summary.html. We need to fix those before the final release, but I don't want to hold the beta up any more. Thanks, --Beman

7 12

[GIL] color convert and color tranfer characteristics
by fabien.castan＠free.fr 05 Aug '10

05 Aug '10

Hi, I have a problem with the distinction between colorspaces and color characteristics. I'm writing a basic transfer characteristics between lin, log, sRGB, rec601, rec709... I'm writing something like I talked for colorspaces, in the mail about "color_correct": * a specialization between each color characteristic and lin * a generic conversion to a templated type using an intermediate lin conversion I have two problems: 1) I have written a per channel functor, which seems to be the right way. But I don't know how to not apply it on the alpha channel if there is an alpha channel... without loosing performances because my common usage is rgba :). 2) I don't know how we can connect this with color_convert, because if we want to make a conversion from RGB to gray, we have to assume that RGB is linear (?) and we need to precise if we want a rec709 or rec601 luminosity... GIL code use an approximation of Rec601 to compute the luminance. Y' = 0.299 R' + 0.587 G' + 0.114 B' (Rec. 601 coefficients) Y' = 0.2126 R' + 0.7152 G' + 0.0722 B' (Rec. 709 coefficients) Best regards, Fabien

2 1

Re: [boost] [GIL] color_convert
by fabien.castan＠free.fr 05 Aug '10

05 Aug '10

Hi, > I cannot recreate your problem. Here is a little test app that works > fine on my machine ( VC10 ) The problem is that I define a generic conversion like that: /// \ingroup ColorConvert /// \brief Converting HSL to any pixel type. Note: Supports homogeneous pixels only. /// /// Done by an intermediate RGB conversion template <typename C2> struct default_color_converter_impl<hsl_t,C2> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef hsl_t C1; typedef typename channel_type<P1>::type T1; typedef typename channel_type<P2>::type T2; pixel<T2,rgb_layout_t> tmp; default_color_converter_impl<C1,rgb_t>()(src, tmp); default_color_converter_impl<rgb_t,C2>()(tmp, dst); } }; So it's in conflict with: template <typename C1> struct default_color_converter_impl<C1, rgba_t>, if I use color_convert( hslPixel, rgbaPixel ). The goal of creating this generic conversion is that I can still make the conversion using an intermediate rgb colorspace if there is no specialization. I think we can have a good solution, if we apply this method to all colorspaces: * define a generic conversion to another colorspace using an intermediate rgb colorspace conversion, only in one direction MyColorspace -> typename C2 (so without typename C1 -> MyColorspace). That's why I would like to remove typename C1 -> rgba_t implementation. * redefine the conversion for colorspaces we want to make a direct conversion

2 1

Re: [boost] Checking library binary compatibility with respect tocompile time options [repost\
by Robert Ramey 05 Aug '10

05 Aug '10

I notice that the link I sent to a respond to the above didn't handle the attachments well. So here they are again. Robert Ramey Original post from back in may Turns out that the idea of a single boost library deployment has come up a couple of times here at BoostCon 2010. While preparing my presentation I considered the problem of what would happen if one installed one library which depended on an newer version of a different library than the user already had installed. I actually woke up in the middle of the night imagining someone would ask about that during my talk. I puzzled about it for some time and the day before I found a way to address it - in my own mind at least. It also seems that it turns out that there are tools that can also manage this. It's not that I don't trust tools but I wear a belt AND suspenders. So I would like a method which guarentees that when I build one library, I don't accidently include code from a prerequisite library which is a version so old that things won't work. I would also like to know that I'm not accidently running with a DLL built with an old version. Basically each library includes a file "manifest.hpp". This get's included when any header get's includes (once at most due to include guards). This includes a static assert that checks that the prequiste libraries are of sufficiently recent version that a dependent library (or user application) requires. There is also a manifest.cpp file included in the library which checks any prequiste DLLS. This would be an exheedingly small overhead to avoid what could be an incredibly large headache. I just verified that the code compiles so at this point it's only an idea. But it seems that some kind of check like this is un-avoidable of one want's to deploy libraries as needed rather than as a monolithic distribution. FYI - no one asked me about this problem at my presentation. Add one more confirmation of Murphy's law. Robert Ramey

2 1

Re: [boost] [GIL] kth_channel_view
by fabien.castan＠free.fr 05 Aug '10

05 Aug '10

Hi, Yes, it works fine without const. I used const automatically because I don't write in my image but I don't think it changes something. So without seems to be better because it's not the correct way to deal with const inside gil. I don't know how we can declare a parameter to be a const view... For example a simple function that takes an image v and returns if it contains a pixel p: template<class MyGilConstView> bool f( const MyGilConstView& v, const MyGilConstView::value_type& p ); This function can't garantee that it doesn't modify the image v and the pixel p. I can create a const view at the begining of the function, to get this garantee, like this: typedef MyGilConstView::const_t MyGilReallyConstView; typedef MyGilReallyConstView::value_type MyGilReallyConstPixel; // as there is no const_t typedef in pixel type... MyGilReallyConstView cv = v; MyGilReallyConstPixel cp = p; Is it correct ? Is there a better way to do it ? Regards, Fabien PS: maybe a "typedef value_type pixel_t" inside the view class can be a good thing for readability ?

2 1

Checking library binary compatibility with respect to compile time options
by joel falcou 05 Aug '10

05 Aug '10

I was pondering how to event or at least warn users when they use a .a compiled with a set of define with an application compiled with divergent options (like having different -D that may cause ODR violation). On IRC, I was linked to this page for MSVC 10: http://msdn.microsoft.com/en-us/library/ee956429.aspx That defiens some pragma that exactly do that. However, it's MSVC 10 specific. After a few brainstorming, we ended up with a simple solution to emulate this. The code source is here: http://dl.dropbox.com/u/3819406/lib_check.tar.gz Here is a use case: g++ -c foo.cpp -o foo.o -I/usr/local/include/boost-1_43 -DGOOD_LIB g++ -c main.cpp -o bmain.o -I/usr/local/include/boost-1_43 -DBAD_LIB -I./ g++ -c main.cpp -o gmain.o -I/usr/local/include/boost-1_43 -DGOOD_LIB -I./ Here, we compiel foo with some settings and try to link it with two different setup for main.o The gcc output, showing the divergence in option is detected: g++ bmain.o foo.o -o bmain bmain.o: In function `__static_initialization_and_destruction_0(int, int)': main.cpp:(.text+0x2a): undefined reference to `boost::config::test_library_version_mismatch_with_version_being_2()' collect2: ld returned 1 exit status Of course, when you link the good pair of .o : g++ gmain.o foo.o -o gmain Nothing happens I guess some details need to be hammered out like visibility and such but could this be a valuable addition to boost (liek boost config for example) or have I overengineered something useless ? Regards

4 4

Quasi-random number generators
by Justinas V. Daugmaudis 05 Aug '10

05 Aug '10

Dear fellow boosters, As the time goes on, the soft pencils down date for the Google Summer of Code project is approaching. For this date the development has to cease, only maintenance work and/or doc writing continues. I invite anyone interested into quasi-random number generators to review the work done at http://svn.boost.org/svn/boost/sandbox/SOC/2010/quasi_random/ Steven Watanabe has been a great mentor, providing guidance when it was needed and, more importantly, avoiding the common pitfall of turning into a pointy-haired boss. You rock, Steven! -- Kind regards, Justinas V. Daugmaudis

1 0

Cache flushing in the constructors
by Sid Sacek 05 Aug '10

05 Aug '10

I've been struggling with these thoughts lately, and am curious how the boost "class" writers deal with it, or if there's any problem at all to begin with. If I want to write a boost class that's going to be compiled for all the supported CPU types, do I have to perform a core-cache flush at the end of my class constructors? I know that there are the "Strong Memory Model" CPU's out there, like the Intel x86 cores, that auto-magically take care of cache-coherency for you, and the "Weak Memory Model" CPU's where the code has to do all of the work for cache-coherency. When developing a boost class that's going to be an object that's used in multi-threaded applications; do these classes use some BOOST utility to performs cache flushes on the newly constructed objects, or am I just thinking about this in the wrong way, which I'm starting to believe is true. I'm new to thinking about these things, and my head hurts! Your views would be appreciated. Thanks, -Sid

5 9

Cannot close ticket #2373
by Christian Henning 04 Aug '10

04 Aug '10

Hi there, it's been a while since I used trac. When I updated ticket #2373 there were no option for closing the ticket. Do I have to login somewhere? My username is chhenning Regards, Christian

2 3

[bcp] Bcp namespace rename causes compile errors on multiple libraries (type_traits, range, spirit, foreach, regex, iostreams) in 1.43
by Cliff Green 04 Aug '10

04 Aug '10

Has bcp namespace renaming been tested against all Boost libraries in 1.43? I'm getting compile errors in (or caused by) the following libraries: type_traits, range, spirit, foreach, regex, iostreams (more details later in this message). The compile errors are from a full bjam build of Boost. I haven't compiled tests or built against my work project code, so I suspect there's more errors in header-only libraries. I'm using g++ 4.1.2 on Linux (although these errors are not compiler specific - I'll also be compiling with VC++ 8.0 at some point). All of these errors are easily fixed, and are "boost" text substitution problems. I was able to get all libraries to build after my changes, but I would rather not use hacked-up source (I prefer to work with the Boost developers and install non-modified Boost source into our Clearcase COTS VOB). However, with these (obvious) compile errors, I'm wondering if the bcp namespace facilities are being tested with all Boost libraries? If not, can I work with John Maddock or someone to set up a test process? Besides doing a full extract / rename and build of the libraries, as many examples and tests as possible should also be compiled to find errors in header-only libraries not brought in to the library source build. Of course it's possible all of the errors I've found have been introduced with new code in 1.43 (which still brings up the need to do a full bcp test before a Boost release), or that I somehow incorrectly used bcp, or there's fixes that haven't been applied to the mainline in SVN. My use case is a perfect fit for the bcp namespace facilities - my work team delivers an SDK (which links to and uses various Boost libraries) to another group which also links to and uses Boost libraries in their own application (everything builds into the same executable). Currently our work team is constrained to using the same Boost version, but we'd like to break this constraint (in particular, for other groups to use our SDK). We use (or will use) enough Boost libraries that bcp on the ones we care about pulls in about 80% of Boost, so I went ahead and ran bcp on all of Boost. Details of the compile failures: -- In type_traits: integral_promotion.hpp, promote.hpp, floating_point_promotion.hpp, header guard probs - original code #ifndef FILE_boost_type_traits_integral_promotion_hpp_INCLUDED #define FILE_boost_type_traits_integral_promotion_hpp_INCLUDED After running bcp with "MyProj_Boost" for the namespace, the header guard is: #ifndef FILE_boost_type_traits_integral_promotion_hpp_INCLUDED #define FILE_MyProj_Boost_type_traits_integral_promotion_hpp_INCLUDED -- In range/config.hpp there's two macros where bcp namespace substitution is incorrectly being applied to the "boost" prefix in boost_range_array: #define BOOST_RANGE_ARRAY_REF() (boost_range_array) #define BOOST_RANGE_ARRAY_REF() (&boost_range_array) Similarly, in range/detail/implementation_help.hpp, the following lines have incorrect substitution: boost_range_silence_warning( boost_range_array ); -- In Phoenix and Wave, there's a bit of namespace substitution problems, where "namespace phoenix" (in multiple files, such as spirit/home/classic/phoenix) is being replaced with "MyProjectphoenix", and in wave/grammars/cpp_intlit_grammer.hpp and cpp_chlit_grammar.hpp there's "namespace phx=phoenix". -- In regex/v4/regex_traits.hpp: BOOST_MPL_HAS_XXX_TRAIT_DEF(boost_extensions_tag) The "boost" prefix in boost_extensions_tag is improperly substituted. -- In foreach.hpp, "boost_foreach_argument_dependent_lookup_hack_value" is not substituted in the enum, but in macros where the enum is used, the substitution is occurring. In iostreams/close.hpp, close_boost_stream on line 143 is being improperly substituted. --- As already mentioned, there's easy changes for each of these. But, is a better answer to make the bcp search and substitution smarter? (I have no idea how easy or hard that would be.) Cliff

3 5

[GIL] color_convert
by fabien.castan＠free.fr 04 Aug '10

04 Aug '10

Hi, I use the GIL extension: HSL. I need to make conversions from hsl to other colorspaces. So I define generic default conversion using intermediate rgb colorspace. I define 2 templates: * default_color_convert<C1,hsl_t> * default_color_convert<hsl_t,C2> But it creates an ambiguity with rgba_t, because it defines the same thing for rgba_t: * default_color_convert<C1,rgba_t> * default_color_convert<rgba_t,C2> So default_color_convert<hsl_t,rgba_t> is ambiguous. The only solution I see is: * to remove default_color_convert<C1,rgba_t> * to define gray_t->rgba_t, rgb_t->rgba_t * to remove default_color_convert<C1,hsl_t> * to define default_color_convert<cmyk_t,C2> So all colorspaces have to: * define a generic conversion to another colorspace using an intermediate rgb colorspace conversion * redefine the conversion for colorspaces we want to make a direct conversion Best regards, Fabien Castan /// \ingroup ColorConvert /// \brief Converting CMYK to any pixel type. Note: Supports homogeneous pixels only. /// /// Done by an intermediate RGB conversion template <typename C2> struct default_color_converter_impl<cmyk_t,C2> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef cmyk_t C1; typedef typename channel_type<P1>::type T1; typedef typename channel_type<P2>::type T2; pixel<T2,rgb_layout_t> tmp; default_color_converter_impl<C1,rgb_t>()(src, tmp); default_color_converter_impl<rgb_t,C2>()(tmp, dst); } }; /* /// \ingroup ColorConvert /// \brief Converting any pixel type to RGBA. Note: Supports homogeneous pixels only. template <typename C1> struct default_color_converter_impl<C1,rgba_t> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef typename channel_type<P2>::type T2; pixel<T2,rgb_layout_t> tmp; default_color_converter_impl<C1,rgb_t>()(src,tmp); get_color(dst,red_t()) = get_color(tmp,red_t()); get_color(dst,green_t())= get_color(tmp,green_t()); get_color(dst,blue_t()) = get_color(tmp,blue_t()); get_color(dst,alpha_t())= channel_convert<T2>(alpha_or_max(src)); } }; */ /// \ingroup ColorConvert /// \brief Converting grayscale pixel type to RGBA. Note: Supports homogeneous pixels only. template <> struct default_color_converter_impl<gray_t,rgba_t> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef gray_t C1; typedef typename channel_type<P2>::type T2; get_color(dst,red_t()) = get_color(src,gray_color_t()); get_color(dst,green_t())= get_color(src,gray_color_t()); get_color(dst,blue_t()) = get_color(src,gray_color_t()); get_color(dst,alpha_t())= channel_convert<T2>(alpha_or_max(src)); } }; /// \ingroup ColorConvert /// \brief Converting grayscale pixel type to RGBA. Note: Supports homogeneous pixels only. template <> struct default_color_converter_impl<rgb_t,rgba_t> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef rgb_t C1; typedef typename channel_type<P2>::type T2; get_color(dst,red_t()) = get_color(src,red_t()); get_color(dst,green_t())= get_color(src,green_t()); get_color(dst,blue_t()) = get_color(src,blue_t()); get_color(dst,alpha_t())= channel_convert<T2>(alpha_or_max(src)); } }; /// \ingroup ColorConvert /// \brief Converting RGBA to any pixel type. Note: Supports homogeneous pixels only. /// /// Done by multiplying the alpha to get to RGB, then converting the RGB to the target pixel type /// Note: This may be slower if the compiler doesn't optimize out constructing/destructing a temporary RGB pixel. /// Consider rewriting if performance is an issue template <typename C2> struct default_color_converter_impl<rgba_t,C2> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef typename channel_type<P1>::type T1; default_color_converter_impl<rgb_t,C2>()( pixel<T1,rgb_layout_t>(channel_multiply(get_color(src,red_t()), get_color(src,alpha_t())), channel_multiply(get_color(src,green_t()),get_color(src,alpha_t())), channel_multiply(get_color(src,blue_t()), get_color(src,alpha_t()))) ,dst); } }; /// \ingroup ColorConvert /// \brief Converting HSL to any pixel type. Note: Supports homogeneous pixels only. /// /// Done by an intermediate RGB conversion template <typename C2> struct default_color_converter_impl<hsl_t,C2> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { typedef hsl_t C1; typedef typename channel_type<P1>::type T1; typedef typename channel_type<P2>::type T2; pixel<T2,rgb_layout_t> tmp; default_color_converter_impl<C1,rgb_t>()(src, tmp); default_color_converter_impl<rgb_t,C2>()(tmp, dst); } }; /// \ingroup ColorConvert /// \brief Unfortunately HSL to HSL must be explicitly provided - otherwise we get ambiguous specialization error. template <> struct default_color_converter_impl<hsl_t,hsl_t> { template <typename P1, typename P2> void operator()(const P1& src, P2& dst) const { static_for_each(src,dst,default_channel_converter()); } };

2 2

[program_options] unknown positional option
by Jeffrey Finkelstein 04 Aug '10

04 Aug '10

Here is some code slightly modified from an example in the documentation for boost::program_options. <code> #include <iostream> #include <vector> #include <string> #include <boost/program_options/positional_options.hpp> #include <boost/program_options/variables_map.hpp> #include <boost/program_options/parsers.hpp> namespace po = boost::program_options; int main(int argc, char ** argv) { po::positional_options_description desc; desc.add("files", -1); std::cout << "Declared positional options." << std::endl; po::variables_map vm; po::store(po::command_line_parser(argc, argv).positional(desc).run(), vm); std::cout << "Stored command line arguments into vm." << std::endl; po::notify(vm); std::cout << "Notified vm that all args have been parsed" << std::endl; std::cout << " num files specified: " << vm.count("files") << std::endl; std::vector<std::string> files = vm["files"].as<std::vector<std::string> >(); for (unsigned int i = 0; i < files.size(); ++i) { std::cout << "file: " << files[i] << std::endl; } return 0; } </code> Linking with version 1.40, the above code, when run with the command line arguments "hello world", produces the following output: <shell> Declared positional options. terminate called after throwing an instance of 'boost::exception_detail::clone_\ impl<boost::exception_detail::error_info_injector<boost::program_options::unkno\ wn_option> >' what(): unknown option files Aborted </shell> Linking with version 1.43, the above code, when run with the command line arguments "hello world", produces the following output: <shell> Declared positional options. Segmentation fault </shell> Am I missing something about how to use positional arguments with this library? I am using Ubuntu 10.04 on x86. The 1.40 version of boost::program_options was installed through the repositories, I compiled the 1.43 version manually. Jeffrey

1 0

Re: [boost] [GIL] kth_channel_view
by fabien.castan＠free.fr 03 Aug '10

03 Aug '10

>A good example of using kth_channel_view is this: > > rgb8_image_t img( 100, 100 ); > typedef typename kth_channel_view_type< 0, const rgb8_view_t>::type view_t; > view_t first = kth_channel_view<0>( const_view( img )); Another interesting possibility is: typedef kth_channel_view_type< 0, const rgb8_view_t> KthChannelView; typename KthChannelView::type first = KthChannelView::make( const_view(img) ); It can be a good thing to directly use channel type, like this: typedef channel_view_type< red_t, const rgb8_view_t>::type view_t; view_t first = channel_view<red_t>( const_view( img )); I have written some code to do that, based on kth_channel_view_type. It's maybe intersting to include in gil. Regards, Fabien namespace boost { namespace gil { template <typename Channel, typename View> struct channel_type_to_index { static const int value = gil::detail::type_to_index< typename color_space_type<View>::type, // color (mpl::vector) Channel // channel type >::type::value; //< index of the channel in the color (mpl::vector) }; template <typename Channel, typename View> struct channel_view_type : public kth_channel_view_type<channel_type_to_index<Channel,View>::value, View> { static const int index = channel_type_to_index<Channel,View>::value; typedef kth_channel_view_type<index, View> parent_t; typedef typename parent_t::type type; static type make(const View& src) { return parent_t::make(src); } }; /// \ingroup ImageViewTransformationsKthChannel template <typename Channel, typename View> typename channel_view_type<Channel,View>::type channel_view(const View& src) { return channel_view_type<Channel,View>::make(src); } }}

2 1

[mpl] has_xxx.hpp potential problem
by Edward Diener 03 Aug '10

03 Aug '10

I am looking at the trunk version of has_xxx.hpp. The macros BOOST_MPL_HAS_MEMBER_TEMPLATE_SUBSTITUTE_PARAMETER and BOOST_MPL_HAS_MEMBER_TEMPLATE_ACCESS appear to be not defined anywhere. This is OK for the first because it is actually not used anywhere to generate code, although it is being passed around to other macros. If it serves no purpose, perhaps it should be removed as it then only serves to obfuscate the code, unless of course there are future plans to define it. The second, however, is being used to generate code in one instance dependent on some version of a compiler, so it needs to be defined somewhere or else an error will occur. Please check this out if this is going into 1.44.

2 2

[asio][thread] asio and future callbacks
by Will Manley 03 Aug '10

03 Aug '10

Hi All I was thinking of implementing a futures service following the asio model of callbacks. This would essentially allow integrating use of futures in the event based model of asio. I would imagine a class like: class futures_service { public: futures_service(io_service& msg_queue); /// Register for a callback when the value contained in that /// future is ready. When the future is ready the handler will /// get posted to the message queue in a manner equivalent to /// calling io_service::dispatch. /// /// Handler should be a functor with the signature: /// void (Future_T&); template <class Future_T, class Handler> void wait_for_async(Future_T future, Handler cb); }; The futures_service could be implemented using the same techniques as boost::wait_for_any (thus would require access to private members of the boost::future classes. I have not come across anything like this in the boost libraries (either in asio or threads). Has this been considered and rejected for some reason? Would boost be interested in it if I were to write it? Which library would it go into, thread or asio? Thanks Will PS. I posted this to the asio and threads lists but got no response so I'm trying here

1 0

[test]Copy-paste error in unit test documentation
by Benoit 03 Aug '10

03 Aug '10

Hi ! Just wanted to tell you that there is a small copy-paste mistake in http://www.boost.org/doc/libs/1_36_0/libs/test/doc/html/utf/user-guide/runt… (and following versions) "Command line argument name : build_info" in tab "detect_memory_leak" should be replaced by "Command line argument name : detect_memory_leak" Keep up the good work ! Benoît

1 0

[Random] make_variate_ref proposal
by Mostafa 03 Aug '10

03 Aug '10

I propose adding a make_variate_ref helper function to Random library to save typing, so I don't have retype the Distribution type twice, and to help with accidentally forgetting to put "&" in the template parameter. Something along the lines of: template<typename Engine, typename Distribution> class boost::variate_generator<Engine &, Distribution &> make_variate_ref(Engine & engine, Distribution & dist) { boost::variate_generator<Engine &, Distribution &> variate(engine, dist); return variate; } What are your thoughts. -Mostafa

2 3

Re: [boost] [MPL] More lazy evaluation, for ease of use?
by jcarey＠jcarey.best.vwh.net 02 Aug '10

02 Aug '10

> On 8/2/2010 09:00 David Abrahams wrote: > > On Jul 31, 2010, at 2:46 PM, Larry Evans wrote: > > The http://groups.yahoo.com/group/boost/files/LazyMPL/ mentioned > > in that post is no longer there. Anybody have a copy they'd > > care to post to vault so other's can have a look? > > Really wanting to close the vault--Anyone can get a GitHub account. > Here's a link: http://github.com/dabrahams/mpl0x/downloads Thanks; Vesa Karvonen's LazyMPL library is exactly the kind of thing that I am looking for. > On 7/31/2010 13:26 David Abrahams wrote: > On Jul 30, 2010, at 6:48 PM, jcarey(a)jcarey.best.vwh.net wrote: > > > > I think it would be helpful if all Sequences, > > Iterators, and Lambda Expressions were also > > nullary Metafunctions returning themselves. > > (In particular, it would be nice if generic > > containers designed for lazy data could > > accommodate Lambda Expressions.) > > Not sure what you mean by that last part, ... LazyMPL supplies some ready-made examples: // boost/lmp/pair.hpp: namespace boost { namespace lmp { template<class L> struct first { typedef typename first<typename L::eval>::eval eval; }; template<class H, class T> struct first<pair<H, T> > { // [***Note the "H::eval", which makes // "first<pair<H, T> >::eval" the same // C++ type as "H::eval". That way we // can use first<pair<H, T> > in place // of H in any lazy context. --John] typedef typename H::eval eval; }; } // boost/lmp/op.hpp: namespace boost { namespace lmp { template<template<class> class F> struct op_1 { // [***Because op_1<F>::eval aliases op1_<F>, // "first<pair<op_1<F>, T> >::eval::template with" // works just like "F". Thus we can put functions // in lazy pairs without any special fuss. --John] typedef op_1 eval; template<class X0> struct with { typedef typename F<X0>::eval eval; }; }; } > but you might have a look at Vesa Karvonen's post: > http://lists.boost.org/Archives/boost/2004/10/74984.php > and the ensuing thread, oh, and the update. Actually, > maybe http://tinyurl.com/lazympl is the best place to look. ... [Omitting performance discussion and sieve example.] Off hand I am not sure what the performance trouble would be; it deserves a deeper look, and I wanted to answer other points right away. Meanwhile, let me just mention that the thread included some questions about strictness analysis; and though it is an oversimplification, I think a rule of thumb one could start off with is: "Pre-evaluate an argument if you know that it will be evaluated before return." -- John

1 0

[context][fiber] context migration
by Charlls Quarra 02 Aug '10

02 Aug '10

Hi, I have a question about context; basically it seems that all the yield functionality can be done by simply calling jump_to on the calling context. is that right? I've also been trying to figure out exactly what functionality does fiber implements on top of it; it seems that fiber migration (to another kernel thread? another process?) is implemented (or eventually will be implemented) here? thanks for any lights on this, Charles J. Quarra

2 1

Any interest in trap_exceptions functionality?
by Andy Venikov 02 Aug '10

02 Aug '10

Hi, I often find myself wanting a generic way to catch and process exceptions. For example, imaging having to export "C" interface from a C++ library. You would create a bunch of extern "C" functions that would invoke the right C++ code. One of the things that needs to be done in every such function is to catch and process all exceptions. Most of the exceptions-handling code would look the same or very similar (the same list of exceptions to catch, same way to handle given exception types). C++ to C is not the only place where you'd need this. Most of the module boundaries might want to trap exceptions. The first thing that developers do in these cases is they start generalizing the handling part. I.e., you'd create a separate function/functor that would handle an exception of a certain kind. Unfortunately it still leaves you with a barage of try/catch() statements in every function that doesn't want to leak exceptions. This creates not only the unpleasant look of a lot of catches (one might argue this point), but it creates a lot of repetition - you need to create catch statement for every exception you want to handle. It would be nice if I could assemble all the exceptions I want to handle (honoring their order) and the way to handle them in one single place under a single object. And then invoke that object on all functions that need to be called. I recently took a crack at this task and came up with a generic way to trap exception. Here's a brief API: trap_exceptions(<list-of-exception-handlers>); The previous line would create a callable object. The parameters are a variable number of exceptions handlers that could be either function pointers, references to functions or functors. One thing they have in common though is the signature: the signature should be "void(T)", where T is the type of the exception that the handler will handle. This "T" type is what the trap_exceptions-created callable object will use in the "catch" statements. Other important notes: the order of handlers is important as this will be the order of "catch" statements (i.e., trap_exceptions(HandleBase, HandleDerived) will hide all Derived exceptions). Whether the exception is caught by reference or by value is also controlled by the handler's signature. Signature "void()" means catch all exceptions indiscriminately. Specifying an empty parameter list will also mean to catch all exceptions indiscriminately. The result of the trap_exceptions call can be assigned to a variable: auto ex_trap = trap_exceptions(HandleEx1, HandleEx2, HandleEx3); //BOOST_AUTO can be used too. And I think it will be possible to use //it without registering HandleEx1 etc.) This object can now be used on multiple functions of any arity and any return type. Functors are supported too. ex_trap(func1); //will create a delayed-call object that upon invocation will call func1 and catch exceptions Ex1, Ex2 and Ex3 So, if func1 has signature int(int, char*, float), then ex_trap(func1)(1, "abc", .5); will call function func1 with the given set of arguments and catch afore-mentioned exceptions. The return type undergoes a significant transformation though. Since the return from this delayed function call now returns more information than before (the additional part being whether an exception has been thrown or not), this additional information is conveyed through the use of boost::optional. In the case of ex_trap+func1, the result will be boost::optional<int>. Functions/functors returning void have a special treatment though since unfortunately it's illegal to instantiate boost::optional<void>. For functions that return void, the return type of the delayed call will be a simple bool. There are some return types that have a special value that indicates "error" and could be used to indicate that an exception occured. In this case, just for convenience purposes, it'll be possible to specify this value and the return type will become the return type of the inner function, not optional<T>. I.e: //Let's say that -1 can be used to indicate that an exception has //occured, then ex_trap(func1, -1)(1, "abc", .5);//will have a return type of int. //-1 will be returned if an exception has been thrown and now all places that had return func1(1, "abc", .5); could simply be replaced with return ex_trap(func1, -1)(1, "abc", .5); //without using boost::optional I think one other use of this functionality can be in functional-style programming in C++. While it's trivial to convert syntactic constructs like "if", "while", "switch", and "for" to functional representations (i.e. if_(f1(), f2(), f3()); which means if (f1()) f2(); else f3(); ), it's a lot harder to create a functional representation of try/catch construct. trap_exceptions is an attempt at that. To illustrate that point more, say we have a tuple (or a fusion-like container) which contains a collection of functions/functors. Using fusion::transform it's possible to add certain qualities to these functions. With trap_exceptions, it'll be possible to add a "no exception leak" quality to this set of functions. Do you think a functionality like that will be useful for boost? Any comments are appreciated. Thanks, Andy. P.S. Currently I implemented this functionality in terms of C++0x. But I think it should be possible to use Boost to make it C++03 compatible.

3 5

Proposal for New Multiple-Precision/ Arbitrary-Precision Numbers Library
by Reetesh Mukul 02 Aug '10

02 Aug '10

Hi, I know the purposes and necessities of a Multiple-Precision and Arbitrary Precision Numbers Library in C++ have echoed many a times in BOOST mail chain. Moreover in past and in present many such efforts have been on to address these needs( Google SoC, XINT, and many others ). I too have a long, consistent interest in this area and so is this proposal. I am putting some of the points in Q & A format. Q. What does Numbers mean here ? A. As a long standing definition, Numbers would mean a “Set”. However for most of the practical reasons, and in particular in relation to Natural Numbers/Integers, it would mean a set with Peano’s Arithmetic or Principle Ideal Domain or Finite Field ( ‘or’ here is in inclusive sense). In most of the cases these Sets will be generated out of Rings. As an example, Natural Numbers can be created by mapping Set of “unsigned int”s (which can be treated as Finite Field) to an Indexed Family of “unsigned int”. One such mapping is “radix” (a0 + a1*r + a2*r^2 + a3*r^3+ ...) based arithmetic. Clearly the library has long term intention to provide support for such mappings which has flavors of being generic. Q. What does Multiple-Precision and Arbitrary precision means here ? A. If the cardinality of indexing set (mentioned above) is finite and known at compile time then it will be the case of multiple-precision else it will be arbitrary precision. Both Arbitrary and Fixed precision have a meaning that they are multiple of a unit precision. We will use the term multiple-precision as an alias to fixed precision, however I see chances of debate over this topic. In its implementation paradigms, the current library has notions of multiple-fixed-precision and multiple-unfixed-precision. In current writing I am denoting multiple-fixed-precision as fixed/multiple precision while multiple-unfixed-precision as arbitrary-precision. That multiple-precision maps to cardinality of indexing set additionally asserts that unit of computation will be Elements of Rings of a given kind and bits/bytes will be of particular interest only. To give additional meaning to finiteness of multiple-precision arithmetic, like specifying it in terms of bits, bytes or range of values that the generated number would have, will mean creating compositions of mapping described in last question. Q.What are some basic APIs that the library will expose? A. This is yet to be finalized. However some design paradigms are settled. I already described the core Mathematics in last two questions. There will be a conception of “varch”(Virtual Architecture). This would mean providing a set of functions like mov, add, addto, or, xor, ... which underlying processor provides. Thus one can do - addto(unsigned int* dest, unsigned int* src, unsigned int n), which adds “src” to “dest” (like operator+=) assuming “unsigned int” is a “finite field” and the “pointers” and “n” means n-sized indexed family of “unsigned int”. Definitely there will be “addto”s corresponding to each of the Ring and Mappings. The “arithmetic concepts” corresponding to each “addto” will be deduced based on types involved, and in case “arithmetic concepts” thus deduced are ill-formed or wrong or void, compile time errors will be generated. These varch functions will be provide very low level interface(with respect to intended library) and internally they will be fine-tuned for underlying processor, system, compiler and algorithms. Numbers will be represented as an object via a kernel called basic_mint (which in turn will use varch’s function):- template<typename SignedType=varch::U, typename IntegerType=unsigned int, std::size_t InitialSize=0, precision::value_type P=default_precision<InitialSize>::value, typename IntegerTraits=integer_traits<IntegerType>, typename Allocator=allocator<IntegerType> > struct basic_mint; Further there will be conception of “generators” which will handle Algebra of underlying types. Q. How much is done ? A. Not much. However some of the above ideas have been implemented. One can see pieces of codes here:- http://sourceforge.net/p/spring-math/svn/. A very large portion of code is to be implemented. I thought, before I go too far, too far where design and implementation buckles, I should get “concept-check” by BOOST Gurus. Q. Will it be wrapped around GMP ? A. No, No and No. C++ has richer Algebraic content. Q. Is there any final API where user can use it the way int/char/float are used is specified. A. Not yet. But at most it will be a thin compile time wrapper around basic_mint. Q. Why I came here? A. For guidelines, help, ideas, warnings, disciplines, lectures, volunteers and inherent desire to register initials of my work :). With Regards, Reetesh Mukul

3 4

[MPL] More lazy evaluation, for ease of use?
by jcarey＠jcarey.best.vwh.net 02 Aug '10

02 Aug '10

According to Boost MPL documentation, "Every Integral Constant is also a nullary Metafunction, returning itself." Put another way: redundant evaluation of an Integral Constant is harmless. This handy guarantee encourages Metafunctions to evaluate their integral arguments upon demand. As others have pointed out before, such lazy evaluation reduces "typename ...::type" syntactic clutter, makes it easier to avoid instantiating a template with parameters it does not support, and tends to increase compilation speed. However, other Boost MPL concepts do not impose this self-return requirement, and many Boost MPL standard data types do not provide such a guarantee. In particular, I think it would be helpful if all Sequences, Iterators, and Lambda Expressions were also nullary Metafunctions returning themselves. (In particular, it would be nice if generic containers designed for lazy data could accommodate Lambda Expressions.) Furthermore, it would be helpful if more standard Metafunctions evaluated their arguments. In particular, if boost::mpl::eval_if were to evaluate its condition argument, then nested ifs would be much easier to write, because nested conditions would not have to be legal for all template parameters. Perhaps the reason for not evaluating certain arguments is backward compatibility? Personally, I think the convenience of widespread lazy evaluation would outweigh the costs of a transition to new Metafunctions and concepts. In particular, uniform lazy evaluation would reduce the burden on beginners to figure out which arguments must be evaluated, and which must *not* be evaluated. Instead, beginners could learn the simple rule to leave arguments unevaluated unless there is some good, documented reason to do otherwise. One special note: It is useful for MPL Metafunctions to be able to reason about arbitrary C++ types, even if those types do not happen to be nullary Metafunctions. For example, a canonical use of MPL is to compute the type returned by a function template. To that end, we could wrap arbitrary types just as we wrap integral values in Integral Constant types, and then unwrap them only at need. For example, we could define: template< typename X > struct box { typedef box type; typedef X content; }; template< typename B > struct open : B::type::content {}; and then compute with "box" instances instead of raw types, and apply "open" only when a raw type is actually required. What do you all think?

4 4

[ptr_container] ptr_vector transfer from C array of pointers documentation
by Number Cruncher 02 Aug '10

02 Aug '10

The documentation for ptr_vector::transfer( iterator before, T** from, size_type size, bool delete_from = true ) implies that the operation "delete [] from" is executed, but having examined the source, I don't think it is. This is actually the behaviour I need. I'm trying to convert a std::vector<T*> to a boost::ptr_vector<T*>, i.e. I have a vector of pointers which is solely responsible for "owning" the objects being pointed to, and I want to create a ptr_vector which will automatically clean up the objects when it goes out of scope. I need to do the transfer so that no memory leaks in the event of an exception. As far as I can see, this is exactly what ptr_vector::scoped_deleter is doing: it will delete any of the copied pointers, but it never actually deletes the "from" pointer; presumably because you don't know whether operator new[] was used when allocating it. Can anyone clear up/confirm that this will work: std::vector<T*> v1; v1.push_back(new T); boost::ptr_vector<T> v2; if (!v1.empty()) { v2.transfer(v2.end(), &v1[0], v1.size(), true); } // from this point, don't care about v1 and v2 will handle deletion of T objs Thanks, Simon

2 2

[RFC] Unicode and Converters/Segmenters
by Mathias Gaunard 01 Aug '10

01 Aug '10

It's been a while (about a year actually) since I had some feedback about my Unicode library, so here I am requesting for comments. The Unicode library provides facilities to convert between UTF and locale encodings in a way as nice and generic to use as possible, as well as a few Unicode character properties that can be used for normalization or segmentation into graphemes. The largest part of the library is actually a fairly intricate generic Converter and Segmenter system, that, among others, allows to define, in an easy and stateless way, a variable-width N to M conversion step. The conversion can then be applied normally on the input, or step by step by an iterator or range adaptor, essentially performing a lazy conversion. Converters can be combined, and can be used to make codecvt facets, which allows them to be transparently applied by standard file streams. Converters can also be built from codecvt facets, which is how the Unicode library provides conversion between locale encodings. I think the whole system really deserves to be a library of itself and not just part of Unicode, but I'm unsure of how to deal with this in Boost. I think it's quite cool, but I haven't really seen much interest into it. I may write a short tutorial of how to write base64 codecs with it and how to use that with iostreams just to show it off a bit more outside of a Unicode context. Anyway, the docs are here: <http://mathias.gaunard.com/unicode/doc/html/> And the code is on the sandbox: <https://svn.boost.org/svn/boost/sandbox/SOC/2009/unicode/> As I have said before, I will be submitting the full thing for formal review *soon*, i.e mid-september. The changes that will go in are mostly performance-related: I'm experiencing with things right now and doing benchmarks, considering unsafe codecs and SIMD ones (SIMD is not just an implementation detail, due to the step-by-step evaluation; using SIMD means having a much larger step -- and of course, it cannot be safe). I also need to tackle the issue of compile-time, which is quite large: I need better header separation. I also need to find a better solution, from a binary point of view, to expose composition from the shared library, as the current one doesn't give much flexibility in implementation.

1 0

[date_time] Constructing ptime object from ISO 8601 compliant strings
by Rush Manbert 31 Jul '10

31 Jul '10

A variation on this question was asked by Allen Cronce back in May, but I didn't see any answer posted. The Posix Time description begins: "Defines a non-adjusted time system..." I assume that this means it is not adjusted for time zone? I need to construct ptimes from ISO 8601 compliant strings that may contain time zone information, such as this: "2010-08-17 12:34:56-07:00" If I constructed a ptime using this string, then used to_iso_string() to convert it to a string, I would expect to see "2010-08-17T19:34:56", but I don't. Rather, what I see is "2010-08-17T12:34:56" because the time zone portion of the string was ignored. Does anyone have a suggestion for dealing with this situation? I have some ideas, but would be interested to hear what others have done. Thanks, Rush

1 0

Please, remove me from Trac and maintainers.txt
by Gennaro Prota 30 Jul '10

30 Jul '10

Hi, I received a notification for the following Trac ticket. <https://svn.boost.org/trac/boost/ticket/4495> Apparently this request <http://lists.boost.org/Archives/boost/2010/06/168338.php> got just ignored, so I'll try to be clearer: I don't want to have anything to do with Boost; can anyone put an end to this annoyance? Thanks. -- Gennaro __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

4 5

Patches for OpenVMS support for Boost (Asio mostly)
by Artyom 30 Jul '10

30 Jul '10

Hello, I want to submit patches for Boost, mostly Asio for better support of OpenVMS IA64 for 32 and 64 bit builds. The fixes come from an organization I work for that prefers to stay anonymous for security reasons. We've mostly concerned about Boost.Asio and we've managed to compile and run all Boost.Asio unit tests actually giving VMS very good Asio support. The fixes cover several independent libraries that should be fixed in order to make them compile: - Boost.Asio - mostly, configuration and 64 bit quirks - Boost.Test - 64 bit issues and compiler issues. - Boost.Config - added new vms.hpp platform config. - Boost.DateTime - 64 bit fixes. - Boost.Thread - compiler issues workarounds. - Boost.Function - 64 bit fixes as sizeof(size_t) < sizeof(void *); I understand that many library maintainers should be involved in integration of these patch. And it is **very important** for the organization I work for to submit them to upstream Boost in order to make an upgrade to future Boost versions simpler. Questions: - How should I submit so wide patch that covers many libraries? Artyom. P.S.: The patch is attached.

4 10

[context] new version
by Oliver Kowalke 30 Jul '10

30 Jul '10

I've uploaded a new version which takes care of the FLS on Windows. Oliver

2 4

[interprocess] Superfluous "volatile" in atomic_add_unless32
by Capehart, Nolan 29 Jul '10

29 Jul '10

In this: inline bool atomic_add_unless32(volatile boost::uint32_t *mem, boost::uint32_t value, volatile boost::uint32_t unless_this) I think "volatile" on the last argument has no purpose and probably reduces speed slightly. Will it not merely cause the compiler to fetch the formal argument from memory every time it's needed? And isn't that of no use since nothing is modifying the formal argument during the function execution? So: 1) Caller puts actual argument on stack. 2) Caller calls atomic_add_unless32. 3) atomic_add_unless32 treats stack variable as volatile, wasting time (not much) because variable isn't actually changing.

1 0

[gsoc] boost.heap update
by Tim Blechmann 29 Jul '10

29 Jul '10

hi all, i've uploaded a new snapshot of boost.heap. it includes some of the proposed changes and i have also added a benchmark sections. during the final time for the gsoc, i'd like to get the library ready for a review ... therefore, i uploaded a new snapshot [1] and an updated documentation [2]. feedback welcome ... cheers, tim [1] http://tim.klingt.org/code/attachments/download/31/boost_heap_280710.tar.gz [2] http://tim.klingt.org/boost_heap -- tim(a)klingt.org http://tim.klingt.org Cheat your landlord if you can and must, but do not try to shortchange the Muse. It cannot be done. You can't fake quality any more than you can fake a good meal. William S. Burroughs

3 8

Phoenix3 port to proto complete
by Thomas Heller 29 Jul '10

29 Jul '10

Ladies and Gentlemen, I proudly announce that the port of phoenix3 is completed! All testcases pass! (some with minor modifications) So, What is next? Here is my proposed schedule: - fix some minor issues - improve boost.bind compatibility: make all boost.bind testcases pass - implement all boost.lambda testcases and make them pass, as far as it is reasonable - add support for C++0x lambdas - make interoperability testcases for std::function, boost::function - adapt the documentation - clean up code (some parts are a little messy as of now) - improve compile time Did I miss something? This is a very tight schedule, I may not be able to finish all points during the GSoC period. Any help will be appreciated. Additionally a review of the current code is highly appreciated to point out some defects that might exist. The code can be checked out at: https://svn.boost.org/svn/boost/sandbox/SOC/2010/phoenix3 I will be happy to answer your questions! Additionally I would like to thank Joel de Guzman and Eric Niebler for their great assistance and initial designs! Best Regards, Thomas Heller

16 37

review request for boost.context
by Oliver Kowalke 29 Jul '10

29 Jul '10

Hello John, hello Ronald, could you add boost.context to the review queue please. boost.context allows to switch between execution contexts. The state of the context which will be left is saved and maybe resumed later. It is a kind of POSIX ucontext (fallback on POSIX platforms for boost.context) but provides assembler for some platforms (faster and some platforms doesn't implement POSIX ucontext because it is deprecaded -> ARM). thanks an best regards, Oliver

10 29

[Boost] [Thread] Query: Stack Size
by Alapkumar Sinha 29 Jul '10

29 Jul '10

Hi, How can I change the default stack size for each new thread being created? Secondly is there a mechanism to set the stack size while creation? I read somewhere that the default stack size is 8MB which is heavy for my application. Please suggest. Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

3 4

[Interprocess] Query on Message queue
by Alapkumar Sinha 29 Jul '10

29 Jul '10

Hi, I have a requirement to have message type based receiving functionality, like the one provided by linux ipc "ssize_t msgrcv(int msqid, struct msgbuf *msgp, size_t msgsz, long msgtyp, int msgflg); " But the messagequeue implementation in boost only allows to set a priority of the message and does not provide a mechanism to wait on a messagequeue based on message type. Can someone tell me if there is a way out to get the above functionalities through boost as well. Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

1 0

[serialization] Padding for base64 dataflow iterators ?
by Timothy Madden 29 Jul '10

29 Jul '10

Hello Could the documentation page for dataflow iterators in the serialization library please state that: 1. using base64 iterators will /not/ add the padding '=' characters in the encoded data, that are present in the canonical encoding in RFC4648 (The Base16, Base32, and Base64 Data Encodings) ? 2. binary string to be encoded should be null-terminated, or the iterators will not pad the input stream of bits with 0s to reach a multiple of 6 bits, but rather use whatever bits follow after the last encoded byte in memory ? Just so the user knows she either has to ensure padding, or otherwise she should not expect the result to exactly follow the RFC, and the result might not be suitable for data interchange between applications, etc ... Or maybe the examples could be changed to include padding, which would be even better ... :) Thank you, Timothy Madden

2 2

[placeholders]
by Andrzej Krzemienski 29 Jul '10

29 Jul '10

Hi, I have a problem with Boost.Bind placeholders. Namely, once I include the <boost/bind.hpp> it automatically brings placeholders _1, _2, .. into scope and I cannot use placeholders from other libraries like Spirit.Qi any more. I.e. I can but I need to qualify them like qi::_1, qi::_2, which is annoying. I include <boost/bind.hpp> in a precompiled header, so I have no option of not including it. Boost.Bind could define them in namespace boost::bind_placeholders and we could control their visibility with namespace using directive. This is what Spirit does, and it is cute. I guess I would not be able to convince anyone that Bind should do the same. But would it be possible to define placeholders _1, _2, ... as something more generic in Boost, unrelated to any particular library? Then boost::bind, would treat it as its own placeholders, Spirit semantic actions would treat them as its own placeholders, but they would be exactly same placeholders. Regards, &rzej

5 5

[interprocess] cmake files on trunk
by Eric Niebler 28 Jul '10

28 Jul '10

Looks like some CMake build files were inadvertently committed to boost trunk (changeset https://svn.boost.org/trac/boost/changeset/64331) I say "inadvertent" because there's no way these files can work in isolation, considering that all other CMake support has been removed from boost trunk. Ion, can you please remove these files? Thanks, -- Eric Niebler BoostPro Computing http://www.boostpro.com

1 0

thread_safe_ptr class interest request
by Philippe Vaucher 28 Jul '10

28 Jul '10

Hello, I've made a thread_safe_ptr class available at http://codepad.org/PxDEGaFm The idea is to use it like so: std::string data = "Hello world;"; thread_safe_ptr<std::string> data_ptr(&data); void thread1() { data_ptr->resize(3); } void thread2() { *data_ptr = "yeah"; } boost::thread t1(&thread1); boost::thread t2(&thread1); t1.join(); t2.join(); Do you see an obvious show-stopper for me not to continue developping this class? What's still to be done is worry about ownership of objects, my idea is to eventually somewhat model it after boost::shared_ptr that way it's easier to pass those around. When I'll be satisfied with the result, my plan is to "boostify" it (namespaces, license etc) and maybe propose it for inclusion in the smart pointer library. What are your thoughts? Philippe

4 5

[serialization] patching 1.43 for the version numbering issue
by Ryan Gallagher 28 Jul '10

28 Jul '10

Hi Robert, As we were discussing the other day, I'd like to just patch my 1.43 release to fix the serialization library versioning issue so that my archives created with it won't need to have the utility run on them for 1.44+ to understand them. I just want to verify with you that changing the version number in serialization/src/basic_archive.cpp is all that's needed. In your recent trunk change you increased the version for 1.44 to '8': https://svn.boost.org/trac/boost/changeset/64157 However, the 1.43 source seems to have version '7' already. I must be missing something as I don't see how binary archived were using library version '6' for 1.42/43. Thanks, -Ryan

4 7

SGI rope in boost?
by Yakov Galka 28 Jul '10

28 Jul '10

Hello all, I can't use SGI's STL for several reasons: * It's incompatible with the standard library implementation shipped with my compiler (MVS). * Extracting only ropes is a headache, there are too much dependencies. * Unacceptable license. Were there any discussions about implementing ropes in boost? Yakov

4 4

Fisher Exact test in boost ?
by Jean-Baptiste Cazier 28 Jul '10

28 Jul '10

Dear all, I am brand new to this mailing list so I apologize in advance for the naivety of my request. I am looking for an implementation of the Fisher exact test in C/C++, and was somehow hoping to find one in boost. I have looked at the documentation of boost and and found many statistical tools, but not the one I am looking for. The closest I got was a discussion in the mailing archive in 2008 on the use of the hypergeometric distribution to perform such implementation Was any progress made since then ? Could I now get the cdf, pmf and sf from an hypergeometric distribution ? or even better a Fisher exact test directly ? Any help will be welcome Thanks Cheers ! Jean-Baptiste

2 4

Re: [boost] [GIL] bits64
by fabien.castan＠free.fr 28 Jul '10

28 Jul '10

> I have been promoting the idea of people contributing any new functionality > of GIL that they find useful by creating a GIL extension that is not > originally in boost. This allows for an opportunity for people to try their > code, flesh out some bugs, suggest changes to the design, etc. We can also > use this as a mechanism to see how popular certain functionality is and use > that to decide which functionality will make it into boost. That way, by the > time it is proposed for inclusion into boost, the code will be more solid. Yes, I have seen it, I use it, and hope to propose new things one day. But adding typedefs is not adding new functionalities. It's the normal usage of the library. If there is a bug here, it's a bug in gil itself not in the added code... So I define it in my code and use it without problem. Maybe we can add those typedefs at least in gil extensions ? If you want I can send you the code.

1 0

[context] user-context switching
by Oliver Kowalke 27 Jul '10

27 Jul '10

I've moved the context switching code from boost.fiber into a new lib - boost.context (uploaded to boost vault). The lib contains assembler for some platforms: i386, x86_64 and arm (aapcs-linux only). It could be used for code implementing cooperative scheduling (such as boost.coroutine and boost.fiber). Oliver

1 0

[gsoc][RFC] Pointer Plus Bits
by Brian Bartman 27 Jul '10

27 Jul '10

Hello, I previously sent out an email to the list about a pointer plus bits like data structure and received some feedback about a pointer plus bits data structure. After taking into consideration all of the different points of view, comments and concerns voiced by the Boost community I have implemented an extension to my bitfield_tuple which allows the user to easily store parts of a pointer and use the extra bits for storage. Here is a basic overview of the bitfield_tuple: Its a tuple like data structure which stores bitfields instead of whole types inside of single tuple. This allows the user to skirt packing limitations of structs and classes in C++ and create bitfields over the storage type of their choice OR leave that decision up to the data structure (the behavior for selecting the storage type is to select the smallest possible unsigned integral type which will hold the all of the bitfields). example of basic bitfield_tuple declaration. #include<boost/integer/bitfield_tuple.hpp> struct red; struct green; struct blue; using namespace boost; using namespace boost::bitfields; typedef bitfield_tuple< member<unsigned char, red, 5>, member<char, green, 6>, member<unsigned int, blue,5> > rgb565_t; The bitfield_tuple takes ordered named template parameters (In the case of the storage type order is ignored. IE no matter where you put the storage< type > template the ending result will be the same). the bitfield_tuple supports the following template named template parameters (all of the templates which follow are located within the boost::bitfields namespace): bit_align< std::size_t> -> increases the offset of the next field to an offset which is divisible by the supplied value unless the current index is divisible by the supplied value then there is no increase. filler<std::size_t> -> bits to be skipped. member<typename, typename, std::size_t> -> this is a basic bitfield parameters it takes are the type the bitfield is to return, a naming type and the width of a bitfield flag<typename> -> boolean version of member. storage<typename> -> uses the supplied type for internal storage. pointer<typename, typename, typename> -> NEW described below. Pointer Member Information: The pointer member takes three template parameters. 1) The type you would like to make a pointer to. 2) The name which can be used (instead of an index, index is also still available to use) to access the pointer. 3) This is an integral_constant or integral_constant like type which is used to make a mask over the value bits of the pointer. This has a default value to leave the last two bits open. You can use leading or ending bits of the pointer for storage by supplying a different mask. Reasoning behind allowing for leading storage bits. There are some systems which do low address allocations and then store values within the higher part of the address. While this is much more rare then the use case of stuffing two bits inside of the end of a pointer I felt that it would be best to provide a way to actually do this. Reasoning behind restricting the mask to an integral_constant or integral_constant like type. The intent for this is to associate a non deduced type with the mask itself, however if people feel better simply using hex to specify the mask I could change the behavior to do that. There are mask creation utilities which can be used to create the mask from a higher level the simply supplying hex. Here are some examples of how to declare a bitfield_tuple with a pointer member: #include <boost/integer/bitfield_tuple.hpp> #include <boost/assert.hpp> using namespace boost; using namespace boost::bitfields; struct ptr; struct color; struct i1; struct i2; typedef bitfield_tuple< pointer<int, ptr> > ptr_1; typedef bitfield_tuple< pointer<int, ptr>, flag<b1>, flag<b2> > ptr_plus_two_bools; typedef bitfield_tuple< pointer<int, ptr>, member<unsigned int,color,2> > ptr_plus_two_bit_color; int main() { ptr_1 p1; int i = 10; p1.get<0>() = &i; BOOST_ASSERT(*p1.get<ptr>() == 10); ptr_plus_two_bools p2; p2.get<ptr>() = &i; ptr.get<b1>() = true; ptr.get<2>() = false; ptr_plus_two_bit_color p3; p3.get<ptr>() = &i; p3.get<color>() = 3; return 0; } The pointer does NOT have to be the first parameter of the bitfield tuple one can simply place things in front of the the pointer and the value mask of the pointer will not be affected. The only thing which is different when this is done is the offset of the pointer within the bitfield_tuples storage, this only changes the location of the bitfield where the pointer is actually being stored. That being said you will always receive the value bits of the pointer in the exact same way they were taken from inside the pointer. -- thanks, Brian Bartman

4 16

Question about boost license
by Marc Elias 27 Jul '10

27 Jul '10

Hello, Allow me to introduce myself, my name is Marc and I would like to use the boost libraries to perform some work on a software with commercial profit. I have some questions about Boost License Policy I would like to know. As I can read in your webpage, most of the Boost libraries are under a single license that allows me to use the libraries for commercial purposes following the instructions you provide in the webpage. You also inform in the webpage that some libraries are under their own licenses. I would like to know, if it's possible, which libraries are under particular licenses and which are these specific licenses. Is it possible to have this information? Thanks a lot for your help. MARC _________________________________________________________________ Accede a tu Hotmail en un solo clic ¡Descárgate Internet Explorer 8 y empieza a disfrutar de todas las ventajas! http://www.ayudartepodria.com/

5 4

Review request: XInt
by Chad Nelson 26 Jul '10

26 Jul '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I am officially requesting a formal review for the Extended Integer library (a arbitrary-length integer math library). The final review version is now available in the sandbox (at <https://svn.boost.org/svn/boost/sandbox/xint>) and the Vault (at <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=xint.z…>). Thanks to everyone who offered suggestions and comments. It's a lot better for them, and likely a lot more useful. Here's hoping for a positive and speedy review. :-) - -- Chad Nelson Oak Circle Software, Inc. * * * -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkw9BTYACgkQp9x9jeZ9/wQX+gCgi1N29anc96B6EX+pZ5rgrvyu d8wAnjfHyu5JQVMVu6BFQPtYExG3SbZR =25L3 -----END PGP SIGNATURE-----

2 3

New name of bjam.exe
by Vladimir Prus 26 Jul '10

26 Jul '10

Boosters, I am sure that most of you got accustomed to typing "bjam" in console whenever you want to build things. This name is old, and derives from a tool named "jam", which is even older (around for maybe 20 years). However, this name is probably no longer good. First, having a single project be identified by both "Boost.Build" and "bjam" names proves inconveninent from "marketing" and conveninence standpoints, to the point where many users try to read documentation for Boost.Jam, don't find anything there, and become upset. Second, users get the idea that Boost.Build is somehow related to "Classic Jam", which is not true. For those reasons, Rene and I have decided that "bjam.exe" should go. We're thinking about naming the executable simply "build.exe", since no other build tool bothered to take it. Does anybody have comments, or better suggestions? Thanks, Volodya

39 62

[1.44] Snapshot available
by Beman Dawes 26 Jul '10

26 Jul '10

The daily release snapshots are working fully again. That's important because the releases are based on the snapshots. See http://boost.cowic.de/rc/ --Beman

1 0

Bugs in program_options library
by Jorge Lodos Vigil 26 Jul '10

26 Jul '10

Hi The function options_description::find_nothrow throws an exception when there are at least 2 exact matches. Since this function is in the public interface this could be considered a bug (it must not throw). Please note that this function is used several times within the implementation without try clauses. The exception thrown might be being used by callers of the method find, so you cannot just remove it. It is best to implement find and find_nothrow as follows: const option_description& options_description::find(const std::string& name, bool approx, bool long_ignore_case, bool short_ignore_case) const { shared_ptr<option_description> found; vector<string> approximate_matches; vector<string> full_matches; // We use linear search because matching specified option // name with the declared option name need to take care about // case sensitivity and trailing '*' and so we can't use simple map. for(unsigned i = 0; i < m_options.size(); ++i) { option_description::match_result r = m_options[i]->match(name, approx, long_ignore_case, short_ignore_case); if (r == option_description::no_match) continue; if (r == option_description::full_match) { full_matches.push_back(m_options[i]->key(name)); found = m_options[i]; } else { // FIXME: the use of 'key' here might not // be the best approach. approximate_matches.push_back(m_options[i]->key(name)); if (!found) found = m_options[i]; } } if (full_matches.size() > 1) boost::throw_exception( ambiguous_option(name, full_matches)); // If we have a full match, and an approximate match, // ignore approximate match instead of reporting error. // Say, if we have options "all" and "all-chroots", then // "--all" on the command line should select the first one, // without ambiguity. if (full_matches.empty() && approximate_matches.size() > 1) boost::throw_exception( ambiguous_option(name, approximate_matches)); if (!found) boost::throw_exception(unknown_option(name)); return *found; } const option_description* options_description::find_nothrow(const std::string& name, bool approx, bool long_ignore_case, bool short_ignore_case) const { try { const option_description& d = find(name, approx, long_ignore_case, short_ignore_case); return &d; } catch(const std::exception&) { return NULL; } } This modification uncovers a bug in function cmdline::finish_option (cmdline.cpp) where find_nothrow is being called assuming that no exception will be thrown. The first part of this function might be modified to: void cmdline::finish_option(option& opt, vector<string>& other_tokens, const vector<style_parser>& style_parsers) { if (opt.string_key.empty()) return; const option_description* xd; try { // First check that the option is valid, and get its description. xd = &m_desc->find(opt.string_key, is_style_active(allow_guessing), is_style_active(long_case_insensitive), is_style_active(short_case_insensitive)); } catch(const std::exception&) { if (m_allow_unregistered) { opt.unregistered = true; return; } throw; } const option_description& d = *xd; // Canonize the name opt.string_key = d.key(opt.string_key); ........ } Now it can throw the correct exception thrown by the find method. This is the only way callers could know the correct exception. It was apparently working before because find_nothrow was throwing exceptions not captured within cmdline::finish_option. You may chose to eliminate the xd variable altogether and initialize and use d within the try clause. What is important is to call find instead of find_nothrow. The following test would have detected these problems and the one solved in https://svn.boost.org/trac/boost/ticket/4159: // Multiple arguments test_case test_cases2[] = { {"--fname file --fname2 file2", s_success, "fname: file fname2: file2"}, {"--fnam file --fnam file2", s_ambiguous_option, ""}, {"--fnam file --fname2 file2", s_ambiguous_option, ""}, {"--fname2 file2 --fnam file", s_ambiguous_option, ""}, {0, 0, 0} }; test_cmdline("fname fname2", style, test_cases2); This test may be added at the end of the test_guessing function in cmdline_test.cpp. I have created the ticked 4469 (https://svn.boost.org/trac/boost/ticket/4469) with this information. Thank you. Best regards Jorge

1 0

[chrono] [thread] boost.chrono changes to boost::condition_variables
by Morgan Henry 26 Jul '10

26 Jul '10

Hello, I've been exploring the boost.chrono candidate library as a basis for some fixes to boost::condition_variables::timed_wait(). I have some questions: 1) What is the current state of the chrono library, and its likely path into boost? 2) Are the chrono API changes to boost::condition_variables likely to be accepted into the boost.thread library in their current form? (i.e introduction of wait_for(), wait_until(), and the introduction of a new explicit dependency from boost/thread/condition_variables on chrono::time_point etc...) 3) Are there any other planned changes to boost::condition_variables::timed_wait to allow use of POSIX clocks other than CLOCK_REALTIME? My ultimate goal is to provide an implementation of boost::condition_variables that allows access to the POSIX clock CLOCK_MONOTONIC for use through boost::condition_variables::timed_wait(). Specifically, providing an implementation that uses pthread_condattr_setclock(&attr, CLOCK_MONOTONIC) at boost::condition_variables initialisation, and use of pthread_cond_timedwait(..., &t) with clock_gettime(CLOCK_MONOTONIC, &t) in boost::condition_variables::timed_wait() and friends This change would provide reasonable behaviour of boost::condition_variables::time_wait() in presence of ongoing changes to the system clock. boost.chrono contributes to this goal by providing a clock abstraction and accessors to the appropriate POSIX clocks through class monotonic_clock, class system_clock, etc... Further to this, changes to boost::condition_variable::timed_wait() and similar would be required to use clock_gettime(CLOCK_MONOTONIC, &t) rather than boost::get_system_time() for calculations when the monotonic_clock is specified. I'm currently considering whether to trust that the boost.chrono API changes to the boost::condition_variables API are robust, and likely to persist for the future. Or to propose alternative changes localised to boost::condition_variables that achieve the goals above without the strong dependency on boost.chrono. Thanks for any comments or information about the above. Morgan http://www.bbc.co.uk/ This e-mail (and any attachments) is confidential and may contain personal views which are not the views of the BBC unless specifically stated. If you have received it in error, please delete it from your system. Do not use, copy or disclose the information in any way nor act in reliance on it and notify the sender immediately. Please note that the BBC monitors e-mails sent or received. Further communication will signify your consent to this.

3 5

Re: [boost] Phoenix3 port to proto complete
by Thomas Heller 26 Jul '10

26 Jul '10

Doug Gregor wrote: > On Fri, Jul 23, 2010 at 11:14 AM, Thomas Heller > <thom.heller(a)googlemail.com> wrote: >> Mathias Gaunard wrote: >> >>> On 23/07/10 14:18, Thomas Heller wrote: >>>> Ladies and Gentlemen, >>>> I proudly announce that the port of phoenix3 is completed! All >>>> testcases pass! (some with minor modifications) >>>> >>>> So, What is next? Here is my proposed schedule: >>>> - fix some minor issues >>>> - improve boost.bind compatibility: make all boost.bind testcases pass >>>> - implement all boost.lambda testcases and make them pass, as far as it >>>> is >>>> reasonable >>>> - add support for C++0x lambdas >>>> - make interoperability testcases for std::function, boost::function >>>> - adapt the documentation >>>> - clean up code (some parts are a little messy as of now) >>>> - improve compile time >>>> >>>> Did I miss something? >>> >>> I would quite like to know how Phoenix 3 compares to Phoenix 2 in terms >>> of compile speed, even if you haven't fully optimized it yet. >> >> Let me give you a small example of what situation we currently have: >> >> For this test i used the core/primitives_test.cpp test and g++ 4.5 >> >> Phoenix3 total compile time: 3.421s >> Phoenix3 preprocess time: 1.755s >> Phoenix3 compile time of preprocessed code: 1.835s >> >> Phoenix2 total compile time: 1.891s >> Phoenix2 preprocess time: 0.745s >> Phoenix2 compile time of preprocessed code: 1.106s >> >> comparing with clang: >> >> Phoenix3 total compile time: 3.901s >> Phoenix3 preprocess time: 2.738s > > Ouch! The Clang guys will be looking into this > preprocessor-performance issue to see if we can do better. Thanks for > reporting this! > > - Doug Thanks for looking into this! FYI, I was able to identify one bottleneck for the preprocessor. It was by including boost/fusion/include/vector.hpp. I instead included the different boost/fusion/container/vector/vectorN.hpp and was able to reduce compile-time by one second. New timings for the above test are: thomas@sunshine ~/programming/boost $ compile-time g++ -I. libs/phoenix/test/core/primitives_tests.cpp complete compile time: real 0m2.385s user 0m2.253s sys 0m0.120s preprocessing time: real 0m1.254s user 0m1.230s sys 0m0.017s compile time without preprocessing: real 0m1.234s user 0m1.157s sys 0m0.067s thomas@sunshine ~/programming/boost $ compile-time clang++ -I. libs/phoenix/test/core/primitives_tests.cpp complete compile time: real 0m2.709s user 0m2.337s sys 0m0.340s preprocessing time: real 0m1.765s user 0m1.417s sys 0m0.337s compile time without preprocessing: real 0m1.011s user 0m0.913s sys 0m0.080s

1 0

boost-trunk compile failure gcc 4.4.3
by Gaetano Mendola 25 Jul '10

25 Jul '10

current trunk has a compilation failure, the following diff solves it Index: boost/optional/optional_io.hpp =================================================================== --- boost/optional/optional_io.hpp (revision 64315) +++ boost/optional/optional_io.hpp (working copy) @@ -74,12 +74,12 @@ else { if ( d != '-') - in.setstate( ios::failbit ); + in.setstate( std::ios::failbit ); d = in.get(); if ( d != '-') - in.setstate( ios::failbit ); + in.setstate( std::ios::failbit ); v = optional<T>() ; } Regards Gaetano mendola

2 1

Property tree bug
by OvermindDL1 25 Jul '10

25 Jul '10

I am attempting to use a recent boost trunk due to updates I need, however propertytree has a build bug that has already been submitted a few days ago, what is the status of this? The fix is already in the bug ticket. https://svn.boost.org/trac/boost/ticket/4459

2 2

Conflict with patent
by Francisco José Tapia 24 Jul '10

24 Jul '10

I am a teacher of programming in a Technical Professional Training School in Madrid ( Spain). I had wrote a counter balanced red-black tree in C++. The balanced trees have a counter in each node, which represent the number of nodes under it including itself. This counter permit to access to the nodes by their position in the tree. Due to this you can use a counter tree as a vector, access by position and insert and delete by position. Of course, the iterators of this trees have random access, an you can add or decrement the iterators any value . vector_tree<int>::iterator Alfa, Beta ; Alfa = Beta + 17 ; The algorithms are built from zero,without any book or article, because you need in each operation , not only modify the pointers, you must modify the counters too. The speed is good. In the worst case the delay respect to the equivalent STL functions is around 20%. I had checked in windows ( Visual Studio ) and Linux (GCC). My version have a 5 classes interface : vector_tree : This class is a counter balanced red-black tree and have the same interface than the STL class vector. The insertion , deletion and access to elements are log(N) operations. The other four classes are set , multiset , map and multimap. Internally they have a vector_tree. They have the same interface than the STL classes, plus the access by position and the random access iterators. My idea is to send you to examine , and if you think useful, make a new boost library. Today is finished to 95% . I hope have all finished by the first weeks of September. I am writing you because today, looking for other think I discovered a US patent “Positional access using a B-tree” ( US patent Number 7,120,637B2 Oct, 10, 2006), and I don't know if this patent prevent the publication of the code in your library, because you can consider the red-black trees an simplification of B-trees If prevent, and you don't have an idea about the utility of the code, I will stop the develop, and I will spend my time with new ideas The idea about the counter trees you can find in “The art of computer Programming “ Donald Knuth, and I have a previous version of this code wrote 10 years ago and presented in my exposition in the Oposiciones a Catedrático de Informática ( Madrid 2001) If you are interested in the code, mail me and I will send you. Francisco José Tapia E-Mail : fjtapia(a)gmail.com

11 15

[Serialization] Query
by Alapkumar Sinha 23 Jul '10

23 Jul '10

Hi, I am trying to use the serialization library in the following scenario. 1. I create one instance of an object in one process 2. Serialize it either with binary/text archive 3. Then send it through unix local socket to another process where the process deserializes Whatever examples available, it shows just archiving like below std::ofstream ofs("filename"); // use it to build and archive boost::archive::text_oarchive oa(ofs); // write class instance being pointed to // to the archive oa << g; /************/ But after this 1. I would like to copy the archived data to a buffer 2. Send the buffer throught a socket something like boost::asio::write(socket, boost::asio::buffer( buffer, sizeof(buffer)); Can someone help on how I can get this done. One more question: does the call boost::asio::write does serialization internally? If yes, still I would need how to get the buffer as mentioned in the query above a my transmission mechanism might change. Thanks, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

[Query] __sync_val_compare_and_swap_4
by Alapkumar Sinha 23 Jul '10

23 Jul '10

Hi , I am trying to use the Boost Interposes, specifically the message queue. When Im doing cross compiling boost libraries on Cronus mips board, I am getting below error undefined reference to `__sync_val_compare_and_swap_4' Upon analysis we found that in boost/interprocess/details/atomic.hpp, was throwing this error. I found the solution. I replaced this returned statement ( __sync_val_compare_and_swap_4 ) and included assembly language code in atomic.hpp. (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp) { /* return __sync_val_compare_and_swap(const_cast<boost::uint32_t *>(mem), cmp, with);*/ boost::uint32_t result; asm volatile(".set\tpush\n\t" ".set\tnoreorder\n\t" ".set\tnomacro\n\t" "1:\n\t" "ll\t%[result],0(%[mem])\n\t" "bne\t%[result],%[with],2f\n\t" "move\t%[result],$0\n\t" // delay slot "move\t%[result],%[mem]\n\t" "sc\t%[result],0(%[mem])\n\t" "beq\t%[result],$0,1b\n\t" "nop\n\t" // delay slot "2:\n\t" ".set\tpop" : [result] "=&r" (result) : [mem] "r" (mem), [cmp] "r" (cmp), [with] "r"(with) : "memory"); return result; } After this I was able to execute the message queue program successfully on the mips platform. Can someone confirm if this is the right solution? Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

[interprocess] x86-64 bug?
by Bartosz Marcinkiewicz 23 Jul '10

23 Jul '10

Hello, I have modified a little an example doc_complex_map.cpp in order to use vector of integers which is a member (int_vector_) of structure stored as a shared map value (complex_data). Program works as expected on x86 (32bits). I get core dump on x86-64: (gdb) bt #0 0x000000000041ecfe in boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index> > >::priv_push_back (this=0x7f3435ae9260, x=@0x7fff77fe9eac) at /home/bma/opt/include/boost/interprocess/containers/container/vector.hpp:1239 #1 0x000000000041ed57 in boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index> > >::push_back (this=0x7f3435ae9260, x=@0x7fff77fe9eac) at /home/bma/opt/include/boost/interprocess/containers/container/vector.hpp:904 #2 0x0000000000401cf1 in operator() (this=0x7fff77fea0ee, x=@0x7f3435ae9218) at doc_complex_map.cpp:109 #3 0x0000000000401e8c in main () at doc_complex_map.cpp:146 Valgrind output is: [bma@dev2 example]$ vg ./doc_complex_map ==18738== Memcheck, a memory error detector. ==18738== Copyright (C) 2002-2007, and GNU GPL'd, by Julian Seward et al. ==18738== Using LibVEX rev 1804, a library for dynamic binary translation. ==18738== Copyright (C) 2004-2007, and GNU GPL'd, by OpenWorks LLP. ==18738== Using valgrind-3.3.0, a dynamic binary instrumentation framework. ==18738== Copyright (C) 2000-2007, and GNU GPL'd, by Julian Seward et al. ==18738== For more details, rerun with: -v ==18738== ==18738== Invalid write of size 4 ==18738== at 0x41ECFE: boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0l>, boost::interprocess::iset_index> > >::priv_push_back(int const&) (vector.hpp:1239) ==18738== by 0x41ED56: boost::container::vector<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0l>, boost::interprocess::iset_index> > >::push_back(int const&) (vector.hpp:904) ==18738== by 0x401CF0: main::test_struct::operator()(complex_data&) (doc_complex_map.cpp:109) ==18738== by 0x401E8B: main (doc_complex_map.cpp:146) ==18738== Address 0x104c0f989 is not stack'd, malloc'd or (recently) free'd This is on boost 1.43. I am attaching source code. Thanks for any hints. -- Bartosz Marcinkiewicz e-mail: bma(a)epcon.pl, bartosz.marcinkiewicz(a)epcon.pl EPCON Sp. z o.o. www.epcon.pl

1 1

boost::bind result type
by David Sankel 23 Jul '10

23 Jul '10

I'm wondering if there's a way I can generically get the result type of boost bind. I'd like to write something along these lines: template< typename StreamT, typename Sink > typename boost::result_of< boost::Bind( StreamT, boost::arg<1>, Sink ) >::type apSink( StreamT t, Sink sk ) { return boost::bind( t , _1 , sk ); } I'm not interested in a boost::function solution because I require that uses apSink's result can be inlined. Any ideas? Perhaps one of these other bind-like libraries has an answer to this. Thanks, David -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

5 15

Problem in proto library
by Jorge Lodos Vigil 23 Jul '10

23 Jul '10

Hi The addition of macro BOOST_PROTO_EXTENDS_USING_ASSIGN in literal.hpp broke compilation with /clr option in MSVC. The problem is that the macro is used as BOOST_PROTO_EXTENDS_USING_ASSIGN(literal) and literal is a variable modifier for managed C++. Adding a private typedef: typedef literal<T, Domain> literal_t; and replacing the macro parameter with: BOOST_PROTO_EXTENDS_USING_ASSIGN(literal_t) solves the problem for us. Tested with VS2008. Please note that this problem prevents compilation of xpressive and any other library that uses proto with /clr. Thank you for boost and particularly for proto and xpressive :-) Best regards Jorge

2 1

[GIL] bits64
by fabien.castan＠free.fr 22 Jul '10

22 Jul '10

Hi, 64 bits pixels are interesting for accumulation buffers or internal computations. I think it could be a good thing to add these typedefs in gil. Is there any reason not to do it? Best regards, Fabien Castan

3 2

Re: [boost] [GIL] scoped_channel_value type
by fabien.castan＠free.fr 22 Jul '10

22 Jul '10

>> So if you want to extract this, you will have to special-case >> scoped_channel_value anyway. So in this case you don't need a typedef >> inside. >> You can just define a specialization like this: >> >> Template <typename ChannelValue> >> Struct base_channel_value { >> typedef ChannelValue type; >> }; >> >> Template <typename ChannelValue, typename MinV, typename MaxV> >> Struct base_channel_value<scoped_channel_value<ChannelValue, MinV, MaxV> > >> { >> typedef ChannelValue type; >> }; >> > >I really have to write that one down. I keep on forgetting this trick. Thanks ! Maybe this utility structure can be added (like channel_type, etc.) ?

1 0

[GIL] scoped_channel_value type
by fabien.castan＠free.fr 22 Jul '10

22 Jul '10

Hi, I would like to get the value type of the channels depending on an image view. So I can get the scoped channel type, from MyView type, like this: typedef typename boost::gil::channel_type<MyView>::type MyScopedChannel; But I can't get the primitive type used by the scoped channel. For example, if the type is scoped_channel_value<float,float_zero,float_one>, I can't get the float type. /// \ingroup ScopedChannelValue /// \brief A channel adaptor that modifies the range of the source channel. Models: ChannelValueConcept template <typename BaseChannelValue, // base channel (models ChannelValueConcept) typename MinVal, typename MaxVal> // classes with a static apply() function returning the minimum/maximum channel values struct scoped_channel_value { typedef BaseChannelValue base_channel_t; //< missing typedef //... } So this will allows to use: typedef typename boost::gil::channel_type<MyView>::type::base_channel_t ChannelBaseType; Are you agree to add this typedef ? Best regards, Fabien Castan

3 3

fixed size vector in boost::numeric::ublas?
by Markus Grabner 22 Jul '10

22 Jul '10

Hi all! In boost::numeric::ublas, there exist different vector variants (unbounded and bounded). All of them can be resized dynamically (up to a maximum size defined at compile time in the case of the bounded vector). Therefore the vector class (or the underlying storage array) have a size member which indicates the current size of the vector. However, it would be extremely useful to have a vector of fixed size, i.e., one which can't be resized dynamically, but has its size statically defined at compile time. Such a vector does not require a size member and only consumes N*sizeof(T) bytes of storage, where N is the (static) vector size and T the value type. Many libraries dealing with geometric data (OpenGL and OpenInventor being prominent examples) store their data in compact arrays in their native data types, e.g., the values (x0,y0,z0,x1,y1,z1,x2,y2,z2) stored in consecutive memory locations define three points in 3D space. By means of a fixed size vector, the entire boost::numeric::ublas functionality could be applied to such arrays by a simple reinterpret_cast on each element. This is not possible with the bounded or unbounded vectors since the vector must be constructed before with its size member properly initialized, and the actual vector data must therefore be copied explicitly before use. I tried to create a fixed_array class to implement this proposal (see attachment), it can be used, e.g., to create the equivalent of the OpenInventor "SbVec3f" data type as follows: typedef boost::numeric::ublas::vector<float,fixed_array<float,3> > vec3d_t; It is probably not the cleanest solution, and I skipped the serialization stuff altogether, but it demonstrates an approach how this can be done. What do you think about adding such an extension to improve boost's interoperability with other libraries? Thanks & kind regards, Markus -- Markus Grabner Institute for Computer Graphics and Vision Graz University of Technology, Inffeldgasse 16a/II, 8010 Graz, Austria WWW: http://www.icg.tugraz.at/Members/grabner

2 1

[ref] incompatibility with c++0x
by Andy Venikov 21 Jul '10

21 Jul '10

The latest c++0x FCD defines the single argument constructor for reference_wrapper(T &) as non-explicit. The boost version is explicit. Was it done on purpose? Should it be changed to non-explicit? BTW, I think original standard drafts did have it as explicit since gcc 4.3.3 still defines it as explicit. But in the final draft (as in gcc 4.5) it's non-explicit. I know that boost::reference_wrapper is not the same as std::reference_wrapper, but still it would be nice to have some uniformity. Thanks, Andy.

2 2

info about boost process
by Conoscenza Silente 21 Jul '10

21 Jul '10

Hi All Do you know whether "boost.process" will become part of the boost library at some point? I need some C++ way to start-stop processes and getting the console output produced by them and it seems that this library is doing right that. I see it in the BOOST VAULT that the development is stopped since 2008. Do you know what are the plans for it and if there is some alternative I can use in current/future boost library? Thanks AFG

2 1

[Graph] Problems customizing edge storage for adjacency_list
by Alex Betts 21 Jul '10

21 Jul '10

Hello! I can't seem to use a custom container for storing edge data when using adjacency_list (this is with gcc 4.1.0 on Linux, but it won't work for gcc 4.3.0 either). I understand that I need to create push() and erase() functions for the custom container, but the compiler never seems to see my implementations of these two functions, as it always gives an error like: boost/pending/container_traits.hpp:414: error: no matching function for call to ‘container_category(...)’ ...from the default implementation of push() defined in container_traits.hpp. I've tried moving push() and erase() in and out of the boost::graph_detail namespace, but that doesn't seem to help. I've attached the source for the program in question, & appreciate any help! thanks, -- Alex

2 2

boost graph.
by Giorgio Zoppi 21 Jul '10

21 Jul '10

Hi, I've a problem with multiple links on the same vertexes. For example we've vertex A and vertex B and we want identify two different edges that they connects to these edges, i.e. A-->B with cost 6 A-->B with cost 8 Is there any way to tag or label these links and using the dijkstra algorithm on the graph? Cheers, Giorgio. -- Quiero ser el rayo de sol que cada día te despierta para hacerte respirar y vivir en me. "Favola -Moda".

2 1

[Serialization & Archive ]
by Alapkumar Sinha 21 Jul '10

21 Jul '10

Hi, Can someone tell me what is the difference between the Archive & Serialization library and what are the scenarios in which one has to chose one over the other? Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

Is there any compile time/static rational numbers library in BOOST ?
by Reetesh Mukul 21 Jul '10

21 Jul '10

Hi, Is there any compile time/static rational numbers library in BOOST ? I can see that static GCD/LCM libraries are there, but could not find it for static rationals. Another question, is there any compile time library which calculates ceil value of division of one integer by another one ? With Regards, Reetesh Mukul

1 0

First set of Boostcon 2010 videos are available
by Marshall Clow 21 Jul '10

21 Jul '10

Almost all of the Transactional Memory sessions from Boostcon are now available, with the exception of Tatiana Shpeisman's presentation on the "Draft Specification of Transactional Language Constructs for C++". That talk should (hopefully) be available tomorrow. Here are the links Maurice Herlihy : Transactional Memory Today - Keynote: http://blip.tv/file/3900047/ Justin Gottschlich:TBoost.STM Engine: http://blip.tv/file/3900167/ Tatiana Shpeisman: Draft Specification of Transactional Language Constructs for C++: <coming soon> Michael Wong: IBM's TM Research: http://blip.tv/file/3900242/ Mark Moir: Sun's / Oracle's TM Research: http://blip.tv/file/3905166/ Tatiana Shpeisman: Intel's TM Research: http://blip.tv/file/3905189/ Hartmut - I apologize for removing your (very nice) introduction for Maurice from the video. Unfortunately, Maurice was wearing the microphone, and none of what you said could be heard. -- Marshall

5 4

[Serialization] Documentation
by Alapkumar Sinha 21 Jul '10

21 Jul '10

Hi, Can someone help me to get the pdf document for boost serialization library? I could not find the documentation in the doc folder of boost tar. The only reference I could find was " http://www.boost.org/doc/libs/1_43_0/libs/serialization/doc/index.html ". I would like to have local copy rather than access it from net every time even if it is not pdf. Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

Trouble caused by MPL's metafunction arity limit
by Stefan 21 Jul '10

21 Jul '10

Hello everyone. I'm working as a student on this year's GSoC and I have ran into a small problem while using MPL in my code. In a nutshell, I have a class template which takes 6 template parameters, and I would like to use it with some MPL algorithms. The problem is, MPL is configured by default to be capable of working with 5 template params only, so lambda expressions of my class won't work with MPL metafunctions. My code is header-only, meaning I cannot (re)define BOOST_MPL_LIMIT_METAFUNCTION_ARITY appropriately, as the MPL headers might have been included before my headers. Out of my 6 template params, 3 are optional, in case this is relevant or can be exploited in any way. Is there any workaround to my problem?

4 4

Re: [boost] New name of bjam.exe
by Tan, Tom (Shanghai) 20 Jul '10

20 Jul '10

How about calling it "baby"? >Subject: [boost] New name of bjam.exe >Message-ID: <201007201245.08070.ghost(a)cs.msu.su> >Content-Type: Text/Plain; charset="us-ascii" > >Does anybody have comments, or better suggestions? > >Thanks, >Volodya

16 19

[optional_io] Request permission to merge simple fix to optional extraction operator
by Fernando Cacciola 20 Jul '10

20 Jul '10

Hi All, It was brought to my attention that extracting an *empty* optional<> from a stream using the default provided operators (in optional_io.hpp), leaves one character behind, preventing any further extraction. This is clearly a bug so I can only guess that no one is using it (except for the user that reported it). The fix is quite trivial: https://svn.boost.org/trac/boost/changeset/64206 And I've updated the test accordingly to make sure it works. Can I marge the fix into the release branch? TIA --- Fernando Cacciola SciSoft Consulting, Founder http://www.scisoft-consulting.com

2 4

BoostCon 2010 website
by Robert Ramey 20 Jul '10

20 Jul '10

I have a couple of requests regarding the BoostCon 2010 website. First of all , This link is very interesting and important to me. Yet it's devilish difficult to find. I shouldn't be "private". http://www.boostcon.com/community/wiki/show/private/2010/ Second, could marshal's links to the video be added to the presentation materials page? Finally could the presentation materials for each presentation be linked from the program page: http://www.boostcon.com/program Robert Ramey

2 2

FW: New name of bjam.exe
by Tan, Tom (Shanghai) 20 Jul '10

20 Jul '10

Or, babe = Build Another Build Environment. It sound so simple and crisp, just as Bing and Google. -----Original Message----- From: Tan, Tom (Shanghai) Sent: Tuesday, July 20, 2010 7:17 PM To: 'boost(a)lists.boost.org' Subject: RE: [boost] New name of bjam.exe How about calling it "baby"? >Subject: [boost] New name of bjam.exe >Message-ID: <201007201245.08070.ghost(a)cs.msu.su> >Content-Type: Text/Plain; charset="us-ascii" > >Does anybody have comments, or better suggestions? > >Thanks, >Volodya

3 2

[Proto] Inlining failure on gcc 4.x on 64bits linux
by joel falcou 20 Jul '10

20 Jul '10

I'm reporting this performances problem we encountered today. We have a large expression operating on table of 51200000 elements; In 32bits mode, our proto code for NT² works perfectly and output a gprofile like: http://codepad.org/Uyyvkq4X rutniem performance sis somethign like 1.5s for the whoel computation. In 64bits on linus using gcc 4.4 or 4.3, we got a massive 8.6s of runtime (!!) and the profile is: http://codepad.org/6VgRsbyR As it seems the call to proto::default_ is not inlined (hence the 5.12M calls) and take 80% of the runtime. I don't thing anything is 32/64bits specific in proto so is it a bug in gcc ? I don't have code handy here but will do tomorrow.

3 2

Re: [boost] [msm] nested pseudo exits with same event ending up in no trans in the most outer state machine.
by Christophe Henry 20 Jul '10

20 Jul '10

Hi Richard, >Is it not allowed to use derived classes as backends ?. Actually, I don't know. I mean, I don't know of a C++ rule forbidding it, but I'm not a language lawyer. What I know is that this problem used to happen sporadically with eUML in the 2.0, but only with VC, and in this case, I see it happen also with g++ 4.4. I'd say it's a compiler bug but usually, g++ is right so I'm not sure. >I was not a ware of it. Is it mentioned in the documentation ? Probably not because I didn't see it happen any more with MSM v2.10. It used to happen with the 2.0 and only with VC and eUML. >If only composite state machines can not be derived classes of >msm:backend than this is fine because I had only one place till now >which I have changed already. We are moving inside uncharted territory. All what I can say is that it used to happen sporadically and only for eUML composites or substates. I never, in any version, saw it happen with the main fsm. Let's try to find a way around. Why do you need to use the back-end as base class? Could you elaborate? And will the need go away after I implement the previously discussed feature that you can pass to the back-end concrete substates instead of default-constructed ones? Something like what Dave suggested: player p(/* for the front-end*/ 3, "a", backend_args = ( init1=Paused("something"), init2=Playing("more data")) ); If you describe your use case, I'll try to find a solution. It'd not be the first time I find a way around compiler bugs ;-) Regards, Christophe

1 0

[msm] nested pseudo exits with same event ending up in no trans in the most outer state machine.
by Christophe Henry 19 Jul '10

19 Jul '10

>Hi All > >I have run in to the following problem : >if I have 3 state machines where 1st has a composite state which has >one more composite state than the most inner one enters to a pseudo >exit state which sends finish event. >The middle one has a transaction from the most inner pseudo exit with >even finish to a pseudo exit middle state which sends finish again. >The most outer state machine has a transition from the middle pseudo >exit with event finish to a internal state. >when the most inner pseudo state sends event finish it ends in a NO >transition on the most outer state machine instead of triggering the >transition in the middle state machine. <snip> Hi Richard, Remove these lines: //struct test1 : msm::back::state_machine< test1Sm > //{ //}; //typedef test1 Test1Player; And replace them with: typedef msm::back::state_machine< test1Sm > Test1Player; And it should work. Regards, Christophe

2 2

preprocessor library
by Wolf Lammen 19 Jul '10

19 Jul '10

Hi, Within the last two weeks, I submitted two patches to boosts ticket system, one correcting a bug in the preprocessor library, one slightly extending a macro improving symmetry when converting list types. I spotted more dubious code in the library, for example, I could easily remove hundreds of lines of dead code from preprocesser/seq/fold_left.hpp, and simplify BOOST_PP_SEQ_FOLD_LEFT saving between 15% and 90% of its execution costs (measured in macro replacements), depending on the input. When submitting the patches I followed the instructions on the bug reporting page of boosts web site. There has been no reaction so far. Did I get something wrong? Would like to learn how patches like these are going to be handled. with kind regards Wolf Lammen -- GMX DSL: Internet-, Telefon- und Handy-Flat ab 19,99 EUR/mtl. Bis zu 150 EUR Startguthaben inklusive! http://portal.gmx.net/de/go/dsl

2 1

[mpl] Request for permission to merge a minor change to release
by Daniel Walker 19 Jul '10

19 Jul '10

Hi all, I just noticed a missing include in boost/mpl/has_xxx.hpp and committed a fix to trunk. https://svn.boost.org/trac/boost/changeset/64144 May I please merge this changeset to release? Daniel Walker

2 1

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 18 Jul '10

18 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2975, Issue 2 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

3 2

[msm] nested pseudo exits with same event ending up in no trans in the most outer state machine.
by Richard Szabo 17 Jul '10

17 Jul '10

Hi All I have run in to the following problem : if I have 3 state machines where 1st has a composite state which has one more composite state than the most inner one enters to a pseudo exit state which sends finish event. The middle one has a transaction from the most inner pseudo exit with even finish to a pseudo exit middle state which sends finish again. The most outer state machine has a transition from the middle pseudo exit with event finish to a internal state. when the most inner pseudo state sends event finish it ends in a NO transition on the most outer state machine instead of triggering the transition in the middle state machine. please find the sample code to reproduces the problem and execution output in attachment to . a part of the execution output : leaving: Stopped entering: Playing entering: Playing::PseudoEntry1 leaving: Playing::PseudoEntry1 entering: test1Sm::initial leaving: test1Sm::initial entering: test1Sm::TestPseudoExit1 no transition from state 1 on event struct `anonymous namespace'::finish Is it a bug or I'm doing something wrong ?. Br. Richie

1 0

Help with patch
by Christian Henning 17 Jul '10

17 Jul '10

Hi there, this is probably offtopic but I need some help with applying a patch for boost::gil. First of all, I don't have much experience with patch and I need to change that. I read some tutorials online on how to patch with subversion and it seems pretty straightforward. I did some little testing myself and everything works as expected. Nice tool, I like it! Now, my first real life try with patch and I'm running into a problem immediately. I get this error with subversion: --------------------------- TortoiseMerge --------------------------- The patch seems outdated! The file line TIFF *_tp; and the patchline TIFF *_tp; do not match! --------------------------- OK --------------------------- The patch file was send to boost mailing list and maybe some lines got shifted by a whitespace but I cannot really tell. I uploaded that patch file here: http://code.google.com/p/gil-contributions/source/browse/trunk/gil_fix/tiff… Could someone tell me what's wrong with that patch file and how to fix it? Thanks, Christian

2 4

[range] permission to merge
by Neil Groves 17 Jul '10

17 Jul '10

Please may I merge changes to Boost.Range to add overloads to various Range functions to better support the use with temporary results? These changes have been tested on the trunk over the last three days without issue. Regards, Neil Groves

3 2

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 17 Jul '10

17 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2975, Issue 1 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

Bug in boost graph library
by Arne Schwabe 17 Jul '10

17 Jul '10

Hello, first I do not if this is the right list. I new to the boost mailling lists. I found a bug in the edge_range function of adjancency list. I condensed a short example. When compiled with MSVC 9 and Debug settings I get a debug assertion, "sequence not ordered". From my understanding the edge_range function needs the stored edge list to be sorted for the std::equal_range function. If I inspect "c" with the debugger the edges are not sorted but in the same order as they were added to the graph. Arne P.S.: If this not the right place for reporting bugs can you point to the right bug tracker/etc?

3 5

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 16 Jul '10

16 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2974, Issue 3 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

Does boost help in creating generic function wrappers?
by Andy Venikov 16 Jul '10

16 Jul '10

In c++0x, creating a generic function wrapper is a bliss: template <typename Func> class gen_wrapper { Func && func_; public: gen_wrapper(Func && in) : func_(in) {} template <typename ... Prms> /*deduce result here */ operator() (Prms && ... prms) { //Do something special here. //NOTE: we can operate with arguments here too return func_(std::forward<Prms>(prms)...); } }; That's it. But if I don't have C++0x, can boost help here? functional/forward_adapter won't work since it hides function parameters, it only lets you operate with the function. It looks like it may be possible to do that by using boost/preprocessor I'll have to generate a whole lot of overloads with O(2^N) (because of the overload on (T &) or (T const &) for every argument). But it looks pretty dounting. It's basically what forward_adapter had to do. Isn't there a ready-made library that would allow me to generate all of the overloads? Thanks, Andy.

4 9

status of logging library
by Torri, Stephen CIV NSWCDD, W15 16 Jul '10

16 Jul '10

What is the status of adding a logging library to Boost? I was looking at Boost.Log and Pantheios. I would like to not have to had another library to depend on. Stephen Stephen Torri, PhD NAVAL SURFACE WARFARE CENTER DAHLGREN 17214 Ave B Suite 121 Dahlgren, Va. 22448 540-653-1082 I am not a contracting officer. I cannot modify or initiate contracts, nor do I have the authority to financially commit the government in any way.

3 3

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 16 Jul '10

16 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2974, Issue 2 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

[gsoc] Pointer Plus Bits Behavior and Interface
by Brian Bartman 16 Jul '10

16 Jul '10

Hello, Pointer Plus Bits: Is a data structure which points to specifically aligned object such that the value of the address is divisible by a power of two (the power of two which it is divisible by is given as a template argument). The empty bits of the pointer are then used to store extra boolean values relating to something (This is of the programmers choosing but it would seem best practice to make it related to the object being pointed at). The technique is of storing extra bits inside of pointers is some times referred to as bit stuffing. Clang uses this technique for their QualType pointer: http://clang.llvm.org/doxygen/classclang_1_1QualType.html So here are some of the questions I would like to pose to the community about the behavior and interface of the pointer_plus_bits data structure: 1) Should the pointer_plus_bits have a pre and post increment and decrement ( what about supporting other arithmetic operations such as add, minus, add assign etc...) ? One could do this if the sizeof the type is evenly divisible by 2 to the number of bits being "stuffed". The next/previous object in the array being traversed could be correctly pointed at (assuming that the item being pointed at IS an array). 1.a) If this is a behavior supported by the pointer_plus_bits should it keep the bits being stuffed or set them to zero each time? 2) Should the bits being stuffed apply during comparison? 3) Should the pointer provide compatibility between itself and pointer of the same type that is being stuffed (the behavior of this would mean masking out the pointer so the stuffed bits won't apply during the comparison)? (ie Should pointer_plus_bits<T,2> be comparable to T* ?) (in pointer_plus_bits 2 is the number of bits being stuffed). -- thanks, Brian Bartman

11 33

Boost.Test - Looking for a gui.
by Giorgio Zoppi 16 Jul '10

16 Jul '10

Hi, i'm looking for a gui which it's able to launch tests and test suites for using with Boost.Test. Cheers, Giorgio. -- Quiero ser el rayo de sol que cada día te despierta para hacerte respirar y vivir en me. "Favola -Moda".

3 5

Michael Herchel is ooo.
by Michael.Herchel＠rohde-schwarz.com 16 Jul '10

16 Jul '10

Ihre Nachricht betreffend: / Your Mail about: Boost Digest, Vol 2974, Issue 1 Ich werde ab 16.07.2010 nicht im Büro sein. Ich kehre zurück am 26.07.2010. Ich werde Ihre Nachricht nach meiner Rückkehr beantworten. I am on vacation and will be back in the office on 26.07.2010. I will reply your email as soon as I am back.

1 0

bjam move in svn
by Vladimir Prus 15 Jul '10

15 Jul '10

I've just moved tools/jam into tools/build/v2/engine. This is a technical step towards unified packaging and release management of what is essentially a single tool, not two independent things. There are not other changes for now, but given that many folks might have tools/jam written in some scripts, I though I'd mention this. The change is on trunk only, so should not affect testing. Anyway, let me know if something breaks. Thanks, -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build: http://boost.org/boost-build2

3 4

mpi test question
by Robert Ramey 15 Jul '10

15 Jul '10

I'm still struggling to get serialization verioning correct. Is there anyway I can run mpi serialization tests on my win32 machine w/o mpi installed? Robert Ramey

2 2

[lists] how to add a new boost mailing list?
by Eric Niebler 15 Jul '10

15 Jul '10

I'd like to set up proto(a)lists.boost.org for use by myself and a few other folks interested in discussing Proto and DSEL design issues. I could just use Google Groups (the Spirit lists use lists.SF.net, I see), but lists.boost.org would be better IMO. Does anybody know how to do this? -- Eric Niebler BoostPro Computing http://www.boostpro.com

1 1

Bits and Ints: Intention Request
by Murilo Adriano Vasconcelos 15 Jul '10

15 Jul '10

Hi, I am working on GSoC Bits and Ints project wich is a library with functions for integral data types. The motivation for this library is to provide integer algorithms and utilities optimized by doing binary manipulations so that it uses less CPU cycles, memory access and conditional branches. This library contains some classical integer algorithms such as population count, reversing bits, sign extension and bit interleaving. Would be great to Boost to incorporate this library because its functions can be used on a widely types of applications that needs to perform fast operations on integral types. Since one of slowest operations perfomed by the CPU is conditional braching (it involves pipelining, recaching, etc) this library avoid it. For the runtime versions, conditional branch is not used (if, switch, for, while, etc). Other motivation to adopt this library is the integration with Boost.MPL. Almost every function implemented have it MPL and non-MPL static version. For example: // Runtime int pop_count(uintmax_t value); // non-MPL metafunction template <uintmax_t Value> struct static_pop_count {}; // MPL template <typename IC> struct pop_count : integral_c<int, static_pop_count<IC::value>::value> {}; The contents of this library is inside of boost/integer folder and can be viewed in [0]. The static and MPL compatible metafunctions are declared on headers with static_ prefix. The partial documentation can be viewed in [1]. What already is implemented (underlined are out of proposal) - Sign extension from a length of m bits to a length of n - Bit reversal - Bit-interleaving and uninterleaving - Programming utilities for bit and bitmask manipulation - Sign function - Transfer of sign - Clear Least-Significant Nonzero Bit - Round Up or Down to Next Power of 2 - Count Trailing Zeros - Population Count - *Integer Log2* - *Count Leading Zeros* - Compile time MPL compatible abs - Compile time MPL compatible lcm - Compile time MPL compatible gcd - Safe average functions - Swap without a temporary - Templated class is_integral_constant<> My plan is to implement these functions: - Run-time GCD - Run-time LCM - Functions for getting carry bits from addition and the high-half of an integer multiply - Rounding right-shifts - Saturating arithmetic operations - Multi-word shifts - Two-word divide by one-word value - Bounds Checking - Power of 2 Crossing - Find First String of 1-Bits of a Given Length - Incrementing a Reversed Integer - Decoding a “Zero Means 2n” Field - Integer Log Base 10 I want to know wich functions you think that it is interesting to implement in this library. Also, comments and suggestions are appreciated. [0] - http://svn.boost.org/svn/boost/sandbox/SOC/2010/bits_and_ints/boost/integer/ [1] - http://svn.boost.org/svn/boost/sandbox/SOC/2010/bits_and_ints/libs/integer/… References: http://aggregate.org/MAGIC/ http://graphics.stanford.edu/~seander/bithacks.html http://bits.stephan-brumme.com/ http://www.boost.org/doc/libs/1_35_0/libs/integer/index.html Hacker's Delight / Henry S. Warren, Jr Regards, -- Murilo Adriano Vasconcelos http://murilo.wordpress.com

3 5

Is svn.boost.org down?
by Marshall Clow 14 Jul '10

14 Jul '10

I can't get to Trac. I can't check out from SVN. [ 0810 PDT ] -- Marshall

2 1

[uuid] - test fail for gcc-mingw-4.3.3
by Andy Tompkins 14 Jul '10

14 Jul '10

Hi, I'm hoping someone can help me figure out why the following test fails. See http://tinyurl.com/2w796gq It appears that it compiles but there is such little information I don't know what it wrong. Thanks Andy.

2 2

[Docs] Where's the documentation on compare_pointees.hpp?
by Mostafa 14 Jul '10

14 Jul '10

Hi all, Is there any mention in the docs on compare_pointees.hpp? (I couldn't find any.) I came across it was via some convoluted Google searches, after exhausting the boost docs route. -Mostafa

2 2

Suggested change to type_traits/function_traits
by Joseph Garvin 14 Jul '10

14 Jul '10

I only just now subscribed to this list so forgive me if this has been suggested and rejected before. Currently function_traits<F> exposes the argument types for F as individual typedefs, arg1_type, arg2_type, etc. I think this could be made more powerful with two changes: 1. First, change it to be 0 indexed, arg0_type should be first. This is more consistent with the rest of boost and C++ in general. 2. Have an inner arg struct, templated over an integer indicating which argument you want. So instead of: typedef some_type arg0_type; typedef some_other_type arg1_type; //... You would have: template<int i> struct arg template<> struct arg<0> { typedef some_type type; } template<> struct arg<1> { typedef some_other_type type; } // etc. I think this would make function_traits more usable for metaprogramming. As is, to access the different argN_types you have to resort to using boost preprocessor. For backwards compatibility the old interface could co-exist with the new one.

4 3

Boost format hex issue..
by Rob Kramer 14 Jul '10

14 Jul '10

Hi, I'm having an issue with boost::format, in that I can't get it to format a value as hexadecimal if that value is of float type. For example, the little test program below prints: "As int: 0018, 0x0012, as float: 0018, 0x0018" This is as intended, I suppose, since floats can't printed in hex form anyhow. But is there anyway I can get the 'x' format type attribute to interpret the value as integer? Simply casting it to int is not an option, because the way my float value is interpreted should depend only on the format string. I added a hack to my application that fixes it for now, but that doesn't seem very correct: boost::format (..) fmt; double v = ..; if (fmod (v, 1.0) == 0.0) fmt % (int) v; else fmt % v; Cheers! Rob #include <iostream> #include <iomanip> #include <boost/format.hpp> using namespace std; int main() { cout << "As int: " << boost::format ("%1$04d, 0x%1$04x") % 18 << ", as float: " << boost::format ("%1$04d, 0x%1$04x") % (double) 18 << endl; }

1 0

member function traits (was: Concept Traits Library)
by Barend Gehrels 14 Jul '10

14 Jul '10

Hi, Related to this message: John Maddock wrote: >> Even if the library doesn't provides an approach that works to define >> all >> the concepts, it has a lot of useful things. I also suggested to >> Terje at >> least to add the mpl and type traits extensions of the library. > > Agreed - in fact I don't see why we can't just add the new traits > direct to the type_traits library? > > Certainly if someone would like to package these up as direct > additions to type_traits (so I don't have to do much!) then I'd > certainly look favorably on adding them. > and especially related to the function_traits of the type_traits library. Is there any interest in class member function introspection? According to the current documentation, "function_traits is intended to introspect only C++ functions of the form R (), R( A1 ), R ( A1, ... etc. ) and not function pointers or class member functions.". We have, in our work on Boost.Geometry, the need to have the function_traits also working on class member functions. We first had defined a specific meta-function, only for the purpose of concept-checking. Bruno suggested that using function_traits we can avoid that. So we need it to work on member functions. I did some experiments and it is possible to let function_traits checking member functions as well, and it is easy to incorporate into function_traits. It can then be called, for a member function called "apply" of a (template)class called Strategy, like this: typedef typename boost::function_traits<typename BOOST_TYPEOF(&Strategy::apply)>::arg1_type ptype1; for the first argument (in our case a point type, which is then used in the concept-checking using BCCL, to check if it fulfills the point concept and to feed into this same apply method). Adding member function support only needs two relatively simple additions: 1) a specialization for member functions, like this (here only for a const function with 2 parameters) template <typename Class, typename R, typename T1, typename T2> struct function_traits_helper<R (Class::*) (T1, T2) const> { BOOST_STATIC_CONSTANT(unsigned, arity = 2); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; }; 2) the boost::add_pointer call in function_traits should be avoided for member functions, this can be solved by using a meta-function there: template<typename Function> struct function_traits : public detail::function_traits_helper < typename mpl::if_ < boost::is_member_function_pointer<Function>, Function, typename boost::add_pointer<Function>::type >::type > {}; Experiments are here: http://codepad.org/Qw4Uf1aG So I have a prototype, it seems to work fine and can easily be extended and incorporated. Is there more interest in it, and do the type_traits maintainers find this a good idea? Of is it already somewhere else within Boost (or planned)? Regards, Barend

3 7

Required disk space for test runner
by Michael Caisse 13 Jul '10

13 Jul '10

I just noticed my boost test runners are failing because 25GB of space is no longer enough. I could randomly start making the VM drives larger but since that is such a pain in the MS guest OS I am hoping somebody can provide guidance on how much space is currently required. Thanks - michael -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

2 1

[1.44] Asking for permission to merge Spirit patches
by Hartmut Kaiser 13 Jul '10

13 Jul '10

Hey, I would like to ask for permission to merge a couple of outstanding Spirit patches to the release branch. These improve Spirit's compatibility with gcc 3.4.x, vc7.1 and Intel/Darwin. I had to wait for the tests to cycle before I could merge them. We have people waiting for those patches to be released. https://svn.boost.org/trac/boost/changeset?reponame=&new=63942@trunk%2Fboost &old=63938@trunk%2Fboost https://svn.boost.org/trac/boost/changeset?reponame=&new=63924@trunk%2Fboost &old=63923@trunk%2Fboost https://svn.boost.org/trac/boost/changeset?reponame=&new=63908@trunk%2Fboost &old=63902@trunk%2Fboost This one adds a new (minor) feature, which I missed to merge during the release preparations. It is well tested, shows no regressions on any platforms, and was supposed to be released (the related docs have been merged already): https://svn.boost.org/trac/boost/changeset?reponame=&new=63891@trunk%2Fboost &old=63838@trunk%2Fboost Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

2 2

[Filesystem] Add features to list all mount paths, determine mount path of a path
by Daniel Trebbien 13 Jul '10

13 Jul '10

John Reynolds came up with a great idea for a possible extension to Boost Filesystem, in response to a question on the Boost Users' List about listing all available drives on Windows. The basic idea is to have the ability to list mounted filesystems. I then suggested that `basic_path` could be extended with a new member (e.g.: `mount_path`) that will determine the mount path of the given path, and add a function to iterate over all mount paths. Before I open a feature request, I wanted to ask some questions: 1. Has this idea been discussed before? 2. Is `mount_path` a good name for this? 3. What would be a good name for the function to iterate over all mount paths? 4. Is the concept of mount paths cross-platform?

6 7

[Query] on Boost.Porcess
by Alapkumar Sinha 13 Jul '10

13 Jul '10

Hi, I am trying to check if there is library for "process" in boost. I came across the following link http://www.netbsd.org/~jmmv/process/index.html . But I am not able to find the boost process header files in the boost library I downloaded. Can someone tell me whether it is part of the boost library or not. If not, is there any other library for the same purpose. I am planning to use boost libraries, but there is a need for process creation as well. So do I have to use the POSIX calls instead? Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

3 2

Vault - multiple C/C++ files versus a compressed one
by vicente.botet 13 Jul '10

13 Jul '10

Hi, "jvd" you have uploaded all these files on the vault. It would be great if you upload a compressed file at once instead, and remove the C/C++ files. Best, Vicente sobol.hpp Home/Random 11.8 Kb 17.06.2010 20:56 niederreiter_base2.hpp Home/Random 13.38 Kb 17.06.2010 20:56 faure.hpp Home/Random 10.26 Kb 17.06.2010 20:56 gray_coded_qrng_base.hpp Home/Random/detail 3.03 Kb 17.06.2010 20:45 out-sobol.png Home/Random/images 19.31 Kb 17.06.2010 20:31 out-niederreiter_base2.png Home/Random/images 19.6 Kb 17.06.2010 20:30 out-faure.png Home/Random/images 11.84 Kb 17.06.2010 20:30 0 dim2demo.cpp Uses all quasi random kernels to output quasi-randomly distributed points. Home/Random 2.54 Kb 17.06.2010 20:29 4 quasi_random_number_generator_base.hpp Home/Random/detail 4.69 Kb 17.06.2010 20:27 _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

10 14

[BGL][Serialization] Error with edge_desc_impl
by Ireneusz Szcześniak 13 Jul '10

13 Jul '10

Hi, I have a problem serializing a graph in my code. I distilled the problem into this program: #include <boost/graph/adjacency_list.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/graph/adj_list_serialize.hpp> using namespace boost; class test; typedef adjacency_list <vecS, vecS, undirectedS, property<vertex_name_t, test> > Graph; typedef Graph::edge_descriptor Edge; class test { public: Edge t; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & t; } }; int main() { Graph g; boost::archive::text_oarchive oa(std::cout); oa << g; return 0; } This is the error message that I get: /usr/include/boost/serialization/access.hpp:109: error: ‘class boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>’ has no member named ‘serialize’ If I remove the field "t" of type Edge in the class "test", I don't get this error. I would appreciate it, if someone could point out where the problem is. Thanks, Irek -- Ireneusz (Irek) Szczesniak http://www.irkos.org

1 0

permission to merge for 1.44 release (boost/python)
by Ralf W. Grosse-Kunstleve 12 Jul '10

12 Jul '10

I'd like to ask permission to merge boost/python and libs/python from the trunk into the release branch. The diffs are fairly small: http://cci.lbl.gov/~rwgk/tmp/boost_python_release_branch_merge_2010_07_12 Most changes have been in the trunk for a while (several weeks at least). The builtin_converters.hpp change is in the trunk for about a week. It only affects one platform, 64-bit Windows, on which it is very well exercised, far beyond the regular boost tests. It changes the behavior of Boost.Python under 64-bit Windows, therefore it seems important to me to merge the patch into the release as soon as possible; I'm guessing the number of users on this platform is currently very small but will increase significantly in the future. The module_init.hpp patch is in the trunk for a few days only but also extensively tested. It seems very unlikely to me that it could cause problems. Ralf

2 2

Does lock-free boost::shared_ptr<T> implementation exist?
by Anqing Xu 12 Jul '10

12 Jul '10

Hi, I'm trying to find a production quality lock free reference counted pointer implementation and boost::shared_ptr seems promising. However boost::atomic_is_lock_free(shared_ptr) returns false on Windows. I'm going to try on SUSE linux soon. According to http://www.boost.org/doc/libs/1_43_0/libs/smart_ptr/shared_ptr.htm, Starting with Boost release 1.33.0, shared_ptr uses a lock-free implementation on the following platforms: GNU GCC on x86 or x86-64; GNU GCC on IA64; Metrowerks CodeWarrior on PowerPC; GNU GCC on PowerPC; Windows. Then why does boost::atomic_is_lock_free(shared_ptr) returns false? Is there any compiler flag that needs to be set? I also found another lock free reference counted pointer, atomic_ptr from Joe Seigh here http://sourceforge.net/projects/atomic-ptr-plus/files/ but it seems to support linux with GCC only. Documentation is also poor. -Anqing

3 2

Concept Traits Library
by Edward Diener 12 Jul '10

12 Jul '10

I discovered, from asking a question on the user NG, the Concept Traits Library ( mentioned at https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Conc… ) in the Boost sandbox by Terje Slettebø and Tobias Schwinger last dated almost 6 years ago. From e-mailing Terje Slettebø I discovered that he did not have time to work on it further or submit it to Boost, since he has been working in other areas for many years as part of his job. Tobias Schwinger's e-mail address was not in the documentation so I was not able to contact him. Other Boost TMP programmers also seemed to have helped to contribute to this library. How did this library slip under the raider, so to speak ? This is a fantastic library with many useful metafunctions for the TMP programmer. For my own particular use the operator metafunctions alone are incredibly useful, but there are many more metafunctions testing for many concepts covering the STL and MPL. The documentation is also very good and there is a complete set of tests. Have I missed anything in terms of other later libraries superceding the functionality that was in this one ? Are the techniques used in this library flawed in any way ? I would love to see this library as part of Boost, if just for the operator metafunctions, and have told Terje Slettebø so.

10 22

Questions regarding new visibility stuff
by Robert Ramey 12 Jul '10

12 Jul '10

I found the page with the updated config documentation on the trunk. a) What happens if the library is being compiled as a static library? The documentation says that BOOST_SYMBOL_EXPORT is always defined. So can I assume that if a static library is being built then it's defined a empty? The serialization library now contains things like #ifdef BOOST_HAS_DECLSPEC // defined in config system Which I believe is undefined for when the library is being built statically. So things currently work. What do I replace the #ifdef above with - if anything. I believe that exporting symbols from an imported static library would create all sorts of interesting surprises. b) the serialization library contains ... #if defined(__BORLANDC__) #define BOOST_ARCHIVE_DECL(T) T __export #define BOOST_ARCHIVE_OR_WARCHIVE_DECL(T) T __export #else #define BOOST_ARCHIVE_DECL(T) __declspec(dllexport) T #define BOOST_ARCHIVE_OR_WARCHIVE_DECL(T) __declspec(dllexport) T #endif This addresses the fact that with borland, the placement of the __export and typename differs in sequence from the rest. I haven't tested borland in a long time and it's broken for the serialization library anyway (and no one has complained) so I suppose you can just ignore this - but I'd thought I'd mention it. c) When will these new macros get checked into the release branch? d) It turns out that I've had to deal with this a lot more than anyone would want to. In my case, I've divided the code into two separate libraries - serialization.dll and wserialization.dll. The second includes only those parts which depend on wide character types. The motiviation is that one only needs the part he is really using. Problems come up as wserialization import symbols from serialization so the import/export issue get's sort of complicated. User programs have the same issue as I've found in making dll/plugin tests. I don't have a real point here, just noting my experiences with this issue. Robert Ramey

2 4

boost_1.43.0 gcc-4.4.1 failure
by Neal Becker 12 Jul '10

12 Jul '10

Is this failure known/expected? "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall - fPIC -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/wave/build/gcc-4.4.1/release/instantiate_cpp_exprgrammar.o" "libs/wave/src/instantiate_cpp_exprgrammar.cpp" ...failed gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.4.1/release/instantiate_cpp_exprgrammar.o... rpm -q gcc gcc-4.4.1-2.fc11.i586

1 0

[gsoc] boost.heap snapshot
by Tim Blechmann 12 Jul '10

12 Jul '10

hi all, i have uploaded a snapshot of boost.heap [1] and the initial documentation to [2]. feedback / suggestions are more than welcome! especially i would like to hear some thoughts about the interface, and if someone requests a specific heap implementation, it is also a good time to ask for it now ... cheers, tim [1] http://tim.klingt.org/code/attachments/download/28/boost_heap_110710.tar.gz [2] http://tim.klingt.org/boost_heap -- tim(a)klingt.org http://tim.klingt.org ... to make life worth living ... Keith Rowe on making music

2 2

Differences between 'trunk' and 'release' right before 1.44 code freeze
by Marshall Clow 12 Jul '10

12 Jul '10

As far as I know, the code freeze for the 1.44 release is scheduled for tomorrow, July 12th. There are about 40 files that exist on the release branch only (do not, or no longer) exist on the trunk. Are these files that were deleted on the trunk and the deletions were never 'merged' to the release branch? There are almost 100 files that exist on the trunk that do not exist at all on the release branch. I'm confident that some of these are "works in progress", not ready for the 1.44 release. I'm also confident that others are work that should be in the 1.44 release - but I certainly can't tell the difference. There are also about 2000 files that differ (some in minor ways, some significantly) between the trunk and the release branch. If you fixed a bug during the bug sprint, you need to merge your changes to the release branch! Here's a list of the files that exist only "on one side". The attached HTML file shows all the differences. Files that exist only in 'release/' boost/asio/detail/gcc_fenced_block.hpp boost/smart_ptr/enable_shared_from_this2.hpp doc/test/accumulators.tag doc/test/dvips.version doc/test/gs.version doc/test/html/images/accumulators doc/test/latex.version libs/math/doc/html/standalone_HTML.manifest libs/range/doc/html/range/reference/adaptors/adaptors_reference.html libs/range/doc/reference/adaptors/adjacent_filtered.html libs/range/doc/reference/adaptors/copied.html libs/range/doc/reference/adaptors/filtered.html libs/range/doc/reference/adaptors/indexed.html libs/range/doc/reference/adaptors/indirected.html libs/range/doc/reference/adaptors/map_keys.html libs/range/doc/reference/adaptors/map_values.html libs/range/doc/reference/adaptors/replaced.html libs/range/doc/reference/adaptors/replaced_if.html libs/range/doc/reference/adaptors/reversed.html libs/range/doc/reference/adaptors/sliced.html libs/range/doc/reference/adaptors/strided.html libs/range/doc/reference/adaptors/tokenized.html libs/range/doc/reference/adaptors/transformed.html libs/range/doc/reference/adaptors/uniqued.html libs/spirit/example/scheme/detail libs/spirit/example/scheme/out.txt libs/spirit/example/scheme/sexpr.hpp libs/spirit/example/scheme/sexpr_test.cpp libs/spirit/example/scheme/sexpr_test.txt libs/spirit/example/scheme/simple_print.hpp libs/spirit/example/scheme/test/generate_qiexpr libs/spirit/example/scheme/test/parse_qiexpr libs/spirit/example/scheme/test/sexpr libs/spirit/example/scheme/utree_test.cpp libs/test/example/cla/Jamfile libs/test/example/est_example1.cpp libs/test/example/est_example2.cpp libs/test/example/unit_test_example_011.cpp libs/test/example/unit_test_example_012.cpp libs/test/test/CMakeLists.txt Files that exist only in 'trunk/' boost/asio/detail/gcc_hppa_fenced_block.hpp boost/asio/detail/gcc_sync_fenced_block.hpp boost/detail/extended_integer.hpp boost/iterator/function_input_iterator.hpp boost/random/detail/generator_seed_seq.hpp boost/random/detail/operators.hpp boost/random/discrete_distribution.hpp boost/random/extreme_value_distribution.hpp boost/random/seed_seq.hpp boost/random/shuffle_order.hpp boost/random/weibull_distribution.hpp boost/signals2/detail/foreign_ptr.hpp boost/smart_ptr/enable_shared_from_raw.hpp boost/test/included/execution_monitor.hpp boost/test/prod_tools.hpp boost/test/utils/setcolor.hpp boost/typeof/unsupported.hpp libs/exception/doc/source libs/filesystem/test/resize_file_test.txt libs/filesystem/test/xx libs/graph/quickbook libs/interprocess/proj/vc7ide/intermodule_singleton_test.vcproj libs/interprocess/test/intermodule_singleton_test.cpp libs/io/doc/quoted_manip.html libs/io/test/quoted_manip_test.cpp libs/iterator/doc/function_input_iterator.html libs/iterator/doc/function_input_iterator.rst libs/iterator/test/function_input_iterator_test.cpp libs/multi_array/example/resize_from_other.cpp libs/multi_array/test/reverse_view.cpp libs/parameter/doc/README.txt libs/parameter/test/literate libs/ptr_container/test/const_element_containers.cpp libs/python/example/quickstart/bin libs/random/example/password.cpp libs/random/test/chi_squared_test.hpp libs/random/test/test_binomial.cpp libs/random/test/test_binomial_distribution.cpp libs/random/test/test_discrete.cpp libs/random/test/test_discrete_distribution.cpp libs/random/test/test_extreme_value.cpp libs/random/test/test_extreme_value_distribution.cpp libs/random/test/test_gamma.cpp libs/random/test/test_gamma_distribution.cpp libs/random/test/test_poisson.cpp libs/random/test/test_poisson_distribution.cpp libs/random/test/test_seed_seq.cpp libs/random/test/test_weibull.cpp libs/random/test/test_weibull_distribution.cpp libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html libs/range/doc/html/range/reference/overview.html libs/range/test/algorithm_test/copy_n.cpp libs/range/test/algorithm_test/remove_copy.cpp libs/range/test/algorithm_test/remove_copy_if.cpp libs/range/test/algorithm_test/replace_copy.cpp libs/range/test/algorithm_test/replace_copy_if.cpp libs/range/test/algorithm_test/reverse_copy.cpp libs/range/test/algorithm_test/rotate_copy.cpp libs/range/test/algorithm_test/search_n.cpp libs/range/test/algorithm_test/swap_ranges.cpp libs/range/test/algorithm_test/unique_copy.cpp libs/range/test/replace_copy.cpp libs/smart_ptr/test/enable_shared_from_raw_test.cpp libs/spirit/doc/Missing.txt libs/spirit/doc/html/spirit/lex/reference/concepts libs/spirit/example/scheme/test/qi/calc.scm libs/test/doc/Jamfile.v2 libs/test/doc/html/utf/user-guide/test-output/FPT.html libs/test/doc/src/Jamfile.v2 libs/test/doc/src/btl-toc.xml libs/test/doc/src/btl.xml libs/test/doc/src/execution-monitor.xml libs/test/doc/src/faq.xml libs/test/doc/src/minimal-testing.xml libs/test/doc/src/program-execution-monitor.xml libs/test/doc/src/snippet libs/test/doc/src/tutorial.hello-the-testing-world.xml libs/test/doc/src/tutorial.intro-in-testing.xml libs/test/doc/src/tutorial.new-year-resolution.xml libs/test/doc/src/utf.testing-tools.xml libs/test/doc/src/utf.tutorials.xml libs/test/doc/src/utf.usage-recommendations.xml libs/test/doc/src/utf.user-guide.runtime-config.xml libs/test/doc/src/utf.users-guide.fixture.xml libs/test/doc/src/utf.users-guide.test-organization.xml libs/test/doc/src/utf.users-guide.test-output.xml libs/test/doc/src/utf.users-guide.xml libs/test/doc/src/utf.xml libs/test/doc/src/xsl libs/test/doc/utf-boostbook.jam libs/test/example/test_example1.cpp libs/test/example/test_example2.cpp libs/test/example/unit_test_example_13.cpp libs/units/example/autoprefixes.cpp tools/build/v2/test/exit_status.py tools/build/v2/tools/doxygen tools/build/v2/tools/xsltproc tools/release/merge2release.bat -- Marshall

2 1

boost.parameter defaults
by Tim Blechmann 11 Jul '10

11 Jul '10

hi all, i am currently having a hard time to figure out, how to use boost.parameter with default template arguments. i have a signature: typedef parameter::parameters<optional<tag::a>, optional<tag::b> > foo_signature; template <class X, class A = boost::parameter::void_, class B = boost::parameter::void_> class foo {}; now, how do i set a default parameter for one of the template arguments? it is either not documented, or i am missing the point, where it is explained ... thanks, tim -- tim(a)klingt.org http://tim.klingt.org Which is more musical, a truck passing by a factory or a truck passing by a music school? John Cage

3 3

[fiber] with assembler
by Oliver Kowalke 11 Jul '10

11 Jul '10

I've uploaded a new version of boost.fiber to boost vault. It provides assembler for x86 (32/64bit) - PowerPC and ARM are planed. Performance of the raw context-switch is 6-12 times faster than swapcontext(POSIX). Mutexes, condition- and event-variables suspend fibers waiting on those sync. primitives and can be shared by fiber running on different threads (schedulers).

2 2

library proposal : odeint
by Karsten Ahnert 11 Jul '10

11 Jul '10

Hi, I proposed a library for solving ordinary differential equations some months ago. Since this time, we have worked a lot on this topic and we would like to start a discussion about the needs and the design of the library. The library odeint ("odeint" comes from integration of ordinary differential equations ) can be found in the sandbox and some preliminary documentation is also available: http://svn.boost.org/svn/boost/sandbox/odeint/ http://svn.boost.org/svn/boost/sandbox/odeint/libs/numeric/odeint/doc/html/… One of our main aims is the independence on a specific container or array type, such that the library can work with ODEs defined on arbitrary topologies, like networks, lattices , grids, etc. So, any comments on this library are highly welcome, as well as contributions (of any kind). Best regards, Karsten

8 13

Maintenance suspended
by David Abrahams 10 Jul '10

10 Jul '10

All --- I tried, I really did, to resolve the trunk and release branches of my libraries for the upcoming release. But the truth is that I'm finding Boost's current interdependent structure and the sluggishness of SVN on a project of our size just makes everything too hard to do. I'm now just declaring openly what has effectively been true for the past couple of months: I'm not maintaining my libraries until I complete the transition to Git that goes along with using Ryppln (http://ryppl.org) I'm sorry, I know it's not good or right, but I know it's going to be for the best in the long run. That should all happen fairly quickly now, anyway. -- David Abrahams BoostPro Computing http://boostpro.com

8 13

[Query] Cross Compiling for mipsel-linux
by Alapkumar Sinha 10 Jul '10

10 Jul '10

Hi, Pardon me if it is not the right forum to ask the below question. I am trying to build the boost library for mipsel-linux. I followed the following procedure. 1. Changed user-config.jam a. using gcc : mipsel : mipsel-linux-g++ ; 2. Then called bjam as: ./bjam --toolset=gcc-mipsel When I do this I am getting the following error. /******/ gcc.compile.c++ bin.v2/libs/math/build/gcc-mipsel/release/threading-multi/cyl_bessel_i.o /tmp/ccgLCiZn.s: Assembler messages: /tmp/ccgLCiZn.s:14975: Error: opcode not supported on this processor: mips1 (mips1) `ll $3,4($4)' /tmp/ccgLCiZn.s:14977: Error: opcode not supported on this processor: mips1 (mips1) `sc $5,4($4)' /tmp/ccgLCiZn.s:15063: Error: opcode not supported on this processor: mips1 (mips1) `ll $3,8($4)' /tmp/ccgLCiZn.s:15065: Error: opcode not supported on this processor: mips1 (mips1) `sc $10,8($4)' /tmp/ccgLCiZn.s:15105: Error: opcode not supported on this processor: mips1 (mips1) `ll $3,4($4)' And so on /******/ Can someone help me on where I am going wrong? Regards, Alap ________________________________ This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system. ______________________________________________________________________

2 1

Re: [boost] Maintenance suspended
by Christophe Henry 10 Jul '10

10 Jul '10

David Abrahams wrote: > All --- > >> I tried, I really did, to resolve the trunk and release branches of my libraries for the upcoming release. >But the truth is that I'm finding Boost's current interdependent structure and the sluggishness of SVN on >a project of our size just makes everything too hard to do. I'm now just declaring openly what has >effectively been true for the past couple of months: I'm not maintaining my libraries until I complete the >transition to Git that goes along with using Ryppln (http://ryppl.org) I'm sorry, I know it's not good or >right, but I know it's going to be for the best in the long run. That should all happen fairly quickly now, anyway. > > -- > David Abrahams > BoostPro Computing > http://boostpro.com > Dave, having a single library to maintain I probably cannot fully appreciate your situation. However, I would like to attract your attention to the very special position you have in this community, especially among newcomers I count myself with. Seeing dave (I mean THE dave! ;-) ) not maintaining his libraries creates a precedent and sends a wrong signal, which deals a blow to boost's credibility. Companies could wonder, waow, if the community cannot even help dave maintain his libraries, in which state must be others? Also considering that ryppl is so far not a reality yet and not even agreed on, we need a solution for the time being. Why not simply request help from the community to which you brought so much? I'm sure that many would be happy to help you on this. So, concretely, what is the problem? Do you have no time handling the feature requests or is svn the problem? If it is just about merging and doing some mechanical svn-related tasks, this is a very workable solution and I gladly offer my help. If it is about feature requests, this is a more complicated one (but seemingly unrelated to svn) and you could also ask for support on this list. Surely, someone competent will step forward and free you from much work. You could simply review patches before commit. It would also help the community by having more than one person familiar with your libraries. Christophe PS: Thinking about it more, it would be a good idea if every boost author would mentor one or several "young" members who could take over when the author's situation changes. In any company, we usually try to avoid having only one person knowing a subject. Maybe a boostcon would be a good place where authors would explain the inside of their library?

5 7

[serialization] tests broken on release branch?
by Richard Webb 09 Jul '10

09 Jul '10

I'm getting error: Unable to find file or target named error: 'test_diamond_complex.cpp' error: referred from project at error: '../libs/serialization/test' on the release branch regression tests.

2 1

[Format] Broken on release branch?
by Richard Webb 09 Jul '10

09 Jul '10

The release branch test results are showing new failures in a number of libs, several of which look to be because of a breakage in Format -> looks like it might have been partially merged from Trunk, and has some bits missing?

2 1

[trac] spam
by Steven Watanabe 09 Jul '10

09 Jul '10

AMDG #4350 was spammed an hour ago. https://svn.boost.org/trac/boost/ticket/4350 In Christ, Steven Watanabe

1 0

Mentoring (Was: Maintenance suspended)
by Christophe Henry 09 Jul '10

09 Jul '10

>>On Jul 8, 2010, at 8:39 PM, Joel de Guzman wrote: >> >> On 7/8/10 8:28 PM, Christophe Henry wrote: >> >>> PS: >>> Thinking about it more, it would be a good idea if every boost author >>> would mentor one or several "young" members who could take over when >>> the author's situation changes. In any company, we usually try to >>> avoid having only one person knowing a subject. >>> Maybe a boostcon would be a good place where authors would explain the >>> inside of their library? >> >> This is exactly what happened to Fusion and now happening to Phoenix >> with the past and present GSOC projects. > >Hey, that's a great idea. To actually institute such a program requires someone to come up with "young" >members who are ready and willing to be mentored. Christophe, would you like to take that project on? It's the key point, to find interested and competent potential "young" (or not ;-) ) members. It seems to me pretty clear that the most motivated candidates are to be found at the boostcon. I will happily take that project on if my idea is viable, and it would be: Authors (and I offer myself as testperson) prepare a talk or a paper where they show the inside of their library, as detailed as possible. - Participants get to learn some of the advanced techniques used in boost libraries - Boost gains an extended circle of possible contributors - Authors prepare a succession if needed later, or the possibility of having more people able to implement changes / fixes. They also get an in-depth review by very clever guys (honestly, I am every year impressed). Preparing others is especially important for people like me who are developing a library alone. Looks to me like a win/win scenario :) This can be coupled with GSOC projects. After learning the inside of a library, these participants could extend it. Alternatively, we can organize this with participants of this list, but it would require a greater deal of work for authors who would have to write down a lot. Some thoughts about it? Potential candidates (as speaker or attendee)? Christophe

6 9

Re: [boost] Parsing boost 1.43 with gcc-xml (bug #4324 - fixed in trunk)
by Benoît Leveau 09 Jul '10

09 Jul '10

Steven Watanabe wrote: > Benoît Leveau wrote: > > I have problems parsing boost 1.43 with gcc-xml, due to the lack of > > several preprocessor flags in /boost/config/compiler/gcc_xml.hpp. > > > > I saw this problem has been fixed in the trunk 4 weeks ago: > > /trunk/boost/config/compiler/gcc_xml.hpp > > Revision 62666: Disable all C++0x features in GCC-XML for now. Fixes #4324. > > > > I am not familiar with the details of the release process, so I'm > > wondering if a patched 1.43 version will be released? > > This bug is quite serious as it prevents boost from being parsed by > > gccxml (which, I guess, is listed as a supported compiler), > > and 1.44 hasn't been released yet, which leaves no option other than > > patching my local copy with the fix from the trunk. > > I would prefer to use an official release as it's not for a personal > > project, but will do the patch if I have to. > > > > 1.44 is scheduled for August 2nd. If you need this fix now, you'll > have to patch your copy. Ok, that's what I thought.. Thanks for the answer! Benoit

1 0

[xint] Design Question
by Chad Nelson 09 Jul '10

09 Jul '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm adding an "unsigned" option to the XInt library, so that fixed-length integers act exactly like their built-in counterparts. That in itself is not a problem, since unsigned fixed-length integers have a well-known and standard behavior. The problem is: what should the library do if the user asks for an unsigned *non*-fixed-length integer? The options I've come up with so far, in order of my personal preference: A: Make the unsigned option part of the fixed-length option, so it *can't* be specified separately. (The most elegant solution, but perhaps not the most useful.) B: Refuse to compile (or if I can't find a way to do that, instantiate) it, on the grounds that the combination can't logically be supported. C: Throw an exception if any calculation results in a negative number. (Not very useful, but logical because under the built-in types' unsigned rules, a negative number in an unlimited-length library would be infinitely long.) D: Force any negative numbers to a different value, such as zero or maybe their positive counterparts. (I can't think of any use for this, I just put it here for completeness.) Can anyone think of a potential reason for options C or D? Or a reason to prefer option B? Or maybe come up with a different idea entirely? - -- Chad Nelson Oak Circle Software, Inc. * * * -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkwY2EYACgkQp9x9jeZ9/wSZuACgqIjJ85p0wUrwhCR/tcvY8QUL bagAniFZU/UGwKfpK7juhuWYxXwMb2Ar =qvcJ -----END PGP SIGNATURE-----

7 24

[quickbook] Question about macros and templates
by Andrey Semashev 09 Jul '10

09 Jul '10

Hi, I'm writing docs in quickbook and stumbled upon a problem. I have this document structure: main.qbk [include a.qbk] [include b.qbk] [include c.qbk] [include x.qbk] [include y.qbk] [include z.qbk] [xinclude r.xml] In files a, b and c I define macros that would unfold into headerref, classref, etc. for the items described in the auto-generated r.xml Reference. I want to use these macros in x, y and z, both in text and code samples. The problem is that, it seems, quickbook doesn't unfold these macros in x, y and z. My guess is that the scope of the macros is limited to the files they are defined in. Is that true? I tried to do the same with templates. It seems that templates are visible in x, y and z, but still are not unfolded in code samples. Is there a way around this problem? Thanks.

2 2

Python port development
by Vladimir Prus 09 Jul '10

09 Jul '10

Hi, as many here probably know, the strategic direction for Boost.Build is the use of Python as implementation language, which should bring a lot of benefits. For more detailed rationale, see: https://trac.lvk.cs.msu.su/boost.build/wiki/PythonPort The port has got so far as to build "hello, world" with gcc, but then stalled. Fortunately, my employer, CodeSourcery, has a sabbatical program, and completing a Python port of Boost.Build was approved as the goal of my own sabbatical. I'll have 4 almost-full-time weeks, starting next Monday, Jule 12. Of course, I'll be asking for feedback, so don't be surprised when I start to post design questions. Thanks, -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build: http://boost.org/boost-build2

3 2

Vault: `BGL` directory
by Daniel Trebbien 08 Jul '10

08 Jul '10

Would someone please delete the `BGL` directory on the Vault? I created it before I found the more-suitable `Algorithms/graph` directory.

1 0

[python] boost-1.44 apply patch br#3843
by Neal Becker 08 Jul '10

08 Jul '10

I'd like to see this patch applied for 1.44. Seems pretty harmless. The purpose is so that BOOST_PYTHON_MODULE macro will expand it's arguments, so that this code will work: #define MY_NAME BOOST_PP_CAT(ldpc_,SIMCASE) BOOST_PYTHON_MODULE(MY_NAME) {... https://svn.boost.org/trac/boost/attachment/ticket/3843/boost_python_module…

2 1

Re: [boost] Maintenance NOT suspended
by Christophe Henry 08 Jul '10

08 Jul '10

>I hereby apologize to the community for my earlier announcement and request that you accept a retraction Thanks for taking this courageous decision! >> So, concretely, what is the problem? Do you have no time handling the >> feature requests or is svn the problem? > >I'll prepare a proper response to these questions in a separate message, but I wanted to head off any damage immediately. As I made the suggestion, count me in. After you explain what you need, hopefully more will volunteer. Regards, Christophe

1 0

[thread][VS2010] shared_mutex woo's
by Hartmut Kaiser 08 Jul '10

08 Jul '10

This: #include <boost/thread.hpp> int main() { boost::shared_mutex mtx; boost::upgrade_lock<boost::shared_mutex> l(mtx); boost::upgrade_to_unique_lock<boost::shared_mutex> ul(l); return 0; } still fails on VC21010. Defining BOOST_NO_RVALUE_REFERENCES makes this compile, though. Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

3 3

[Fusion] Permission to update release branch and roll in dependencies
by Tobias Schwinger 08 Jul '10

08 Jul '10

Dear release team, we're about to freeze the next release. I'd like to kindly ask for your permission to address the issues discussed in this thread http://thread.gmane.org/gmane.comp.lib.boost.devel/198532/ before it's too late, again. Reportedly the outdated files do - other than hoped in that thread - NOT work anymore - and neither do the new and documented ones for the lack of dependencies. So, what I'd like to do is: o merge trunk changes into the Functional module of Fusion o add Forward o optionally add Factory Please check the new mini libraries for "release compliance" and give me a go on the fix. Would be too bad to go with a partially defunct Fusion in two releases for bureaucratic reasons. Please also note that rolling back to a proper previous version might involve more changes and will complicate future merges for us. Regards, Tobias

6 8

Name conflict: boost/range/adaptor/replaced.hpp and boost/algorithm/string/replace.hpp
by Jeremy Maitin-Shepard 08 Jul '10

08 Jul '10

I found that these two header files (the second one being required indirectly by including boost/exception/all.hpp) cannot be used together, because they both attempt to bring a definition of replace_range into the boost namespace. This is with boost-1.43.

1 0

boost.atomic library works on Linux but not on Windows -- please help
by Anqing Xu 07 Jul '10

07 Jul '10

Hi, In search of a std:atomic<T> implementation, I decided to give boost.atomic library a try. My initial investigation found it worked fine under linux. However it does not work on Windows. Here is a little test program to demonstrate: #include <iostream> #include <boost/atomic.hpp> #include <boost/lockfree/detail/tagged_ptr.hpp> #include <boost/lockfree/detail/freelist.hpp> int main() { boost::lockfree::caching_freelist<int> pool(3); int* pInt1 = pool.allocate(); *pInt1 = 1; int* pInt2 = pool.allocate(); *pInt2 = 2; int* pInt3 = pool.allocate(); *pInt3 = 3; pool.deallocate(pInt1); pool.deallocate(pInt2); pool.deallocate(pInt3); int* pInt4 = pool.allocate(); int* pInt5 = pool.allocate(); int* pInt6 = pool.allocate(); } The test uses boost.lockfree library, which you can download from http://tim.klingt.org/git?p=boost_lockfree.git If you set a break point, say in fallback.hpp, you will see that on Windows it falls back to spinlock. Can somebody please suggest how to fix this? I suspect the issue has something to do with intptr_t type. I looked into the code but quickly started to have headache. Atomic library uses template metaprogramming and is not easy to understand. -Anqing

1 0

[mpl] zero argument member template detection
by Daniel Walker 07 Jul '10

07 Jul '10

Hello, Following up on Steven's question from a few weeks ago (sorry for delay) about has_xxx_template, there is a bug in msvc 9 and 10 that causes ICE. I filed a bug against msvc here. https://connect.microsoft.com/VisualStudio/feedback/details/571720 Here is code to reproduce the bug. struct S { template<class T = int> struct X {}; }; template<class T> // The following line causes ICE void f(typename T::template X<>*) {} // The following alternative line compiles cleanly //void f(typename S::template X<>*) {} // The following line also compiles cleanly //void f(typename T::template X<int>*) {} int main() { f<S>(0); } Incidentally, the code above is accepted by msvc 8 and gcc... and clang! :) I do not know of a work around. Moreover, while looking for a work around, I found another bug in has_xxx_template that may render zero argument detection unreliable on any compiler. Rethinking some of my original design choices, I now believe that it is a bad idea to conflate member template detection and template arity detection. It would be better if BOOST_MPL_HAS_XXX_TEMPLATE_DEF defined a metafunction to detect member templates of any arity (up to some configurable limit). So I made the appropriate changes to effect this and updated the tests and documentation. The changes did not cause errors running the MPL test suite on gcc 3.4, 4.3, 4.4, 4.5 and msvc 7.1, 8, 9, 10. So, in sum, the interface is now cleaner and works consitently across compilers. Since this is the first release of has_xxx_template, I went ahead and checked the changes into trunk. Hopefully, I got this committed in time for the 1.44 code freeze... Do I still need to merge to release? Further discussion of some details follows for those who are interested. First, regarding the general problem of template arity detection, perhaps this is a motivating need for a seperate template_arity metafunction. There's already one in mpl/aux_ that's not part of the external library API. If there's interest, I'll post more on this later in a seperate thread. Regarding the specific problem of zero member template argument detection for has_xxx_template, the issue is that while you can instantiate a template with zero arguments, you do not actually declare a template with zero arguments, obviously. For example, struct S { template<class T = int> struct xxx {}; }; So, S::xxx is actually a one argument template that can be instatiated with zero args; e.g. S::xxx<>(). Originally, I was trying to detect how many arguments a template can be instatiated with, but I think this is the wrong approach. The technique I'm using in BOOST_MPL_HAS_XXX_TEMPLATE_DEF can only reliably detect the declared arity of the tempate. Here's a brief outline of how it works. BOOST_MPL_HAS_XXX_TEMPLATE_DEF defines a metafunction that uses SFINAE to detect member templates in the following way. template<template<class> class> struct substitute {}; template<class T> long has_xxx_test(substitute< T::template xxx >*); template<class> short has_xxx_test(...); const bool result = sizeof(has_xxx_test<S>(0)) == sizeof(long); However, to detect zero arguments, the following would be invalid, since you cannot declare a template with zero parameters. template<template<> class> struct substitute {}; So instead the zero arg test was performed using template<class T> long has_xxx_test(typename T::template xxx<>*); Unfortunately, this test causes ICE on msvc, and really, it doesn't completely work on any compiler, since it is invalid if T's xxx member template does not have default parameters; i.e. it cannot properly reject member templates requiring one or more arguments. The new BOOST_MPL_HAS_XXX_TEMPLATE_DEF on trunk resolves these issues by removing the requirement that users specify the template arity and arguments. Instead, it generates a metafunction that detects member templates of any arity. It does so by providing several overloads of the internal test function, one for each arity, up to a user configurable maximum (BOOST_MPL_LIMIT_METAFUNCTION_ARITY) as illustrated by the following simplified code. #include <boost/mpl/assert.hpp> #include <boost/mpl/bool.hpp> template<class T> class has_xxx { template<template<class> class> struct substitute1 {}; template<template<class,class> class> struct substitute2 {}; template<class U> static long has_xxx_test(substitute1<U::template xxx>*); template<class U> static long has_xxx_test(substitute2<U::template xxx>*); template<class> static short has_xxx_test(...); public: static const bool value = sizeof(has_xxx_test<T>(0)) == sizeof(long); typedef boost::mpl::bool_<value> type; }; struct S1 { template<class> struct xxx {}; }; struct S2 { template<class,class> struct xxx {}; }; int main() { BOOST_MPL_ASSERT(( has_xxx<S1> )); BOOST_MPL_ASSERT(( has_xxx<S2> )); BOOST_MPL_ASSERT_NOT(( has_xxx<int> )); } Daniel Walker

1 0

Re: [boost] auto-link with gcc/windows
by Jürgen Hunold 07 Jul '10

07 Jul '10

Hi Robert ! On Monday, 5. July 2010 19:35:02 you wrote: > In my code I use BOOST_HAS_DECLSPEC but I'm having problems with > mingw. I'm not sure it has anything to do with this, but it's not at clear > to me > what the differing meanings are of BOOST_HAS_DECLTYPE and > BOOST_HAS_DECLSPEC. BOOST_HAS_DECLSPEC is the interesting one. Please find a patch adding two more "#define BOOST_SERIALIZATION_SOURCE" to the sources. This fixed compilation for me when using gcc's symbol visibility and might help here as mingw uses symbol visibility "under the hood" for __declspec(dllimport/-export). Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * juergen.hunold(a)gmx.de ! -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

8 23

Parsing boost 1.43 with gcc-xml (bug #4324 - fixed in trunk)
by Benoît Leveau 07 Jul '10

07 Jul '10

Hello, I have problems parsing boost 1.43 with gcc-xml, due to the lack of several preprocessor flags in /boost/config/compiler/gcc_xml.hpp. I saw this problem has been fixed in the trunk 4 weeks ago: /trunk/boost/config/compiler/gcc_xml.hpp Revision 62666: Disable all C++0x features in GCC-XML for now. Fixes #4324. I am not familiar with the details of the release process, so I'm wondering if a patched 1.43 version will be released? This bug is quite serious as it prevents boost from being parsed by gccxml (which, I guess, is listed as a supported compiler), and 1.44 hasn't been released yet, which leaves no option other than patching my local copy with the fix from the trunk. I would prefer to use an official release as it's not for a personal project, but will do the patch if I have to. Thanks for your help! Benoit

2 1

[thread] more generic future?
by Oliver Kowalke 07 Jul '10

07 Jul '10

The future implementation of boost.thread uses boost.mutex, condition and condition_any. What about renaming future to future_base or put it into namespace boost::detail and pass the sync. primitves (mutex, condition) as template args? This would provide the way that other libs could use the future impl with their own sync. primitives. namespace boost { namespace detail { template< typename MutexT, typename ConditionT > future {...}; }} namespace boost { typedef detail::future< mutex, condition > future; namespace fibers { class mutex {}; class condition {}; typedef detail::future< mutex, condition > future; }} boost::future -> uses pthreads/Win32 threads boost::fibers::future -> used for fibers Oliver

1 0

Boost Graph Library: Dijkstra Shortest Path ignores color_map in named parameters?
by Alex Hagen-Zanker 07 Jul '10

07 Jul '10

I am trying to use the dijkstra_shortest_path algorithm with named parameters. It worked well, until I wanted to pass the color map as an argument. Despite providing my own color_map, the algorithm ends up creating its own two_bit_color_map. I am using the following code: template<class TGraph, class TVisitor> int myDijkstra(TGraph& graph, TVisitor& visitor, int source) { bool earlyExit = false; const int nVertices =boost::num_vertices(graph); std::vector<double> distances(nVertices); std::vector<typename TGraph::vertex_descriptor> predecessors(nVertices); std::vector<boost::default_color_type> colors(nVertices); try { boost::dijkstra_shortest_paths<TSubGraph, TVisitor >( graph, source, boost::predecessor_map( &predecessors[0] ) .distance_map( &distances[0] ) .visitor( visitor ) .color_map( &colors[0] ) ); } catch( EarlyExitByVisitor ) { earlyExit = true; } return earlyExit ? CountBlackVertices(colors) : nVertices; } The code compiles and runs, but the vector of colors is never modified (I can initialize it with different colors, makes no difference). The predecessor and distance maps are fine. Tracing what happens in the source code (boost version 1.43). I notice that the Named Parameter Variant (line 466) gets the distance, weight and index from the named parameter object. It then passes on to the dijkstra_dispatch1 (line 443) that adds the default for the distance map. It passes on to dijkstra_dispatch2 (line 413) that sets even more parameters, but not the color map. Finally it calls dijkstra_shortest_paths variant with default color_map (line 342), which ignores the named parameter object and provides its own color map. (all of the line numbers are in file dijkstra_shortest_paths.hpp). My question is: is this a bug? Can I use named parameters if I want to provide my own color_map? How? Any help is appreciated. -- Alex Hagen-Zanker

2 7

Unicode and codecvt facets
by Mathias Gaunard 06 Jul '10

06 Jul '10

As some may know, I am working on a Unicode library that I plan to submit to Boost fairly soon. The codecs in that library are based around iterators and ranges, but since there was some demand for support for codecvt facets I am working on adapting those into that form as well. Unfortunately, it seems it is only possible to subclass std::codecvt<char, char, mbstate_t> and std::codecvt<wchar_t, char, mbstate_t>. I personally don't know and understand that much about iostreams/locales, but I have looked quickly at libstdc++'s implementation and it doesn't seem like it is possible for std::locale to contain any other instance of codecvt. What I wonder is if there is really a point to facets, then. std::codecvt<wchar_t, char, mbstate_t> means that the in-memory charset would be UTF-16 or UTF-32 (depending on the size of wchar_t) while the file would be UTF-8. The problem is that wchar_t is platform-dependent and not really reliable, so it's not really something I'd recommend to use as the in-memory representation to deal with Unicode. Why do people even use utf8_codecvt_facet anyway? What's wrong with dealing with UTF-8 rather than maybe UTF-16 or UTF-32?

4 10

auto-link with gcc/windows
by Robert Ramey 06 Jul '10

06 Jul '10

I've been seeing a problem in building MinGW version of he serializationalization library. This is related to auto-link. Now I notice that in config/compiler/gcc.hpp we've got: #if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_HAS_DECLTYPE ... # define BOOST_NO_DECLTYPE Also in another part of the same file I find: #if __GNUC__ >= 4 # if defined(_WIN32) || defined(__WIN32__) || defined(WIN32) // All Win32 development environments, including 64-bit Windows and MinGW, define // _WIN32 or one of its variant spellings. Note that Cygwin is a POSIX environment, // so does not define _WIN32 or its variants. # define BOOST_HAS_DECLSPEC In my code I use BOOST_HAS_DECLSPEC but I'm having problems with mingw. I'm not sure it has anything to do with this, but it's not at clear to me what the differing meanings are of BOOST_HAS_DECLTYPE and BOOST_HAS_DECLSPEC. Robert Ramey

3 2

Complexity of Goldberg's push_relabel max flow algorithm used in BOOST
by Dan Jiang 06 Jul '10

06 Jul '10

Anyone knows the time complexity of the Goldberg's push_relabel max flow algorithm used in BOOST? The BOOST documentation says O(n^3). But since the code seems to use highest label, global and gap relabeling and hence the complexity should be O(n^2 * m^1/2). According to literature, the complexity would be O(n^3) if FIFO is used in implementation. Please correct if I am wrong. Dan _________________________________________________________________ Look 'em in the eye: FREE Messenger video chat http://go.microsoft.com/?linkid=9734386

1 0

[function_types] is there an equivalent for functors?
by Edd Dawson 06 Jul '10

06 Jul '10

Hi all, I'm looking for code that does what boost::function_types::parameter_types does but for functors. Support for things such as boost::bind/lambda/function/signals(1&2)/etc and the standard binders and adaptors would be nice. I specifically want to be able to do something like: template<typename Functor> void f(const Functor &f) { typedef typename functor_params<Functor>::type params; // an mpl sequence const std::size_t arity = functor_arity<Functor>::value; // ... } I started writing code for this but I've come to the point where I can't see a way to support libraries such as boost::bind without relying on their implementation details. But perhaps something like this already exists? Thanks, Edd

6 19

[BGL] trunk@63671: `detail/adjacency_list.hpp` needs to include <algorithm>
by Daniel Trebbien 05 Jul '10

05 Jul '10

I get a compilation error in `boost/graph/detail/adjacency_list.hpp` that is fixed by adding `#include <algorithm>` to the top: /usr/local/include/boost/graph/detail/adjacency_list.hpp:1653: error: `equal_range` is not a member of `boost::graph_detail` A patch is attached.

2 3

Coming up on 1.44 code freeze
by Marshall Clow 05 Jul '10

05 Jul '10

I've been looking at the trunk and release branch, I've noticed that there are a lot of files that exist only in one or the other. My suspicion is that this is a result of work not getting merged to the release branch. The last day for "major code changes" for the 1.44 release is Monday, July 5th, Here's a list of what I found: Only in 'release/' boost/fusion/adapted/class/class_iterator.hpp boost/fusion/adapted/class/detail/at_impl.hpp boost/fusion/adapted/class/detail/at_key_impl.hpp boost/fusion/adapted/class/detail/begin_impl.hpp boost/fusion/adapted/class/detail/category_of_impl.hpp boost/fusion/adapted/class/detail/end_impl.hpp boost/fusion/adapted/class/detail/has_key_impl.hpp boost/fusion/adapted/class/detail/is_sequence_impl.hpp boost/fusion/adapted/class/detail/is_view_impl.hpp boost/fusion/adapted/class/detail/size_impl.hpp boost/fusion/adapted/class/detail/value_at_impl.hpp boost/fusion/adapted/class/detail/value_at_key_impl.hpp boost/fusion/adapted/class/extension.hpp boost/lambda/detail/control_structures_impl.hpp boost/numeric/ublas/tempfile.2.tmp boost/numeric/ublas/tempfile.3.tmp boost/numeric/ublas/tempfile.4.tmp boost/numeric/ublas/tempfile.tmp boost/smart_ptr/enable_shared_from_this2.hpp doc/test/accumulators.tag doc/test/dvips.version doc/test/gs.version doc/test/html/images/accumulators doc/test/latex.version libs/filesystem/doc libs/filesystem/example libs/filesystem/src libs/filesystem/test/convenience_test.cpp libs/filesystem/test/deprecated_test.cpp libs/filesystem/test/equivalent.cpp libs/filesystem/test/fstream_test.cpp libs/filesystem/test/large_file_support_test.cpp libs/filesystem/test/lpath.hpp libs/filesystem/test/msvc libs/filesystem/test/operations_test.cpp libs/filesystem/test/path_test.cpp libs/filesystem/test/wide_test.cpp libs/fusion/test/functional/make_unfused_generic.cpp libs/fusion/test/functional/make_unfused_lvalue_args.cpp libs/fusion/test/functional/make_unfused_rvalue_args.cpp libs/fusion/test/functional/unfused_generic.cpp libs/fusion/test/functional/unfused_lvalue_args.cpp libs/fusion/test/functional/unfused_rvalue_args.cpp libs/graph/example/kolmogorov-eg.cpp libs/graph/test/kolmogorov_max_flow_test.cpp libs/math/doc/html/standalone_HTML.manifest libs/range/doc/html/range/reference/adaptors/adaptors_reference.html libs/range/doc/reference/adaptors/adjacent_filtered.html libs/range/doc/reference/adaptors/copied.html libs/range/doc/reference/adaptors/filtered.html libs/range/doc/reference/adaptors/indexed.html libs/range/doc/reference/adaptors/indirected.html libs/range/doc/reference/adaptors/map_keys.html libs/range/doc/reference/adaptors/map_values.html libs/range/doc/reference/adaptors/replaced.html libs/range/doc/reference/adaptors/replaced_if.html libs/range/doc/reference/adaptors/reversed.html libs/range/doc/reference/adaptors/sliced.html libs/range/doc/reference/adaptors/strided.html libs/range/doc/reference/adaptors/tokenized.html libs/range/doc/reference/adaptors/transformed.html libs/range/doc/reference/adaptors/uniqued.html libs/test/example/cla/Jamfile libs/test/example/est_example1.cpp libs/test/example/est_example2.cpp libs/test/example/unit_test_example_011.cpp libs/test/example/unit_test_example_012.cpp libs/test/test/CMakeLists.txt Only in 'trunk/' boost/detail/extended_integer.hpp boost/filesystem/detail boost/filesystem/v2 boost/filesystem/v3 boost/fusion/algorithm/iteration/iter_fold.hpp boost/fusion/algorithm/iteration/reverse_fold.hpp boost/fusion/algorithm/iteration/reverse_iter_fold.hpp boost/fusion/include/iter_fold.hpp boost/fusion/include/reverse_fold.hpp boost/fusion/include/reverse_iter_fold.hpp boost/graph/boykov_kolmogorov_max_flow.hpp boost/graph/loop_erased_random_walk.hpp boost/graph/random_spanning_tree.hpp boost/io/detail boost/iterator/function_input_iterator.hpp boost/numeric/ublas/assignment.hpp boost/numeric/ublas/functional.hpp-0 boost/random/detail/operators.hpp boost/random/discrete_distribution.hpp boost/random/extreme_value_distribution.hpp boost/random/seed_seq.hpp boost/random/shuffle_order.hpp boost/random/weibull_distribution.hpp boost/serialization/item_version_type.hpp boost/signals2/detail/foreign_ptr.hpp boost/smart_ptr/enable_shared_from_raw.hpp boost/spirit/home/karma/detail/attributes.hpp boost/spirit/home/karma/detail/get_stricttag.hpp boost/spirit/home/karma/directive/strict_relaxed.hpp boost/spirit/home/karma/nonterminal/debug_handler.hpp boost/spirit/home/karma/nonterminal/debug_handler_state.hpp boost/spirit/home/karma/nonterminal/simple_trace.hpp boost/spirit/home/qi/detail/attributes.hpp boost/spirit/home/qi/nonterminal/debug_handler_state.hpp boost/spirit/include/karma_strict_relaxed.hpp boost/system/api_config.hpp boost/test/included/execution_monitor.hpp boost/test/prod_tools.hpp boost/test/utils/setcolor.hpp boost/type_traits/is_lvalue_reference.hpp boost/type_traits/is_rvalue_reference.hpp boost/typeof/unsupported.hpp libs/algorithm/string/test/find_format_test.cpp libs/exception/doc/source libs/filesystem/test/resize_file_test.txt libs/filesystem/test/xx libs/filesystem/v2 libs/filesystem/v3 libs/format/test/format_test_enum.cpp libs/fusion/test/algorithm/fold.hpp libs/fusion/test/algorithm/fold2.cpp libs/fusion/test/algorithm/iter_fold.cpp libs/fusion/test/algorithm/reverse_fold.cpp libs/fusion/test/algorithm/reverse_iter_fold.cpp libs/graph/doc/boykov_kolmogorov_max_flow.html libs/graph/doc/figs/bk_max_flow.gif libs/graph/doc/figs/warning.png libs/graph/example/boykov_kolmogorov-eg.cpp libs/graph/quickbook libs/graph/test/boykov_kolmogorov_max_flow_test.cpp libs/graph/test/random_spanning_tree_test.cpp libs/interprocess/proj/vc7ide/intermodule_singleton_test.vcproj libs/interprocess/test/intermodule_singleton_test.cpp libs/io/doc/quoted_manip.html libs/io/test/quoted_manip_test.cpp libs/iostreams/test/deprecated_file_descriptor_test.cpp libs/iostreams/test/detail/file_handle.hpp libs/iterator/doc/function_input_iterator.html libs/iterator/doc/function_input_iterator.rst libs/iterator/test/function_input_iterator_test.cpp libs/lambda/test/result_of_tests.cpp libs/multi_array/example/resize_from_other.cpp libs/multi_array/test/reverse_view.cpp libs/numeric/ublas/bench5 libs/numeric/ublas/doc/samples/assignment_examples.cpp libs/numeric/ublas/test/sparse_view_test.cpp libs/numeric/ublas/test/test_assignment.cpp libs/parameter/doc/README.txt libs/parameter/test/literate libs/ptr_container/test/const_element_containers.cpp libs/python/example/quickstart/bin libs/random/example/password.cpp libs/random/test/chi_squared_test.hpp libs/random/test/test_binomial.cpp libs/random/test/test_binomial_distribution.cpp libs/random/test/test_discrete.cpp libs/random/test/test_discrete_distribution.cpp libs/random/test/test_extreme_value.cpp libs/random/test/test_extreme_value_distribution.cpp libs/random/test/test_gamma.cpp libs/random/test/test_gamma_distribution.cpp libs/random/test/test_poisson.cpp libs/random/test/test_poisson_distribution.cpp libs/random/test/test_seed_seq.cpp libs/random/test/test_weibull.cpp libs/random/test/test_weibull_distribution.cpp libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html libs/range/doc/html/range/reference/overview.html libs/range/test/algorithm_test/copy_n.cpp libs/range/test/algorithm_test/remove_copy.cpp libs/range/test/algorithm_test/remove_copy_if.cpp libs/range/test/algorithm_test/replace_copy.cpp libs/range/test/algorithm_test/replace_copy_if.cpp libs/range/test/algorithm_test/reverse_copy.cpp libs/range/test/algorithm_test/rotate_copy.cpp libs/range/test/algorithm_test/search_n.cpp libs/range/test/algorithm_test/swap_ranges.cpp libs/range/test/algorithm_test/unique_copy.cpp libs/range/test/replace_copy.cpp libs/serialization/test/test_diamond_complex.cpp libs/serialization/vc7ide/test_diamond_complex.vcproj libs/smart_ptr/test/enable_shared_from_raw_test.cpp libs/smart_ptr/test/make_shared_fp_test.cpp libs/spirit/doc/Missing.txt libs/spirit/doc/html/spirit/lex/reference/concepts libs/spirit/doc/html/spirit/what_s_new/spirit_2_4.html libs/spirit/example/scheme libs/spirit/test/karma/debug.cpp libs/spirit/test/karma/karma_optional_double.cpp libs/spirit/test/karma/semantic_action_attribute.cpp libs/spirit/test/lex/regression006.cpp libs/spirit/test/qi/attr_with_action.cpp libs/system/src/local_free_on_destruction.hpp libs/system/test/dynamic_link_test.cpp libs/system/test/throw_test.cpp libs/test/doc/Jamfile.v2 libs/test/doc/html/utf/user-guide/test-output/FPT.html libs/test/doc/src/Jamfile.v2 libs/test/doc/src/btl-toc.xml libs/test/doc/src/btl.xml libs/test/doc/src/execution-monitor.xml libs/test/doc/src/faq.xml libs/test/doc/src/minimal-testing.xml libs/test/doc/src/program-execution-monitor.xml libs/test/doc/src/snippet libs/test/doc/src/tutorial.hello-the-testing-world.xml libs/test/doc/src/tutorial.intro-in-testing.xml libs/test/doc/src/tutorial.new-year-resolution.xml libs/test/doc/src/utf.testing-tools.xml libs/test/doc/src/utf.tutorials.xml libs/test/doc/src/utf.usage-recommendations.xml libs/test/doc/src/utf.user-guide.runtime-config.xml libs/test/doc/src/utf.users-guide.fixture.xml libs/test/doc/src/utf.users-guide.test-organization.xml libs/test/doc/src/utf.users-guide.test-output.xml libs/test/doc/src/utf.users-guide.xml libs/test/doc/src/utf.xml libs/test/doc/src/xsl libs/test/doc/utf-boostbook.jam libs/test/example/test_example1.cpp libs/test/example/test_example2.cpp libs/test/example/unit_test_example_13.cpp libs/type_traits/doc/html/boost_typetraits/reference/is_lvalue_reference.html libs/type_traits/doc/html/boost_typetraits/reference/is_rvalue_reference.html libs/type_traits/doc/is_lvalue_reference.qbk libs/type_traits/doc/is_rvalue_reference.qbk libs/type_traits/test/is_lvalue_reference_test.cpp libs/type_traits/test/is_rvalue_reference_test.cpp libs/type_traits/test/tricky_rvalue_test.cpp libs/units/example/autoprefixes.cpp libs/utility/initialized_test.cpp libs/utility/initialized_test_fail1.cpp libs/utility/initialized_test_fail2.cpp libs/utility/value_init_workaround_test.cpp tools/boostbook/xsl/html-base.xsl tools/build/v2/test/exit_status.py tools/build/v2/tools/doxygen tools/build/v2/tools/xsltproc tools/release/merge2release.bat -- Marshall

5 5

[BGL] all_clustering_coefficients
by Barend Gehrels 05 Jul '10

05 Jul '10

Hi, Is the function all_clustering_coefficients documented in 1.44, or can it be documented in a new version? It has this functionality (?): <http://hosho.ees.hokudai.ac.jp/~kubo/Rdoc/library/RBGL/html/clusteringCoef.…> (taken from RBGL, "An interface to the BOOST graph library" for R) I tried it and it is a fast and probably useful algorithm, assigning a value between 0 and 1 (both included) to each vertex. Actually I'm looking for a way to find remote corners in a graph, and the vertices with 0 calculated by this algorithm are remote (but these can probably also be found other wise) Thanks, Barend

1 0

[Fusion][Parameter] Some unused parameters warning in gcc
by Joel Falcou 05 Jul '10

05 Jul '10

Following files have obnoxious warnings due to unused parameters. Fix is trivial. trunk/boost/fusion/sequence/intrinsic/has_key.hpp line 70 trunk/boost/fusion/algorithm/query/detail/any.hpp line 112 trunk/boost/parameter/aux_/tagged_argument.hpp trunk/boost/parameter/parameters.hpp Will put up trac item+patches soon

1 0

[thread] A few submissions
by Andrey Semashev 05 Jul '10

05 Jul '10

Hi, I would like to propose the following components for inclusion into Boost.Thread: 1. Once-blocks. This is a flavor of the "once" concept. One can define a block of code that should be executed only once, like that: void foo() { BOOST_LOG_ONCE_BLOCK() { puts("Hello, world once!"); } } The code within the block can access names (e.g. variables) as if it was a usual code block. Why not call_once: * The once-code is defined in-place, which greatly simplifies usage in many cases. One of the main goals of the "once" concept is the dynamic initialization, which involves the variables being initialized. With once-blocks there is no need bind these variables into a functor. Once-blocks are also easier to be used within a macro. * The resulting code is much shorter since the thread synchronization code is separated from the once-code. call_once is instantiated with each once-functor, although the synchronization code is the same. * The once-flag is smaller on Windows. In fact, unlike call_once, the behavior on Windows is equivalent to POSIX. * It has ticket #4225 fixed. If this component is accepted, I would also like to port call_once to once-blocks. Source code: <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/boost…> <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/libs/…> 2. Lightweight read/write mutex. Basically, I want a portable analogue for pthread_rwlock_t, with minimum dependencies, code size and memory footprint. Naturally, it is compatible with Boost.Thread locks. Why not shared_mutex: * shared_mutex.hpp depends on a lot of other headers. It brings in a great deal of Boost.DateTime, although I don't need the timed methods at all. * It offers more than I ever use. I don't need upgradeability. * It is larger than pthread_rwlock_t on POSIX systems (on Linux x64 it's 192 bytes vs 56). On Windows NT 6 it can be implemented through SRWLOCK, which is of size of one pointer. * I remember there were reports that shared_mutex is slower than pthread_rwlock_t. But I haven't done testing, so I won't press it. Source code: <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/boost…> <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/libs/…> 3. Lightweight thread-local storage for small POD values. Allows to store POD values of size up to sizeof(void*) with least possible overhead, memory and performance-vise. thread_specific< int > tls; Why not thread_specific_ptr: * thread_specific_ptr performance depends on the total number of ptrs within the application as it involves an additional lookup among them on access. thread_local does nothing more than abstracting away the native API for TLS, so it provides better performance. * thread_specific_ptr requires to dynamically allocate memory even for tiniest things, like bool or int. This is inconvenient and awkward, especially when memory and exception safety matters. <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/boost…> <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/libs/…> A few notes up-front. There are extensions in some compilers for TLS support. It offers even better performance and easier to use. Also, C++0x will bring this feature into the language. But: * It is known to have problems with dynamically-loaded modules. * It is not portable. Even when C++0x it out, not all compilers will support it right away. * thread_specific does not require the variable to have a static storage duration. 4. shared_lock_guard. A light analogue to shared_lock, which allows to generate a more efficient code. Ticket #3567. Source code: <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/boost…> As a part of this addition I would like to improve segregation of boost/thread/locks.hpp by extracting every component within it into a separate header in a new "locks" directory. 5. The strictest_lock metafunction. Given the list of lock types, it selects the one that offers the strictest concurrency guarantees (i.e. shared lock is stricter than no lock at all, exclusive lock is stricter than shared lock). This metafunction can be useful in generic code, where the final lock type must be deduced. Source code: <http://boost-log.svn.sourceforge.net/viewvc/boost-log/trunk/boost-log/boost…> I understand that some of these tools might seem specific to my case, but I think they could be useful in general. If any of these tools is accepted into Boost.Thread, the code is not set in stone - namings and implementation details can be changed, if needed. I can do the code transition, write docs and a few tests, if needed. Just let me know if either of these is of interest and whether I am allowed to do so. PS: If you want SVN access to all these things, it is available on the SourceForge: <http://sourceforge.net/scm/?type=svn&group_id=199644>

3 14

Bug Sprint merge from trunk to release branche
by vicente.botet 05 Jul '10

05 Jul '10

Hi maintainers, have you merged the tickets solved in trunk branch during the last Bug Sprint? If not, it will be very kind of you to do this before the release branche is frozen. Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

1 0

Changelog
by David Bellot 04 Jul '10

04 Jul '10

Hi everybody, I'm a new maintainer for ublas and before the deadline on monday, I still have a last question: we made a few changes in ublas for 1.44 and I would like to report them to the boost official changes. However, I don't know where to write my information ? Is there a file or do I have to send an email to the boost release managers ? Cheers, David -- David Bellot, PhD david.bellot(a)gmail.com http://david.bellot.free.fr

2 1