June 2007 - Boost-users - lists.preview.boost.org

Trying to follow standard library bootstrap instructions on Solaris 10 with CC 5.8
by Benson Margulies 21 Jun '07

21 Jun '07

sunblade% ./configure --with-toolset=sunpro --prefix=/sunblade1/boostinstall --without-icu -n Building Boost.Jam with toolset sunpro... tools/jam/src/bin.solaris/bjam -n Detecting Python version... 2.4 -n Detecting Python root... /usr/local -n Unicode/ICU support for Boost.Regex?... disabled. Generating Boost.Build configuration in user-config.jam... Generating Makefile... sunblade% make ./tools/jam/src/bin.solaris/bjam --user-config=user-config.jam sunpro.jam: No such file or directory /sunblade1/benson/boost/boost_1_34_0/tools/build/v2/build/toolset.jam:27 : in toolset.using rule sunpro.init unknown in module toolset. /sunblade1/benson/boost/boost_1_34_0/tools/build/v2/build/project.jam:82 5: in using user-config.jam:5: in modules.load /sunblade1/benson/boost/boost_1_34_0/tools/build/v2/build-system.jam:138 : in load /sunblade1/benson/boost/boost_1_34_0/tools/build/v2/kernel/modules.jam:2 61: in import /sunblade1/benson/boost/boost_1_34_0/tools/build/v2/kernel/bootstrap.jam :132: in boost-build /sunblade1/benson/boost/boost_1_34_0/boost-build.jam:9: in module scope Not all Boost libraries built properly.

1 0

boost::thread flush()?
by Graham Reitz 20 Jun '07

20 Jun '07

Is there a method to release all threads waiting on a mutex? Or, more generally, a portable way to release a bunch of threads at the same time? (boost::asio?) I didn't see anything in the docs, besides barrier. Unfortunately, I can't guarantee the N threads will be waiting when a flush is needed. thanks, graham

3 4

Examples for multi-indexing look rather different from doc
by Benson Margulies 20 Jun '07

20 Jun '07

The current doc for the multi-index feature uses the member<> parameterized type as the key extractor. The example source codes use some CPP macro all in caps that doesn't seem to be defined any longer. Perhaps the doc needs an update?

2 1

[program_options] Reloading options
by Ovanes Markarian 20 Jun '07

20 Jun '07

Hello! Is there any way to reload (overwrite) config options. My scenario would be: Specifying an unlimited number of config-files. Process instructions of a config file. After the tool is done, load next config file (by overwriting previous settings). Would this work? With Kind Regards, Ovanes Markarian

1 0

[Date Time] time duration Debug assertion VSC++ 8
by michael mathews 20 Jun '07

20 Jun '07

Hi All, This little program works with Visual Studio 2003 but fails with an assertion failure in VS 2005 sp1. #include "boost/date_time/posix_time/posix_time.hpp" int main() { using namespace boost::posix_time; time_duration timeinterval(24,0,0,0); return 0; } The assertion is from strftime.c line 659 ((timeptr->tm_hour>=0)&&(timeptr->tm_hour<=23)) Is there a fix? I am using boost 1.34.0 thanks in advance michael ____________________________________________________________________________________ Luggage? GPS? Comic books? Check out fitting gifts for grads at Yahoo! Search http://search.yahoo.com/search?fr=oni_on_mail&p=graduation+gifts&cs=bz

3 3

ambiguous overload using boost::variant
by Paul.VanHagen＠shell.com 20 Jun '07

20 Jun '07

