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

[inteprocess] Using named_mutex on Windows 7
by Edward Diener 18 Nov '11

18 Nov '11

I wrote a program more than 3 years ago where I used boost::interprocess_named_mutex to protect more than one instance of the same process from running the same sequence of code at the same time. The program appears to run fine under Windows XP and Windows Vista but occasionally locks up waiting for the locked mutex to unlock on Windows 7. The code looks like this: ------------------------------------------------------------------- boost::interprocess::named_mutex cmutex(boost::interprocess::open_or_create_t(),"MyMutexName"); { boost::interprocess::scoped_lock<boost::interprocess::named_mutex> cscoped(cmutex); // Code here which must be run one at a time. } ------------------------------------------------------------------- Under Windows 7 the code occasionally hangs on the scoped_lock instantiation, which of course I can not have. I notice there is a file in the temporary directory ( TMP or TEMP environment variable ) which is being used by interprocess, and after that file is manually deleted, the program no longer hangs on the scoped_lock instantiation. Is there a reason for this problem on Windows 7 ? I know that Windows 7 has global and local named mutexes and only by prefacing a named mutex name with global\ is the mutex truly global. I do not know if this is causing the problem on Windows 7. It does seem as if something in the file in the temporary directory is telling inteprocess that "MyMutexName" is still locked when the hangup occurs, but I would have expected that when acoped_lock goes out of scope, it handles resetting that file to the correct state. I wonder if this has something to do with UAC/file permissions in Windows 7, where the process somehow can no longer write to the file in the temporary directory afte creating it. Is this a known interprocess problem, perhaps fixed in a later release ? I wrote my code before Windows 7 even came out, recompiled it for Windows 7, but did not update the version of Boost I was using ( Boost 1.35 ). Maybe I need to do that ? I would certainly be willing to do that if I knew that this was a problem with interprocess in Boost 1.35 that has subsequently been fixed in a later version of Boost.

1 0

Re: [Boost-users] Boost 1.48.0 Release Notice
by Tom Kent 18 Nov '11

18 Nov '11

> > Subject: Re: [Boost-users] Boost 1.48.0 Release Notice > From: Michael Jackson (imikejackson_at_[hidden]) > Date: 2011-11-16 10:27:18 > On 11/16/11 10:05 AM, in article > CAArKS8i9AtMcQhRtxt81LQZm4vTVeanhuhQLFgVBjahLv+oJxw_at_[hidden], "Tom > Kent" wrote: > >> Subject: [Boost-users] Boost 1.48.0 Release Notice > >> From: Beman Dawes (bdawes_at_[hidden]) > >> Date: 2011-11-16 07:33:06 > >> > >> Release 1.48.0 of the Boost C++ Libraries is now available. > >> These open-source libraries work well with the C++ Standard Library, > >> and are usable across a broad spectrum of applications. The Boost > >> license encourages both commercial and non-commercial use. > >> This release contains new libraries: Container, Locale, Move. Updated > >> libraries include: Asio, Chrono, Config, Fusion, Geometry, Graph, > >> Interprocess, Intrusive, Lexical cast, Math, MSM, Numeric Conversion, > >> Proto, Regex, Spirit, TypeTraits, Unordered, Wave, and more. For > >> details, including download links, see > >> http://www.boost.org/users/news/version_1_48_0 > >> You can also download directly from SourceForge: > >> http://sourceforge.net/projects/boost/files/boost/1.48.0/ > >> To install this release on your system, see > >> http://www.boost.org/doc/libs/release/more/getting_started/index.html > >> Thanks, > >> --The Boost release team > >> Beman Dawes > >> Daniel James > >> Eric Niebler > >> Rene Rivera > >> Vladimir Prus > > > > > > I've built windows libraries (vc8, vc9, vc10) for this (32 and 64 > > bit), if you want them, you can get them from my website: > > http://boost.teeks99.com > > Tom > What exact versions of each of those did you use? Were they > single/multi-threaded, Static/Shared... > Thanks > Mike Jackson I believe I have all the various combinations: mt, mt-gd, mt-s, s, sgd, mt dll, mg-gd dll Tom

1 0

4 link errors related to boost_thread_vc100_mt-1_47 libraries
by code 17 Nov '11

17 Nov '11

Hi Boost users, I built boost_thread_vc100_mt-1_47.lib and boost_thread_vc100_mt-1_47.dll successfully by using 1_47 source codes without changing any thing. When I used the libraries in my project, I got the following link errors: 1>boost_UT.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: static void __cdecl boost::thread::sleep(class boost::posix_time::ptime const &)" (__imp_?sleep@thread@boost@@SAXABVptime@posix_time@2@@Z) 1>boost_UT.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) private: static class boost::intrusive_ptr<struct boost::detail::thread_data_base> __cdecl boost::thread::make_thread_info(void (__cdecl*)(void))" (__imp_?make_thread_info@thread@boost@@CA?AV?$intrusive_ptr@Uthread_data_base@detail@boost@@@2@P6AXXZ@Z) 1>boost_UT.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) void __cdecl boost::detail::free_raw_heap_memory(void *)" (__imp_?free_raw_heap_memory@detail@boost@@YAXPAX@Z) 1>boost_UT.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) void * __cdecl boost::detail::allocate_raw_heap_memory(unsigned int)" (__imp_?allocate_raw_heap_memory@detail@boost@@YAPAXI@Z) Can somebody kindly help me figure out a solution to fix them? Thank you Yan My working environment: Windows 7 + Visual Studio VC++10.

3 5

Boost 1.48.0 Release Notice
by Beman Dawes 17 Nov '11

17 Nov '11

Release 1.48.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains new libraries: Container, Locale, Move. Updated libraries include: Asio, Chrono, Config, Fusion, Geometry, Graph, Interprocess, Intrusive, Lexical cast, Math, MSM, Numeric Conversion, Proto, Regex, Spirit, TypeTraits, Unordered, Wave, and more. For details, including download links, see http://www.boost.org/users/news/version_1_48_0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.48.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

2 1

Re: [Boost-users] [variant] declaring recursive variants (Jerry Jeremiah)
by 乔志强 17 Nov '11

17 Nov '11

MS Visual Studio 2010 SP1 compiled OK. But if use gcc, boost::variant<T> use boost:: sizeof_<T> and boost:: alignment_of <T>, and use sizeof(T), so need a complete type. Maybe gcc bug or bug of boost for gcc ? So you need workaround between // ADD THESE begin //////////// and // ADD THESE end ////////////, see next: //////////////////////////////////////////// template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct sizeof_ : mpl::size_t< sizeof(T) > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,sizeof_,(T)) }; ./boost/variant/variant.hpp:1105:17: instantiated from 'boost::variant<std::basic_string<char>, long double, message_iter, config_iter>' .\main.cpp:40:31: instantiated from here ./boost/mpl/sizeof.hpp:28:1: error: invalid application of 'sizeof' to incomplete type 'message_iter' In file included from ./boost/aligned_storage.hpp:20:0, from ./boost/variant/variant.hpp:41, from ./boost/variant.hpp:17, from .\main.cpp:8: ./boost/type_traits/alignment_of.hpp: In instantiation of 'const size_t boost::detail::alignment_of_impl<message_iter>::value': //////////////////////////////////////////// #include <boost/variant.hpp> #include <string> #include <vector> #include <list> #include <map> struct message_iter; struct config_iter; // ADD THESE begin //////////// typedef std::map<std::string,int>::iterator any_map_iterator; namespace boost { namespace mpl { template<> struct sizeof_<message_iter> : sizeof_<any_map_iterator> { }; template<> struct sizeof_<config_iter> : sizeof_<any_map_iterator> { }; } template<> struct alignment_of<message_iter> : alignment_of<any_map_iterator> { }; template<> struct alignment_of<config_iter> : alignment_of<any_map_iterator> { }; } // ADD THESE end //////////// typedef boost::variant<std::string ,long double ,message_iter ,config_iter > var; typedef std::vector<var> value; typedef std::map<std::string,value> message; typedef std::map<std::string,message> config; struct config_iter { config_iter(const config::iterator iter) : iter_(iter) {} operator config::iterator() const { return iter_; } config::iterator operator() () const { return iter_; } bool operator == (const config_iter & other) const { return iter_ == other.iter_; } protected: config::iterator iter_; }; struct message_iter { message_iter(const message::iterator iter) : iter_(iter) {} operator message::iterator() const { return iter_; } message::iterator operator() () const { return iter_; } bool operator == (const message_iter & other) const { return iter_ == other.iter_; } protected: message::iterator iter_; }; // ADD THESE begin //////////// BOOST_STATIC_ASSERT(sizeof(config_iter) == sizeof(message_iter)); BOOST_STATIC_ASSERT(sizeof(config_iter) == sizeof(any_map_iterator)); // ADD THESE end //////////// struct identifier { identifier() : name_(""), version_(0) { // std::cout << "identifier::identifier()" << std::endl; } identifier(const std::string & name, const value & version) : name_(name), version_(version) { // std::cout << "identifier::identifier(" << name << "," << version << ")" << std::endl; } bool operator == (const identifier & other) const { return name_ == other.name_ && version_ == other.version_; } private: // updated by constructor std::string name_; value version_; }; int main() { return 0; } -----邮件原件----- 发件人: Jerry Jeremiah [mailto:Jerry.Jeremiah@telecom.co.nz] 发送时间: 2011年11月17日 17:33 收件人: 乔志强主题: RE: [variant] declaring recursive variants (Jerry Jeremiah) Thanks for taking the time to look at it. I appreciate that. If you read down a little farther you will see that I do that and it complains that config_iter isn't a complete type. And there is no way to get rid of that without removing all the "unrelated" classes. Can you figure out how to get the program right at the bottom to compile? Even adding the operator== to all the classes doesn't help... Thanks for all the help, Jerry

2 1

[ublas]how to get tsm to compile with simple matrix args?
by Larry Evans 17 Nov '11

17 Nov '11

Compilation of the attached file with gcc4.7 produces obscure output: /home/evansl/download/gcc/4.7-20111008/install/bin/g++ -c -Wall -ftemplate-depth-300 -O0 -g3 -fno-inline -std=gnu++0x -I/home/evansl/prog_dev/boost-svn/ro/trunk/sandbox/rw/non_variadic_templates -I/home/evansl/prog_dev/boost-svn/ro/trunk -I../../.. -DTEMPLATE_DEPTH=300 solve_tridiag_ublas.cpp -MMD -o solve_tridiag_ublas.o In file included from solve_tridiag_ublas.cpp:2:0: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp: In instantiation of 'typename boost::numeric::ublas::matrix_matrix_solve_traits<E1, E2>::result_type boost::numeric::ublas::solve(const boost::numeric::ublas::matrix_expression<E1>&, const boost::numeric::ublas::matrix_expression<E1>&, C) [with E1 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >; E2 = boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> >; C = double; typename boost::numeric::ublas::matrix_matrix_solve_traits<E1, E2>::result_type = boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >]': /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/blas.hpp:387:48: required from 'M1& boost::numeric::ublas::blas_3::tsm(M1&, const T&, const M2&, C) [with M1 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >; T = double; M2 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >; C = double]' solve_tridiag_ublas.cpp:150:54: required from here /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: error: no matching function for call to 'inplace_solve(const boost::numeric::ublas::matrix_expression<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > > >&, boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type&, double)' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: candidates are: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1859:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::lower_tag, boost::numeric::ublas::column_major_tag, boost::numeric::ublas::dense_proxy_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1859:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1885:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::lower_tag, boost::numeric::ublas::column_major_tag, boost::numeric::ublas::packed_proxy_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1885:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1914:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::lower_tag, boost::numeric::ublas::column_major_tag, boost::numeric::ublas::unknown_storage_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1914:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1942:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::lower_tag, boost::numeric::ublas::column_major_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1942:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1950:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::lower_tag, boost::numeric::ublas::row_major_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1950:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1959:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::lower_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1959:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1967:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::unit_lower_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1967:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1977:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::upper_tag, boost::numeric::ublas::column_major_tag, boost::numeric::ublas::dense_proxy_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:1977:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2003:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::upper_tag, boost::numeric::ublas::column_major_tag, boost::numeric::ublas::packed_proxy_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2003:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2032:10: note: template<class E1, class E2> void boost::numeric::ublas::inplace_solve(const boost::numeric::ublas::matrix_expression<E1>&, boost::numeric::ublas::vector_expression<E2>&, boost::numeric::ublas::upper_tag, boost::numeric::ublas::column_major_tag, boost::numeric::ublas::unknown_storage_tag) /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2032:10: note: template argument deduction/substitution failed: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/numeric/ublas/triangular.hpp:2587:9: note: 'boost::numeric::ublas::matrix_matrix_solve_traits<boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::matrix_binary_scalar1<const double, boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >, boost::numeric::ublas::scalar_multiplies<double, double> > >::result_type {aka boost::numeric::ublas::matrix<double, boost::numeric::ublas::basic_row_major<>, boost::numeric::ublas::unbounded_array<double, std::allocator<double> > >}' is not derived from 'boost::numeric::ublas::vector_expression<E2>' and it goes on and on. Looking at libs/numeric/ublas/test:23.cpp was no help since it looked like it was doing exactly what the attached code is doing. Please, what can I change to get the attached to compile? TIA. -regards, Larry

3 6

FWD: I figured I should share the wealth
by Olivier Tournaire 17 Nov '11

17 Nov '11

hey there. it had never occurred to me that i anyone can be their own boss until i started it <a href="http://artist.com.tr/profile/22WayneScott/">http://artist.com.tr/profile/22WayneScott/</a> talk to you later.

1 0

Re: [Boost-users] The GMANE archive is not searchable
by Steinar Bang 17 Nov '11

17 Nov '11

>>>>> giecrilj(a)stegny.2a.pl: > The page "Boost Mailing Lists" [1] constains a hyperlink to what is > called "Gmane's searchable archive" [2]. However, the page in > question contains no search form; Actually the page in [2] does contain a search form at the bottom. However,... > Actually, it is possible to perform a search using the Group > Information interface [3]. Please adjust the hyperlink accordingly. ...personally I would have linked to [3], since that page has links to all ways of accessing the archives, statistics, as well as an easily visible search form. > [1] <URL: http://www.boost.org/community/groups.html#users > > [2] <URL: http://news.gmane.org/gmane.comp.lib.boost.user > > [3] <URL: http://dir.gmane.org/gmane.comp.lib.boost.user >

1 0

dubious range mismatch prerequisite
by Krzysztof Żelechowski 17 Nov '11

17 Nov '11

The documentation for mismatch, as applied to ranges, says that rng2 must be at least as long as rng1. Why is this precondition necessary? The precondition is impossible to evaluate for bare input iterators without destroying the iterators, whereupon it is impossible to call mismatch any more. IMHO, it would be perfectly reasonable to stop at the end of rng2 if rng2 is shorter. <URL: http://www.boost.org/doc/libs/1_47_0/libs/range/ doc/html/range/reference/algorithms/non_mutating/mismatch.html >

2 1

Re: [Boost-users] BOOST ASIO Strange behaviour
by Marat Abrarov 17 Nov '11

17 Nov '11

Hi, Gokul. > I am noticing consistently that DEBUG Version of ASIO is slightly faster > than the Release version consistently. The difference is around 5-10%. What does this 5-10% mean? Throughput? Regards, Marat Abrarov.

2 2

recursive_variant map recursion / incomplete type error
by Bodmer Marc 17 Nov '11