Hello, I'm having difficulty compiling the following code fragment using the Intel 9.1 C++ compiler. This little program mimics part of our application and the way we make use of the boost::variant class template. The build log follows at the end. The program itself is totally meaningless, but it just demonstrates a problem in either the compiler or in boost. The strange thing is that this program compiles nicely without any problem using the gcc 3.3.1 compiler on Linux. I appreciate any help. TIA Paul #include <map> #include <string> #include <boost/variant.hpp> using namespace std; template <typename IntT=int> class A { public: A() : m_i(0) { } A(const IntT& i) : m_i(i) { } private: IntT m_i; }; template <typename StringT, typename IntT=int> class B { public: B() : m_pi(0) { } B(const string& s, const IntT& i) : m_pi(new IntT(i)) { } ~B() { delete m_pi; } private: StringT m_s; IntT* m_pi; }; typedef A<> a_t; typedef B<string> b_t; typedef boost::variant<a_t, boost::recursive_wrapper<b_t> > Integer; typedef Integer* IntegerPtr; template <typename CharT, typename IntT, typename DoubleT> class numeric_type : public boost::variant<CharT, IntT*, DoubleT> { public: typedef boost::variant<CharT, IntT*, DoubleT> numeric_type_variant; /// Default constructor. numeric_type() : numeric_type_variant() { } numeric_type(const CharT& ch) : numeric_type_variant(ch) { } numeric_type(IntT* pInt) : numeric_type_variant(pInt) { } numeric_type(const DoubleT& d) : numeric_type_variant(d) { } /* template <typename T> /// Converting constructor. numeric_type(T const& t) : numeric_type_variant(t) { } */ // some more code }; int main(int argc, char* argv[]) { char ba; double bc; // set up map with variant integers map<string, Integer> mapInteger; mapInteger.insert(make_pair("a", a_t(0))); mapInteger.insert(make_pair("b", b_t("b", 1))); numeric_type<char, Integer, double> b(ba); numeric_type<char, Integer, double> c(&mapInteger["b"]); numeric_type<char, Integer, double> d(bc); return 0; } ------ Build started: Project: VariantProblemDemo, Configuration: Debug Win32 ------ Compiling... VariantProblemDemo.cpp C:\Mijn Documenten\Backup\Projects\Work\3rdParty\boost\boost\variant\variant.hpp(1273) : error C2668: 'boost::detail::variant::make_initializer_node::apply<BaseIndexPair,Iterator>::initializer_node::initialize' : ambiguous call to overloaded function with [ BaseIndexPair=boost::mpl::aux::iter_fold_impl<2,boost::mpl::begin<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::end<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::pair<boost::detail::variant::initializer_root,boost::mpl::int_<0>>,boost::mpl::lambda<boost::mpl::protect<boost::detail::variant::make_initializer_node>>::type>::state1, Iterator=boost::mpl::aux::iter_fold_impl<2,boost::mpl::begin<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::end<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::pair<boost::detail::variant::initializer_root,boost::mpl::int_<0>>,boost::mpl::lambda<boost::mpl::protect<boost::detail::variant::make_initializer_node>>::type>::iter1 ] C:\Mijn Documenten\Backup\Projects\Work\3rdParty\boost\boost\variant\detail\initializer.hpp(89): could be 'int boost::detail::variant::make_initializer_node::apply<BaseIndexPair,Iterator>::initializer_node::initialize(void *,boost::detail::variant::make_initializer_node::apply<BaseIndexPair,Iterator>::initializer_node::param_T)' with [ BaseIndexPair=boost::mpl::aux::iter_fold_impl<2,boost::mpl::begin<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::end<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::pair<boost::detail::variant::initializer_root,boost::mpl::int_<0>>,boost::mpl::lambda<boost::mpl::protect<boost::detail::variant::make_initializer_node>>::type>::state1, Iterator=boost::mpl::aux::iter_fold_impl<2,boost::mpl::begin<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::end<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::pair<boost::detail::variant::initializer_root,boost::mpl::int_<0>>,boost::mpl::lambda<boost::mpl::protect<boost::detail::variant::make_initializer_node>>::type>::iter1 ] C:\Mijn Documenten\Backup\Projects\Work\3rdParty\boost\boost\variant\detail\initializer.hpp(89): or 'int boost::detail::variant::make_initializer_node::apply<BaseIndexPair,Iterator>::initializer_node::initialize(void *,boost::detail::variant::make_initializer_node::apply<BaseIndexPair,Iterator>::initializer_node::param_T)' with [ BaseIndexPair=boost::mpl::aux::iter_fold_impl<2,boost::mpl::begin<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::end<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::pair<boost::detail::variant::initializer_root,boost::mpl::int_<0>>,boost::mpl::lambda<boost::mpl::protect<boost::detail::variant::make_initializer_node>>::type>::state0, Iterator=boost::mpl::aux::iter_fold_impl<2,boost::mpl::begin<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::end<boost::variant<a_t,boost::recursive_wrapper<b_t>>::recursive_enabled_types>::type,boost::mpl::pair<boost::detail::variant::initializer_root,boost::mpl::int_<0>>,boost::mpl::lambda<boost::mpl::protect<boost::detail::variant::make_initializer_node>>::type>::iter0 ] while trying to match the argument list '(void *, const int)' C:\Mijn Documenten\Backup\Projects\Work\3rdParty\boost\boost\variant\variant.hpp(1342) : see reference to function template instantiation 'void boost::variant<T0_,T1>::convert_construct<const T>(const T &,int,boost::mpl::false_)' being compiled with [ T0_=a_t, T1=boost::recursive_wrapper<b_t>, T=int ] VariantProblemDemo.cpp(62) : see reference to function template instantiation 'boost::variant<T0_,T1>::variant<int>(const T &)' being compiled with [ T0_=a_t, T1=boost::recursive_wrapper<b_t>, T=int ] VariantProblemDemo - 1 error(s), 0 warning(s) ---------------------- Done ---------------------- Build: 0 succeeded, 1 failed, 0 skipped

1 0

Porting to vc8
by Rupali.Praveen＠barclayscapital.com 20 Jun '07

20 Jun '07

Hi I have inherited some code that uses the boost1300\boost\numeric\ublas , specifically the matrix constructs. We are now porting our code from vc6 to vc8. The current library seems to be giving a lot of compilation errors, like: ../../ThirdParty\boost1300\boost\numeric\ublas\matrix_expression.hpp(781 ) : error C2027: use of undefined type 'boost::numeric::ublas::vector_matrix_binary<E1,E2,F>::const_iterator2' ../../ThirdParty\boost1300\boost\numeric\ublas\matrix_expression.hpp(603 ) : see declaration of 'boost::numeric::ublas::vector_matrix_binary<E1,E2,F>::const_iterator2' ../../ThirdParty\boost1300\boost\numeric\ublas\matrix_expression.hpp(700 ) : see reference to class template instantiation 'boost::numeric::ublas::vector_matrix_binary<E1,E2,F>::const_iterator1' being compiled ../../ThirdParty\boost1300\boost\numeric\ublas\matrix_expression.hpp(103 4) : see reference to class template instantiation 'boost::numeric::ublas::vector_matrix_binary<E1,E2,F>' being compiled Do I need to download the latest version of boost for the porting? Thanks Rupali ------------------------------------------------------------------------ For important statutory and regulatory disclosures and more information about Barclays Capital, please visit our web site at http://www.barcap.com. Internet communications are not secure and therefore the Barclays Group does not accept legal responsibility for the contents of this message. Although the Barclays Group operates anti-virus programmes, it does not accept responsibility for any damage whatsoever that is caused by viruses being passed. Any views or opinions presented are solely those of the author and do not necessarily represent those of the Barclays Group. Replies to this email may be monitored by the Barclays Group for operational or business reasons. Barclays Capital is the investment banking division of Barclays Bank PLC, a company registered in England (number 1026167) with its registered office at 1 Churchill Place, London, E14 5HP. This email may relate to or be sent from other members of the Barclays Group. ------------------------------------------------------------------------

1 0

[bind] overloaded function troubles
by Michael Marcin 19 Jun '07

19 Jun '07