17 Nov '11

Hi I try to use boost::recursive_variant with a recursive std::map. There are several projects and examples on the internet using boost::recursive_variant exactly like I do and it seems to work there. But somehow I can not make it compile in my environment. I am using gcc 4.6.1 and boost 1.46.1. I've stripped my code down to this: ------------------------------------------------------------- #include <boost/variant.hpp> #include <map> typedef boost::make_recursive_variant< int, std::map<float, boost::recursive_variant_> >::type element; int main () { element i = 42; } But I always get these errors about uncomplete types (see attachments for full compiler output and code): ------------------------------------------------------------- /usr/include/c++/4.6/bits/stl_pair.h:93:11: error: 'std::pair<_T1, _T2>::second' has incomplete type /usr/include/boost/variant/variant_fwd.hpp:232:12: error: forward declaration of 'struct boost::recursive_variant_' used compile command: ------------------------------------------------------------ gcc recursive_variant_stripped.cpp 2> gccout.txt Thanks for any help and suggestions regards Marc

1 0

[boost-users] [regex] Problem on Solaris
by Kunth, Thomas (ext) 17 Nov '11

17 Nov '11

Hello! I am currently observing a strange crash on my test systems. The core file tells me that it happens when constructing a regular expression from a string for the first time. We are using boost 1.33.1. Please find below some system details. Configuration no. 1 is the current stable workung one. In configuration no. 2 my program crashes in the constructor of boost::regex. The crash seems to be caused by some threading related functions, but the application is single threaded. The call stack is attached to this e-mail. In configuration no. 3 my program does not crash, but hangs at nearly the same position inside the boost::regex constructor. Again inside some threading related functions of my single threaded application. It is related to my system configuration. Here are the ones I use: 1. This configuration works since years * Compilation of libboost_regex: SunOS 5.8 Generic_117350-35 sun4u sparc SUNW,Sun-Blade-2500 CC: Sun WorkShop 6 update 2 C++ 5.3 Patch 111685-24 2006/11/03 * Compilation of my application SunOS 5.8 Generic_117350-35 sun4u sparc SUNW,Sun-Blade-2500 CC: Sun WorkShop 6 update 2 C++ 5.3 Patch 111685-24 2006/11/03 * Execution environment SunOS 5.8 Generic_117350-35 sun4u sparc SUNW,Sun-Fire-V240 2. We are noe migrating to Solaris 10. This is causing problems. First we just change the execution environment: * Execution environment SunOS 5.10 Generic_141444-09 sun4u sparc SUNW,Sun-Fire-V210 3. Then we also change the compilation environment: * Compilation of libboost_regex is not changed. Libraries have not even been re-compiled. * Compilation of my application SunOS 5.10 Generic_141414-01 sun4u sparc SUNW,SPARC-Enterprise CC: Sun WorkShop 6 update 2 C++ 5.3 Patch 111685-24 2006/11/03 * Execution environment SunOS 5.10 Generic_141444-09 sun4u sparc SUNW,Sun-Fire-V210 I cannot change these configurations. But I would have the chance to move to a newer version of boost if it would compile with my legacy compiler (which it doesn't). Please help me solving this problem! Thanks in advance! With best regards, Thomas

1 0

Re: [Boost-users] [variant] declaring recursive variants (Jerry Jeremiah)
by 乔志强 17 Nov '11

17 Nov '11

binary '==' : no operator found which takes a left-hand operand of type 'const T2' and T2=config_iter so you need bool config_iter::operator == (const config_iter & other) const; struct config_iter { config_iter(const config::iterator iter) : iter_(iter) {} operator config::iterator() const { return iter_; } config::iterator operator() () const { return iter_; } //////ADD THIS////////////////////// bool operator == (const config_iter & other) const { return iter_ == other.iter_; } //////ADD THIS////////////////////// protected: config::iterator iter_; }; //////// SEE HERE /////////////////////////////////// 1>.\boost\variant\variant.hpp(781): error: binary '==' : no operator found which takes a left-hand operand of type 'const T2' (or there is no acceptable conversion) //////// SEE HERE /////////////////////////////////// 1> .\boost\blank.hpp(58): could be 'bool boost::operator ==(const boost::blank &,const boost::blank &)' 1> while trying to match the argument list '(const T2, const T2)' 1> .\boost\variant\variant.hpp(763) : see reference to function template instantiation 'bool boost::detail::variant::equal_comp::operator ()<T>(const T &,const T &) const' being compiled 1> with 1> [ 1> T=T2 1> ] 1> .\boost\variant\variant.hpp(832) : see reference to function template instantiation 'bool boost::detail::variant::comparer<Variant,Comp>::operator ()<const T>(const T &) const' being compiled 1> with 1> [ 1> Variant=boost::variant<std::string,long double,config_iter>, 1> Comp=boost::detail::variant::equal_comp, 1> T=T2 1> ] 1> .\boost\variant\detail\visitation_impl.hpp(130) : see reference to function template instantiation 'bool boost::detail::variant::invoke_visitor<Visitor>::internal_visit<const T>(T &,int)' being compiled 1> with 1> [ 1> Visitor=boost::detail::variant::comparer<boost::variant<std::string,long double,config_iter>,boost::detail::variant::equal_comp>, 1> T=T2 1> ] 1> .\boost\variant\detail\visitation_impl.hpp(173) : see reference to function template instantiation 'bool boost::detail::variant::visitation_impl_invoke_impl<Visitor,VoidPtrCV,T>(int,Visitor &,VoidPtrCV,T *,boost::mpl::true_)' being compiled 1> with 1> [ 1> Visitor=boost::detail::variant::invoke_visitor<boost::detail::variant::comparer<boost::variant<std::string,long double,config_iter>,boost::detail::variant::equal_comp>>, 1> VoidPtrCV=const void *, 1> T=T2 1> ] 1> .\boost\variant\detail\visitation_impl.hpp(256) : see reference to function template instantiation 'bool boost::detail::variant::visitation_impl_invoke<Visitor,VoidPtrCV,T2,NoBackupFlag>(int,Visitor &,VoidPtrCV,T *,NoBackupFlag,int)' being compiled 1> with 1> [ 1> Visitor=boost::detail::variant::invoke_visitor<boost::detail::variant::comparer<boost::variant<std::string,long double,config_iter>,boost::detail::variant::equal_comp>>, 1> VoidPtrCV=const void *, 1> NoBackupFlag=boost::variant<std::string,long double,config_iter>::has_fallback_type_, 1> T=T2 1> ] 1> .\boost\variant\variant.hpp(1776) : see reference to function template instantiation 'bool boost::detail::variant::visitation_impl<first_which,first_step,Visitor,VoidPtrCV,boost::variant<T0_,T1,T2>::has_fallback_type_>(const int,const int,Visitor &,VoidPtrCV,boost::mpl::false_,NoBackupFlag,Which *,step0 *)' being compiled 1> with 1> [ 1> Visitor=boost::detail::variant::invoke_visitor<boost::detail::variant::comparer<boost::variant<std::string,long double,config_iter>,boost::detail::variant::equal_comp>>, 1> VoidPtrCV=const void *, 1> T0_=std::string, 1> T1=long double, //////// SEE HERE /////////////////////////////////// 1> T2=config_iter, //////// SEE HERE /////////////////////////////////// 1> NoBackupFlag=boost::variant<std::string,long double,config_iter>::has_fallback_type_, 1> Which=first_which, 1> step0=first_step 1> ] // test program with config_iter and indentifier // doesn't compile if identifier::operator==() is in the program #include <boost/variant.hpp> #include <iterator> #include <string> #include <vector> #include <list> #include <map> struct config_iter; typedef boost::variant<std::string ,long double ,config_iter > var; typedef std::vector<var> value; typedef std::map<std::string,value> message; typedef std::map<std::string,message> config; struct config_iter { config_iter(const config::iterator iter) : iter_(iter) {} operator config::iterator() const { return iter_; } config::iterator operator() () const { return iter_; } protected: config::iterator iter_; }; struct identifier { identifier() : name_(""), version_({0}) { // std::cout << "identifier::identifier()" << std::endl; } identifier(const std::string & name, const value & version) : name_(name), version_(version) { // std::cout << "identifier::identifier(" << name << "," << version << ")" << std::endl; } bool operator == (const identifier & other) const { return name_ == other.name_ && version_ == other.version_; } private: // updated by constructor std::string name_; value version_; }; int main() { return 0; }

1 0

Lisp/Scheme DSEL in C++?
by Nathan Ridge 17 Nov '11

17 Nov '11

Hello, I came across the following post on boost-users [1]: >> hello all, >> >> does anybody know of an existing spirit/lisp implimentation, and is there >> any interest in developing such a project in open source? > > None yet, AFAIK. > > I'll be writing an example for Spirit2 to complement the tiny-C > virtual machine in there. What's equally interesting though is > that scheme (or at least a subset of it) can be implemented in > pure c++. No parsing, just pure DSEL in C++. Now, imagine a > parser that targets this DSEL (through C++) -- a source to source > translator. Essentially, your scheme code will be compiled into > highly efficient C++. I find this quite intriguing, and I'm naturally led to ask two questions: 1. Which subset of Scheme can be implemented in this way, with a DSEL? 2. Has anyone actually done this? Thanks! Nate [1] http://thread.gmane.org/gmane.comp.lib.boost.user/30512

2 3

[variant] declaring recursive variants
by Jerry Jeremiah 16 Nov '11

16 Nov '11

> Hello, Actually, I don't want a recursive variant in the normal recursive_wrapper sense. What I want is this: typedef std::list<a> alist; typedef std::list blist; typedef boost::variant<std::string ,long double ,alist::iterator ,blist::iterator ,config::iterator > var; typedef std::vector<var> value; typedef std::map<std::string,value> message; typedef std::map<std::string,message> config; But of course I can't do that because I have no idea how to forward declare config. I suspect that there is no way to do this, but I am not in the same league as everybody else when it comes to this stuff. Any suggestions? Thank you, Jerry

2 2

[gil] Constructing view from locator
by Sapp, Mark 16 Nov '11

16 Nov '11

Hi All, I'm trying to iterate through each pixel in a view and calculate the average of the 9x9 pixels surrounding it. I initially tried following the convolution example, but it's performance isn't fast enough for my needs. I have tried several ways of iterating through the pixels on the 136x98 test image provided with the gil: attempt #1 executes in ~400 ms convolve_rows_fixed<rgb32f_pixel_t>(src1,kernel,dst); convolve_cols_fixed<rgb32f_pixel_t>(dst,kernel,dst); attempt #2 executes in ~26000 ms vector<vector<double>> window(windowSizeX, vector<double> (windowSizeY, 1.0 / 81)); for (int y = 0; y <= src1.height(); ++y) { for (int x = 0; x < src1.width(); ++x) { for (int yi = y - windowRadiusY; yi <= y + windowRadiusY; ++yi) { if (yi >= 0 && yi <= src1.height()) { typename SrcView1::x_iterator src1_it=src1.row_begin(y); typename SrcView2::x_iterator src2_it=src2.row_begin(y); typename DstView::x_iterator dst_it=dst.row_begin(y); for (int xi = x - windowRadiusX; xi <= x + windowRadiusX; ++xi) { vector<double> ux, ux2, uy, uy2, uxy = vector<double>(numChannels, 0); ux = ux2 = uy = uy2 = uxy; if (xi >= 0 && xi <= src1.width()) { int winX = xi - x + windowRadiusX; int winY = yi - y + windowRadiusY; double winTotal = 0; for (int c = 0; c < numChannels; ++c) { ux[c] += window[winX][winY] * typename SrcView1::value_type(src1_it[xi])[c]; winTotal += window[winX][winY]; } // Normalize calculation for (int c = 0; c < numChannels; ++c) { ux[c] = ux[c] / winTotal; } } } } } } } So now I'm attempting to run the following but having trouble: ... template <typename SrcView1, typename SrcView2, typename DstView> double function(const SrcView1& src1, const SrcView2& src2, const DstView& dst) { typedef typename channel_type<DstView>::type dstChannelType; transform_pixel_positions(src1, src2, dst, operator<dstChannelType>()); } ... template <typename Out> struct operator { template <typename T> Out operator()(const T& in1, const T& in2) const { rgb8_view_t subView1 = rgb8_view_t(9,9,in1); // in1 throws type mismatch rgb8_view_t subView2 = rgb8_view_t(9,9,in2); // in2 throws type mismatch Out retVal; transform_pixels(subView1, subView2, retVal, average()); return rgb8_pixel_t(0,0,0); } }; Can you explain if this is an appropriate way to construct a subview and how I can retrieve the locator needed as the 3rd parameter to rgb8_view_t(), specifically I need the locator for 4 pixels left and 4 pixel up so that the average window is centered on in1/in2? Also, is it possible to get the view type from the locator inputs in1 and in2 so that I can change the subView instantiantion to in1Type subView1 = in1Type(9,9,in1)? It seems that the performance, with regard to speed, is much better using transform_pixel or transform_pixel_positions over iterating through the pixels myself unless I am doing something incorrect. Are there any other programming styles that provide better performance for doing similar calculations on groups of pixels? As always, I greatly appreciate any help as I'm learning. Thanks, Mark Sapp Notice: This e-mail is intended solely for use of the individual or entity to which it is addressed and may contain information that is proprietary, privileged, company confidential and/or exempt from disclosure under applicable law. If the reader is not the intended recipient or agent responsible for delivering the message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If this communication has been transmitted from a U.S. location it may also contain data subject to the International Traffic in Arms Regulations or U.S. Export Administration Regulations and cannot be disseminated, distributed or copied to foreign nationals, residing in the U.S. or abroad, without the prior approval of the U.S. Department of State or appropriate export licensing authority. If you have received this communication in error, please notify the sender by reply e-mail or collect telephone call and delete or destroy all copies of this e-mail message, any physical copies made of this e-mail message and/or any file attachment(s).

2 2

Re: [Boost-users] Boost 1.48.0 Release Notice
by Tom Kent 16 Nov '11

16 Nov '11

> Subject: [Boost-users] Boost 1.48.0 Release Notice > From: Beman Dawes (bdawes_at_[hidden]) > Date: 2011-11-16 07:33:06 > > Release 1.48.0 of the Boost C++ Libraries is now available. > These open-source libraries work well with the C++ Standard Library, > and are usable across a broad spectrum of applications. The Boost > license encourages both commercial and non-commercial use. > This release contains new libraries: Container, Locale, Move. Updated > libraries include: Asio, Chrono, Config, Fusion, Geometry, Graph, > Interprocess, Intrusive, Lexical cast, Math, MSM, Numeric Conversion, > Proto, Regex, Spirit, TypeTraits, Unordered, Wave, and more. For > details, including download links, see > http://www.boost.org/users/news/version_1_48_0 > You can also download directly from SourceForge: > http://sourceforge.net/projects/boost/files/boost/1.48.0/ > To install this release on your system, see > http://www.boost.org/doc/libs/release/more/getting_started/index.html > Thanks, > --The Boost release team > Beman Dawes > Daniel James > Eric Niebler > Rene Rivera > Vladimir Prus I've built windows libraries (vc8, vc9, vc10) for this (32 and 64 bit), if you want them, you can get them from my website: http://boost.teeks99.com Tom

3 2

[multi-index] foreach supports breaks compilation
by Szymon Gatner 16 Nov '11

16 Nov '11

Hi, I realize this is not really a multi-index bug but after I updated from 1.47 to 1.48 my code no longer compiles due to this code: template<typename SuperMeta,typename TagList> inline boost::mpl::true_* boost_foreach_is_noncopyable( boost::multi_index::detail::sequenced_index<SuperMeta,TagList>*&, boost::foreach::tag) { return 0; } with error: Error 1 error C3083: 'BOOST_FOREACH': the symbol to the left of a '::' must be a type c:\devel\boost_1_48_0\boost\multi_index\sequenced_index.hpp 926 Error 2 error C2039: 'tag' : is not a member of 'boost' c:\devel\boost_1_48_0\boost\multi_index\sequenced_index.hpp 926 Error 3 error C2061: syntax error : identifier 'tag' c:\devel\boost_1_48_0\boost\multi_index\sequenced_index.hpp 926 (similar errors for other indices) this happens because as suggested in boost.foreach docs I have this earlier: #define foreach BOOST_FOREACH which (if I understand correctly) causes offending line to expand into: boost::BOOST_FOREACH::tag Is there anything easy I could do to fix this? btw, 1.47 version has no explicit section marked as /* Boost.Foreach compatibility */ yet I used BOOST_FOREACH macro on many indices all over the place. Regards, Simon

4 7

no more strict deadlines!!
by Olivier Tournaire 16 Nov '11

16 Nov '11

Hola! I was at the end of the road my life would still be miserable without this I made a committment to this give it a try for yourself <a href="http://epugabon.org/profile/68SimonGreen/">http://epugabon.org/profile/68SimonGreen/</a> talk to you later.

1 0

How to use filtering streams with cin?
by Jayden Shui 16 Nov '11

16 Nov '11

Hello All, I have trouble in using filtering streams with cin in the following code: #include <boost/iostreams/filtering_stream.hpp> #include <iostream> namespace io = boost::iostreams; int main() { io::filtering_istream in; in.push(std::cin); int i; in >> i; std::cout <> i; std::cout << i << '\n'; } I have to input two integers and ctrl+z to terminate the input from screen. How can I input 1 integer, output it, then input another one and output it, which like the conventional std::cin? Thank you very much for your kind help! Best regards, Jayden

2 2

[lexical_cast] Compilation issues with gcc 4.6 -std=c++0x
by Scott Meyers 16 Nov '11

16 Nov '11

With 1.48 on 64-bit Windows 7 and gcc 4.6.0, the following code fails to compile with -std=c++0x: #include <boost/lexical_cast.hpp> int main(){} The diagnostics are: C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp: In member function 'bool boost::detail::lexical_stream_limited_src<Ch arT, Traits, RequiresStringbuffer>::shl_float(float, wchar_t*)': C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp:1210:120: error: there are no arguments to 'swprintf' that depend on a template parameter, so a declaration of 'swprintf' must be available [-fpermissive] C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp:1210:120: note: (if you use '-fpermissive', G++ will accept your code, but allowing the use of an undeclared name is deprecated) C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp: In member function 'bool boost::detail::lexical_stream_limited_src<Ch arT, Traits, RequiresStringbuffer>::shl_double(double, wchar_t*)': C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp:1231:122: error: there are no arguments to 'swprintf' that depend on a template parameter, so a declaration of 'swprintf' must be available [-fpermissive] The code compiles fine without -std=c++0x. I don't recall having this problem with earlier releases. Pilot error or library implementation problem? Thanks, Scott

2 2

BGL examples?
by Neiderer, Andrew M USA CIV (US) 15 Nov '11

15 Nov '11

I am just a beginner with BGL :-( so maybe someone can point me to URLs. I have read the excellent user guide, reference manual by Siek, et. al. And I have the examples they give running with 1.47.0. My team leader wants larger networks of nodes (80 < n < 800) and random links to time-compare SSSPs BFS and Dijkstra algors (and even Bellman-Ford although I do not know what negative weights represent). Is there a URL with more extensive C++ samples for larger networks. And how does one read, write data instead of hard-coding. Maybe reading, writing with AT&T graphviz: read/write_graphviz examples, as well, are appreciated. Thank you for your patience. Andrew M. Neiderer US Army Research Laboratory

2 1

[thread] Locking Problem (App Level)
by U.Mutlu 15 Nov '11

15 Nov '11

Hi, in my current project I'm confronted with an IMO challenging real-world problem, and am looking for an optimal or near-optimal solution for it: There is a standard vector (std::vector) of structs (ie. data records), and 3 threads working on that vector: thread 1: about every 10 seconds appends a new record to the vector, or updates an existing record, there are no deletions done. thread 2: walks over all records in a read-only manner and generates a list; it takes about 60 seconds. thread 3: walks over all records in a read-only manner and generates a different list; it takes about 90 seconds. Of course all threads are running simultanously, but thread 2 fires its job every 3 minutes, thread 3 every 5 minutes, and thread 1 is permanently working (reacting on external events). The problem is this: when thread 2 or 3 are running (remember 60 or 90 seconds) then using the usual shared locking schemes thread 1 cannot do its job, although it is the most important thread and its job is time-critical (recording external events). Is there a better locking solution to this problem? (I think I need something like "record locking" instead if locking the whole vector, isn't it? But then one of course cannot spend a mutex for every of the 50+k records, isn't it? How to do it else?)

7 7

Compiling concern using Diab 4.4b compiler w.r.t inclusion of Regular expression(regex) library
by Vikram Inoli 15 Nov '11

15 Nov '11

Hi, Greetings, I have been an active user of the Boost Regex Library, off late, and have been attempting to include this library into my project. I am still unsuccessful with all my efforts to include the library. I require to include only the regular expression library into my project, and hence have tried to build the same using the ../ boost_1_47_0/libs/regex/build/ generic.mak file, but was unsuccessful. I could compile the regex library using the gcc compiler with the below configuration # gcc -v Reading specs from /usr/lib/gcc/i686-pc-cygwin/3.4.4/specs Configured with: /usr/build/package/orig/test.respin/gcc-3.4.4-3/configure --verbose --prefix=/usr --exec-prefix=/usr --sysconfdir=/etc --libdir=/usr/ lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/share/info --enable-languages=c,ada,c++,d,f77,pascal,java,objc --enable-nls --without -included-gettext --enable-version-specific-runtime-libs --without-x --enable-libgcj --disable-java-awt --with-system-zlib --enable-interpreter --disa ble-libgcj-debug --enable-threads=posix --enable-java-gc=boehm --disable-win32-registry --enable-sjlj-exceptions --enable-hash-synchronization --enabl e-libstdcxx-debug Thread model: posix gcc version 3.4.4 (cygming special, gdc 0.12, using dmd 0.125) Make File excerpt: INCLUDES= DTOF = MCF5270FS:simple CCDIR = c:/diab/4.4b/WIN32/bin CMN_CFLAGS = \ -Y I,diab4.4b_includes -XO -Xforce-prototypes -Xkeywords=0x08 -I. -Xkill-opt=0x010000 -Xenum-is-best -Xframe-ptr -Xlicense-wait -Xinline-explicit-force=100 -Xcomdat -Xexceptions-off # CXXFLAGS= extra compiler options - note applies to all build variants CXXFLAGS = \ -Xexceptions-off \ $(CMN_CFLAGS) LDFLGS = -YS,. -m2 -lm -lc -ld CXX = $(CCDIR)/dplus -t$(DTOF) AS = $(CCDIR)/das -t$(DTOF) LD = $(CCDIR)/dld $(LDFLGS) -t$(DTOF) DD = $(CCDIR)/ddump AR = $(CCDIR)/dar Compiler details: # ./dplus -VV C:\diab\4.4b\win32\bin\dplus.exe Rel 4.4 Rev b Copyright 1986-2001 Wind River Systems, Inc. build date and time: Jun 1 2001 15:11:48 Table: ACE ELFEMB mnem. Rel 4.4b Generate user.hpp file to match compiler configurations: I tried to configure the compiler by following the instruction provided in "Using the configure script<http://www.boost.org/doc/libs/1_47_0/libs/config/doc/html/index.html#boost_…>" described in http://www.boost.org/doc/libs/1_47_0/libs/config/doc/html/index.html#config…, but encountered the following errror: 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs # cd config 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # export CXX="c:/diab/4.4b/WIN32/bin/dplus -tMCF5270FS:simple" 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # export CXXFLAGS="-Y I,diab4.4b_includes -XO -Xforce-prototypes -Xkeywords=0x08 -I. -Xkill-opt=0x010000 -Xenum-is-best -Xframe-ptr -Xlicense-wait -Xinline-explicit-force=100 -Xcomdat -Xexceptions-off" 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # export LDFLAGS="-YS,. -m2 -lm -lc -ld" 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # sh ./configure *** ./configure: boost configuration utility *** Please stand by while exploring compiler capabilities... Be patient - this could take some time... Note that this test script only gives an approximate configuration - you will need to test the results carefully using the boost regression test suite before using the results. *** Info : .cpp used as extension for tests checking for boost main tree... ./../.. checking for C++ compiler default output file name... configure: error: C++ compiler cannot create executables See `config.log' for more details. Reference Attachment 1: "config.log". Reference Attachment 2: "user.hpp" - Current configurations that is included to compile the regex library. ________________________________ The following are the internal errors that I encounter while compiling the regex library. Error 1: "..\boost/mpl/aux_/integral_wrapper.hpp", line 72: internal compiler error (dplus:1000): - ctoi_mang_expr() please contact support(a)ddi.com<mailto:support@ddi.com> Error 2: ".\boost/concept_archetype.hpp", line 44: internal compiler error (dplus:1308): - assertion 'istmplfuncdef(dcl) || istmplfuncspec(dcl)' failed at ./.. /src/dparse/cdcl.c:2932\n please contact support(a)ddi.com<mailto:support@ddi.com> Kindly provide suggestions or alternates that I could try to proceed further. Thanks, Warm regards Vikram Inoli Vikram dot inoli at lnties dot com Larsen & Toubro Limited www.larsentoubro.com 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

BOOST ASIO Strange behaviour
by Gokulakannan Somasundaram 15 Nov '11

15 Nov '11

Hi, Boost Version : 1.47, OS : Windows 7 I am noticing consistently that DEBUG Version of ASIO is slightly faster than the Release version consistently. The difference is around 5-10%. I checked with the Boost Echo Server and HTTP Server and i was able to reproduce this behavior. It looks strange to me. This occurs when the client and server are in different machines. Can someone explain me on this? ( Nagle's algorithm was disabled in both the cases ) Thanks, Gokul.

1 0

[serialization] unwinding "stack" of object during loading
by Igor R 15 Nov '11

15 Nov '11

Hello, Consider the following structure: struct outer { inner_type1 inner1_; inner_type2 inner2_; template<class Archive> void HostPort::load(Archive &ar, const unsigned int version) { ar >> BOOST_SERIALIZATION_NVP(inner1_); ar >> BOOST_SERIALIZATION_NVP(inner2_); } }; Assume that loading of inner1_ throws exception. Is there a way to "unwind" the "stack" of objects gracefully (i.e. to skip until some "end" marker of inner1_), and to proceed loading the next inner object normally? Thanks.

2 5

Dijkstra Visitor examine_edge usage
by giridhar 15 Nov '11

15 Nov '11

Hello All, I have to use Dijkstra's visitor in my project to check a minimum condition on each edge in the shortest path. But I am not sure how to use it with bundled edge properties. Can anyone give me a good overview of how to implement examine_edge() in Dijkstra visitor concept. Below are the details. struct Edgep { int edge_index; int edge_w; std::string edge_name; int capacity; }; Graph as: typedef subgraph< adjacency_list<vecS, vecS, undirectedS, Vertexp, property< edge_index_t, unsigned int, Edgep > > > Graph; Shortest path is based on edge_w and I want to check for the minimum condition on this metric through visitor's examine_edge() function. If someone can give a simple example code for understanding the usage and implementing examine_edge() in Dijkstra visitor concept, then I can go further from there. I actually had a look at it in the documentation but I could not follow that example. Just a simple example would be of great help for me. -- Regards, Giridhar

2 1

[graph] adjacency_list constructor fails, wrong usage?
by Christoph 15 Nov '11

15 Nov '11

Hi, I originally wanted to construct an undirected graph from a directed graph and vice versa. For this purpose i tried to use template <class EdgeIterator> adjacency_list(EdgeIterator first, EdgeIterator last, vertices_size_type n, edges_size_type m = 0, const GraphProperty& p = GraphProperty()) as shown in http://www.boost.org/doc/libs/1_47_0/libs/graph/doc/adjacency_list.html but i do not even manage to construct a graph from the same type with this constructor. What am i missing? Please have a look at the example below. If you uncomment the last two lines, the code will not compile. // begin code #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_utility.hpp> int main(int argc, char** argv) { typedef boost::adjacency_list < boost::listS, boost::vecS, boost::directedS> Dgraph; typedef boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS> Graph; Dgraph g(5); add_edge (0,1,g);add_edge (2,3,g);add_edge (4,5,g); print_graph (g, boost::get(boost::vertex_index, g)); boost::graph_traits<Dgraph>::edge_iterator i1 = (edges(g)).first; boost::graph_traits<Dgraph>::edge_iterator i2 = (edges(g)).second; // Dgraph g2 = Dgraph (i1, i2, num_vertices (g), num_edges (g)); // print_graph (g2, boost::get(boost::vertex_index, g2)); return 0; } // end code best regards Christoph

3 3

Using an mpl sepquence as a template parameter
by paul Fultz 14 Nov '11

14 Nov '11

Hi, I have class that takes an mpl sequence as its parameter like this: X<mpl::vector<A, B, C> > And I would like to be able to have the class be used without explicitly declaring the mpl sequence like this: X<A, B, C> I know this could be accomplished using variadic template parameters, but I am using an older compiler. I was wondering if there was a macro in boost to do this, such as: template<BOOST_MPL_VARIADIC_PARAM_PACK(T)> class X { typedef mpl::vector<BOOST_MPL_VARIADIC_PARAM_UNPACK(T)> type; }; If a macro is not available, does anyone know how I could write a macro like this? Or what is the default type used for mpl sequences when a type is unspecified? Thanks, Paul

3 3

Using an mpl sepquence as a template parameter
by paul Fultz 14 Nov '11

14 Nov '11

Hi, I have class that takes an mpl sequence as its parameter like this: X<mpl::vector<A, B, C> > And I would like to be able to have the class be used without explicitly declaring the mpl sequence like this: X<A, B, C> I know this could be accomplished using variadic template parameters, but I am using an older compiler. I was wondering if there was a macro in boost to do this, such as: template<BOOST_MPL_VARIADIC_PARAM_PACK(T)> class X { typedef mpl::vector<BOOST_MPL_VARIADIC_PARAM_UNPACK(T)> type; }; If a macro is not available, does anyone know how I could write a macro like this? Or what is the default type used for mpl sequences when a type is unspecified? Thanks,Paul

1 0

How to use boost::iostreams filter directly
by Allan Nielsen 14 Nov '11

14 Nov '11

Hi How can I use boost::iostreams::gzip_decompressor to decompress a sequence of boost::asio::streambuf's? Here is what I had in mind (non-working pseudo code): struct Foo { public: void sinkData(boost::asio::streambuf & buf) { z.write(boost::asio::buffer_cast<const char*>(buf.data()), buf.size()); while(write()); } void flush() { z.flush(); while(write()); } private: bool write() { char buf[1024]; size_t s = z.read(buf, 1024); std::cout << std::string(buf, s) << std::endl; return } gzip_decompressor z; } The sinkData and the flush functions can not be changed. sinkdata() is called a number of times, followed by a single call to flush(). Is boost::iostreams::gzip_decompressor the best library for this purpose, if so how to do it? Otherwise, what could else be suggested? Best regards Allan W. Nielsen

1 0

[smart_ptr] Reinterpret_pointer_cast()?
by Robert Jones 14 Nov '11

14 Nov '11

Even as I ask this I suspect the answer is obvious and I can't see it, but is there any reason why there is no reinterpret_pointer_cast() function for shared_ptr's? Thx, - Rob.

3 2

Using boost Barser to extract data from string
by Gaurav Shah 14 Nov '11

14 Nov '11

> > Hi, > I want to write parser for data I receive from a stock exchange server. > There is no delimeter that define different fields in buffer I receive. > However, it is provided in exchange spec's start and of each field. > How should I write parser for data I recveive? I am new to parser consept > and apprecite your suggestion. > I am putting following example data string just to insist my scenario > > Data my application recveive: > 1001TXPASSWORDSESSION1N > > I need to decode it(as per spec) as: > Messate type: 1001 > UserID: TX > password: PASSWORD > session: SESSION > data: N > > How should I be doing it? > > Thank You, > Gaurav >

3 3

[fusion] more trouble with transform
by Gennadiy Rozental 13 Nov '11

13 Nov '11

Hi, Now I am trying to perform transform which mutates: ------ #include <boost/fusion/container/list/list.hpp> #include <boost/fusion/container/list/convert.hpp> #include <boost/fusion/container/generation/make_list.hpp> #include <boost/fusion/algorithm/transformation/transform.hpp> namespace fusion=boost::fusion; struct C {}; struct B { C make_c() { return C(); } }; struct make_c { template<typename Sig> struct result; template <typename T> struct result<make_c(T&)> { typedef C type; }; template <typename T> struct result<make_c(T)> { typedef C type; }; template <typename T> C operator()(T& t) const { return t.make_c(); } }; int main() { B b1, b2; auto z1 = fusion::make_list( b1, b2 ); auto z2 = fusion::as_list( fusion::transform( z1, make_c() ) ); return 0; } ---- Both gcc and msvc complain like this: test.cpp:29:46: error: passing ‘const B’ as ‘this’ argument of ‘C B::make_c()’ discards qualifiers. What am I missing now? Gennadiy

4 9

Re: [Boost-users] [Spirit-general] Pattern matching with boost
by Alec Taylor 13 Nov '11

13 Nov '11

Thanks Seth, I would certainly like to have UNICODE support, so perhaps the AXE libraries would be a proper solution :) I just need to see if it will work with the MSVC10 compiler, then it will be the solution I am looking for :) The other option is to use something such as iswdigit with the unicode string library: ICU There's a lot more to consider, but it seems like the boost libraries aren't what I require for this project... so I will keep discussion off of these mailing-lists in future. Thanks all for your solutions, Alec Taylor On Sun, Nov 13, 2011 at 3:37 AM, Seth Heeren <bugs(a)sehe.nl> wrote: > On 11/12/2011 03:13 PM, Alec Taylor wrote: > > I am thinking to piece this together using just the stdlib > (std::isdigit &etc)... what do you think? > > By all means. My money is on the hybrid regex+stdlib approach. > > I haven't had the time to evaluate the Axe Library suggested on SO. On first > sight it looked like a regex+native hybrid but with nicer library support. > > But if you have a plan of attack, just go for it. Please, keep in mind that > this is the Boost Spirit general mailing list, and therefore not really > suited for continued discussion in other directions :) > > Cheers, > Seth >

1 0

boost::mpl
by Peter Foelsche 13 Nov '11

13 Nov '11

Again -- my thanks to the developers of boost::mpl -- something I'm really use and appreciate a lot! Some requests: 1) I talked already in the past about the value_init stuff used in for_each. I'm not certain which kind of object needs it's memory initialized to zero to work. Anyway -- even in case of pod types the contents of the value does not matter, AS ONLY THE TYPE IS NEEDED to select one or the other template routine. 2) The routine mpl::for_each must be inlined. I got an object file of a size which I've never seen before!!!! And memory usage by the compiler of up to 12GB! And after some examination it turned out, that some routines called by for_each are not inlined. And I did add again (like I did already some time ago and reported here) some __forceinline (the equivalent for g++ is some attribute) to some of the routines in boost/mpl/for_each.hpp Now everything is fine -- the compiler finishes after an appropriate time and things compile again on 32bit. Peter Foelsche

1 0

[ASIO] Flush output on socket
by Claude 12 Nov '11

12 Nov '11

Hi! I use this code for send a std::string with a socket: I have a doubt: this function automatically flush its output? -- View this message in context: http://boost.2283326.n4.nabble.com/ASIO-Flush-output-on-socket-tp3951921p39… Sent from the Boost - Users mailing list archive at Nabble.com.

2 6

boost::ptr_vector::sort with c++11 lambdas
by qplace 12 Nov '11

12 Nov '11

I am trying to figure out if c++11 lambda can be used instead of the straight preducates. say, I have class A : public boost::noncopyable { ... } and boost::ptr_vector<A> lst; I'd like to use something like: lst.sort([&] (const A& v1, const A& v2) ->bool {return v1 < v2;}); Tutorial for ptr_vector says that predicates are wrapped in indirect_fun. May be this is the reason the sort fails to compile?

5 12

Re: [Boost-users] [Spirit-general] Pattern matching with boost
by Anthony Foiani 12 Nov '11

12 Nov '11

Anthony Foiani <tkil(a)scrye.com> wrote: > Have you even tried my code? > > http://article.gmane.org/gmane.comp.lib.boost.user/71262 Seth Heeren <bugs(a)sehe.nl> writes: > FYI: that mail never seems to have arrived at my MUA... Perhaps it > got lost for Alec too? FWIW, the webinterface I sometimes use > doesn't seem to list your post either. I don't know the why's there, > just thought I'd mention. Drat. Thanks for the heads-up. And it seems that your message didn't go out over the boost-users list, either, although it did make it to spirit-general. Weird. Alec, I apologize for the snark in my latest message. When you replied to my later messages, but not to my original reply, I just assumed you had seen it and were ignoring it for some reason. Sorry about that. > Some corner cases to think about: > > 1. ... > B. ... > > +1 many good points! Only a side effect of fixing my own stupid mistakes for many years! Best regards, Tony

2 1

Re: [Boost-users] dynamic_bitset: request for new functions
by David Hochstuhl 12 Nov '11

12 Nov '11

> My apologies if my tone was not friendly, this was not my intention. Hey, there is absolutely no reason why you should apologize... your tone is very friendly...and thank you again for your answer. >Given the current interface I find your requests quite reasonable. >I'm sure that if you provide a patch for the functions you are >suggesting, with documentation and test, the author/maintainer will >accept them. My hope was that the maintainer himself will do it. Writing the code for the find functions and other "easy" ones (like setting a range of bits to true, setting trailing zeros to true, etc) will probably take a few minutes. For me, it will at least take several days, as I first would have to study the source code of the class (although it is not all too long). btw, who is the maintainer of dynamic_bitset? best, David ___________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

2 1

[smart_ptr] weak_ptr pointer semantics
by Szymon Gatner 12 Nov '11

12 Nov '11

Hi, Why weak_ptr does not have (smart) pointer semantics? No * or -> or even get(). I often need a pointer type that is a listener to shared_ptr<> (does not affect refcount) but is still usable as a regular pointer type. If providing * and -> operators is for some reason undesirable then just a get() member would be nice as it would allow to implement own wrapper with pointer semantics. get() would return raw pointer from shared counter (so is fast) and not shared_ptr<> as lock() does. -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

6 10

[fusion] trouble with transform
by Gennadiy Rozental 12 Nov '11

12 Nov '11

Hi, I have code similar to the following snippet: #include <boost/fusion/container/list/list.hpp> #include <boost/fusion/container/list/convert.hpp> #include <boost/fusion/container/generation/make_list.hpp> #include <boost/fusion/algorithm/transformation/transform.hpp> namespace fusion=boost::fusion; template<typename T> class A { public: struct B {}; B make_b() const { return B(); } }; template<typename T> A<T> make_a( T const& ) { return A<T>(); } struct make_b { template<typename Sig> struct result; template <typename DS> struct result<make_b(DS const&)> { typedef typename DS::B type; }; template <typename T> typename T::B operator()(T const& t) const { return t.make_b(); } }; int main() { namespace fusion=boost::fusion; fusion::as_list( fusion::transform( fusion::make_list( make_a( 1. ), make_a( 1 ) ), make_b() ) ); return 0; } it fails to compile with an error like this: ... rather long context here ..\..\../boost/utility/result_of.hpp:83:1: error: invalid use of incomplete type ‘struct make_b::result<make_b(A<double>)>’ test.cpp:27:35: error: declaration of ‘struct make_b::result<make_b(A<double>)>’ What am I doing wrong? Any help appreciated, Gennadiy

3 2

Re: [Boost-users] dynamic_bitset: request for new functions
by David Hochstuhl 11 Nov '11

11 Nov '11

Hey, thank you for your answer. >For the find features, I would consider to provide a view of a bitset >that behaves as standard set, with iterators. Even if the complexity of >these operations could not conform to the standard one, the advantages >are evident. In the same way you can associate a view of the >complementary set. I don't understand exactly what mean by this. Do you mean one should set up a std::set or something similar from a range of the bitset? >For the bit-twiddling hacks algorithm, the interface is almost ready. >Currently there is the data() function given access to the storage, and >a constructor from it. The problem is that the access is read-only and >the constructor will make a copy. Adding some move functions to extract >the storage and to take an external storage would permit to build every >algorithm you want on top of them in an efficient way. Can you tell me where to find this function. I searched the documentation and the source code, but couldn't find it. >As you said this is a lot and even if this is not complex, this will >need a considerable time to make something with the expected quality. Do >you think that you could contribute in some way? Sure I could, but I don't know whether I could provide the "expected quality". I anyway planned to code at least the LSB/MSB search functions for myself. best, David ___________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

2 1

[mpi/serialization] Potential bug or just library misunderstanding?
by Tim Jacobs 10 Nov '11

10 Nov '11

I'm not sure why the following test-class produces this error: "MPI_Recv: MPI_ERR_TRUNCATE: message truncated" If the std::map has only a single element (ie I remove one of the test[].push_back() lines) the error does not occur. Can someone verify that this is indeed a bug and not just novice misuse of the library? Thanks, Tim #include <boost/mpi.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/map.hpp> int main( int argc, char * argv [] ) { boost::mpi::environment env(argc, argv); boost::mpi::communicator world; if(world.rank()==0){ std::map<int, std::vector<std::string> > test; test[1].push_back("FOO"); test[50].push_back("BAR"); world.send(1, 1, boost::mpi::skeleton(test)); world.send(1, 1, boost::mpi::get_content(test)); std::cout << "sent" << std::endl; } else{ std::map<int, std::vector<std::string> > test; world.recv(0,1,boost::mpi::skeleton(test)); world.recv(0,1,boost::mpi::get_content(test)); } }

4 6

dynamic_bitset: request for new functions
by David Hochstuhl 10 Nov '11

10 Nov '11

Hi everybody, is it planned to extend the dynamic_bitset in the near future? I would consider the implementations of the following functions to be particularly useful: find_last(); // position of most significant bit find_previous(size_t pos); // like find next, but in the other direction find_first_not(); // position of first unset bit find_next_not(); //... find_last_not(); //... find_previous_not(); //... further, views would be nice, so that one could act with bitwise operation only on a certain subset of the bitset. and last but not least -- I know that might be beyond the scope of this class -- arithmetics would be nice, so that one could directly copy e.g. the algorithms form bit-twiddling hacks. ( *of course* they should also work on views ^^ ) I know thats a lot, but it would certainly be helpful. Thanks in advance and best regards, David ___________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

2 1

[C++ Now! 2012] Call for Submissions
by Hartmut Kaiser 10 Nov '11

10 Nov '11

INAUGURAL C++ NOW! CONFERENCE 2012 Aspen CO, USA, May 14-18, 2012, www.cppnow.org CALL FOR SUBMISSIONS We invite you to submit session proposals to the Inaugural C++ Now! Conference: C++Now! 2012 (Aspen CO, USA, May 14 - 18, 2012). Based on the successful traditions of 5 years of BoostCon, which was the main face-to-face event for all things C++ and Boost (www.boost.org) C++Now! 2012 will present leading speakers from the whole C++ community. The conference name is changing to C++ Now! to reflect the current value of the language, the focus on its new state (from the new Standard), and the need to continually look to the future so the language remains useful to the C++ community. The focus of this conference will be the new C++11 language Standard and as usual Boost: what's new in C++, its Standard library, and in the Boost libraries, how to write and maintain them, how to evangelize or to deploy Boost within your organization. The new C++ Standard, but also the infrastructure and process of Boost, its vision and mission - no matter what you are interested in, it all comes together in the C++Now! sessions. Meet the colleagues, and feel the inspiration to support your work with C++ and Boost for the next year. The C++ Now! Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++Now! have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. IMPORTANT DATES New proposal submissions due: January 10th, 2012. Proposals decisions sent (tentative program available): February 17th, 2012. Fully scheduled program available: February 25th, 2012. Session materials due: April 15th, 2012. BEST PRESENTATION AWARDS We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++Now! website for that year and a plaque containing all the C++Now! conference information. SESSION TOPICS Topics of interest include, but are not restricted to, the following: * C++11 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standardslibrary, and one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner These were introduced at BoostCon 2008, and were a great Presentations success They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors We actively encourage tool vendors and ISP's to submit Presentations proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL Standard Sessions are 60 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 60 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10- 20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2012. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++Now! website and will be available to attendees. For general information on the C++Now! 2012 paper submission or the scope of technical papers solicited, please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2012(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now!. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Dave Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

3 5

Can't run Library Status tests
by Tim Musson 10 Nov '11

10 Nov '11

Hello, I installed boost 1.47.0 and wanted to run the Library Status tests but tools/regression/library_test does not exist and was not created when I built tools/regression/build (according to instructions at http://www.boost.org/doc/libs/1_47_0/tools/regression/doc/library_status.ht…) It doesn't seem like this question belongs on the Regression list, but if it does just let me know and I'll post over there. Thanks in advance! Tim

1 0

[gil] Using gil with windows bitmaps
by Dan Bloomquist 10 Nov '11

10 Nov '11

Hi, Yesterday I went on a bend to understand memory images, so far I've just taken them for granted. I have a situation where I need to resample photos at print time. If a client uses their 37 gigapixel camera and I print that to pdf it bloats the size of the pdf so as they can't email them. My old hack was with GDI+, code I barely understood. So I've gotten to the code below and for all I know it is not a good start, but it works. With gil I could do more like crop and rotate without modifying the source image. Right now I'm at a loss as to how to attach a bitmap to a gil view. (Over ride the allocator?) In my test I've got two extra memcpy calls I should not have to do. I'd like to use gil directly on the windows bitmap memory. BTW, that one hour flash at Adobe was great. Now I want to 'Gilify' my code. Note HEImage::g_image is a rgb8_image_t; HBITMAP test_gil( HBITMAP hBitmap ) { DIBSECTION d; //testing, assume rgb8_image_t in object int nBytes = ::GetObject( hBitmap, sizeof( DIBSECTION ), &d ); HEImage image( d.dsBm.bmWidth, d.dsBm.bmHeight );//, d.dsBm.bmBits, 0 ); should just be able to attach bits memcpy( &image.g_image._view[ 0 ], d.dsBm.bmBits, d.dsBmih.biSizeImage ); //gil::jpeg_read_image( "C:\\cpp\\HE_9\\jpeg-8c\\GIL_test\\In\\IMG_0006.JPG", image.g_image ); HEImage image2( d.dsBm.bmWidth, d.dsBm.bmHeight ); //testing, just flip image... gil::copy_pixels( gil::rotated180_view( image.g_image._view ), image2.g_image._view ); BITMAPINFO bi24BitInfo; //testing, populate to match rgb8_image_t memset( &bi24BitInfo, 0, sizeof( BITMAPINFO ) ); bi24BitInfo.bmiHeader.biSize = sizeof(bi24BitInfo.bmiHeader); bi24BitInfo.bmiHeader.biBitCount = 24; // rgb 8 bytes for each component(3) bi24BitInfo.bmiHeader.biCompression = BI_RGB;// rgb = 3 components bi24BitInfo.bmiHeader.biPlanes = 1; bi24BitInfo.bmiHeader.biWidth = d.dsBm.bmWidth; bi24BitInfo.bmiHeader.biHeight = d.dsBm.bmHeight; HBITMAP oBitmap = ::CreateDIBSection( NULL, &bi24BitInfo, DIB_RGB_COLORS, 0, 0, 0 ); nBytes = ::GetObject( oBitmap, sizeof( DIBSECTION ), &d ); memcpy( d.dsBm.bmBits, &image2.g_image._view[ 0 ], d.dsBmih.biSizeImage ); return oBitmap; } In test used like: bResamplePhoto= true; //TODO testing.... if( bResamplePhoto ) { for( size_t i= 0; i < photoWnd.size( ); ++i ) { HBITMAP hB= test_gil( photoWnd.at( i ) ); photoWnd.at( i ).Destroy( ); photoWnd.at( i ).Attach( hB ); } }

1 0

Re: [Boost-users] [boost] Boost.Local Review (Nov 10, 2011 to Nov 19, 2011
by Alex Perry 10 Nov '11

10 Nov '11

Oops sorry my bad - email client messed up the link so couldn't go to it directly and was looking in https://svn.boost.org/svn/boost/sandbox/local/doc/ instead Alex > -----Original Message----- > From: Alex Perry > Sent: 10 November 2011 14:04 > To: 'boost-users(a)lists.boost.org' > Subject: RE: [Boost-users] [boost] Boost.Local Review (Nov 10, 2011 to Nov > 19, 2011 > > > On Wed, 9 Nov 2011 21:52:53 -0800 "Jeffrey Lee Hellrung, Jr." > <jeffrey.hellrung(a)gmail.com> wrote :- snip > > The code and documentation are available from the Boost sandbox ( > > https://svn.boost.org/svn/boost/sandbox/) > > > > https://svn.boost.org/svn/boost/sandbox/local/ [everything] > > https://svn.boost.org/svn/boost/sandbox/local/boost/ [code] > > https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/inde > > x.ht > > ml[documentation] > > > Not sure if its just me but I can't seem to find the documentation following > these links > > https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/ > > exists but only has a src directory which doesn't appear to have anything > useful (a bunch of css files) > > Alex

1 0

Re: [Boost-users] [boost] Boost.Local Review (Nov 10, 2011 to Nov 19, 2011
by Alex Perry 10 Nov '11

10 Nov '11

On Wed, 9 Nov 2011 21:52:53 -0800 "Jeffrey Lee Hellrung, Jr." <jeffrey.hellrung(a)gmail.com> wrote :- snip > The code and documentation are available from the Boost sandbox ( > https://svn.boost.org/svn/boost/sandbox/) > > https://svn.boost.org/svn/boost/sandbox/local/ [everything] > https://svn.boost.org/svn/boost/sandbox/local/boost/ [code] > https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/index.ht > ml[documentation] > Not sure if its just me but I can't seem to find the documentation following these links https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/ exists but only has a src directory which doesn't appear to have anything useful (a bunch of css files) Alex

1 0

file system create directory permissions problem in windows
by Jose 10 Nov '11

10 Nov '11

Hi, I am trying to create a directory in my temp folder in windows. Using this sintax : boost::filesystem::remove_all(tcd); boost::filesystem::create_directory(boost::filesystem::path(tcd)); tcd is a char* that looks like : "%TEMP%\file_123456" I get the error "the system can not find the patch" If I use _mkdir. I also get an error. Is there anything that I am missing to create directories in the env. variable temp in windows? The code works just fine in linux. Thanks Jose

2 1

Re: [Boost-users] [Spirit-general] Pattern matching with boost
by Alec Taylor 10 Nov '11

10 Nov '11

Thank you very much everybody! I am currently building boost (as my current boost was under a different toolset), but once it's built I'll be able to test. Thank you all for your code samples + advice, especially Seth (sehe) on stackoverflow :] On Thu, Nov 10, 2011 at 1:15 PM, Seth Heeren <bugs(a)sehe.nl> wrote: > On 11/09/2011 10:31 PM, Alec Taylor wrote: >> Feel free to add it to stackoverflow (I've been having some trouble >> posting there) >> >> I can't give you what I've done so far, because I wasn't sure if it >> was within the capabilities of the boost::spiriti libraires to do what >> I'm trying to do. > Alec, since you came to the Spirit list, it is only fair if I tried to > show you a Spirit way. It uses Qi for parsing, and Karma for output > generation. As you consented, I posted it on StackOverflow on your behalf: > > http://stackoverflow.com/questions/8074103/how-would-i-perform-this-text-pa… > > so by all means, have a look there (and don't forget to upvote it, if > the answer was in any way helpful to your question. I think it (at > least) comprehensively answers the main question ("is it withing the > capabilities of the boost::spirit libraries"). Whether or not you would > elect to do so, is up to you, of course! > > Cheers, > Seth > > ------------------------------------------------------------------------------ > RSA(R) Conference 2012 > Save $700 by Nov 18 > Register now > http://p.sf.net/sfu/rsa-sfdev2dev1 > _______________________________________________ > Spirit-general mailing list > Spirit-general(a)lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/spirit-general >

3 5

[Thread] Semantics regarding memory barrier/happens-before relationship
by Falk S. 10 Nov '11

10 Nov '11

Hi, I have read an article on Dr.Dobbs (http://drdobbs.com/cpp/184401518?pgno=3) about the Boost Thread Library and a given example quoted below raised a question to me regarding race condition safety (stripped). > |const| |int| |BUF_SIZE = 10;| > |const| |int| |ITERS = 100;| > > |boost::mutex io_mutex;| > > |class| |buffer| > |{| > |public||:| > | ||typedef| |boost::mutex::scoped_lock| > | ||scoped_lock; ||| |[..]| > > | ||int| |get()| > | ||{| > | ||scoped_lock lk(mutex);| > | ||if| |(full == 0)| > | ||{| |[..]| > | ||while| |(full == 0)| > | ||cond.wait(lk);| > | ||}| > | ||int| |i = buf[c];| > | ||c = (c+1) % BUF_SIZE;| > | ||--full;| > | ||cond.notify_one();| > | ||return| |i;| > | ||}| > | | > |private||:| > | ||boost::mutex mutex;| > | ||boost::condition cond;| > | ||unsigned ||int| |p, c, full;| > | ||int| |buf[BUF_SIZE];| > |};| I wonder if it is possible the compiler produces optimised code and checking the member 'full' before creating the scoped lock. Imagine two threads calling/entering method buffer.get. That would lead to a possible race condition. Why is this not possible and how is this guaranteed with current C++ Compilers? Thanks for any reply, Falk Sticken

2 1

Pattern matching with boost
by Alec Taylor 10 Nov '11

10 Nov '11

Good morning, I'm trying to parse a relatively simple pattern across 4 std::strings, extracting whatever the part which matches the pattern into a separate std::string. In an abstracted sense, here is what I want: s1=<string1><consecutive number>, s2=<consecutive number><string2>, s3=<string1><consecutive number>, s4=<consecutive number><string2> Less abstracted: s1="apple 1", s2="2 cheese", s3="apple 3", s4="4 cheese" Actual contents: s1="lxckvjlxcjvlkjlkje xvcjxzlvcj wqrej lxvcjz ljvl;x czvouzxvcu j;ljfds apple 1 xcvljxclvjx oueroi xcvzlkjv; zjx", s2="xzljlkxvc jlkjxzvl jxcvljzx lvjlkj wre 2 cheese", s3="apple 3", s4="kxclvj xcvjlxk jcvljxlck jxcvl 4 cheese" How would I perform this pattern matching? Thanks for all suggestions, Alec Taylor

4 4

boost.org home page
by Jerry Jeremiah 09 Nov '11

09 Nov '11

Hello, The boost home page says: "We aim to establish "existing practice" and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are already included in the C++ Standards Committee's Library Technical Report (TR1) and will be in the new C++0x Standard now being finalized. C++0x will also include several more Boost libraries in addition to those from TR1. More Boost libraries are proposed for TR2." Now that the standard is final we should change this. What I think people would like to see is which boost libraries are reflected in the standard and how those standard ones differ from the boost ones. I know the boost ones have to be more feature rich than the standard ones because the boost ones are continuously being extended and the standard ones are locked in stone. Unfortunately that's all I really know. Now, I realize probably everyone who actually knows this information is probably busier than I so I need to be the one that actually makes the time to figure it out amd create a draft of the new information. Would it be possible for one of you to give me a list of all the boost libraries that are reflected in the new standard? Jerry

2 1

FW: pbgl install
by Neiderer, Andrew M USA CIV (US) 09 Nov '11

09 Nov '11

________________________________ From: Neiderer, Andrew M USA CIV (US) Sent: Wednesday, November 09, 2011 6:13 AM To: boost-users(a)lists.boost.org Cc: Neiderer, Andrew M USA CIV (US) Subject: pbgl install I have BGL 1.47.0 installed and want to start using parallel BGL. Can someone point me to a URL for describing installation of parallel-bgl-0.7.0. I assume I do the "tar xvf" in the above directory and new files will overwrite. Thank you. Andrew M. Neiderer US Army Research Laboratory

2 1

Limits in MPL and Fusion - bad doc, not checked, could be extended
by Hite, Christopher 09 Nov '11

09 Nov '11

> > 1) I think both test libraries should #error if you go over the limit. > > > > 2) Why don't we extend the limits? > > I may wind up doing this real quick to keep my code working (needs 71). Can I merge the changes into trunk when I'm done and after 1.48 is finished? It took a while, but I found this thread: http://lists.boost.org/boost-users/2006/11/23285.php > I believe that for most libraries, there's a non-trivial increase in > compile-time for any user of the library when you increase the arity of > things. It's config switch. The library user sets BOOST_MPL_LIMIT_VECTOR_SIZE to whatever he needs and sets BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS. The silly thing is there's an undocumented limit which doesn't warn it just complains when it can't include map60. It would be easy to have map50, just use the limit instead of a hard coded 50. That would allow someone who needs just a it to do it. > Bumping up the default could have rather adverse effects on the compile > time of people who doesn't want to pay for it. No, the library is header only. If you leave the limits at 20 you'll include file10 and file20, but no more. I've currently got the hack in my code. It only works if you do it before including any of the standard headers and it's uggly because BOOST_MPL_LIMIT_MAP_SIZE is redefined 50->70. #define ULTIMATE_N 70 #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #include <boost/mpl/map.hpp> #include <boost/mpl/map/map50.hpp> #include <boost/preprocessor/iterate.hpp> namespace boost { namespace mpl { # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(51, ULTIMATE_N, <boost/mpl/map/aux_/numbered.hpp>)) # include BOOST_PP_ITERATE() }} #define BOOST_MPL_LIMIT_MAP_SIZE ULTIMATE_N // do this for each mpl::map, mpl::list, fusion::vector, fusion::map Chris

1 0

phoenix ostream<< result type wrong
by Hite, Christopher 09 Nov '11

09 Nov '11

I'm using Boost version 1.43, perhaps this has been fixed. std::stringstream ss; (boost::phoenix::arg_names::arg1<<1<<2<<3)(ss); BOOST_CHECK_EQUAL(ss.str(),"123"); // check ss.str() == "123" failed [1 != 123] I think what's going on is that the shift operator is returning the int and not the stream. This shouldn't compile, but does: int o=(boost::phoenix::arg_names::arg1<<1<<2<<3)(ss); My use case is a log library which does the actual streaming in non-critical space. Chris

1 0

[Move] unique_ptr
by Szymon Gatner 09 Nov '11

09 Nov '11

Hi, with now accepted Move library, is implementation of unique_ptr<> planned for boost? I used to use Howard Hinnant's implementation so far but got compilation problems as soon as I added Move library to my toolbox. Also, Hinnant's page says: "The following is a dated C++03 emulation of unique_ptr. You may find a better unique_ptr emulation at boost." Does he mean the one in Boost.Interprocess? Regards, Simon

3 10

[operators] operators: +,+= and commutativity
by Ovanes Markarian 09 Nov '11

09 Nov '11

Hello *, I was just considering the operators library to ease implementation effort of += and + operator overloads. Unfortunately, as I found out operator+ is implemented in the library for types with commutative property only. In the docs I see that there are implementations of operators for subtractable_left, dividable_left and modable_left, but not addable_left. In my simple case I would like to use the += operator for string based type to work with my type and string types. What was the design rationale to not provide the addable_left form? Many thanks, Ovanes

1 0

boost 1.43 bimap updating question
by Damian 09 Nov '11

09 Nov '11

Hello. I'm trying to update the data of a left bimap and I keep getting this error message: error: assignment of read-only data-member ‘boost::bimaps::relation::detail::normal_storage<boost::bimaps::tags::tagged<const int, boost::bimaps::relation::member_at::left>, boost::bimaps::tags::tagged<const double, boost::bimaps::relation::member_at::right> >::second’ Here is what I'm doing: int idx = 0; double score = 0.0; typedef boost::bimap<int, double> bm_type; // define the bimap type we will use bm_type bm; bm_type::right_iterator r_iter; bm_type::left_iterator l_iter; bm.insert( bm_type::value_type( 1, 93.9) ); bm.insert( bm_type::value_type( 2, 18.3) ); bm.insert( bm_type::value_type( 3, 4.54) ); bm.insert( bm_type::value_type( 4, 0.343) ); score = 60000.0343; idx = 3; l_iter = bm.left.find(idx); if(l_iter == bm.left.end()) { // this is a new entry so add it bm.insert( bm_type::value_type( idx, score) ); } else { // we have this idx value in the bimap // update the bimap score value only if the current value // of score is greater than what is currently in the bimap // for the same index (idx) value. if( l_iter->second < score ) { l_iter->second = score; } } Can someone tell me what I'm doing wrong? The double value in the map is the only part that needs to be updated and only if a new (higher) score is observed. Thanks, Damian -- ------------------------------------------------------------------------------ Damian Fermin, Ph.D. Pathology Department University of Michigan 4237 Medical Science I 1301 Catherine Ann Arbor, MI 48109-0602 734.615.0302 "There is No Gene for the Human Spirit" -- GATTACA ------------------------------------------------------------------------------

2 1

Limits in MPL and Fusion - bad doc, not checked, could be extended
by Hite, Christopher 09 Nov '11

09 Nov '11

/fs/tools/L3/boost_1_43_0/boost/mpl/list.hpp:36:69: fatal error: boost/mpl/list/list80.hpp: No such file or directory BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS doesn't seem to work if you read the documentation. The doc should say "we have a hard coded limit of 50". /fs/tools/L3/boost_1_43_0/boost/fusion/container/vector/detail/vector_n_chooser.hpp:45:1: error: 'vector80' does not name a type fusion is even worse. It could easily checks FUSION_MAX_VECTOR_SIZE in vector_n_chooser.hpp, but doesn't detect a value that's too big. 1) I think both test libraries should #error if you go over the limit. 2) Why don't we extend the limits? I may wind up doing this real quick to keep my code working (needs 71). Can I merge the changes into trunk when I'm done and after 1.48 is finished? Chris

2 1

pimpl idiom implementation?
by Chris Cleeland 08 Nov '11

08 Nov '11

In wanting to implement a few things using PIMPL I looked in boost for necessary structure. I found several things that use the idiom, but no formal unified implementation. I then stumbled across a Dr. Dobbs article, and the code at https://github.com/sean-/boost-pimpl Anybody know the status of that code and its potential for inclusion in boost? -- Chris Cleeland

3 3

[shared_ptr] Can the custom deleter be a simple function?
by Robert Jones 08 Nov '11

08 Nov '11

The shared_ptr docs suggest that a smart pointer employing a null deleter can be implemented using a functor. Why prefer a functor to a function? Thx, - Rob.

4 6

Re: [Boost-users] [locale] Quick questions
by Jookia 08 Nov '11

08 Nov '11

Ah, thanks. I'm kind of wary of using translate() as it doesn't implictly convert to const char*, so it kind of screws program options up: error: no match for call to ‘(boost::program_options::options_description_easy_init) (const char [7], boost::locale::basic_message<char>)’ Would there be a way to fix this?

1 0

Re: [Boost-users] [locale] Quick questions
by Jookia 08 Nov '11

08 Nov '11

I made some kind of limited test case: http://www.mediafire.com/?g5axcnch8q20ixo

2 1

[variant] a question about recursive typedef
by gongyiling 08 Nov '11

08 Nov '11

Hello, everyone: I want write a general linked list(any element in the list may be a node or nested general linked list, so recursive). I think general linked list could by defined as following(see spirit's tutorial mini_xml): glist = *glist_node glist_node = node | glist so here is the typedef according to the above rules: struct node { int data; }; typedef boost::variant<node, boost::recursive_wrapper<glist> > glist_node; //typedef 1 typedef std::list<glist_node> glist; //typedef 2 so the problem comes here, in the typedef 1, how can I forward declare glist? I know this is not a problem if I define glist as a struct or class, but I think the all-powerful library must has a beautiful solution, if any one has a solution, please let me know.

3 2

regex memory leaks
by jamich - Post 08 Nov '11

08 Nov '11

I have problem with memory leaks. I use boost version 1.47. I compiled boost libray by Visual Studio 2010 SP1. My testing code is here: #include "stdafx.h" #include <stdio.h> #include <boost/regex.hpp> void Memtest() { boost::regex e("^(\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}\\.\\d{1,3})(:\\d{1,5})?$"); if ( boost::regex_match("1.a.1.1", e) ) std::cout << "ok" << std::endl; if ( boost::regex_match("1.1.1.1", e) ) std::cout << "ok" << std::endl; } int main(int argc, _TCHAR* argv[]) { _CrtSetReportMode( _CRT_ERROR, _CRTDBG_MODE_DEBUG ); _CrtMemState state; _CrtMemCheckpoint(&state); Memtest(); _CrtMemState newState, diff; _CrtMemCheckpoint(&newState); if(_CrtMemDifference(&diff, &state, &newState)) { _CrtMemDumpStatistics(&diff); } return 0; } This code comes from simple console based project. Debugger gives me these output: 0 bytes in 0 Free Blocks. 5544 bytes in 16 Normal Blocks. 0 bytes in 0 CRT Blocks. 0 bytes in 0 Ignore Blocks. 0 bytes in 0 Client Blocks. Largest number used: 9333 bytes. Total allocations: 13620 bytes. Could anyone help me to resolve these memory leaks? Thanks, Michal

2 1

Re: [Boost-users] [locale] Quick questions.
by Jookia 08 Nov '11

08 Nov '11

>> Use std::locale::global(locale_you_need_to_install) That's what I've originally been doing (You can see the code at http://sprunge.us/ULEV ), but it doesn't work. Also, I'm new to mailing lists. How do I specifically reply to a post properly? Currently I'm just typing "Re: [Boost-users] [locale] Quick questions." in the subject bar.

2 2

[locale] Quick questions
by Jookia 07 Nov '11

07 Nov '11

Hey! I have some small questions about Boost.Locale. 1. Is it safe to assume that Boost.Locale API methods (like gettext) return UTF-8 strings, or are they locale dependent? 2. I use a custom domain, but when calling gettext("...") I still get lovely English text. However, calling gettext("...", std::locale()) fixes that. Is there some way to set the default domain/locale for gettext so I can simply write gettext("...")? 3. What's the deal with the whole locale/$LANG/LC_MESSAGES/$domain.mo folder structure? I know it has Unix heritage, but why is it explicity forced? It seems like a complex structure compared to locale/$LANG-$domain.mo.

3 3

multi-array and pdes
by petros 07 Nov '11

07 Nov '11

Hi, These can very well be very naive questions, since I am relatively new to this - apologies..: I am trying to write a pde solver for a 3D problem. Multi-array seems like a very natural choice for a data structure to store the functtion values. The method I am trying to use is operrator splitting. This amounts to solving a tridiagonal system for each dimension in sequence. Suppose then that I have a MA( M, N, L ): It is highly desirable to maintain this xyz (let's call it) "logical" system of reference since incorporation of boundary conditions and stencil calculations would be conceptually straightforward -otherwise very complicated. The idea being that, I would then have the tridiagonal opertator ( and rhs) in the "rotated" system and all other calculations in the "logical" one. Therefore, I need some fascility to rotate my MA, from the xyz to yzx etc (cyclically). Is there functionality ( as a view to the data ) that would allow me to do this off-the-shelve? Also, a couple of other points: -If I wanted to use views to subgrids, in parallelized calculations, are there memory allocations that happen under the hood for which I should worry (for performance)? -Is a one dimensional MA usable? -Are there adapters between 2D MAs and uBlas matrices? Thank you very much for your help in advance! P-

4 21

[atomic] review results
by Tim Blechmann 07 Nov '11

07 Nov '11

hi all, unfortunately only few reviews of boost.atomic arrived in time, however i count 3 YES and no NO, so i am happy to say: Helge Bahmann's boost.atomic library is ACCEPTED. since the library is an implementation of a c++11 feature for c++03, design, API and semantics are mostly fixed. many comments are going into details of the implementation, so i won't sum them all up ... iac, helge already said he wants to address the raised issues, the main points are summarized below. full implementation of the c++11 interface: the library currently only implements a subset of the c++11 library. it lacks the functional interface for integral atomic types and the ATOMIC_VAR_INIT / ATOMIC_FLAG_INIT macro. quickly consulting the latest draft that i currently have at hand the following two functions are missing as well: template <class T> T kill_dependency(T y); void atomic_signal_fence(memory_order); i encourage helge to provide a full implementation of the interface. documentation: the documentation is currently lacking a good API reference. i would therefore encourage helge to provide a doxygen-generated reference section. there were some concerns that it assumes that readers will have to be familiar with concurrency. maybe it is a good idea to point to some literature/tutorials about concurrent programming and/or to c++11 atomics. the section of real-world examples could probably include a link to shavit/herlihy's book `the art of multiprocessor programming'. it would also be helpful to have a detailed specification, if a platform/compiler combination supports a specific type natively (with run-time dispatching or specific compiler flags) ... maybe in form of a table. shared memory support/multi-module support: in multi-module applications and when using shared memory, the blocking emulation of atomics can cause troubles. for multi-module applications this can be resolved by placing the spinlock pool inside a shared library. shared- memory support could be realized by associating a (spin)lock with each blocking atomic<> instead of using a pool of spinlocks. boost should definitely provide atomics which support shared memory, either by default or by an additional implementation which is placed in the boost::interprocess namespace. i would like to thank helge for implementing boost.atomic and submitting it to boost and everyone who participated in the review. cheers, tim review manager

1 0

[Boost.PropertyTree] Is it possible to populate a tree with user defined parser?
by Gábor Márton 07 Nov '11

07 Nov '11

Hi, I would like to use PropertyTree as a higher level interface to access our project's config data. However, the config data can be accessed only through C API calls, so I cannot use the XML or INI parser. I suppose that PropertyTree has a polimorfic implementataion, which provides an interface for which a parser must conform, am I right? Thanks, Gabor

2 1

bcp doesn't work as expected
by Max Limper 06 Nov '11

06 Nov '11

Hi everyone, I'm trying to use boosts shared_ptr class, and only that one - I was happy to see that boosts provides such a cool tool as bcp. However, it seems that the installation that bcp performs is not complete in my case. When compiling my project, I first found out that "boost/config/user.hpp" was missing. So I copied that one manually and assumed that it was just a little bug since that one does just includes comments and might therefore have been ignored by bcp for some reason. But now, I still find that "boost/config/compiler/visualc.hpp" is missing and my project is unable to compile. According to the bcp description ( http://www.boost.org/doc/libs/1_37_0/tools/bcp/bcp.html) I was assuming that bcp should install all compiler configs that might be necessary for any random platform. Here's how I used bcp after I built it (Windows7, VC10): "{path-to-the-bcp-build-dir}/bsp.exe shared_ptr.hpp E:\SDK\boost_1_47_0_dependencies" , invoked from the root of the freshly downloaded boost directory E:\SDK\boost_1_47_0. Did I make a mistake, or is this a bug? Thanks a lot in advance! Regards, Max

2 4

[variant] is the which() function part of variant's public API?
by Nathan Ridge 06 Nov '11

06 Nov '11

which() is a public member function of variant, but I don't see any mention of it in the documentation. Can I assume this is part of the public API (i.e. it won't go away, won't change its behaviour in future releases) or not? (For example, I am writing a function to serialize a variant and thinking that one implementation might be to write the which() followed by the object). Thanks, Nate

2 2

boost::filesystem::path in UTF-8 on Windows
by John M. Dlugosz 05 Nov '11

05 Nov '11

If I have a string that is in UTF-8, how do I tell the path constructor? path p1 ("my utf8 data", SOME_CODECVT); I think it is a matter of passing the right SOME_CODECVT. What is it? The |path::value_type| is |wchar_t, according to the docs. —John |

3 7

Re: [Boost-users] [Gil] TIFF file with mixed 8/16 bit channel
by Corinna Kinchin 05 Nov '11

05 Nov '11

Christian, You're wonderful - thanks for getting back so promptly and helpfully. I'm just downloading the latest boost version (am using 1.42 at the moment which doesn't seem to have the cymk16161688_image_t you refer to) and will try out your suggestion. And this is almost certainly an RTFM question but how does one know which input image type to use? If you had a moment to point me in the right direction or to jot down an elegant code snippet to get me on the right track for reading different flavours of TIFF files I'd be eternally grateful ... Meanwhile I'll go RTFM ;) Thanks a million for taking the time to help. All the best, ... Corinna > > Corinna, this has to wait until tomorrow. Hope that's ok with you. > > But I can see from the source code that the input image should be > cymk16161688_image_t and not just cymk8_image_t.

2 1

crash using boost::interprocess
by nevergone . 05 Nov '11

05 Nov '11

Hello, I'm using boost::interprocess to share config information between processes on windows platform. It random crash on custom pc. I only have a minidump dump, here is the stack output by windbg: 001df6b0 65e49d45 001df758 00302c48 7721ee1e XXXXPlugin!boost::interprocess::detail::emulation_recursive_mutex::lock+0xc 001df6f8 65e49c42 06750038 65e7b8b4 06750028 XXXXPlugin!boost::interprocess::scoped_lock<boost::interprocess::interprocess_recursive_mutex>::lock+0x15 001df720 65e494c1 06750008 00000001 6c1274eb XXXXPlugin!boost::interprocess::segment_manager<wchar_t,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void>,0>,boost::interprocess::iset_index>:: priv_get_lock+0x42 001df76c 65e48239 65e7b8b4 001df798 001df794 XXXXPlugin!boost::interprocess::segment_manager<wchar_t,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void>,0>,boost::interprocess::iset_index>:: priv_generic_find<wchar_t>+0x31 001df7bc 65e70053 001df7dc 00000001 001df8c4 XXXXPlugin!boost::interprocess::segment_manager<wchar_t,boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offset_ptr<void>,0>,boost::interprocess::iset_index>:: priv_find_impl<ConfigFile::_CACHE_ITEM>+0xa9 001df800 65e720c8 01ff8670 65e7b8b4 001df8cc XXXXPlugin!ConfigFile::CConfigCache::Read+0xc3 001df82c 65e5bbf5 65e7b8b4 001df8cc 00000004 XXXXPlugin!ConfigFile::CCommonConfig::Read+0x28 001dfb00 65e5e42e 020739b8 001dfb24 65e5e69a XXXXPlugin!CXXXXXMng::bFindProcessInfo+0x55 001dfb0c 65e5e69a 0000001c 001dfba0 00000113 XXXXPlugin!CXXXXXMng::OnTimer+0x5e 001dfb24 756286ef 00020448 00000113 0000001c XXXXPlugin!CXXXXXMng::StaticWndProc+0x2a 001dfb50 75628876 65e5e670 00020448 00000113 user32!InternalCallWinProc+0x23 001dfbc8 756289b5 00000000 65e5e670 00020448 user32!UserCallWinProcCheckWow+0x14b 001dfc28 75628e9c 65e5e670 00000000 001dfc70 user32!DispatchMessageWorker+0x35e 001dfc38 0137cf27 001dfc50 013eb5a8 013eb2d8 user32!DispatchMessageW+0xf 001dfc70 0134b2f5 8b56d422 013eb2d8 013eb2d8 xxxxMain!CXXXX::MessageLoop+0x97 001dfec8 67add2a7 013f11a4 00000001 00000000 xxxxMain!CXXXXApp::InitInstance+0x335 001dfecc 013f11a4 00000001 00000000 013787d8 mfc80u!AfxWinMain+0x48 [f:\dd\vctools\vc7libs\ship\atlmfc\src\mfc\winmain.cpp @ 37] 001dff6c 75b41114 7ffda000 001dffb8 7721b495 xxxxMain!__native_startup_lock 001dff78 7721b495 7ffda000 773d0f2e 00000000 kernel32!BaseThreadInitThunk+0xe 001dffb8 7721b468 01378944 7ffda000 00000000 ntdll!__RtlUserThreadStart+0x70 001dffd0 00000000 01378944 7ffda000 00000000 ntdll!_RtlUserThreadStart+0x1b EXCEPTION_RECORD: ffffffff -- (.exr 0xffffffffffffffff) ExceptionAddress: 72341bac (XXXXPlugin!boost::interprocess::detail::emulation_recursive_mutex::lock+0x0000000c) ExceptionCode: c0000005 (Access violation) ExceptionFlags: 00000000 NumberParameters: 2 Parameter[0]: 00000000 Parameter[1]: 06400030 Attempt to read from address 06400030 FOLLOWUP_IP: XXXXPlugin!boost::interprocess::detail::emulation_recursive_mutex::lock+c 65e41bac 8b4608 mov eax,dword ptr [esi+8] the code is: PCACHE_ITEM CacheItem = m_SharedMemory.find<CACHE_ITEM>(lpszName).first; Can anyone help me? thx

3 4

Compiling Boost 1.47 with GCC 4.6.1 and --std=c++0x
by Travis Gockel 04 Nov '11

04 Nov '11

I'm building Boost 1.47.0 with GCC 4.6.1 and C++11 support enabled and get the following two errors building the Signals library: libs/signals/src/named_slot_map.cpp: In member function ‘void boost::signals::detail::named_slot_map::disconnect(const boost::signals::detail::stored_group&)’: libs/signals/src/named_slot_map.cpp:105:23: error: call of overloaded ‘erase(boost::signals::detail::named_slot_map::group_iterator&)’ is ambiguous libs/signals/src/named_slot_map.cpp:105:23: note: candidates are: /usr/local/include/c++/4.6.1/bits/stl_map.h:613:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::iterator std::map<_Key, _Tp, _Compare, _Alloc>::erase(std::map<_Key, _Tp, _Compare, _Alloc>::const_iterator) [with _Key = boost::signals::detail::stored_group, _Tp = std::list<boost::signals::detail::connection_slot_pair>, _Compare = boost::function2<bool, boost::signals::detail::stored_group, boost::signals::detail::stored_group>, _Alloc = std::allocator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >, std::map<_Key, _Tp, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >, std::map<_Key, _Tp, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >] /usr/local/include/c++/4.6.1/bits/stl_map.h:643:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::size_type std::map<_Key, _Tp, _Compare, _Alloc>::erase(const key_type&) [with _Key = boost::signals::detail::stored_group, _Tp = std::list<boost::signals::detail::connection_slot_pair>, _Compare = boost::function2<bool, boost::signals::detail::stored_group, boost::signals::detail::stored_group>, _Alloc = std::allocator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >, std::map<_Key, _Tp, _Compare, _Alloc>::size_type = long unsigned int, std::map<_Key, _Tp, _Compare, _Alloc>::key_type = boost::signals::detail::stored_group] libs/signals/src/named_slot_map.cpp: In member function ‘void boost::signals::detail::named_slot_map::remove_disconnected_slots()’: libs/signals/src/named_slot_map.cpp:128:35: error: call of overloaded ‘erase(std::_Rb_tree_iterator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >::_Self)’ is ambiguous libs/signals/src/named_slot_map.cpp:128:35: note: candidates are: /usr/local/include/c++/4.6.1/bits/stl_map.h:613:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::iterator std::map<_Key, _Tp, _Compare, _Alloc>::erase(std::map<_Key, _Tp, _Compare, _Alloc>::const_iterator) [with _Key = boost::signals::detail::stored_group, _Tp = std::list<boost::signals::detail::connection_slot_pair>, _Compare = boost::function2<bool, boost::signals::detail::stored_group, boost::signals::detail::stored_group>, _Alloc = std::allocator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >, std::map<_Key, _Tp, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >, std::map<_Key, _Tp, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >] /usr/local/include/c++/4.6.1/bits/stl_map.h:643:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::size_type std::map<_Key, _Tp, _Compare, _Alloc>::erase(const key_type&) [with _Key = boost::signals::detail::stored_group, _Tp = std::list<boost::signals::detail::connection_slot_pair>, _Compare = boost::function2<bool, boost::signals::detail::stored_group, boost::signals::detail::stored_group>, _Alloc = std::allocator<std::pair<const boost::signals::detail::stored_group, std::list<boost::signals::detail::connection_slot_pair> > >, std::map<_Key, _Tp, _Compare, _Alloc>::size_type = long unsigned int, std::map<_Key, _Tp, _Compare, _Alloc>::key_type = boost::signals::detail::stored_group] WHOA BUDDY! Anyway, if you look into this, it is because my STL implementation has changed to the new definition for map::erase which takes a const_iterator. As you can see, trying to erase with an iterator creates an ambiguous call between the const_iterator and key_type. I came up with two solutions: One was to explicitly cast to a const_iterator and the other was to mark stored_group::stored_group<T>(const T&) as explicit. Both work perfectly fine for me, but I like the explicit constructor solution better. I attached that change as a patch...feel free to use it if it doesn't break anything (which it probably does). -- Travis Gockel

1 0

[config] TI compiler warning "static local variables of extern inline function are not resolved to single copy"
by Krzysztof Czainski 04 Nov '11

04 Nov '11

Hello, I use some boost libraries with a TI compiler. One of it's defects is "static local variables of extern inline function are not resolved to single copy". It emits a warning about it. My typical workaround for this is making such a function non-inline. This may require to move such a function definition out of a header file, if it isn't a template function. When I need a non-template function to be defined inside a header file, and return an instance of a static variable, i can't just make that function static (or put it into an unnamed namespace), because there will no longer be a single instance of the returned variable.Therefore I came up with the following: instead of: inline int& get_single_int() { static int i = 0; return i; } I need: template < class > // not inline int& get_single_int_impl() { static int i = 0; return i; } inline int& get_single_int() { return get_single_int_impl<void>(); } I needed to make modifications in two places in boost to work around this defect. I'll be happy to share those modifications, but first I wanted to ask if anyone can think of a better/simpler workaround. What comes into my mind, that could make this workaround more general, is replacing the line "// not inline" with some macro BOOST_INLINE_STATIC_VAR defined conditionally to 'inline' or nothing. Thoughts? Regards, Kris

2 1

[graph] Implementing turn restrictions
by Stephen Woodbridge 04 Nov '11

04 Nov '11

Hi all, I need to solve Dijkstra shortest path with turn restrictions. I am wondering if anyone has an example of how to implement this? I'm thinking that this can be done something like this: 1. a restriction(s) could be represented as: at a given node X if my ancestry is some list of of nodes, then restrict going forward to a node or list of nodes. 2. any given node can optionally have a list of restrictions attached to it 3. a visitor function would then get the list of restrictions for the visited node and compare ancestor list of each restriction to the current path ancestry and then filter forward nodes if there is an ancestry match(s). Does this sound like a reasonable approach? Does anyone have an example of this or something similar? Any thoughts on how to efficiently implement matching the path to the restriction lists? Many thanks, -Steve

2 1

[filesystem] error compiling win win7/mingw
by Gustavo Villada 04 Nov '11

04 Nov '11

Hi Guys, I'm trying to compile boost.filesystem on a win7 with mingw. MinGW is installed by default. I've already compile bjam, b2 and successful boostrap.bat I got this error, suggestions? C:\boost_1_47_0>bjam toolset=gcc --with-filesystem stage Component configuration: - chrono : not building - date_time : not building - exception : not building - filesystem : building - graph : not building - graph_parallel : not building - iostreams : not building - math : not building - mpi : not building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : not building - wave : not building ...patience... ...found 525 targets... ...updating 8 targets... gcc.compile.c++ bin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi\v3\src\operations.o In file included from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1:0, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from libs\filesystem\v3\src\operations.cpp:117: c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1:23: error: #include nested too deeply libs\filesystem\v3\src\operations.cpp:655:26: warning: '<unnamed>::create_symbolic_link_api' defined but not used "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_STATIC_LINK=1 -I"." -c -o "bin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi\v3\src\operations.o" "libs\filesystem\v3\src\operations.cpp" ...failed gcc.compile.c++ bin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi\v3\src\operations.o... ...skipped <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi>libboost_filesystem-mgw45-mt-d-1_47.a(clean) for lack of <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi>v3\src\operations.o... ...skipped <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi>libboost_filesystem-mgw45-mt-d-1_47.a for lack of <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi>v3\src\operations.o... ...skipped <pstage\lib>libboost_filesystem-mgw45-mt-d-1_47.a for lack of <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\debug\link-static\threading-multi>libboost_filesystem-mgw45-mt-d-1_47.a... gcc.compile.c++ bin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi\v3\src\operations.o In file included from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1:0, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1, from libs\filesystem\v3\src\operations.cpp:117: c:\mingw\bin\../lib/gcc/mingw32/4.5.2/../../../../include/sys/utime.h:1:23: error: #include nested too deeply libs\filesystem\v3\src\operations.cpp:655:26: warning: '<unnamed>::create_symbolic_link_api' defined but not used "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DNDEBUG -I"." -c -o "bin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi\v3\src\operations.o" "libs\filesystem\v3\src\operations.cpp" ...failed gcc.compile.c++ bin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi\v3\src\operations.o... ...skipped <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi>libboost_filesystem-mgw45-mt-1_47.a(clean) for lack of <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi>v3\src\operations.o... ...skipped <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi>libboost_filesystem-mgw45-mt-1_47.a for lack of <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi>v3\src\operations.o... ...skipped <pstage\lib>libboost_filesystem-mgw45-mt-1_47.a for lack of <pbin.v2\libs\filesystem\build\gcc-mingw-4.5.2\release\link-static\threading-multi>libboost_filesystem-mgw45-mt-1_47.a... ...failed updating 2 targets... ...skipped 6 targets... C:\boost_1_47_0>

1 0

Serialize abstract base class
by Fabian Weiss 04 Nov '11

04 Nov '11

I try to serialize objects wich are derived of an abstract base class. class Modul() { Modul(); int a; virtual void function() = 0; private: friend class boost::serialization::access; template <typename Archive> void serialize(Archive &ar, const unsigned int version) { ar & boost::serialization::make_nvp("a", a); }; }; BOOST_SERIALIZATION_ASSUME_ABSTRACT(Modul) BOOST_CLASS_TRACKING(Modul, track_never) class ExampleModul : public Modul { ExampleModul(){}; int b; void function(); private: friend class boost::serialization::access; template <typename Archive> void serialize(Archive &ar, const unsigned int version) { ar & boost::serialization::make_nvp("Modul", boost::serialization::base_object<Modul>(*this)); ar & boost::serialization::make_nvp("b", b); } }; For serializing the classes I use a boost::archive::xml_oarchive and register the classes: boost::archive::xml_oarchive archfile; archfile.register_type<Modul>(); archfile.register_type<ExampleModul>(); I can compile serializing and run the code - works. But when it comes to deserializing I get a compile error: ..instantiated from here /usr/include/boost/serialization/access.hpp:132:9: error: cannot allocate an object of abstract type 'Modul' note: because the following virtual functions are pure within 'Modul': virtual void Modul::function() If I do not register <Modul> in the deserializing code, then it compiles but I get runtime error of course: terminate called after throwing an instance of 'boost::archive::archive_exception' I found this example but I dont understand what they are doing and where the classes are registered: http://www.boost.org/doc/libs/1_47_0/libs/serialization/example/demo.cpp How can I serialize my abstract base class?

2 3

[type_traits] an is_iterator, not is_pointer, trait
by Belcourt, K. Noel 03 Nov '11

03 Nov '11

Hi, I'm looking to use a trait in enable_if that can distinguish between a raw pointer and any other valid iterator type, essentially the difference between iterator traits and the raw pointer specialization. template <class Iterator> struct iterator_traits; template <class T> struct iterator_traits<T*>; I was hoping to find a boost::is_iterator type trait which would return false_type for is_iterator<int*> (any raw pointer) and true type for any other valid iterator. This would allow me to group iterators via is_pointer and is_iterator. I was just wondering if this already exists somewhere? Thanks. -- Noel Belcourt

2 3

Re: [Boost-users] [Gil] TIFF file with mixed 8/16 bit channel depths
by Christian Henning 03 Nov '11

03 Nov '11

Corinna, this has to wait until tomorrow. Hope that's ok with you. But I can see from the source code that the input image should be cymk16161688_image_t and not just cymk8_image_t. Christian

1 0

[Boost.Endian] Review Results
by joel falcou 03 Nov '11

03 Nov '11

Hi everyone, after some delay, here is the result of the review of Beman Dawes' Boost.Endian library. First, I want to thanks all participants of the review that lead to very deep and interesting discussions on the matter. 5 votes were cast : 2 unconditionally in favor, 3 conditionally in favor after changes made and there is a mini-review. The verdict is that Boost.Endian is **CONDITIONNALY ACCEPTED** Here is what needs to be done to get the library ready for a mini-review: * Common use case scenarios should be developed. * Example programs should be developed for the common use case scenarios. * Documentation should illuminate the differences between endian integer/float type and endian conversion approaches to the common use case scenarios, and provide guidelines for choosing the most appropriate approach in user's applications. * Conversion functions supplying results via return should be provided. * Platform specific performance enhancements such as use of compiler intrinsics or relaxed alignment requirements should be supported. * Endian integer (and floating) types should be implemented via the conversion functions. If that can't be done efficiently, consideration should be given to expanding the conversion function signatures to resolve the inefficiencies. * Benchmarks that measure performance should be provided. It should be possible to compare platform specific performance enhancements against portable base implementations, and to compare endian integer approaches against endian conversion approaches for the common use case scenarios. * Float (32-bits) and double (64-bits) should be supported. IEEE 754 is the primary use case. * Support for user defined types (UDTs) is desirable, and should be provided where there would be no conflict with the other concerns. * There is some concern that endian integer/float arithmetic operations might used inadvertently or inappropriately. The impact of adding an endian_buffer class without arithmetic operations should be investigated. * Stream insertion and extraction of the endian integer/float types should be documented and included in the test coverage. * Binary I/O support that was investigated during development of the Endian library should be put up for mini-review for inclusion in the Boost I/O library. From this point, I will let Beman prepare Endian for the mini-review and I already volunteer to manage the mini-review so informations are not scattered around. Regards

1 0

[fusion] Adapted struct I/O
by Mateusz Łoskot 03 Nov '11

03 Nov '11

Hi, I'm still taking early steps with Boost.Fusion. I'm trying to adapt a bunch of struct and template struct for easy I/O operations. I don't understand one thing from the docs. Here we go; 1) Given the example [1] of template struct adoption: namespace demo { template<typename Name, typename Age> struct employee { Name name; Age age; }; } // Any instantiated demo::employee is now a Fusion sequence BOOST_FUSION_ADAPT_TPL_STRUCT( (Name)(Age), (demo::employee) (Name)(Age), (Name, name) (Age, age)) [1] http://www.boost.org/doc/libs/1_47_0/libs/fusion/doc/html/fusion/adapted/ad… 2) The included comment says "demo::employee is now a Fusion sequence". 3) Jumping to I/O and out docs, reading that [2] "The I/O operators: << and >> work generically on all Fusion sequences. " [2] http://www.boost.org/doc/libs/1_47_0/libs/fusion/doc/html/fusion/sequence/o… 4) Means, I should be able to stream Fusion-adopted demo::employee #include <iostream> #include <string> #include <boost/fusion/adapted/struct/adapt_struct.hpp> #include <boost/fusion/include/adapt_struct.hpp> #include <boost/fusion/sequence/io.hpp> #include <boost/fusion/include/io.hpp> // code from above example goes here int main() { demo::employee<std::string, int> e; std::cout << e << std::endl; } 5) Given what I have learned above, I expect the cout << e to work: $ g++ -I/home/mloskot/dev/boost/_svn/trunk boost_fusion.cpp boost_fusion.cpp: In function ‘int main()’: boost_fusion.cpp:28:18: error: no match for ‘operator<<’ in ‘std::cout << e’ ... I assume complete error is not necessary as my question is of general nature. Is my expectation valid? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org Member of ACCU, http://accu.org

3 5

[Gil] TIFF file with mixed 8/16 bit channel depths
by Corinna Kinchin 03 Nov '11

03 Nov '11

Hello, I'm using boost::gil::read_image(in, img, tiff_tag()); as part of a process to extract raw image data from a TIFF file, and it works beautifully for cmyka TIFF files containing either 5 x 8-bit channels, or 5 x 16-bit channels. But it seems using this technique mangles image data contained in a (photoshop generated) TIFF file which contains CMYK channels with both 8 and 16 bit depths (mixed). Here is an extract from the ImageMagick 'identify -verbose' output on such a file: Depth: 8/16-bit Channel depth: cyan: 16-bit magenta: 16-bit yellow: 16-bit black: 8-bit alpha: 8-bit It seems that read_image treats the TIFF file as if it contains 5 x 8-bit channels (the TIFFTAG_BITSPERSAMPLE property and hence the _bits_per_sample info value for the TIFF file is set to 8), so the CMY channel image data isn't read in correctly ... at least that's my best guess. Does anyone out there know whether boost::gil can be made to support 8/16bit TIFF files - eg if there's an extension (or hack ;) which could do the trick? Or any other options (eg other libraries) which could be worth investigation? Many thanks for reading this far, and if you have any remotely relevent ideas it would be great to hear them ... All the best, Corinna ... Corinna Kinchin email: ckinchin(a)datazone.com Datazone Ltd. Tel: +353 64 66 28964 Palm Gate, Greenane, Fax: +353 64 66 28965 Killarney, Co. Kerry, Ireland URL: http://www.miramo.com Datazone - makers of `Miramo', the automated publishing tool

2 1

MSVC++ 2010 and BOOST_STATIC_ASSERT
by Sunil Thomas 03 Nov '11

03 Nov '11

Hi all! I've noticed that MSVC++ 2010 has implemented static_assert (compile time checks); and probably as a result, the code that used to build fine in MSVC++ 2008 is now generating the following error. code: BOOST_STATIC_ASSERT(N==1) *error C2338: (N==1)* ** Appreciate if anyone who has resolved this error can share their experiences.. Thanks, --Thomas. **

3 7

Boost.Pool: Writing a base class for per-class pool allocation
by Freddie Witherden 03 Nov '11

03 Nov '11

Hi all, I am currently trying to write a base class which overloads new and delete so that they allocate from a boost pool: template<typename T> class pool_object { public: static void* operator new(size_t) { return pool_.malloc(); } static void operator delete(void *p) { pool_.free(p); } private: static boost::pool<> pool_; }; template<typename T> boost::pool<> pool_object<T>::pool_(sizeof(T)); The idea is that one can write: class foo : public pool_object<foo> { ... }; The problem with this is that boost::pool is not thread-safe. The thread-safe variant is a singleton pool. However, this is parametrized by a size: boost::singleton_pool<sizeof(T)> -- which is a problem as T is incomplete. Are there any solutions other than sticking my own mutex into the class? Regards, Freddie.

1 0

[RapidXML] Cannot open XML files unless in main
by Alec Taylor 03 Nov '11

03 Nov '11

Good afternoon, Unfortunately only my 10 lines [main only]: http://ideone.com/WOmcphowever works, whilst my 20 lines [OO with functions] doesn't: http://ideone.com/R7mir How can I get this to work? I am aware that boost property tree wraps RapidXML... so maybe you can help me out here? Thanks for all suggestions, Alec Taylor

1 1

boost.mpi serialization... error?
by Jacques C. Richard 02 Nov '11

02 Nov '11

I am trying boost::mpi on a big code & getting the following error message from mac mpiC++ (same from an intel super-computer). Can anyone pick out something quickly from that to help please or do you need to see more? I'd like to figure out what I did to not do it! :) Thanks! Jacques Process=1's mpe_decomp1d MiniGridSize= 3 3 3 Pause @ "main: 879: Domain decomposition" if 1 process: <Enter> or <Return> continues; ^C aborts: init_internal_neighbors_wf: Process 1 of 2 exchanging (if necessary) w/+/-1! Sender=1, Receiver=0 [jacques-richards-mac-mini:00474] *** Process received signal *** [jacques-richards-mac-mini:00474] Signal: Segmentation fault (11) [jacques-richards-mac-mini:00474] Signal code: Address not mapped (1) [jacques-richards-mac-mini:00474] Failing at address: 0x200000001 [jacques-richards-mac-mini:00474] [ 0] 2 libSystem.B.dylib 0x00007fff86fa51ba _sigtramp + 26 [jacques-richards-mac-mini:00474] [ 1] 3 ??? 0x0000000000000000 0x0 + 0 [jacques-richards-mac-mini:00474] [ 2] 4 Mg 0x000000010010ff0e _ZN5boost3mpi6detail24ignore_skeleton_oarchiveINS1_16content_oarchiveEE13save_overrideIP12lattice_typeEEvRKT_i + 40 [jacques-richards-mac-mini:00474] [ 3] 5 Mg 0x000000010010ff3a _ZN5boost7archive6detail18interface_oarchiveINS_3mpi6detail16content_oarchiveEElsIKP12lattice_typeEERS5_RT_ + 42 [jacques-richards-mac-mini:00474] [ 4] 6 Mg 0x000000010010ff6e _ZNK5boost13serialization3nvpIKP12lattice_typeE4saveINS_3mpi6detail16content_oarchiveEEEvRT_j + 40 [jacques-richards-mac-mini:00474] [ 5] 7 Mg 0x000000010010ff93 _ZN5boost13serialization6access1 ... .. .

2 4

Re: [Boost-users] [BGL] How to provide a vertex_index property for my graph
by gongyiling 02 Nov '11

02 Nov '11

"ShNaYkHs ShNaYkHs" 写入消息 news:CA+GAXM2Kt7KjUamMuXUeo2_SL-GTWg0k2UjerJTNQi7sizUipQ@mail.gmail.com... > Hello, > Since my graph use setS as a VertexList, I have to either provide a > vertex_index property map for my graph to be able to use some functions > requiring a vertex_index (e.g. write_graphviz). My graph is defined as: > typedef adjacency_list<setS, setS, undirectedS, NodeData, EdgeData> Graph; > Where NodeData and EdgeData are structures. Can you please give me a very > simple example of how to provide a vertex_index property map for my graph > ? > I mean, since an adjacency_list that uses listS or setS as the vertex > container does not automatically provide this vertex_id property, how can > I > add it to the code bellow ? > I tried to use an associative_property_map to include index for vertices, > but it doesn't work (errors): > #include <boost/graph/iteration_macros. > hpp> > #include <boost/graph/adjacency_list.hpp> > using namespace std; > using namespace boost; > struct NodeData > { > int label; > float influance; > /* etc ... */ > }; > struct EdgeData > { > int age; > /* etc ... */ > }; > typedef map<vecS, size_t> IndexMap; > IndexMap mapIndex; > associative_property_map<IndexMap> propmapIndex(mapIndex); > typedef adjacency_list<setS, setS, undirectedS, NodeData, EdgeData> Graph; > typedef Graph::vertex_descriptor NodeID; > typedef Graph::edge_descriptor EdgeID; > int main() > { > Graph g; > NodeID n0 = add_vertex(g); g[n0].label = -1; > NodeID n1 = add_vertex(g); g[n1].label = -1; > EdgeID edge; bool ok; > tie(edge, ok) = boost::add_edge(n0, n1, g); > if (ok) g[edge].age = 10; > int i=0; > BGL_FORALL_VERTICES(v, g, Graph) > { > put(propmapIndex, v, i++); > } > return 0; > } > Thanks for answer. -------------------------------------------------------------------------------- you can using vertex bundle property as you vertex index, here is the code I modified according to above: #include <boost/graph/iteration_macros.hpp> #include <boost/graph/adjacency_list.hpp> using namespace std; using namespace boost; struct NodeData { int label; float influance; int index; //add by gyl /* etc ... */ }; struct EdgeData { int age; /* etc ... */ }; typedef adjacency_list<setS, setS, undirectedS, NodeData, EdgeData> Graph; typedef Graph::vertex_descriptor NodeID; typedef Graph::edge_descriptor EdgeID; int main() { Graph g; NodeID n0 = add_vertex(g); g[n0].label = -1; g[n0].index = 0; //add by gyl, init index 0. NodeID n1 = add_vertex(g); g[n1].label = -1; g[n1].index = 1; //add by gyl, init index 1. EdgeID edge; bool ok; tie(edge, ok) = boost::add_edge(n0, n1, g); if (ok) g[edge].age = 10; int i=0; BGL_FORALL_VERTICES(v, g, Graph) { put(boost::get(&NodeData::index, g)/*by gyl get bundle property map*/, v, i++); } return 0; } at last, I think you should post this to boost.user maillist instead here. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 1

[regex] why partial match / early break ?
by U.Mutlu 01 Nov '11

01 Nov '11

Hi, why is this regex const string sRe = "((([a-zA-Z]|([a-zA-Z][a-zA-Z0-9\\-]))+[a-zA-Z0-9])\\.)+" "((([a-zA-Z]|([a-zA-Z][a-zA-Z0-9\\-]))+[a-zA-Z0-9]))"; not matching this string wholly? "a1a.a2a.a3a.a4aaaa" It rather matches only this part: "a1a.a2a.a3a.a4" What's the problem here? (I know I can append a delimiter to solve the problem, but I think the regex should've match it wholly, shouldn't it?)

4 6

transfer_at_least_t
by Carla Strembicke 01 Nov '11

01 Nov '11

Hi, I have an object of transfer_at_least_t. I would like to find out what the minimum value is due to the fact that my app that set it is requiring so many bytes of unencrypted data, and the transfer is including the encryption. Is there any interface that can get this value or do I have to store it before I create the object transfer_at_least_t? Carla Strembicke Software Developer [cid:image015772.JPG@7ddd0ff8.4ca8ab2e] SUBNET Solutions Inc. www.SUBNET.com<http://www.SUBNET.com/> Making Substations More Intelligent T: 403.270.8885 F: 403.270.9631 #100, 4639 Manhattan Road SE, Calgary, Alberta, Canada; T2G 4B3 CONFIDENTIAL INFORMATION NOTICE: The information contained in this e-mail is privileged, confidential and intended solely for the use of the addressee named above. If the reader of this e-mail is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this e-mail is strictly prohibited. If you received this in error, please contact the sender and destroy all copies of this e-mail. Thank you.

2 1

using a boost::shared_mutex in a share_ptr
by Sean Farrow 01 Nov '11

01 Nov '11

Hi: I have the following variable declared in a class: Boost::shared_ptr<boost;:shared_mutex> If I have a standard boost::shared_mutex, I can pass this to a shared or unique lock. How do I pass a boost::shared_ptr<boost::shared_mutex> to a lock? This is probably really simple, but I carn't fathum it out! Cheers Sean.

2 1

serialization of a ptr
by Jonathan Bishop 01 Nov '11

01 Nov '11

How do I prevent boost::serialize from treating a pointer as an object and serializing the object. I have written the specialization of save/load for the object pointer. I get the following errors when I attempt to compile the program below... boost/serialization/access.hpp: In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_oarchive, T = X]': boost/serialization/serialization.hpp:81: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_oarchive, T = X]' boost/serialization/serialization.hpp:140: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::binary_oarchive, T = X]' boost/archive/detail/oserializer.hpp:151: instantiated from 'void boost::archive::detail::oserializer<Archive, T>::save_object_data(boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::archive::binary_oarchive, T = X]' s3.cpp:53: instantiated from here boost/serialization/access.hpp:109: error: 'class X' has no member named 'serialize' ============================================================================================== #include <fstream> #include <sstream> #include <cstddef> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include "boost/serialization/split_free.hpp" using namespace std; class X { X(const X& other); X& operator=(const X& other); public : static X* get(int id); X() : id(0) {} int id; }; // Non-intrusive serialization (pretend I am not able to modify class X) // I was hoping serialization would use this specialization // archive X by id template<class Archive> void save(Archive& ar, X*& x, unsigned int version) { int id = x->id; ar & id; } // load X by lookup template<class Archive, class T> void load(Archive& ar, X*& x, unsigned int version) { int id; ar & id; x = X::get(id); } template<class Archive, class T> inline void serialize(Archive& ar, X*& t, const unsigned int version) { split_free(ar, t, version); } int main() { X x; std::ofstream ofs("junk"); boost::archive::binary_oarchive oa(ofs); oa & x; ofs.close(); return 0; }

3 3

[test] boost.test bug report email address?
by legalize+jeeves＠mail.xmission.com 01 Nov '11

01 Nov '11

[Please do not mail me a copy of your followup] The docs say I can report a bug to the email address <boost-test =at= emailaccount =dot= com> but this is undeliverable for 7 days. -- "The Direct3D Graphics Pipeline" -- DirectX 9 version available for download <http://legalizeadulthood.wordpress.com/the-direct3d-graphics-pipeline/> Legalize Adulthood! <http://legalizeadulthood.wordpress.com>

2 1

Common parameter on command line and in a config file with sections
by Gruhn, Dan 01 Nov '11

01 Nov '11

Greetings, I would like to have a parameter "expire-days" that has a default and can be set via the command line --expire-days|-e <days> and a config file [foo] expire-days = <days> It would be most elegant to be able to specify things like this (notice the automatic storage to the expireDays variable): namespace bpo = boost::program_options; int expireDays = 30; bpo::options_description desc("Allowed options"); desc.add_options() ("expire-days,e", bpo::value<int>(&expireDays)->default_value(expireDays), "Number of days before files expire") ; bpo::options_description configFileDesc; configFileDesc.add_options() ("foo.expire-days", bpo::value<int>(&expireDays), "") ; bpo::variables_map varMap; try { // Attempt to parse the configuration file. std::ifstream cfg("/tmp/all.cfg"); if (cfg.is_open()) { std::cout << "Opened /tmp/all.cfg" << std::endl; static const bool allowUnregistered = true; bpo::store(bpo::parse_config_file(cfg , configFileDesc, allowUnregistered), varMap); } // Parse the command line bpo::store(bpo::parse_command_line(argc, argv, desc), varMap); bpo::notify(varMap); } std::cout << "Expire days: " << expireDays << std::endl; My code may be strange but I am trying to find the right order and combination of adding options, parsing, storing, and notifying that gives the command line priority over the config file which in turn has priority over the 30 day default. Oddly enough, it doesn't seem to make much difference which order I use, the config file seems to have precedence This is not what I expected so perhaps I'm doing something wrong but I can't find it. I know that I can accomplish this via extra code on my part, but I'm trying to come up with a general scheme that would work for multiple programs with multiple variables using a common config file and the simpler the better. The documentation mentions using sections in config files but doesn't give much detail. Can anyone help me here or at least describe for me which of add_options, parse_*, store, and notify does the following: 1) Sets the default value 2) Marks that a value has been set from the command line/config file. 3) Actually does the store to the given variable. 4) What does notify do? I've tried (and continue to try) looking through the code but am having problems find the right place examine. I'll take pointers in that area as well. This does not seem like an exotic use case. Has anyone else accomplished this or something like it? As always, any help of any kind will be greatly appreciated. Dan

3 2

How to build the bjam tool on Windows?
by Congmin min 31 Oct '11

31 Oct '11

Hello. I just downloaded the boost library. I want to build bjam tool on my Windows machine. I need to get boost work for my eclipse IDE. But why I can't find the jam directory under boost/tools? How can I do that? Thanks.

3 2