I have a windows compiler that is a derivative of cw 9.4 that is complaining when trying to compile the following #include <boost/bind.hpp> struct a { void foo(int) {} void foo() {} }; void bar() { boost::bind( &a::foo, _1 ); } the actual error is: ### mwccsym2.exe Compiler: # In: C:\Subversion\boost-RC_1_34_0\boost\boost\bind.hpp # From: bind_test.cpp # ---------------------- # 1633: ::bind_t< result_type, F, list_type >( F( f ), list_type( a1 ) ); # Error: ^ # illegal implicit conversion from 'boost::_bi::bind_t<const void (&)(void *const , const void *const , void *const , const void *const , int), boost::_mfi::dm<void (const void *const , int), a>, boost::_bi::list1<boost::arg<1>>>' to # 'boost::_bi::bind_t<const void (&)(const void *const , int), boost::_mfi::dm<void (const void *const , int), a>, boost::_bi::list1<boost::arg<1>>>' # (point of instantiation: 'bar()') # (instantiating: 'boost::bind<boost::arg<1>, void (const void *const , int), a>(void (a::*)(int), boost::arg<1>)') Changing the definition to struct a { void foo() {} void foo(int) {} }; lets it compile but this is not a general solution as this fails to compile: void bar() { boost::bind( &a::foo, _1, 0 ); } I've uploaded a full minimal example to my website including the compiler in question if it helps. http://www.mikemarcin.com/misc/mwccsym/bind_overload.zip Thanks, Michael Marcin

2 1

New bcbboost release
by Nicola Musatti 19 Jun '07

19 Jun '07

Hallo, I just released a new version of bcbboost, the unofficial BCB Boost patches. This is a set of patches that improves Boost's support of Borland/CodeGear compilers. The current version supports Boost 1.34.0 and bcc32 5.9.0, the new compiler that is part of C++Builder 2007. For more information and download: http://bcbboost.sourceforge.net Comments and bug reports, not to mention code contributions, are all very welcome. Please use the SourceForge trackers or the mailing list, bcbboost-general(a)lists.sourceforge.net Enjoy! Nicola Musatti

2 3

Re: [Boost-users] math/statistics policy-interface feedback requested.
by John Maddock 19 Jun '07

19 Jun '07

Hubert Holin wrote: > The proposed interface is certainly nice and could definitely be > worked with. OK good. > For the global choices it is perfectly adequate, IMO. For finer > control however, it does appear very fine-grained (per-function), > which, in addition to making error message harder to read, is perhaps > not the most frequent level of interaction needed. For instance, > while I certainly see the need sometimes for per-function disabling > of internal double promotion, I believe that more frequently users > may want to set these preferences at the translation unit level, when > not at the global level. Whilst I think you're correct that per-TU control is the most often needed requirement: it's actually the hardest of all to provide without violating the dreaded "one definition rule". The only solution I can think of involves making the special function macros - which also means we can't overload them - and then internally mangling the function names according to the policies in effect (in other words the same as the current proposal). Perhaps more interesting, and based on the current proposal is per-namespace policies: #include <boost/math/special_functions.hpp> typedef something my_policy_type; namespace mynamespace{ BOOST_MATH_DECL_POLICY_SPECIAL_FUNCTIONS(my_policy_type); } Then "mynamespace::tgamma(x);" would use my_policy_type to determine it's behaviour. If you an unnamed namespace then this could be used in place of a using declaration, to bring a specific set of functions into the scope of the current TU only. > While (mostly) global objects may be evil, something along the > lines of standard streams and their interaction with locales and > facets may perhaps be easier to deal with. For instance, functions > may requests their choices from some external "policy object", which > may be locally altered, much as streams will enquire from a locale > how to typeset dates. Granted, this would make multithreading all the > hairier (which is not really a good idea). Oh, no global objects please, they're evil, no really they are! :-) > On the other hand, not all > functions necessarily require information about every configuration > choice possible, so passing in all the info when only some is needed > may perhaps be excessive. That's true. However, I now have the meta-programming code that allows a function to reset policies that it knows aren't relevent to it to their defaults. Policy objects also get "normalised" internally to reduce code bloat, so: tgamma(x, policy1); and tgamma(x, policy2); are one-line inline forwarders that will call the same template instantiations internally, if there are no relevent differences between policy1 and policy2. Thanks for the feedback, John.

1 0