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

[boost build] Where/How is python found?
by Gottlob Frege 30 Oct '12

30 Oct '12

I'm trying to determine how boost build finds the python install. I see in boost\tools\build\v2\tools\python-config.jam that it looks in the Windows Registry (for NT at least). But this only checks for Python 2.4, 2.3, 2.2. It also seems to look for python.exe in the PATH. But I can't seem to find the code that does that. Any ideas? In particular, I would like to change it to actually check for an include directory once it finds python.exe. On my system, it finds a 'rogue' python.exe that is not part of the full python install (thus no include folder). Tony

2 2

[Boost.Test] Always leaving test code active in Release mode
by Ruediger Berlich 30 Oct '12

30 Oct '12

Hi there, we use Boost.Test to do Unit tests for the Geneva library, covering parametric optimization. Code for tests is included directly in most classes, so tests can be written "on-site", whenever a new feature is added. However, in Release mode, usually test-functions are *not* included (masked by an "#ifdef GEMTESTING" block), but can be switched on by the user prior to compilation. When this happens, it means that classes being tested have a different interface than classes without the GEMTESTING-define set. Users are meant to derive their own classes from the Geneva's core classes and overload certain functions. They are also provided with a test infrastructure, that allows them to test their own code without too much trouble for compliance with the libraries rules (as just one example, it is being tested whether their code can be serialiazed using Boost.Serialization and whether de-serialized classes are identical to the one being serialized). However, when users compile our (Open Source) library with the GEMTESTING-define set and then compile their own code without this flag, they will include headers with a different interface than the one being used to compile the library. This has led to some very hard to detect failures. We are looking for ways to circumvent this source of errors and so far see three options: a) We can give compiled libraries a different name when the test-code is included (e.g. libgeneva-testing.so or the likes) b) There could be sanity checks in the code, e.g. with a static function returning different values depending on whether test code is activated or not c) We can always compile the test code, even in Release mode, by removing the "#ifdef GEMTESTING", this leaving no ambiguities regarding the API Option a) will effectively double compilation times, as we will always have to compile both library variants. It would also force us to make many changes in the CMake-based build system. Option b) leaves a source for frustration for our users, as they will only discover the problem when compiling and/or running their code. Option c) is the easiest to implement, but leaves open some questions (see below) *** My question now is, what the trade-offs of option c) are (i.e., leaving all test code in and always linking with the Boost.Test libraries). Do we loose anything ? Will this affect our ability to debug the code ? Are there runtime-penalties ? Note that none of the test-functions is called during normal execution. *** Of course any views on a good strategy for the above scenario are also appreciated. In any case thanks and best regards, Ruediger

1 0

Typedef rejected when disambiguating a call to boost::assign
by mark pashley 30 Oct '12

30 Oct '12

I am trying to initialise a std::map of std::set using boost::assign, as follows: typedef std::set< uint32_t > the_set_t; typedef std::map< uint32_t, the_set_t > the_map_t; the_map_t data = boost::assign::map_list_of< uint32_t, the_set_t > > // bad line ( 1, boost::assign::list_of(10)(20)(30) ) Unfortunately this is rejected by GCC 4.4.6, and results in a large amount of errors, (attached below). The problem is caused by the use of the typedef the_set_t. If the typedef is replaced with std::set<uint32_t> the code compiles and works correctly. the_map_t data = boost::assign::map_list_of< uint32_t, std::set< uint32_t > > The error produced is as follows: map-assign.cpp:19: error: conversion from ‘bool’ to non-scalar type ‘the_map_t’ requested In file included from /opt/boost_1_51_0/boost/assign/list_of.hpp:397, from map-assign.cpp:7: /opt/boost_1_51_0/boost/preprocessor/iteration/detail/local.hpp: In member function ‘boost::assign_detail::generic_list<T>& boost::assign_detail::generic_list<T>::operator() (const U&, const U0&) [with U = int, U0 = boost::assign_detail::generic_list<int>, T = int]’: map-assign.cpp:17: instantiated from here /opt/boost_1_51_0/boost/preprocessor/iteration/detail/local.hpp:37: error: functional cast expression list treated as compound expression In file included from /opt/boost_1_51_0/boost/iterator/iterator_categories.hpp:15, from /opt/boost_1_51_0/boost/iterator/detail/facade_iterator_category.hpp:7, from /opt/boost_1_51_0/boost/iterator/iterator_facade.hpp:14, from /opt/boost_1_51_0/boost/range/iterator_range_core.hpp:23, from /opt/boost_1_51_0/boost/range/iterator_range.hpp:13, from /opt/boost_1_51_0/boost/assign/list_of.hpp:20, from map-assign.cpp:7: /opt/boost_1_51_0/boost/mpl/eval_if.hpp: At global scope: /opt/boost_1_51_0/boost/mpl/eval_if.hpp: In instantiation of ‘boost::mpl::eval_if_c<false, boost::range_const_iterator< boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)>, boost::range_mutable_iterator< boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)> >’: /opt/boost_1_51_0/boost/range/iterator.hpp:63: instantiated from ‘boost::range_iterator< boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)>’ /opt/boost_1_51_0/boost/range/iterator_range_core.hpp:72: instantiated from ‘bool boost::iterator_range_detail::less_than(const Left&, const Right&) [with Left = boost::assign_detail::converter< boost::assign_detail::generic_list<int>, std::_Deque_iterator<int, int&, int*> >, Right = boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)]’ /opt/boost_1_51_0/boost/assign/list_of.hpp:274: instantiated from ‘bool boost::assign_detail::operator<(const boost::assign_detail::converter<T, I>&, const Range&) [with T = boost::assign_detail::generic_list<int>, I = std::_Deque_iterator<int, int&, int*>, Range = boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)]’ /opt/boost_1_51_0/boost/assign/list_of.hpp:292: instantiated from ‘bool boost::assign_detail::operator>(const Range&, const boost::assign_detail::converter<T, I>&) [with T = boost::assign_detail::generic_list<int>, I = std::_Deque_iterator<int, int&, int*>, Range = boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)]’ map-assign.cpp:19: instantiated from here /opt/boost_1_51_0/boost/mpl/eval_if.hpp:60: error: no type named ‘type’ in ‘struct boost::range_mutable_iterator< boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)>’ In file included from /opt/boost_1_51_0/boost/range/iterator_range.hpp:13, from /opt/boost_1_51_0/boost/assign/list_of.hpp:20, from map-assign.cpp:7: /opt/boost_1_51_0/boost/range/iterator_range_core.hpp: In function ‘bool boost::iterator_range_detail::less_than(const Left&, const Right&) [with Left = boost::assign_detail::converter<boost::assign_detail::generic_list<int>, std::_Deque_iterator<int, int&, int*> >, Right = boost::assign_detail::generic_list<std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)]’: /opt/boost_1_51_0/boost/assign/list_of.hpp:274: instantiated from ‘bool boost::assign_detail::operator<(const boost::assign_detail::converter<T, I>&, const Range&) [with T = boost::assign_detail::generic_list<int>, I = std::_Deque_iterator<int, int&, int*>, Range = boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)]’ /opt/boost_1_51_0/boost/assign/list_of.hpp:292: instantiated from ‘bool boost::assign_detail::operator>(const Range&, const boost::assign_detail::converter<T, I>&) [with T = boost::assign_detail::generic_list<int>, I = std::_Deque_iterator<int, int&, int*>, Range = boost::assign_detail::generic_list<std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&)]’ map-assign.cpp:19: instantiated from here /opt/boost_1_51_0/boost/range/iterator_range_core.hpp:72: error: no matching function for call to ‘begin(boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (&) (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&))’ /opt/boost_1_51_0/boost/range/iterator_range_core.hpp:72: error: no matching function for call to ‘end(boost::assign_detail::generic_list< std::pair<unsigned int, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> > > > (&) (const unsigned int&, const std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >&))’ In file included from map-assign.cpp:7: /opt/boost_1_51_0/boost/assign/list_of.hpp: In member function ‘Container boost::assign_detail::converter<DerivedTAssign, Iterator>::convert( const Container*, boost::assign_detail::default_type_tag) const [with Container = int, DerivedTAssign = boost::assign_detail::generic_list<int>, Iterator = std::_Deque_iterator<int, int&, int*>]’: /opt/boost_1_51_0/boost/assign/list_of.hpp:142: instantiated from ‘Container boost::assign_detail::converter<DerivedTAssign, Iterator>::convert_to_container() const [with Container = int, DerivedTAssign = boost::assign_detail::generic_list<int>, Iterator = std::_Deque_iterator<int, int&, int*>]’ /opt/boost_1_51_0/boost/assign/list_of.hpp:436: instantiated from ‘boost::assign_detail::generic_list<T>::operator Container() const [with Container = int, T = int]’ /opt/boost_1_51_0/boost/preprocessor/iteration/detail/local.hpp:37: instantiated from ‘boost::assign_detail::generic_list<T>& boost::assign_detail::generic_list<T>::operator()(const U&, const U0&) [with U = int, U1 = boost::assign_detail::generic_list<int>, T = int]’ map-assign.cpp:17: instantiated from here /opt/boost_1_51_0/boost/assign/list_of.hpp:163: error: functional cast expression list treated as compound expression /opt/boost_1_51_0/boost/assign/list_of.hpp:163: error: invalid cast from type ‘std::_Deque_iterator<int, int&, int*>’ to type ‘int’ What is wrong with using a typedef or is this a known limitation of `boost::assign`? -- View this message in context: http://boost.2283326.n4.nabble.com/Typedef-rejected-when-disambiguating-a-c… Sent from the Boost - Users mailing list archive at Nabble.com.

2 5

shared_ptr on aix
by Vojtech Fried 30 Oct '12

30 Oct '12

Hi, What is the status of boost/smart_ptr/detail/sp_counted_base_aix.hpp? It is not #included by default in sp_counted_base_aix.hpp. Is it safe to use or is it just an exprerimental version? We have a multiplatform application and I am trying to make some improvements for it on AIX platform. One candidate right now is to utilize sp_counted_base_aix.hpp (boost/smart_ptr/detail/sp_counted_base_aix.hpp). It implements atomic counter without (pthread) mutexes. Using it improves performance of our app up to 10%. But sp_counted_base_aix.hpp is not used by default. I had to add an #ifed to sp_counted_base.hpp to make it work. I tested the implementation with a small sample program that copied and removed shared_ptrs in multiple threads and it works. But I am still concerned. How widely is this AIX specific implementation used? How risky is it for us to use it? Best regards Vojtech

1 0

Boost.Test ordering
by John M. Dlugosz 30 Oct '12

30 Oct '12

If I make unit tests in different source files, I need to declare a BOOST_AUTO_TEST_SUITE in each one, right? At link time, these appear in some undetermined order. How can I cause them to be run in the desired order instead? —John

1 0

boost::container::vector fails to compile with C++03 compiler
by mark pashley 30 Oct '12

30 Oct '12

The following example compiles fine when using GCC 4.4.6 with the --std=c++0x flag but fails to compile in C++03 mode. #include <stdint.h> #include <boost/container/vector.hpp> struct data { int i_; boost::container::vector<data> v_; }; int main( int argc, char** argv ) { data myData; myData.i_ = 10; data myData2; myData2.i_ = 30; myData.v_.push_back( myData2 ); return 0; } It compiles successfully with g++ --std=c++0x test-cont.cpp However if I remove the --std=c++0x I get the following errors: g++ test-cont.cpp In file included from include/c++/4.4.6/memory:49, boost/container/container_fwd.hpp:36, boost/container/vector.hpp:20, from test-cont.cpp:2: include/c++/4.4.6/bits/stl_algobase.h: In static member function static _OI std::__copy_move<false, false, std::random_access_iterator_tag>:: __copy_m(_II, _II, _OI) [with _II = boost::container::constant_iterator<data, long int>, _OI = data*]: include/c++/4.4.6/bits/stl_algobase.h:397: instantiated from _OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false, _II = boost::container::constant_iterator<data, long int>, _OI = data*] include/c++/4.4.6/bits/stl_algobase.h:436: instantiated from _OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false, _II = boost::container::constant_iterator<data, long int>, _OI = data*] include/c++/4.4.6/bits/stl_algobase.h:468: instantiated from _OI std::copy(_II, _II, _OI) [with _II = boost::container::constant_iterator<data, long int>, _OI = data*] boost/move/move.hpp:1147: instantiated from boost::copy_or_move(I, I, F, typename boost::move_detail::disable_if< boost::move_detail::is_move_iterator, void>::type*) [with I = boost::container::constant_iterator<data, long int>, F = data*] boost/container/detail/advanced_insert_int.hpp:58: instantiated from void boost::container::container_detail::advanced_insert_aux_proxy<A, FwdIt, Iterator>::copy_remaining_to(Iterator) [with A = std::allocator<data>, FwdIt = boost::container::constant_iterator<data, long int>, Iterator = data*] test-cont.cpp:21: instantiated from here include/c++/4.4.6/bits/stl_algobase.h:343: error: no match for operator= in * __result = __first.boost::container::constant_iterator<T, Difference>::operator* [with T = data, Difference = long int]() test-cont.cpp:5: note: candidates are: data& data::operator=(data&) It looks like boost::container::vector requires move semantics which I assumed would automatically use boost::move when compiled with a c++03 compiler. If I manually modify the struct data to define: a default constructor a copy constructor an assignment operator an emulated move constructor using BOOST_RV_REF an emulated move assignment operator using BOOST_RV_REF The example compiles. Having to manually add these move/copy constructors and assignment operators for C++03 is laborious. Is this a bug with boost::container? -- View this message in context: http://boost.2283326.n4.nabble.com/boost-container-vector-fails-to-compile-… Sent from the Boost - Users mailing list archive at Nabble.com.

4 5

Visual Studio Debugger "renderer" support for Boost.Container ?
by John M. Dlugosz 29 Oct '12

29 Oct '12

MS Visual Studio's Debugger comes pre-loaded with "renderers" (I forget what S.T.L. actually called them) for the containers and smart pointers supplied with the compiler. Looking at a Boost Container in the debugger is not nearly so nice. Has anyone looked into adding renderers for them?

3 2

Multiplying a matrix and vector ===> vector
by Vipin Varma 29 Oct '12

29 Oct '12

Dear all, My basic requirement is to multiply a matrix and a vector and then to store it into a vector using Boost's UBLAS. When I multiply a boost::numeric::ublas::compressed_matrix with a boost::numeric::ublas::vector using prod(matrix, vector), the output is a boost::numeric::ublas::matrix_vector_binary1. E.g. <PSEUDOCODE> boost::numeric::ublas::compressed_matrix m; boost::numeric::ublas::vector x; boost::numeric::ublas::matrix_vector_binary1<compressed_matrix, vector, ? > tmp; tmp = prod(m,x); <PSEUDOCODE> The problem is that in the third field --- which expects the operation type --- in line 3, I do not know what to enter or how to specify the type of operation; I tried '*' and 'prod' and 'vector' and 'compressed_matrix' but none work. Alternatively, I can avoid the tmp variable altogether and get a working program to copy the result of matrix-vector multiplication onto a new vector y but then I would need two multiplications. E.g. <CODE> std::copy(prod(m,x).begin(), prod(m,x).end(), y.begin()); <CODE> Any suggestions on how to declare a matrix_vector_binary1 correctly or how to get the finaly result efficiently onto a vector will be appreciated. Regards, Vipin

3 8

build process of boost code & lib creation
by danianton＠libero.it 29 Oct '12

29 Oct '12

Hi, I’am using boost in my application. I need an explanation about build process and library creation. I’d know if there is an alternative to bjam, could I use a make file made by me? It’s difficult to implement a build process? The .lib files generated by b2 process are created from the source file contained in the archive file? Thanks. Best regards, Daniele.

1 0

[Thread] Win32 TLS problem with dynamic libraries
by Сергей Захарченко 29 Oct '12

29 Oct '12

Hello, I need to build a shared plugin library with Boost libraries linked statically into it. As many may know, there's a problem with having a .tls section in Win32 dynamic libraries which are to be loaded via LoadLibrary, but Boost.Thread insists on having one. Assuming that I can guarantee that no Boost.Thread functions are called from non-Boost.Thread threads, it shouldn't be needed. Apart from patching the Boost.Thread sources, or the resulting binaries, what's the best way of eliminating it? I assume that I need to eliminate tss_pe.cpp from linkage, but I don't seem to be able to. Adding a namespace boost { void tss_cleanup_implemented() {} } to one of the library's sources doesn't help, as it results in a multiply defined symbol error (compiler MSVC2008 from Express edition). Any suggestions? Thank you, -- Sergey Zakharchenko

3 2

Boost installation inquiry
by mega deth 29 Oct '12

29 Oct '12

Hello Boost User Community, I am a big fan of boost C++ having used it for a college class to do threading. I want to get back into it and I previously installed boost on a windows machine, now dealing with a Linux machine would like some help as I have run into difficulties with the installation process. First off, I would like to build threads and regex libraries. I have gotten the first example show below to work correctly: #include <boost/lambda/lambda.hpp> #include <iostream> #include <iterator> #include <algorithm> int main() { using namespace boost::lambda; typedef std::istream_iterator<int> in; std::for_each( in(std::cin), in(), std::cout << (_1 * 3) << " " ); } My main issue is the next part. I have Boost is located in /usr/local/boost_1_51_0 I have run the following steps: 1. Go to the directory tools/build/v2/. 2. Run bootstrap.sh 3. Run b2 install --prefix=PREFIX where PREFIX is the directory where you want Boost.Build to be installed 4. Add PREFIX/bin to your PATH environment variable. For the 3rd step, I ran b2 as follows: b2 --build-dir=~/bin/Boos tC++1.51/ toolset=gcc stage My PATH looks like this: > echo $PATH /usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/root/bin :/root/bin/BoostC++1.51/bin/ g++ I- /root/boost/ /root/bin/repos/c-projects/c++/C++Projects/Boost/testLinkToBoostLib.cpp -o example \ > ~/boost/stage/lib/libboost_ libboost_chrono.a libboost_regex.a libboost_chrono.so libboost_regex.so libboost_chrono.so.1.51.0 libboost_regex.so.1.51.0 libboost_filesystem.a libboost_system.a libboost_filesystem.so libboost_system.so libboost_filesystem.so.1.51.0 libboost_system.so.1.51.0 libboost_program_options.a libboost_thread.a libboost_program_options.so libboost_thread.so libboost_program_options.so.1.51.0 libboost_thread.so.1.51.0 Finally this is my issue: When I try to compile the test regex code with boost, I am unable to find the correct library to include. I fear that because I have this issue, that my thread library is not built as well. Is there a way to check? Can you provide what worked for you to install boost on your linux machine. c++ -I path/to/boost_1_51_0 example.cpp -o example \ ~/boost/stage/lib/libboost_regex-gcc34-mt-d-1_36.a I am unable to find or even create this: libboost_regex-gcc34-mt-d-1_36.a If you have any advise or direction please let me know. Thank you! There was some talk about checking the configuration of the user-config.jam if there are linker or compile issues. But I do not think those could be the issues at the moment. Thank you in advance for looking at my issue! ~Jake

2 1

Boost random not looking so random
by Robin Rowe 28 Oct '12

28 Oct '12

I'm using boost to shuffle an array, but it's not looking as random as I would expect. Am I not using it right? The code below outputs sequences that look random mostly, but I see patterns such as 7 7 12 12 11. boost::random::mt19937 rng; boost::minstd_rand lcggen; lcggen.seed(clockTime); rng.seed(lcggen); unsigned min=1; unsigned max=15; for(unsigned i=0;i<5;i++) { boost::random::uniform_int_distribution<> dist(min,max); const int j = dist(rng); ... code that shuffles stuff using j ... min++; cout<<j<<' '; } Suggestions? Thanks! Robin -- www.cinepaint.org

3 3

cygwin build error on boost filesystem
by Kraus Philipp 27 Oct '12

27 Oct '12

Hello, I try to build the Boost 1.51 on the latest Cygwin version: I'm using this commands: export BZIP2_BINARY=bz2 export ZLIB_BINARY=z export ZLIB_INCLUDE=/cygdrive/c/Users/Administrator/Documents/zlib/1.2.7/include export ZLIB_LIBPATH=/cygdrive/c/Users/Administrator/Documents/zlib/1.2.7/lib export BZIP2_INCLUDE=/cygdrive/c/Users/Administrator/Documents/bzip2/1.0.6/include export BZIP2_LIBPATH=/cygdrive/c/Users/Administrator/Documents/bzip2/1.0.6/lib cd library/boost_1_51_0 ./bootstrap.sh ./b2 --with-exception --with-filesystem --with-math --with-random --with-regex --with-date_time --with-thread --with-system --with-program_options --with-serialization --with-iostreams --layout=system link=shared runtime-link=shared threading=multi variant=release install --prefix=../boost/1.51.0 ./boost/filesystem/path_traits.hpp: At global scope: ./boost/filesystem/path_traits.hpp:224: error: `std::wstring' has not been declared ./boost/filesystem/path_traits.hpp:228: error: ISO C++ forbids declaration of `to' with no type In file included from ./boost/filesystem/operations.hpp:25, from libs\filesystem\src\unique_path.cpp:20: ./boost/filesystem/path.hpp:378: error: ISO C++ forbids declaration of `wstring' with no type ./boost/filesystem/path.hpp:378: error: invalid use of `::' ./boost/filesystem/path.hpp:378: error: expected `;' before '&' token ./boost/filesystem/path.hpp:379: error: expected `;' before "const" ./boost/filesystem/path.hpp:379: error: ISO C++ forbids declaration of `wstring' with no type ./boost/filesystem/path.hpp:379: error: invalid use of `::' ./boost/filesystem/path.hpp:379: error: expected `;' before '&' token ./boost/filesystem/path.hpp:400: error: expected `;' before "template" ./boost/filesystem/path.hpp:409: error: ISO C++ forbids declaration of `wstring' with no type ./boost/filesystem/path.hpp:409: error: invalid use of `::' ./boost/filesystem/path.hpp:409: error: expected `;' before "generic_wstring" ... The Boost filesystem is not build on the command the full build process is stop with the error Is this an error on my installation and how can I solve the problem? Thanks a lot Phil

1 0

use boost preprocessor to generate T1 t1, T2 t2 ...
by weiqingh 27 Oct '12

27 Oct '12

hi there, I would like to use boost preprocessor to generate something like this: (for n from 0 to N with n = 2 in the following example) template <typename T1, typename T2> void foo(T1 t1, T2 t2) I have tried to use BOOST_PP_ENUM_PARAMS but cannot figure out how to get both T_i and t_i changed each time. is there some other macros I can use? any help is highly appreciated. Thanks, -- View this message in context: http://boost.2283326.n4.nabble.com/use-boost-preprocessor-to-generate-T1-t1… Sent from the Boost - Users mailing list archive at Nabble.com.

5 5

Re: [Boost-users] [boost] Fwd: Re: [system] symbol visibility and GCC vs. Clang
by Michel Morin 26 Oct '12

26 Oct '12

Fixed in r81068. Since dllexport/dllimport are not fully supported on clang (see http://llvm.org/bugs/show_bug.cgi?id=11170 ), I didn't add the macros (BOOST_SYMBOL_EXPORT/BOOST_SYMBOL_IMPORT) for the Windows platform. Regards, Michel

1 0

[unique_ptr] How should I assign unique_ptr returned from a factory function, possibly using boost::move, in C++03
by Adam Romanek 26 Oct '12

26 Oct '12

Hi, the question is: how should I assign boost::interprocess::unique_ptr returned from a factory function, possibly using boost::move, in C++03? Here's an example: --- #include <boost/interprocess/smart_ptr/unique_ptr.hpp> using namespace boost::interprocess; class my_class { public: my_class() {} }; struct my_class_deleter { void operator()(my_class *p) {} }; typedef unique_ptr<my_class, my_class_deleter> uptr; uptr create() { return uptr(); } int main() { uptr x; x = create(); // return 0; } --- The problem is that gcc fails to compile the above code saying: main.cpp:22: error: ambiguous overload for ‘operator=’ in ‘x = create()()’ ../../boost_latest/boost/interprocess/smart_ptr/unique_ptr.hpp:211: note: candidates are: boost::interprocess::unique_ptr<T, D>& boost::interprocess::unique_ptr<T, D>::operator=(boost::rv<boost::interprocess::unique_ptr<T, D> >&) [with T = my_class, D = my_class_deleter] ../../boost_latest/boost/interprocess/smart_ptr/unique_ptr.hpp:249: note: boost::interprocess::unique_ptr<T, D>& boost::interprocess::unique_ptr<T, D>::operator=(int boost::interprocess::unique_ptr<T, D>::nat::*) [with T = my_class, D = my_class_deleter] I use gcc v4.4.3 and Boost v1.51.0. BTW: I posted the same question on StackOverflow: http://stackoverflow.com/questions/13086428/how-should-i-assign-boostinterp…

1 0

Re: [Boost-users] boost wave memory leak
by Hartmut Kaiser 26 Oct '12

26 Oct '12

> I apologize if this is not standard procedure (not quite sure what > that is) but I was wondering if you've been able to reproduce the issue > using the information from my last email. Sorry, I have not had any time to look into this issue. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu > > Rob Conde > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Hartmut Kaiser > Sent: Monday, October 22, 2012 8:00 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] boost wave memory leak > > > I'm getting a report of a memory leak when using boost wave. I see a > > similar problem at: > > > > https://svn.boost.org/trac/boost/ticket/4346 > > > > but supposedly that is fixed for a while. > > > > The call stack is: > > How did you get that call stack? What do I need to do to reproduce this > problem? > > Regards Hartmut > --------------- > http://boost-spirit.com > http://stellar.cct.lsu.edu > > > > > > MyDll.dll!operator new(unsigned int count, const std::nothrow_t & > > __formal) > > Line 18 + 0x9 bytes C++ > > > > MyDll.dll!operator new[](unsigned int count, const std::nothrow_t & x) > > Line > > 15 + 0xd bytes C++ > > > > MyDll.dll!boost::default_user_allocator_new_delete::malloc(const > unsigned > > int bytes) Line 97 + 0xe bytes C++ > > > > MyDll.dll!boost::pool<boost::default_user_allocator_new_delete>::mallo > > c_ne > > ed > > _resize() Line 693 + 0x9 bytes C++ > > > > > MyDll.dll!boost::pool<boost::default_user_allocator_new_delete>::malloc() > > Line 432 C++ > > > > MyDll.dll!boost::singleton_pool<boost::fast_pool_allocator_tag,12,boos > > t::d > > ef > > ault_user_allocator_new_delete,boost::mutex,32,0>::malloc() Line 137 > > + 0xb > > bytes C++ > > > > > MyDll.dll!boost::fast_pool_allocator<std::_List_nod<boost::wave::cpplexer: > > :l > > ex_token<boost::wave::util::file_position<boost::wave::util::flex_stri > > ng<c > > ha > > r,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowSt > > ring > > > oost::wave::util::AllocatorStringStorage<char,std::allocator<char> > > >,char *> > > > > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::w > > >av > > >e::u > > til::file_position<boost::wave::util::flex_string<char,std::char_trait > > s<ch > > ar > > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util: > > >:A > > >lloc > > atorStringStorage<char,std::allocator<char> >,char *> > > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > > >::_Node,boost::default_user_allocator_new_delete,boost::mutex,32,0>:: > > >al > > >loca > > te(const unsigned int n) Line 419 + 0xb bytes C++ > > > > MyDll.dll!std::list<boost::wave::cpplexer::lex_token<boost::wave::util > > ::fi > > le > > > _position<boost::wave::util::flex_string<char,std::char_traits<char>,std:: > > al > > locator<char>,boost::wave::util::CowString<boost::wave::util::Allocato > > rStr > > in > > gStorage<char,std::allocator<char> >,char *> > > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::w > > >av > > >e::u > > til::file_position<boost::wave::util::flex_string<char,std::char_trait > > s<ch > > ar > > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util: > > >:A > > >lloc > > atorStringStorage<char,std::allocator<char> >,char *> > > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > > >>::_Buynode() > > Line 1172 + 0x7 bytes C++ > > > > MyDll.dll!std::list<boost::wave::cpplexer::lex_token<boost::wave::util > > ::fi > > le > > > _position<boost::wave::util::flex_string<char,std::char_traits<char>,std:: > > al > > locator<char>,boost::wave::util::CowString<boost::wave::util::Allocato > > rStr > > in > > gStorage<char,std::allocator<char> >,char *> > > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::w > > >av > > >e::u > > til::file_position<boost::wave::util::flex_string<char,std::char_trait > > s<ch > > ar > > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util: > > >:A > > >lloc > > atorStringStorage<char,std::allocator<char> >,char *> > > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > > >::list<boost::wave::cpplexer::lex_token<boost::wave::util::file_posit > > >io > > >n<bo > > ost::wave::util::flex_string<char,std::char_traits<char>,std::allocato > > r<ch > > ar > > >,boost::wave::util::CowString<boost::wave::util::AllocatorStringStora > > >ge > > ><cha > > r,std::allocator<char> >,char *> > > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::w > > >av > > >e::u > > til::file_position<boost::wave::util::flex_string<char,std::char_trait > > s<ch > > ar > > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util: > > >:A > > >lloc > > atorStringStorage<char,std::allocator<char> >,char *> > > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> >() Line > > >436 > > + 0x68 bytes C++ > > > > MyDll.dll!`dynamic initializer for > > > 'boost::wave::util::impl::gen_unput_queue_iterator<boost::wave::cpplexer:: > > le > > x_iterator<boost::wave::cpplexer::lex_token<boost::wave::util::file_po > > siti > > on > > <boost::wave::util::flex_string<char,std::char_traits<char>,std::alloc > > ator > > <c > > har>,boost::wave::util::CowString<boost::wave::util::AllocatorStringSt > > har>or > > har>age< > > char,std::allocator<char> >,char *> > > > > > >,boost::wave::cpplexer::lex_token<boost::wave::util::file_position<bo > > >os > > >t::w > > ave::util::flex_string<char,std::char_traits<char>,std::allocator<char > > >,bo > > os > > t::wave::util::CowString<boost::wave::util::AllocatorStringStorage<cha > > r,st > > d: > > :allocator<char> >,char *> > > > > >,std::list<boost::wave::cpplexer::lex_token<boost::wave::util::file_p > > >os > > >itio > > n<boost::wave::util::flex_string<char,std::char_traits<char>,std::allo > > cato > > r< > > char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringS > > char>to > > char>rage > > <char,std::allocator<char> >,char *> > > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::w > > >av > > >e::u > > til::file_position<boost::wave::util::flex_string<char,std::char_trait > > s<ch > > ar > > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util: > > >:A > > >lloc > > atorStringStorage<char,std::allocator<char> >,char *> > > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > > > >>::last''() > > Line 155 + 0x28 bytes C++ > > > > msvcr90d.dll!__initterm() + 0x1c bytes > > > > > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > ______________________________________________________________________ > This email has been scanned by the Symantec Email Security.cloud service. > For more information please visit http://www.symanteccloud.com > ______________________________________________________________________ > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: [Boost-users] boost wave memory leak
by Hartmut Kaiser 26 Oct '12

26 Oct '12

> I'm getting a report of a memory leak when using boost wave. I see a > similar problem at: > > https://svn.boost.org/trac/boost/ticket/4346 > > but supposedly that is fixed for a while. > > The call stack is: How did you get that call stack? What do I need to do to reproduce this problem? Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu > > MyDll.dll!operator new(unsigned int count, const std::nothrow_t & > __formal) > Line 18 + 0x9 bytes C++ > > MyDll.dll!operator new[](unsigned int count, const std::nothrow_t & x) > Line > 15 + 0xd bytes C++ > > MyDll.dll!boost::default_user_allocator_new_delete::malloc(const unsigned > int bytes) Line 97 + 0xe bytes C++ > > MyDll.dll!boost::pool<boost::default_user_allocator_new_delete>::malloc_ne > ed > _resize() Line 693 + 0x9 bytes C++ > > MyDll.dll!boost::pool<boost::default_user_allocator_new_delete>::malloc() > Line 432 C++ > > MyDll.dll!boost::singleton_pool<boost::fast_pool_allocator_tag,12,boost::d > ef > ault_user_allocator_new_delete,boost::mutex,32,0>::malloc() Line 137 + > 0xb > bytes C++ > > MyDll.dll!boost::fast_pool_allocator<std::_List_nod<boost::wave::cpplexer: > :l > ex_token<boost::wave::util::file_position<boost::wave::util::flex_string<c > ha > r,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString > oost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char > *> > > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::wav > >e::u > til::file_position<boost::wave::util::flex_string<char,std::char_traits<ch > ar > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::A > >lloc > atorStringStorage<char,std::allocator<char> >,char *> > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > >::_Node,boost::default_user_allocator_new_delete,boost::mutex,32,0>::al > >loca > te(const unsigned int n) Line 419 + 0xb bytes C++ > > MyDll.dll!std::list<boost::wave::cpplexer::lex_token<boost::wave::util::fi > le > _position<boost::wave::util::flex_string<char,std::char_traits<char>,std:: > al > locator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStr > in > gStorage<char,std::allocator<char> >,char *> > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::wav > >e::u > til::file_position<boost::wave::util::flex_string<char,std::char_traits<ch > ar > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::A > >lloc > atorStringStorage<char,std::allocator<char> >,char *> > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > >>::_Buynode() > Line 1172 + 0x7 bytes C++ > > MyDll.dll!std::list<boost::wave::cpplexer::lex_token<boost::wave::util::fi > le > _position<boost::wave::util::flex_string<char,std::char_traits<char>,std:: > al > locator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStr > in > gStorage<char,std::allocator<char> >,char *> > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::wav > >e::u > til::file_position<boost::wave::util::flex_string<char,std::char_traits<ch > ar > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::A > >lloc > atorStringStorage<char,std::allocator<char> >,char *> > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > >::list<boost::wave::cpplexer::lex_token<boost::wave::util::file_positio > >n<bo > ost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<ch > ar > >,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage > ><cha > r,std::allocator<char> >,char *> > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::wav > >e::u > til::file_position<boost::wave::util::flex_string<char,std::char_traits<ch > ar > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::A > >lloc > atorStringStorage<char,std::allocator<char> >,char *> > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> >() Line > >436 > + 0x68 bytes C++ > > MyDll.dll!`dynamic initializer for > 'boost::wave::util::impl::gen_unput_queue_iterator<boost::wave::cpplexer:: > le > x_iterator<boost::wave::cpplexer::lex_token<boost::wave::util::file_positi > on > <boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator > <c > har>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStor > har>age< > char,std::allocator<char> >,char *> > > > > >,boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boos > >t::w > ave::util::flex_string<char,std::char_traits<char>,std::allocator<char>,bo > os > t::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char,st > d: > :allocator<char> >,char *> > > > >,std::list<boost::wave::cpplexer::lex_token<boost::wave::util::file_pos > >itio > n<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocato > r< > char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringSto > char>rage > <char,std::allocator<char> >,char *> > > > >,boost::fast_pool_allocator<boost::wave::cpplexer::lex_token<boost::wav > >e::u > til::file_position<boost::wave::util::flex_string<char,std::char_traits<ch > ar > >,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::A > >lloc > atorStringStorage<char,std::allocator<char> >,char *> > > > >,boost::default_user_allocator_new_delete,boost::mutex,32,0> > > >>::last''() > Line 155 + 0x28 bytes C++ > > msvcr90d.dll!__initterm() + 0x1c bytes > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 2

How can I make the libboost_regex.a static library?
by Scott Johnson 26 Oct '12

26 Oct '12

Transitioning an application from CentOS 5 to CentOS 6 and I noticed that neither the boost-devel nor boost-static rpms contain the libboost_regex.a static library. The boost-static rpm has most of the static libs but not that one. The CentOS 5 boost-devel package had the static library. I know dynamic libraries are encouraged but I still need the static lib. I grabbed the boost src rpm. I guess I need to build a custom version of the static rpm, but not sure yet which Makefile or where to make a change to get the libboost_regex.a. Thanks for any help.

2 1

[units] Missing quantity operator++, operator%
by Nathan Crookston 25 Oct '12

25 Oct '12

All, I'm in the process of switching my homegrown units system over to boost units. Some operators which I'm missing are the modulus and the pre and post increment operators. Looking through the archives I note an original review[1] which mentioned the absence of those operators. One response claimed that quantity<si::length, int> t = 5. ...; t++; was nonsensical as writing 5 m + 1, and the reviewer eventually agreed, citing possible confusion if the quantity type converted the initializer. Matthias Schabel seemed to respond favorably: 'I debated this for a while - the only problem is that there will be some value types with heterogeneous operator+ / operator- for which q + 1 is not the same type as q, but I guess that it is just OK for it to just give a compile error in those cases.' And Steven Watanabe said 'Will do.' I haven't found anything regarding the modulus operator. My question is, would a patch adding those operators be accepted? Thanks, Nate [1] http://lists.boost.org/Archives/boost/2007/03/119001.php

3 4

Errors when linking a CXX executable to boost static libraries, using gcc4.7 and boost 1.51.0
by camille chambon 25 Oct '12

25 Oct '12

Hello, I'm trying to link a CXX executable to boost static libraries. My environment is: - Fedora 17 64bit - gcc 4.7 - boost 1.51.0 built with gcc 4.7 I then get the following errors : `.text._ZN5boost16exception_detail19error_info_injectorINS_16bad_lexical_castEED2Ev' referenced in section `.text._ZN5boost16exception_detail19error_info_injectorINS_16bad_lexical_castEED1Ev[_ZN5boost16exception_detail19error_info_injectorINS_16bad_lexical_castEED1Ev]' of /home/cchambon/libs/lib/libpgma.a(Timeline.cpp.o): defined in discarded section `.text._ZN5boost16exception_detail19error_info_injectorINS_16bad_lexical_castEED2Ev[_ZN5boost16exception_detail19error_info_injectorINS_16bad_lexical_castEED5Ev]' of /home/cchambon/libs/lib/libpgma.a(Timeline.cpp.o) `.text._ZN5boost16exception_detail19error_info_injectorINS_12bad_any_castEED2Ev' referenced in section `.text._ZN5boost16exception_detail19error_info_injectorINS_12bad_any_castEED1Ev[_ZN5boost16exception_detail19error_info_injectorINS_12bad_any_castEED1Ev]' of /home/cchambon/libs/lib/libpgma.a(DistributionFactory.cpp.o): defined in discarded section `.text._ZN5boost16exception_detail19error_info_injectorINS_12bad_any_castEED2Ev[_ZN5boost16exception_detail19error_info_injectorINS_12bad_any_castEED5Ev]' of /home/cchambon/libs/lib/libpgma.a(DistributionFactory.cpp.o) error: collect2: ld returned 1 exit status Does anyone know what these errors mean? Cheers, Camille

1 0

Re: [Boost-users] Occasional blocking with tcp::socket::receive
by Stuart Siegel 25 Oct '12

25 Oct '12

I have read the documentation :-) My understanding is that it's blocking if there's no data left to be read and you ask it to read from the socket. In my case, the server has sent the data and it's there waiting for it to read. I've confirmed this via wireshark and, as I mentioned, the plain POSIX call to read (which is also blocking by the way) works as expected. ________________________________ From: nullable.type <nullable.type(a)gmail.com> To: boostusers(a)googlegroups.com Cc: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org>; boost-users(a)lists.boost.org; ssiegel95(a)yahoo.com Sent: Thursday, October 25, 2012 3:34 AM Subject: Re: [Boost-users] Occasional blocking with tcp::socket::receive Hi Read the documentation: http://www.boost.org/doc/libs/1_51_0/doc/html/boost_asio/reference/basic_st… A call to boost::asio::ip::tcp::socket::receive(..) IS a blocking call. If you wannt to avoid blocking, just use the async_* functions. Cheers, Simon On Friday, October 19, 2012 3:50:11 PM UTC+2, Stuart Siegel wrote: The call to receive below will occasionally hang. All interactions are synchronous and single threaded. Things work perfectly if I use the alternative <sys/socket.h> (POSIX) implementation under the #else. Since I'm pretty new to boost::asio, I must be doing something wrong but after many hours of trying different things, I'm still stuck. Any advice would be appreciated. #if 1 namespace bas = boost::asio; remaining = X //(something typically about 5000 bytes of char data) bas::streambuf b; bas::streambuf::mutable_ buffers_type bufs = b.prepare(1024); while (remaining > 0) { size_t n = sock.receive(bufs); //<-------------this blocks every so often remaining -= n; for ( bas::buffers_iterator<bas:: streambuf::mutable_buffers_ type, char> it = bas::buffers_begin(bufs); it < (bas::buffers_begin(bufs) + n); it++ ) qba.append(*it); } #else //this works perfectly in the 250000 or so test calls I've hit it with char buf[1024]; while (remaining > 0) { n = read( sock, buf, min( sizeof(buf), remaining ) ); remaining -= n; for (int i = 0 ; i < n; i++ ) qba.append(buf); } #endif >

1 0

Are shared_mutex's recursive?
by John M. Dlugosz 25 Oct '12

25 Oct '12

Clearly recursive acquiring of a shared (reading) lock is natural. But what about an exclusive lock? Can the owning thread acquire the write lock recursively, or even read locks recursively?

2 1

Memory usage of adjacency_list
by Ed Linde 24 Oct '12

24 Oct '12

Hi, Is it possible to get a ballpark figure of the maximum memory required for an adjacency_list, given its settings? I need these statistics to report how much memory is being used initially when reading in a large graph and then after vertex removal operations and edge removal operations, how much reduction is got in this memory finally. Do I have to write something of my own to do this? Thanks, Ed -- View this message in context: http://boost.2283326.n4.nabble.com/Memory-usage-of-adjacency-list-tp4637051… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

Is it possible to put a std::unique_ptr into a mulit_index container?
by Josh Quigley 24 Oct '12

24 Oct '12

Hi all, Is it possible to put a std::unique_ptr into a mulit_index container? In particular, the following fails. typedef std::pair<int, std::unique_ptr<int> > ValueT; typedef boost::multi_index_container< ValueT, boost::multi_index::indexed_by< boost::multi_index::hashed_unique< BOOST_MULTI_INDEX_MEMBER(ValueT, int, first) > > > HashMap; HashMap map; auto a = std::make_pair(5, std::unique_ptr<int>(new int(5))); map.insert(std::move(b)); // This line fails to compile (Visual Studio 2012) I'm guessing the answer is 'No' and it's because the rvalue reference overloads have not been done, but I'd like confirmation (or even better, to be told I'm wrong!). Thanks, Josh.

2 1

[spirit] Parsing quoted string
by Giampiero Gabbiani 24 Oct '12

24 Oct '12

Hi together, I have to parse the following row: "a_token": true|false, the last comma is optional. Testing the following: bool value; test_parser(" \"orig_bool\": true,", qi::lit('"') >> *(ascii::alnum | qi::char_('_')) >> qi::lit('"') >> qi::lit(':') >> boost::spirit::qi::bool_[phx::ref(value)=_1] >> -(qi::lit(','))); it works, but with the following instead the program compile but hangs ... bool value; test_parser(" \"orig_bool\": true,", qi::lit('"') >> *(!qi::lit('"')) >> qi::lit('"') >> qi::lit(':') >> boost::spirit::qi::bool_[phx::ref(value)=_1] >> -(qi::lit(','))); the only difference is the way by means I get the content of the quoted string, actually instead of using *(ascii::alnum | qi::char_('_')) I'd like to use *(!qi::lit('"')) that - imho - should be better but it actually hangs. What/where am I actually missing/wrong? Many thanks in advance Giampiero

2 1

Re: [Boost-users] asio: how to handle disk IO, recommendations
by Avi Bahra 24 Oct '12

24 Oct '12

> Currently I has a single threaded server based on boost ASIO. > This works correctly most of the time. > However on systems where i know that the disk's are slow. > , the server grinds to a halt, when dealing with the blocking > disk IO. > > I could not find any examples or documentation in ASIO, in > how to get round these issues. It appears that ASIO does > not provide any support for async' disk IO. > > So I assume this is handled by use of threads ? > Are there any examples of using ASIO with threaded disk IO, > since this must be very common use case ? > > Is the strand functionality appropriate for handing disk IO, > in an async' manner. > > Any recommendations/advice on this issues would be > greatly appreciated. > > Best regards, > Ta, > Avi > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > >Hi Avi, > >If your server performs short read/writ frequently and data to be transfer >to network depend on these operations, then multi-threading does not help a >lot here. I would suggest you to recheck your I/O strategies and make sure >they are optimized. e.g. buffering, cache, .. etc. If they are perfect but >performance still bother you, then consider to use memory mapped file or >libaio. > >Best, >Acer. In my case the ASIO server needs to only write to a local disk.(no reads) One write is relatively short, i.e to a log file, to record all requests, the other is to write periodically a in memory node tree. This can vary between 1-100MB. My thinking was that if I used a thread reserved for writing the node tree, it will not block the server from handling requests, on slow file systems. I will look into memory mapped files and libaio. Ta, Avi

2 1

serialization
by Larry E. Ramey 24 Oct '12

24 Oct '12

I've got a system where class A { A(); A(const string&); virtual ~A(); }; class C : public A { C(); C(const A&, float); virtual ~C(); }; BOOST_CLASS_EXPORT( A ) BOOST_CLASS_EXPORT( C ) main() { ... const A* a = new a("stuff"); const C* c = new c(*a, 52.54390f); { ofstream ofs("dump.bin"); boost::archive::text_oarchive oa(ofs); oa<<a<<c; } ... A* a2=NULL; C* c2=NULL; try { ifstream ifs("dump.bin"); boost::archive::text_iarchive ia(ifs); ia>>a2; ia>>c2; } catch(boost::archive::archive_exception& ae) { cout<<ae.what(); } } This works just fine. If I replace A* a2=NULL; C* c2=NULL; with A* a2=NULL; A* c2=NULL; Then it throws an unregistered_class exception. If I change the iarchive to take: const A* a = new A("I'm cool"); const A* c = new C(*a,54.2f); then I can unarchive it with a pair of A*. Is this by design? Seriously? I can't save derived pointers and unarchive base pointers? Larry

3 4

adding 'blackberry' to boost build
by Gottlob Frege 23 Oct '12

23 Oct '12

I work for RIM (ie BlackBerry), and am trying to make using boost as easy as possible to use for BB developers. So I would like to make building boost for BB as easy as possible. I would also like to make building boost work "as expected" for anyone who understands Boost.Build. It is the "as expected" part that I'm not sure of. ie should I just offer a blackberry-config.jam? should Boost.Build be changed to auot-detect the BB NDK? should blackberry be a toolset? a target-os? ...? how would you *expect* it hook into Boost.Build? (And note that I expect that developers *also* use the same boost for Windows, etc, so I don't want to replace/affect the simple build for the host machine.) - And finally, it would be nice if this was upstreamed back into boost build (if people think that makes sense), so that boost "just works" on BlackBerry. Here's what I have so far: from the command line, you run something like: b2 install --prefix=C:\boost\ --user-config=blackberry-config.jam --layout=system toolset=gcc target-os=qnxnto I'd prefer it if they didn't need to type so much. And the config file looks like basically the rest of this email: import os ; # these env vars are set by installing the BB NDK QNX_TARGET_ARCH = [ os.environ QNX_TARGET_ARCH ] ; QNX_TARGET = [ os.environ QNX_TARGET ] ; QNX_HOST = [ os.environ QNX_HOST ] ; if ! $(QNX_TARGET) || ! $(QNX_HOST) { ECHO error: ; ECHO error: BlackBerry build of Boost requires QNX_TARGET and QNX_HOST env variables. Did you run bbndk-env.bat? ; ECHO error: ; EXIT ; } if $(QNX_TARGET_ARCH) = x86 { dashVOpt = gcc_ntox86_cpp ; linkArchDir = x86 ; } else { dashVOpt = gcc_ntoarmv7le_cpp ; linkArchDir = armle-v7 ; } using qcc # Version : # C++-compile-command : $(QNX_HOST)/usr/bin/QCC -V$(dashVOpt) # Compiler options : <compileflags>"-D__QNX__" <compileflags>"-D__QNXNTO__" # Add -D__USE_ISOC99 for rounding control mechanism (boost/numeric/interval/hw_rounding.hpp) <compileflags>"-D__USE_ISOC99" <compileflags>"-I$(QNX_TARGET)/usr/include" # Prevent this from being output: "note: the mangling of 'va_list' has changed in GCC 4.4" <compileflags>"-Wno-psabi" # Add -fPIC to link without error to LibTestNativeLibTuTest.o (for statechart tests) <compileflags>"-fPIC" # Requested by BBM team <compileflags>"-fno-strict-aliasing" # Functions like sync_val_compare_and_swap and sync_fetch_and_add aren't available <compileflags>"-DBOOST_SP_NO_SYNC" <linkflags>"-L$(QNX_TARGET)/$(linkArchDir)/usr/lib -L$(QNX_TARGET)/$(linkArchDir)/lib" ; import option ; option.set keep-going : false ; ------------------------ Thanks in advance, Tony

2 2

building universal boost binaries (MacOS)
by Nick Zavaritsky 23 Oct '12

23 Oct '12

Hi! Boost.build docs says that to build 'fat' binaries on the Mac two options exist: architecture=combined and/or address-model=32_64. The first one builds a binary with PowerPC and x86 code. The second one builds a binary with 32 and 64bit code. The doc further states that architectire= and address-model= are independent: one can use the first one alone or the second one alone or both simultaneously yielding different results. (http://www.boost.org/boost-build2/doc/html/bbv2/reference/tools.html#bbv2.r…) I would like to use address-mode=x86_64 to build x86/x86_64 fat binaries of boost libraries. Unfortunately with boost 1.51 it doesn't work this way — in order to get fat binaries one has to specify both architecture=combined and address-mode=32_64. Since we don't want power pc support we strip binaries from ppc code using lipo. This is a very suboptimal solution since we compile ppc variant anyway and that takes time. Even worse is that the modern toolchain doesn't support PowerPC hence we have to compile Boost using older toolchain. Currently address-model=32_64 works only if architecture=combined was specified as well (tried with Xcode 4.5 and 3.2.5). Is this really a bug in Boost.build? If that is by design what is the method to build boost fat binaries with modern toolchain lacking ppc support?

1 0

Re: [Boost-users] [EXTERNAL] Re: [MPI] missing symbols using serialization's static library design
by Robert Ramey 23 Oct '12

23 Oct '12

"Barrett, Brian W" <bwbarre(a)sandia.gov> wrote in message news:<69A29AB53D57F54D81061A9E4E45B8FD239CC111(a)EXMB01.srn.sandia.gov>... > On 10/17/12 1:00 PM, "Robert Ramey" <ramey(a)rrsd.com> wrote: > > >Barrett, Brian W wrote: > >> > Unfortunately, I'm barely competent in using Boost.MPI and > Boost.Serialization. I'm definitely not in a position to be able to apply > a patch. > > What I'm getting from your responses and the general silence elsewhere is > that the right answer is to deal with the incompatibilities between > versions of Boost and explicitly instantiate all the internal MPI > archivers and hope for the best. It's a little painful, but I think we > can do that. Well, your organization could contract with me to address this for you. I've done special work for several companies which use the serialization library. This work has been contributed to boost and become part of the distributed package. So a) The organization gets what it needs for a reasonable cost. b) Any generally useful enhancements get included in the library So it helps everyone all around. Thanks in advance for considering this. Robert Ramey > > Thanks, > > Brian > > -- > Brian W. Barrett > Scalable System Software Group > Sandia National Laboratories

3 4

[system] symbol visibility and GCC vs. Clang
by James Walker 23 Oct '12

23 Oct '12

When trying to link a bunch of libraries on OS X, I got this linker warning: ld: warning: direct access in boost::system::system_error::~system_error() to global weak symbol vtable for boost::system::system_error means the weak symbol cannot be overridden at runtime. This was likely caused by different translation units being compiled with different visibility settings. As far as I can tell, everything is compiled using the flags -fvisibility=hidden -fvisibility-inlines-hidden. I'm wondering whether the problem is that some of the libraries were built using gcc and some were built using Clang. In boost/system/system_error.hpp, the declaration of boost::system::system_error is decorated with BOOST_SYMBOL_VISIBLE. In boost/config/compiler/gcc.hpp, BOOST_SYMBOL_VISIBLE is defined to be __attribute__((visibility("default"))), whereas boost/config/compiler/clang.hpp does not define BOOST_SYMBOL_VISIBLE. -- James W. Walker, Innoventive Software LLC <http://www.frameforge3d.com/>

2 2

Re: [Boost-users] Interesting article on stack-based TMP
by Thorsten Ottosen 23 Oct '12

23 Oct '12

On 23-10-2012 15:05, Larry Evans wrote: > On 10/22/12 07:26, Giovanni Piero Deretta wrote: > [snip] >> Now, to make this thread on-topic: is anybody working on a C++11 >> rewrite of Boost.MPL? >> > Anyone attempting such a rewrite and planning to use the > variadic template features might want to start from: > > http://svn.boost.org/svn/boost/sandbox/variadic_templates/boost/mpl/ > > However, using variadic templates may cause a slowdown in the > compile times. IIRC, a variadic template version of proto was > developed but was abandoned in favor of using: > > http://www.boost.org/doc/libs/1_51_0/libs/preprocessor/doc/index.html > > because of large compile times. Hm. This is really sad if variadic templates can't be used for the thing they were created for. Is this an inherent problem for large-scale use of variadic templates? -Thorsten

2 1

asio: how to handle disk IO, recommendations
by Avi Bahra 23 Oct '12

23 Oct '12

Currently I has a single threaded server based on boost ASIO. This works correctly most of the time. However on systems where i know that the disk's are slow. , the server grinds to a halt, when dealing with the blocking disk IO. I could not find any examples or documentation in ASIO, in how to get round these issues. It appears that ASIO does not provide any support for async' disk IO. So I assume this is handled by use of threads ? Are there any examples of using ASIO with threaded disk IO, since this must be very common use case ? Is the strand functionality appropriate for handing disk IO, in an async' manner. Any recommendations/advice on this issues would be greatly appreciated. Best regards, Ta, Avi

2 1

Boost install creates no boost library files
by niallm 22 Oct '12

22 Oct '12

Hi guys, I'm running OS X 10.8.2 and I'm trying to install boost. I'm using Enthought python. So I've unpacked the tar file boost_1_51_0.tar.bz2 into usr/local. Then in the resulting directory boost_1_51_0, I do the following commands: $ ./bootstrap.sh --with-python=2.7 --with-python-root=../../Library/Frameworks/EPD64.framework /Versions/Current/bin/python then: $ ./b2 link=shared --with-python --with-math (I only need the python and math parts). This returns: he Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: /usr/local/boost_1_51_0 The following directory should be added to linker library paths: /usr/local/boost_1_51_0/stage/lib Then I did: $ sudo ./b2 --prefix=usr/local link=shared --with-python --with-math install This returns: common.mkdir usr common.mkdir usr/local common.mkdir usr/local/include common.mkdir usr/local/include/boost Followed by lots of lines starting 'common.copy...' and finished with '...updated 9752 targets...'. However when I check in usr/local/include there is no boost directory, and there are no boost libraries in usr/local/lib Thanks in advance -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-install-creates-no-boost-library-f… Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

[graph] Extending bgl_named_params
by Philipp Moeller 22 Oct '12

22 Oct '12

Hi, I maintain a library that introduces its own graph properties for domain specific algorithms and provides it's own implementation of bgl_named_parameters by essentially mimicking bgl_named_parameters one-to-one. With the refactoring in 1.51 that implementation broke and I had to add another implementation of named parameters which essentially looks like this: enum my_property_t { my_property }; template <typename T, typename Tag, typename Base = boost::no_property> struct foo_bgl_named_params : boost::bgl_named_params<T, Tag, Base> { typedef boost::bgl_named_params<T, Tag, Base> base; typedef foo_bgl_named_params self; foo_bgl_named_params(T v = T()) : base(v) {} foo_bgl_named_params(T v, const Base& b) : base(v, b) {} template <typename PMap> foo_bgl_named_params<PMap, my_property_t, self> my_property_map(const PMap& p) const { typedef foo_bgl_named_params<PMap, my_property_t, self> Params; return Params(p, *this); } }; // the respective free functions... template <typename PMap> foo_bgl_named_params<PMap, my_property_t, self> my_property_map(const Pmap& p) const { typedef foo_bgl_named_params<PMap, my_property_t, self> Params; return Params(p); } // partial specialization for lookup_named_param_def namespace boost { template <typename T, typename Tag, typename Base, typename Def> struct lookup_named_param_def<Tag, foo_bgl_named_params<T, Tag, Base>, Def> { typedef T type; static const type& get(const bgl_named_params<T, Tag, Base>& p, const Def&) { return p.m_value; } }; template <typename Tag1, typename T, typename Tag, typename Base, typename Def> struct lookup_named_param_def<Tag1, foo_bgl_named_params<T, Tag, Base>, Def> { typedef typename lookup_named_param_def<Tag1, Base, Def>::type type; static const type& get(const bgl_named_params<T, Tag, Base>& p, const Def& def) { return lookup_named_param_def<Tag1, Base, Def>::get(p.m_base, def); } }; } // boost This is brittle because it the type returned by the inherited functions is not the same and chaining will not work if one of those functions is called first, e.g. all custom properties have to be chained together first. >From the documentation it is not really obvious to me if other libraries are even supposed to provide their own properties and how/if they actually should be able to extend the named parameters API. Is that simply not an intended feature of the BGL or can that be done differently? Cheers, Philipp

2 1

Linking issue with Boost 1.44 and GCC 4.6
by Joseph Sulewski 21 Oct '12

21 Oct '12

Hi, I'm having a very strange compilation issue with Boost. I've used boost in other C++ projects in the past and have had no issues. I'm writing a program to compile against Hypertable which relies on the boost 1.44 version of the library. I'm writing this on Intel Linux and compiling with GCC 4.6.3 Here is my linker command. I removed the .o's from my application to make it simpler to read: g++ -L/opt/hypertable/current/lib -L/home/l3/development/libraries/boost_1_44_0/stage/lib -pthread -o "AppLogger" MYDOT-O-FILES.o -lboost_system -lboost_iostreams -lboost_filesystem -lboost_program_options -lboost_thread -lsigar-x86-linux -lz -lHypertable -lHyperspace -lHyperTools -lHyperComm -lHyperCommon As you can see I'm including a number of boost libraries but I'm getting a lot of very strange errors. For example, opt/hypertable/current/lib/libHypertable.a(Client.cc.o): In function `Hypertable::Client::Client(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)': Client.cc:(.text+0x26a5): undefined reference to `boost::program_options::variables_map::variables_map()' >From what I can see the precompiled library from Hypertable is not finding the functions in the boost library. Here is another I get Client.cc:(.text+0x26a5): undefined reference to `boost::program_options::variables_map::variables_map()' /opt/hypertable/current/lib/libHypertable.a(Client.cc.o): In function `Hypertable::Client::Client(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)': I get a bunch of these: HqlInterpreter.cc:(.text._ZN5boost9call_onceIPFvvEEEvRNS_9once_flagET_[void boost::call_once<void (*)()>(boost::once_flag&, void (*)())]+0x151): undefined reference to `boost::detail::once_epoch_cv' There are many many more linker errors but I didn't want to clog up the system with all the errors. Any ideas would be greatly appreciated Thanks

3 5

[proto] transform with calling templates
by Felipe Magno de Almeida 21 Oct '12

21 Oct '12

Hello, I had the following transform and function object: struct bind_functions_transform : proto::when < proto::terminal<binding::placeholder::method_value<proto::_,proto::_> > , bind_method_call(proto::_value, proto::_data, proto::_state)> > struct bind_method_call : proto::callable { template <typename T> struct result { typedef typename boost::function_types::parameter_types<T>::type parameter_types; typedef typename boost::mpl::next <typename boost::remove_reference <typename boost::mpl::at_c<parameter_types, 2u>::type>::type>::type type; }; template <typename Sig, typename F, std::size_t I, std::size_t N> boost::mpl::size_t<I+1> operator()(binding::placeholder::method_value<Sig, F>const& method , boost::fusion::vector<Class&, environment, binding::virtual_table<N>&>& data , boost::mpl::size_t v) const { ... } }; So, I needed one more compile-time information which would be equal to all calls and transforms, so I made my transform into a template and also bind_method_call as follows: template <typename T> struct bind_functions_transform : proto::when < proto::terminal<binding::placeholder::method_value<proto::_,proto::_> > , bind_method_call<T>(proto::_value, proto::_data, proto::_state)> > template <typename T> struct bind_method_call : proto::callable [...] And then I received the following error: ../boost_1_50_0/boost/proto/transform/detail/preprocessed/construct_funop.hpp:24:33: error: no matching function for call to ‘jvb::binding::bind_method_call<hello_world>::bind_method_call(const jvb::binding::placeholder::method_value<void(), void (hello_world::*)()>&, boost::fusion::vector<jvb::class_&, jvb::environment, jvb::binding::virtual_table<1ul>&, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_>&, const mpl_::size_t<0ul>&)’ I've remembered the workaround for msvc with proto::call. Because it seemed that the transform was actually trying to construct instead of calling bind_method_call, so I changed to: template <typename PeerClass> struct bind_functions_transform : proto::when < proto::terminal<binding::placeholder::method_value<proto::_,proto::_> > , proto::call<bind_method_call<PeerClass>(proto::_value, proto::_data, proto::_state)> > And it worked. Well, my question is: is this a known limitation? I didn't find it in proto documentation. I'm using GCC 4.7.1 and x86_64 with Linux Regards, -- Felipe Magno de Almeida

2 1

Boost python, unique_ptr and abstract class
by Maxim Yegorushkin 19 Oct '12

19 Oct '12

I am using boost::python to expose a C++ API into Python. Here is what I am trying to do: #include <boost/python.hpp> #include <memory> struct Subscriber { virtual ~Subscriber() = 0; static std::unique_ptr<Subscriber> create(); }; template<class T> inline T* get_pointer(std::unique_ptr<T> const& p) { return p.get(); } BOOST_PYTHON_MODULE(subscriber) { // Expose the class. boost::python::class_< Subscriber , std::unique_ptr<Subscriber> , boost::noncopyable >("Subscriber"); // Expose its factory function. bp::def("createSubscriber", Subscriber::create); } boost::python::class_<> constructor invocation spits out errors (full compiler log attached): /usr/local/ots/boost-1.51.0/include/boost/python/converter/as_to_python_function.hpp:40:75: error: use of deleted function ‘std::unique_ptr<_Tp, _Dp>::unique_ptr(const std::unique_ptr<_Tp, _Dp>&) [with _Tp = Subscriber; _Dp = std::default_delete<Subscriber>; std::unique_ptr<_Tp, _Dp> = std::unique_ptr<Subscriber>]’ /usr/local/ots/boost-1.51.0/include/boost/python/object/pointer_holder.hpp:194:14: error: cannot allocate an object of abstract type ‘Subscriber’ How do I make boost::python friendly to std::unique_ptr<> and how do I wrap an abstract class please? -- Maxim

1 0

Occasional blocking with tcp::socket::receive
by Stuart Siegel 19 Oct '12

19 Oct '12

The call to receive below will occasionally hang. All interactions are synchronous and single threaded. Things work perfectly if I use the alternative <sys/socket.h> (POSIX) implementation under the #else. Since I'm pretty new to boost::asio, I must be doing something wrong but after many hours of trying different things, I'm still stuck. Any advice would be appreciated. #if 1 namespace bas = boost::asio; remaining = X //(something typically about 5000 bytes of char data) bas::streambuf b; bas::streambuf::mutable_buffers_type bufs = b.prepare(1024); while (remaining > 0) { size_t n = sock.receive(bufs); //<-------------this blocks every so often remaining -= n; for ( bas::buffers_iterator<bas::streambuf::mutable_buffers_type, char> it = bas::buffers_begin(bufs); it < (bas::buffers_begin(bufs) + n); it++ ) qba.append(*it); } #else //this works perfectly in the 250000 or so test calls I've hit it with char buf[1024]; while (remaining > 0) { n = read( sock, buf, min( sizeof(buf), remaining ) ); remaining -= n; for (int i = 0 ; i < n; i++ ) qba.append(buf); } #endif

1 0

[Boost.Functional.OverloadedFunction][C++03] Number of overloads in boost::overload_function<...>
by Felipe Magno de Almeida 19 Oct '12

19 Oct '12

Hello, Is there a way to know how many overloads are there in a overloaded_function without resorting to preprocessor metaprogramming in C++03? It doesn't seem to be a MPL sequence, for example. Regards, -- Felipe Magno de Almeida

3 6

boost solution for transforming stl algorithms on proxy iterators?
by Oswin Krause 19 Oct '12

19 Oct '12

Hi, I often have problems which look a bit like this: //example code, only for problem statement //std::vector<bool> chosen only because it is no container :). If this is too silly for you, //think about a matrix interpreted as range of row-vectors. std::vector<bool> myContainer;//does only have proxy iterators. std::vector<double> myDistances; //stores for every element in myContainer a distance //now i want to to sort the elements of both ranges in place //as if they were in a hypothetic range std::vector<std::pair<bool, double> > //and sort them by the second part: boost::sort(make_key_value_range(myContainer,myDistances));//bam, not allowed I omited the definition of make_key_value_range but it should be clear that this returns a proxy range with writable iterators and reference type similar to std::pair<std::vector<bool>::reference,double&> for which swap is overloaded to do the right thing. This is not allowed by the standard as boost::sort calls std::sort which in turn requires random_access_iterators - and they disallow proxy references. This issue is AFAIK resolved with C++11 but some of us still need to support C++03 - and I am really annoyed by this problem. The thing is: this will compile on most compilers. One could just lie about the iterator category, saying it is a random_access_iterator and even VC would be happy with it. However it could just break randomly on a new compiler without warning or has severe performance issus (for example gcc works, but completely ignores my nicely defined swap and instead does a triangle copy :-( ). So how can one resolve this issue? I have the problem, that i need to do this in-place, since copying would result in std::bad_alloc almost surely. Also the above single line of code just looks that nice, that i just want to have it this way. So, how do you resolve this issue? is there maybe some boost library capable of getting this done? e.g. boost.betterSTL? :-). Greetings, Oswin

5 10

Using Adaptable Generator concept with generate_n and boost smart pointers
by Marco Craveiro 18 Oct '12

18 Oct '12

Hi boosters, I'm trying to create a class that models the concept of adaptable generator [1]. The idea is that it generates pointers to test data objects which I'd like to then put inside of smart pointers such as shared_ptr or scoped_ptr (or even std::shared_ptr) via generate_n, etc. This is a (non-compilable) example of my intentions: #include <algorithm> #include <iostream> #include <memory> #include <vector> #include <iterator> struct base { int i; }; struct derived : public base { int z; }; struct generator { typedef base result_type; result_type* operator()() { return new derived(); } }; int main(void) { std::vector<std::shared_ptr<base> > z; std::generate_n(std::back_inserter(z), 5, generator()); return 0; } The std::shared_ptr is incidental; it could have been boost::shared_ptr, etc - its up to client code to decide. I get this to work fine when result_type is say boost::shared_ptr<base> but what I really like is for it to be a raw pointer; is there some boost magic (or standard C++ 11 magic) I can apply to convert it to the value_type of the container I'm trying to generate? Many thanks for your time, Marco -- So young, and already so unknown -- Pauli blog: http://mcraveiro.blogspot.com [1] http://www.sgi.com/tech/stl/AdaptableGenerator.html

1 0

Generically connecting a signal to a member function
by Chris Stankevitz 18 Oct '12

18 Oct '12

Hello, I wrote a function called "Connect" which generically connects a signal to a member function. The pseudo-code for this function is: void Connect(Signal, MemberFunction, pClass) { Signal.connect(Signal::slot_type(MemberFunction, pClass)); } Problem: I had to create "overloads" for different number of signal arguments. This was somewhat expected and we see it in boost with things like boost::bind. What I did not expect was that each of my overloads had to have a different name. This is because all overloads have the same function signature: one signal, one member function, one class pointer. Question: Is there a way to write a generic "Connect" that handles signals of different number of arguments? If overloading is involved, can it be done like bind such that all overloads have the same name? Below is my solution that exhibits the "problem" I described above. Thank you for your help, Chris === #include <boost/bind.hpp> #include <boost/signals2.hpp> #include <iostream> //------------------------------------- // Connect0 // // Generically connect a member // function to a signal producing zero // arguments. //------------------------------------- template < class TASignal, class TAMemberFunction, class TAClass> void Connect0( TASignal& Signal, TAMemberFunction MemberFunction, TAClass* pClass) { typedef typename TASignal::slot_type TDSlot; TDSlot Slot(MemberFunction, pClass); Signal.connect(Slot); } //------------------------------------- // Connect0 // // Generically connect a member // function to a signal producing one // arguments. //------------------------------------- template < class TASignal, class TAMemberFunction, class TAClass> void Connect1( TASignal& Signal, TAMemberFunction MemberFunction, TAClass* pClass) { typedef typename TASignal::slot_type TDSlot; TDSlot Slot(MemberFunction, pClass, _1); Signal.connect(Slot); } //------------------------------------- // Connect2 // // Generically connect a member // function to a signal producing two // arguments. //------------------------------------- template < class TASignal, class TAMemberFunction, class TAClass> void Connect2( TASignal& Signal, TAMemberFunction MemberFunction, TAClass* pClass) { typedef typename TASignal::slot_type TDSlot; TDSlot Slot(MemberFunction, pClass, _1, _2); Signal.connect(Slot); } //------------------------------------- //------------------------------------- struct TCClass { void f0() {} void f1(int) {} void f2(int, int) {} }; //------------------------------------- //------------------------------------- int main() { boost::signals2::signal<void()> Signal0; boost::signals2::signal<void(int)> Signal1; boost::signals2::signal<void(int, int)> Signal2; TCClass Class; Connect0(Signal0, &TCClass::f0, &Class); Connect1(Signal1, &TCClass::f1, &Class); Connect2(Signal2, &TCClass::f2, &Class); Signal0(); Signal1(1); Signal2(2, 2); return 0; }

1 0

Intrsuive multisets and stable sorting
by Dan Posluns 18 Oct '12

18 Oct '12

Hi there, I'm attempting to use intrusive associative containers, but it's essential to the application that as I add "equivalent" objects to the multiset that their order is maintained, ie. that the sort is stable. I'm looking at using avl_multiset for its fast retrieve times. I ran an experiment several times over where I added 1000 entries of random numbers from 0-9 that also contained ordering information to a multiset, and that ordering information wound up being preserved, even when I removed some items and added new ones to the initial tree. So that looks promising. If someone were able to confirm the results of my experiment it would be better, though. Best would be documentation that lists which multiset implementations are stable and which aren't, but I can't find such a thing in the docs. Thanks, Dan.

3 5

[fusion] making an inner struct boost fusion compatible?
by Oswin Krause 17 Oct '12

17 Oct '12

Hi list, I have the following problem: template<class T, class U, class V> struct MyType{ struct nested{ typename MetaFunc<T>::type a; typename MetaFunc::type b; typename MetaFunc<V>::type c; }; }; now this inner struct must be a boost fusion compatible random access sequence. The examples cover only structs on namespace lvel, how can i handle this way? Later these classes will be generated by a macro automatically so even dirty hacks are allowed :). But i don't want to clatter the namespace by pulling nested outside of the class. Is there an easy way or do i have to write the necessary mtafunctions to make this possible? Greetings, Oswin

3 8

undefined reference to boost::hash_range
by Michael Dickey 17 Oct '12

17 Oct '12

I ran into an odd error with 1.51.0 when compiling the following code using gcc 4.4.6 on rhel6/64 with -fkeep-inline-functions (using this flag for debug builds): #include <boost/filesystem/path.hpp> int main(void) { boost::filesystem::path a_path; return 0; } The linker complains about an undefined reference to boost::hash_range<> referenced from boost/filesystem/path.hpp. Looking at path.hpp I can see it includes hash_fwd.hpp not hash.hpp. This is despite the fact that it's actually using various hash methods inside the header file (including hash_range). When I change it to use hash.hpp instead, the linker error goes away. Should path.hpp really use hash.hpp instead, or is this some weird compiler issue, or something else entirely? I figured someone here would know =) Thanks, -Mike

1 0

[Phoenix] Restricting actors
by paul Fultz 17 Oct '12

17 Oct '12

Hello, I was wondering if there was a way to restrict actors(rather than extend them). That is, I would like to create an actor that only supports say the `+` operator. Right now, if I inherit from `actor` it will bring in all the C++ operators. Is there a different base class I can inherit from? Or is it even possible? Thanks, Paul

1 0

IOStream - expose MemoryInputStream buffer and it's size
by Gheorghe Marinca 16 Oct '12

16 Oct '12

Hy, I want to implement a boost iostream MemoryInputStream like this: class MemoryInputDevice : public boost::iostreams::source { public: MemoryInputDevice(char* buffer, size_t size): buffer(buffer), size(size), pos(0) { } std::streamsize read(char* s, std::streamsize n); private: char* buffer; std::streamsize size; std::streamsize pos; }; typedef boost::iostreams::stream<MemoryInputDevice> MemoryInputStream; I want at the same time to expose to clients beside the istream interface a way for the client to get the pointer to the internal buffer and it's length (getting the pointer to the internal buffer could be questionable but in order not to copy buffer around there are cases where a parser of mine needs all the content of the internal buffer and I don't want to copy that around before passing it to the parser) Is therea way for MemoryInputStream user to get that info ? I was thinking at the stream->rdbuffer() method but it seems it does not give me what I want. Thanks in advance for your help -Ghita

2 1

How to do line clipping using boost polygon?
by jian hu 16 Oct '12

16 Oct '12

Hi, I'm trying to clip line segments using boost polygon. Boost polygon does not provide public interface but somehow I find the function validate_scan(), which can do the line clipping. My input are two segments < (10, 10), (10, 2), 0 > < ( 6, 7), (11, 2), 1 > The numbers in the brackets are coordinates of two end points of the segments and the number after it is the segment id. So it looks like this. The result I expect should be four segments, which are the result of intersection <(10,10), (10,3), 0> <(10,3), (10,2), 0> <(6,7 ), (10,3), 1> <(10,3), (11, 2), 1> However, the <(10,3), (11,2), 1> segment is replace by two segments, which are <(10,3), (10,2), 1> and <(10,2), (11,2), 1>. Can someone tell me what happened? Replacing the segment with the other two are not right behavior. Thank you very much. -- Jian Hu

1 0

[boost.numeric] Poor Performance of numeric_cast
by Tang Jiang Jun 16 Oct '12

16 Oct '12

Hi, I have run a performance testing for numeric_cast recently, and found that the result was really unexpected bad, although the document mentioned that it will be no overhead if overflows don't happen. Could somebody please help me to verify this testing? If this is true, I doubt whether I should use numeric_cast in the production code. Here is my testing code and result. *#include <boost/numeric/conversion/cast.hpp> #include <boost/format.hpp> #include <boost/cstdint.hpp> #include <boost/chrono.hpp> #include <iostream> using namespace std; using namespace boost; using namespace boost::numeric; using namespace boost::chrono; int main() { const static int32_t COUNT = 1000000; high_resolution_clock::time_point start; start = high_resolution_clock::now(); for( int32_t n = 0; n < COUNT; ++n ) { int32_t i32 = 123; int16_t i16 = i32; } cout << format("Native Integer Cast: %1%\n") % ( ( high_resolution_clock::now() - start ) / COUNT ); start = high_resolution_clock::now(); for( int32_t n = 0; n < COUNT; ++n ) { try { int32_t i32 = 100; int16_t i16 = numeric_cast< int16_t >( i32 ); } catch( const bad_numeric_cast& e ) { cout << e.what() << endl; } } cout << format("Boost Integer Cast: %1%\n") % ( ( high_resolution_clock::now() - start ) / COUNT ); start = high_resolution_clock::now(); for( int32_t n = 0; n < COUNT; ++n ) { float f = 100.0f; int32_t i = static_cast< int32_t >( f ); } cout << format("Native Floating-Integer Cast: %1%\n") % ( ( high_resolution_clock::now() - start ) / COUNT ); start = high_resolution_clock::now(); for( int32_t n = 0; n < COUNT; ++n ) { try { float f = 123.0f; int32_t i = numeric_cast< int32_t >( f ); } catch( const bad_numeric_cast& e ) { cout << e.what() << endl; } } cout << format("Boost Floating-Integer Cast: %1%\n") % ( ( high_resolution_clock::now() - start ) / COUNT ); start = high_resolution_clock::now(); for( int32_t n = 0; n < COUNT; ++n ) { int32_t i = 132; float f = static_cast< float >( i ); } cout << format("Native Integer-Floating Cast: %1%\n") % ( ( high_resolution_clock::now() - start ) / COUNT ); start = high_resolution_clock::now(); for( int32_t n = 0; n < COUNT; ++n ) { try { int32_t i = 128; float f = numeric_cast< float >( i ); } catch( const bad_numeric_cast& e ) { cout << e.what() << endl; } } cout << format("Boost Integer-Floating Cast: %1%\n") % ( ( high_resolution_clock::now() - start ) / COUNT ); return 0; };* Result: *Native Integer Cast: 3 nanoseconds Boost Integer Cast: 311 nanoseconds Native Floating-Integer Cast: 4 nanoseconds Boost Floating-Integer Cast: 430 nanoseconds Native Integer-Floating Cast: 2 nanoseconds Boost Integer-Floating Cast: 106 nanoseconds*

4 12

[asio] Custom asynchronous service
by Acer Yang 16 Oct '12

16 Oct '12

Hi all, I would like to adapt my class to asio for offering async_do_something(param, callback) interfaces. After reading examples presented in asio/examples/services/ and some asio source code. I found the example does not do invoke callback stuff (e.g. asio/examples/service/logger_service.cpp). In case of asio source code, there are classes such as detail::wait_handler<> that wrap user callbacks for invoked later. Should I use these wrappers in my service implementation if I hope to comfort the strand design of asio? Do I have other choices? All suggestions are welcome. Best wishes, Acer.

2 3

boost test, valgrind errors in release mode
by Avi Bahra 15 Oct '12

15 Oct '12

I have several libs that I am testing with boost unit test Valgrind shows mismatched free/delete Using opensuse113, gcc 4.5, boost 1.47 I am bit perplexed because: a/ The valgrind errors only show up with release mode. b/ The valgrind errors suggest problems with unit test, but I have dozen or so separate unit tests, however, errors only shows up on one of the tests. has anyone come across these errors, and suggestion of how to overcome. + valgrind --leak-check=full --show-reachable=yes ACore/bin/gcc-4.5/release/coretest ==25529== Memcheck, a memory error detector ==25529== Copyright (C) 2002-2009, and GNU GPL'd, by Julian Seward et al. ==25529== Using Valgrind-3.5.0 and LibVEX; rerun with -h for copyright info ==25529== Command: ACore/bin/gcc-4.5/release/coretest ==25529== ==25529== Mismatched free() / delete / delete [] ==25529== at 0x4C25F7B: free (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==25529== by 0x4D25CA: _ZNSt6vectorISt4pairIN5boost9unit_test13basic_cstringIKcEES5_ESaIS6_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS6_S8_EERKS6_.clone.57 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4D3B09: _Z41__static_initialization_and_destruction_0ii.clone.0 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x50EEF5: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4265AA: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x511D22F: ??? (in /usr/lib64/libstdc++.so.6.0.14) ==25529== by 0x50EE74: __libc_csu_init (elf-init.c:120) ==25529== by 0x55C1B0F: (below main) (in /lib64/libc-2.11.2.so) ==25529== Address 0x5904c60 is 0 bytes inside a block of size 32 alloc'd ==25529== at 0x4C267D0: operator new(unsigned long) (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==25529== by 0x4D2561: _ZNSt6vectorISt4pairIN5boost9unit_test13basic_cstringIKcEES5_ESaIS6_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS6_S8_EERKS6_.clone.57 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4D2F62: _Z41__static_initialization_and_destruction_0ii.clone.0 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x50EEF5: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4265AA: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x511D22F: ??? (in /usr/lib64/libstdc++.so.6.0.14) ==25529== by 0x50EE74: __libc_csu_init (elf-init.c:120) ==25529== by 0x55C1B0F: (below main) (in /lib64/libc-2.11.2.so) ==25529== ==25529== Mismatched free() / delete / delete [] ==25529== at 0x4C25F7B: free (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==25529== by 0x4D25CA: _ZNSt6vectorISt4pairIN5boost9unit_test13basic_cstringIKcEES5_ESaIS6_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS6_S8_EERKS6_.clone.57 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4D3B29: _Z41__static_initialization_and_destruction_0ii.clone.0 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x50EEF5: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4265AA: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x511D22F: ??? (in /usr/lib64/libstdc++.so.6.0.14) ==25529== by 0x50EE74: __libc_csu_init (elf-init.c:120) ==25529== by 0x55C1B0F: (below main) (in /lib64/libc-2.11.2.so) ==25529== Address 0x5904cc0 is 0 bytes inside a block of size 64 alloc'd ==25529== at 0x4C267D0: operator new(unsigned long) (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==25529== by 0x4D2561: _ZNSt6vectorISt4pairIN5boost9unit_test13basic_cstringIKcEES5_ESaIS6_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS6_S8_EERKS6_.clone.57 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4D3B09: _Z41__static_initialization_and_destruction_0ii.clone.0 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x50EEF5: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4265AA: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x511D22F: ??? (in /usr/lib64/libstdc++.so.6.0.14) ==25529== by 0x50EE74: __libc_csu_init (elf-init.c:120) ==25529== by 0x55C1B0F: (below main) (in /lib64/libc-2.11.2.so) ==25529== ==25529== Mismatched free() / delete / delete [] ==25529== at 0x4C25F7B: free (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==25529== by 0x4D25CA: _ZNSt6vectorISt4pairIN5boost9unit_test13basic_cstringIKcEES5_ESaIS6_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS6_S8_EERKS6_.clone.57 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4D3B69: _Z41__static_initialization_and_destruction_0ii.clone.0 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x50EEF5: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4265AA: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x511D22F: ??? (in /usr/lib64/libstdc++.so.6.0.14) ==25529== by 0x50EE74: __libc_csu_init (elf-init.c:120) ==25529== by 0x55C1B0F: (below main) (in /lib64/libc-2.11.2.so) ==25529== Address 0x5904d40 is 0 bytes inside a block of size 128 alloc'd ==25529== at 0x4C267D0: operator new(unsigned long) (in /usr/lib64/valgrind/vgpreload_memcheck-amd64-linux.so) ==25529== by 0x4D2561: _ZNSt6vectorISt4pairIN5boost9unit_test13basic_cstringIKcEES5_ESaIS6_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS6_S8_EERKS6_.clone.57 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4D3B29: _Z41__static_initialization_and_destruction_0ii.clone.0 (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x50EEF5: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x4265AA: ??? (in /var/tmp/ma0/clientRoot/workspace/MyProject/ACore/bin/gcc-4.5/release/coretest) ==25529== by 0x511D22F: ??? (in /usr/lib64/libstdc++.so.6.0.14) ==25529== by 0x50EE74: __libc_csu_init (elf-init.c:120) ==25529== by 0x55C1B0F: (below main) (in /lib64/libc-2.11.2.so) ==25529== Best regards, Ta, Avi

1 0

Error : Unable to load Jamfile
by Baba Prasad 15 Oct '12

15 Oct '12

Dear all, I am able to installed boost_1_49_0 in my linux fedora 16 OS and then I exported the bjam file and also BOOST_ROOT. I copied two files into my code directory and name of these files are user-config.jam and boost-build.jam and content of these files as shown bellow. when I try to compile the my code it is giving the following error. Please any one get me out of this problem. my user-config.jam file contains using boost : 1.49 : /home/odtone/Documents/mihf/boost_1_49_0 ; using gcc : : : <cxxflags>-glib-2.0 -dbus-glib-1 : <libs>-glib-2.0 -dbus-glib-1 ; using gcc : : : <compileflags>-glib-2.0 -dbus-glib-1 : <libs>-glib-2.0 -dbus-glib-1 ; my boost-build.jam file contains boost-build /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2 ; Even though I feel everything looks ok still I am getting following error. Please could you help me . and also I did export bjam also export PATH=$PATH/home/odtone/Documents/mihf/boost_1_49_0/ export BOOST_ROOT=:/home/odtone/Documents/mihf/boost_1_49_0/ [root@odtone-aam odtone]# bjam /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:267: in find-jamfile from module project error: Unable to load Jamfile. error: Could not find a Jamfile in directory ':/home/odtone/Documents/mihf/boost_1_49_0/:/home/odtone/Documents/mihf/boost_1_49_0'. error: Attempted to find it with pattern '[Bb]uild.jam[Jj]amfile.v2[Jj]amfile[Jj]amfile.jam )'. error: Please consult the documentation at 'http://www.boost.org'. /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:288: in load-jamfile from module project /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:62: in project.load from module project /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:766: in project.use from module project /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:89: in load-used-projects from module project /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:73: in load from module project /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build/project.jam:168: in project.find from module project /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/build-system.jam:570: in load from module build-system /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/kernel/modules.jam:283: in import from module modules /home/odtone/Documents/mihf/boost_1_49_0/tools/build/v2/kernel/bootstrap.jam:142: in boost-build from module /home/odtone/Documents/mihf/odtone/boost-build.jam:2: in module scope from module Best Regards BaBu -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.

3 2

how to use staged 1.51 with installed boost 1.49 with autotools?
by Joost Kraaijeveld 14 Oct '12

14 Oct '12

Hi, I use Debian with Boost 1.49 installed. I want to test my application with 1.51 that is compiled into a stage directory. According to ax_boost_boost.m4: If no path to the installed boost library is given the macro searchs under /usr, /usr/local, /opt and /opt/local and evaluates the $BOOST_ROOT environment variable. How can I use my staged version, as the installed version is found in /usr? TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

3 6

Getting undirected graph from directed graph discarding properties
by Philipp Klaus Krause 13 Oct '12

13 Oct '12

I have a directed graph that has some properties, and I want the underlying undirected graph, but don't need the properties there. Assuming G is the directed graph with properties, and G_sym is the undirected without them, up until boost 1.50 I used: boost::copy_graph(G, G_sym); But as of boost 1.51 and 1.52 this gives an error due to the properties. Is there an easy way to do what I want to do in boost, and if yes, how? Philipp g++ -pipe -ggdb -g -O2 -Wall -Wno-parentheses -I /tmp/boost_1_52_0_beta1 -I /tmp/boost_1_52_0_beta1 -I. -I. -I././support/util -I. -I /tmp/boost_1_52_0_beta1 -I. -I.. -I./../support/util -I. -I. -c -o SDCClospre.o SDCClospre.cc In file included from SDCClospre.hpp:26:0, from SDCClospre.cc:24: SDCCtree_dec.hpp: In instantiation of ‘void tree_decomposition_from_elimination_ordering(T_t&, const std::list<unsigned int>&, const G_t&) [with T_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_lospre_node>; G_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>]’: SDCCtree_dec.hpp:274:3: required from ‘void thorup_tree_decomposition(T_t&, const G_t&) [with T_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_lospre_node>; G_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>]’ SDCClospre.cc:289:68: required from here SDCCtree_dec.hpp:260:3: error: no match for ‘operator=’ in ‘G_sym = G’ SDCCtree_dec.hpp:260:3: note: candidate is: In file included from /tmp/boost_1_52_0_beta1/boost/graph/graphviz.hpp:24:0, from SDCClospre.hpp:22, from SDCClospre.cc:24: /tmp/boost_1_52_0_beta1/boost/graph/adjacency_list.hpp:313:21: note: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>& boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::operator=(const boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with OutEdgeListS = boost::vecS; VertexListS = boost::vecS; DirectedS = boost::undirectedS; VertexProperty = boost::no_property; EdgeProperty = boost::no_property; GraphProperty = boost::no_property; EdgeListS = boost::listS; boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>] /tmp/boost_1_52_0_beta1/boost/graph/adjacency_list.hpp:313:21: note: no known conversion for argument 1 from ‘const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>’ to ‘const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>&’ In file included from /tmp/boost_1_52_0_beta1/boost/graph/graphviz.hpp:19:0, from SDCClospre.hpp:22, from SDCClospre.cc:24: /tmp/boost_1_52_0_beta1/boost/property_map/property_map.hpp: In instantiation of ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::vec_adj_list_vertex_all_properties_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>*, boost::no_property, boost::no_property&>; Reference = boost::no_property&; K = long unsigned int; V = cfg_lospre_node]’: /tmp/boost_1_52_0_beta1/boost/graph/copy.hpp:129:9: required from ‘void boost::detail::vertex_copier<Graph1, Graph2>::operator()(const Vertex1&, Vertex2&) const [with Vertex1 = long unsigned int; Vertex2 = long unsigned int; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’ /tmp/boost_1_52_0_beta1/boost/graph/copy.hpp:164:11: required from ‘static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>; MutableGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; CopyVertex = boost::detail::vertex_copier<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >; CopyEdge = boost::detail::edge_copier<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >; IndexMap = boost::vec_adj_list_vertex_id_map<cfg_lospre_node, long unsigned int>; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<cfg_lospre_node, long unsigned int>, long unsigned int, long unsigned int&>]’ /tmp/boost_1_52_0_beta1/boost/graph/copy.hpp:348:5: required from ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>; MutableGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’ SDCCtree_dec.hpp:155:3: required from ‘void thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::list<unsigned int>; G_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>]’ SDCCtree_dec.hpp:272:3: required from ‘void thorup_tree_decomposition(T_t&, const G_t&) [with T_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_lospre_node>; G_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>]’ SDCClospre.cc:289:68: required from here /tmp/boost_1_52_0_beta1/boost/property_map/property_map.hpp:361:5: error: no match for ‘operator=’ in ‘(&((const boost::vec_adj_list_vertex_all_properties_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>*, boost::no_property, boost::no_property&>&)pa))->boost::vec_adj_list_vertex_all_properties_map<Graph, GraphPtr, Property, PropertyRef>::operator[]<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>*, boost::no_property, boost::no_property&>(k) = v’ /tmp/boost_1_52_0_beta1/boost/property_map/property_map.hpp:361:5: note: candidate is: In file included from /tmp/boost_1_52_0_beta1/boost/graph/graph_traits.hpp:26:0, from /tmp/boost_1_52_0_beta1/boost/graph/graphviz.hpp:21, from SDCClospre.hpp:22, from SDCClospre.cc:24: /tmp/boost_1_52_0_beta1/boost/pending/property.hpp:18:10: note: boost::no_property& boost::no_property::operator=(const boost::no_property&) /tmp/boost_1_52_0_beta1/boost/pending/property.hpp:18:10: note: no known conversion for argument 1 from ‘const cfg_lospre_node’ to ‘const boost::no_property&’ In file included from /tmp/boost_1_52_0_beta1/boost/graph/graphviz.hpp:19:0, from SDCClospre.hpp:22, from SDCClospre.cc:24: /tmp/boost_1_52_0_beta1/boost/property_map/property_map.hpp: In instantiation of ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::adj_list_edge_all_properties_map<boost::directed_tag, boost::no_property, boost::no_property&, boost::no_property*, long unsigned int>; Reference = boost::no_property&; K = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; V = float]’: /tmp/boost_1_52_0_beta1/boost/graph/copy.hpp:109:9: required from ‘void boost::detail::edge_copier<Graph1, Graph2>::operator()(const Edge1&, Edge2&) const [with Edge1 = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>; Edge2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’ /tmp/boost_1_52_0_beta1/boost/graph/copy.hpp:173:11: required from ‘static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>; MutableGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; CopyVertex = boost::detail::vertex_copier<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >; CopyEdge = boost::detail::edge_copier<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >; IndexMap = boost::vec_adj_list_vertex_id_map<cfg_lospre_node, long unsigned int>; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<cfg_lospre_node, long unsigned int>, long unsigned int, long unsigned int&>]’ /tmp/boost_1_52_0_beta1/boost/graph/copy.hpp:348:5: required from ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>; MutableGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’ SDCCtree_dec.hpp:155:3: required from ‘void thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::list<unsigned int>; G_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>]’ SDCCtree_dec.hpp:272:3: required from ‘void thorup_tree_decomposition(T_t&, const G_t&) [with T_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_lospre_node>; G_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_lospre_node, float>]’ SDCClospre.cc:289:68: required from here /tmp/boost_1_52_0_beta1/boost/property_map/property_map.hpp:361:5: error: no match for ‘operator=’ in ‘(&((const boost::adj_list_edge_all_properties_map<boost::directed_tag, boost::no_property, boost::no_property&, boost::no_property*, long unsigned int>&)pa))->boost::adj_list_edge_all_properties_map<Directed, Property, PropRef, PropPtr, Vertex>::operator[]<boost::directed_tag, boost::no_property, boost::no_property&, boost::no_property*, long unsigned int>(k) = v’ /tmp/boost_1_52_0_beta1/boost/property_map/property_map.hpp:361:5: note: candidate is: In file included from /tmp/boost_1_52_0_beta1/boost/graph/graph_traits.hpp:26:0, from /tmp/boost_1_52_0_beta1/boost/graph/graphviz.hpp:21, from SDCClospre.hpp:22, from SDCClospre.cc:24: /tmp/boost_1_52_0_beta1/boost/pending/property.hpp:18:10: note: boost::no_property& boost::no_property::operator=(const boost::no_property&) /tmp/boost_1_52_0_beta1/boost/pending/property.hpp:18:10: note: no known conversion for argument 1 from ‘const float’ to ‘const boost::no_property&’

2 3

[1.52.0] Beta1 release available
by Daniel James 13 Oct '12

13 Oct '12

Boost release 1.52.0 beta 1 is now available from SourceForge See https://sourceforge.net/projects/boost/files/boost/1.52.0.beta.1/ This release contains numerous enhancements and bug fixes for existing libraries. For details of what's in the release, see http://www.boost.org/users/history/version_1_52_0.html. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

3 2

[BGL] How do I iterate over a labeled graph?
by eric 12 Oct '12

12 Oct '12

I am trying to iterate over my labeled_graph like so: struct Vertex { std::string vertType; }; typedef Graph::vertex_iterator VertexIter; VertexIter vertexIter, vertexEnd; for (tie(vertexIter, vertexEnd) = vertices(graph); vertexIter != vertexEnd; vertexIter++) { std::string vertexType = graph[*vertexIter].vertType; } However, I get a compiler error saying that graph has no operator [] that accepts an unsigned int. How should I be doing what I'm trying to do? -- View this message in context: http://boost.2283326.n4.nabble.com/BGL-How-do-I-iterate-over-a-labeled-grap… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

[Matrix] - Complie time error on Sun Solaris.
by Jagpreet Athwal 12 Oct '12

12 Oct '12

I am trying to compile the below example program listed on boost.org: #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/io.hpp> int main () { using namespace boost::numeric::ublas; matrix<double> m (3, 3); for (unsigned i = 0; i < m.size1 (); ++ i) for (unsigned j = 0; j < m.size2 (); ++ j) m (i, j) = 3 * i + j; std::cout << m << std::endl; } When I compile it, I get these errors. Could anyone please help me with getting rid of these? /boost/numeric/ublas/storage.hpp", line 1046: Error: Too few arguments for template std::reverse_iterator<boost::numeric::ublas::basic_range<boost::numeric::ublas::Z, boost::numeric::ublas::D>::const_iterator>. /boost/numeric/ublas/storage.hpp", line 1076: Where: While specializing "boost::numeric::ublas::basic_range<boost::numeric::ublas::Z, boost::numeric::ublas::D>". /boost/numeric/ublas/storage.hpp", line 1076: Where: Specialized in non-template code. /boost/numeric/ublas/storage.hpp", line 1265: Error: Too few arguments for template std::reverse_iterator<boost::numeric::ublas::basic_slice<boost::numeric::ublas::Z, boost::numeric::ublas::D>::const_iterator>. /boost/numeric/ublas/storage.hpp", line 1296: Where: While specializing "boost::numeric::ublas::basic_slice<boost::numeric::ublas::Z, boost::numeric::ublas::D>". /boost/numeric/ublas/storage.hpp", line 1296: Where: Specialized in non-template code. /boost/numeric/ublas/storage.hpp", line 1525: Error: Too few arguments for template std::reverse_iterator<boost::numeric::ublas::indirect_array<boost::numeric::ublas::A>::const_iterator>. /boost/numeric/ublas/storage.hpp", line 1558: Where: While specializing "boost::numeric::ublas::indirect_array<boost::numeric::ublas::A>". /boost/numeric/ublas/storage.hpp", line 1558: Where: Specialized in non-template code. /boost/numeric/ublas/storage.hpp", line 246: Error: Too few arguments for template std::reverse_iterator<const boost::numeric::ublas::T*>. /boost/numeric/ublas/fwd.hpp", line 126: Where: While specializing "boost::numeric::ublas::unbounded_array<boost::numeric::ublas::T, boost::numeric::ublas::ALLOC>". /boost/numeric/ublas/fwd.hpp", line 126: Where: Specialized in non-template code. /boost/numeric/ublas/storage.hpp", line 247: Error: Too few arguments for template std::reverse_iterator<boost::numeric::ublas::T*>. /boost/numeric/ublas/fwd.hpp", line 126: Where: While specializing "boost::numeric::ublas::unbounded_array<boost::numeric::ublas::T, boost::numeric::ublas::ALLOC>". /boost/numeric/ublas/fwd.hpp", line 126: Where: Specialized in non-template code. 5 Error(s) detected. Thanks, Jag

2 1

Compile errors under VS 2012 using Boost 1.44
by Boucher, Michael D 12 Oct '12

12 Oct '12

Hi folks, I'm upgrading a old project, first created using Visual Studio 2008, to Visual Studio 2012. This project uses the boost libraries to implement regular expressions, and a few other things. When I try to compile, I get somewhere north of 2000 errors, all stemming from iterator_adaptor.hpp. Here's a sample... ---------------------- error C2039: 'reference' : is not a member of '`global namespace'' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 311 error C2065: 'add_reference' : undeclared identifier boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 215 error C2275: 'Value' : illegal use of this type as an expression boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 215 error C2974: 'boost::mpl::eval_if' : invalid template argument for 'F2', type expected boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 215 error C3203: 'eval_if' : unspecialized class template can't be used as a template argument for template parameter 'DefaultNullaryFn', expected a real type boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 216 error C2955: 'boost::mpl::eval_if' : use of class template requires template argument list boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 216 error C3203: 'ia_dflt_help' : unspecialized class template can't be used as a template argument for template parameter 'Reference', expected a real type boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 217 error C2955: 'boost::detail::ia_dflt_help' : use of class template requires template argument list boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 217 error C2039: 'type' : is not a member of 'boost::iterator_facade<Derived,Value,CategoryOrTraversal,Reference>' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 217 error C4430: missing type specifier - int assumed. Note: C++ does not support default-int boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 219 error C2838: 'type' : illegal qualified name in member declaration boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 222 error C2143: syntax error : missing ';' before '>' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 222 error C2226: syntax error : unexpected type 'boost::detail::ia_dflt_help<Difference,boost::iterator_difference<I2>>::type' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 222 error C2238: unexpected token(s) preceding ';' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 223 error C2516: 'boost::detail::iterator_adaptor_base<Derived,Base,Value,Traversal,Reference,Difference>::type' : is not a legal base class boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 271 error C2825: 'boost::iterator_adaptor<Derived,Base,Value,Traversal,Reference>::super_t': must be a class or namespace when followed by '::' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 311 error C2146: syntax error : missing ';' before identifier 'dereference' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 311 error C4430: missing type specifier - int assumed. Note: C++ does not support default-int boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 312 warning C4183: 'dereference': missing return type; assumed to be a member function returning 'int' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 312 error C2825: 'boost::iterator_adaptor<Derived,Base,Value,Traversal,Reference>::super_t': must be a class or namespace when followed by '::' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 327 error C2039: 'iterator_category' : is not a member of '`global namespace'' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 327 error C2146: syntax error : missing ',' before identifier 'iterator_category' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C2146: syntax error : missing ';' before identifier 'my_traversal' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C2838: 'type' : illegal qualified name in member declaration boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C2955: 'boost::iterator_category' : use of class template requires template argument list boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C2955: 'boost::iterator_category_to_traversal' : use of class template requires template argument list boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C3254: 'boost::iterator_adaptor<Derived,Base,Value,Traversal,Reference>' : class contains explicit override 'type' but does not derive from an interface that contains the function declaration boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C4430: missing type specifier - int assumed. Note: C++ does not support default-int boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 328 error C2825: 'boost::iterator_adaptor<Derived,Base,Value,Traversal,Reference>::super_t': must be a class or namespace when followed by '::' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 333 error C2039: 'difference_type' : is not a member of '`global namespace'' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 333 error C2146: syntax error : missing ',' before identifier 'n' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 333 error C2825: 'boost::iterator_adaptor<Derived,Base,Value,Traversal,Reference>::super_t': must be a class or namespace when followed by '::' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 error C2039: 'difference_type' : is not a member of '`global namespace'' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 error C2146: syntax error : missing ';' before identifier 'distance_to' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 error C2238: unexpected token(s) preceding ';' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 error C2143: syntax error : missing ';' before '<end Parse>' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 error C4430: missing type specifier - int assumed. Note: C++ does not support default-int boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 warning C4183: 'distance_to': missing return type; assumed to be a member function returning 'int' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 350 error C2334: unexpected token(s) preceding ':'; skipping apparent function body boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 363 error C2760: syntax error : expected '{' not ';' boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 364 error C1075: end of file found before the left brace '{' at 'pstsdk\0.3.0\include\pstsdk\ndb\node.h(39)' was matched boost\1.44.0\include\boost\iterator\iterator_adaptor.hpp 365 ---------------- The project builds without any errors under VS 2008. Is 1.44 too old to use in VX 2012? I know that Microsoft has changed some of the underlying libraries, so do I need 1.51? Thanx for any help! Mike ---- Michael D Boucher Connected development Autonomy, an HP Company Tel: 508-808-7590 E-mail: michael-d.boucher(a)hp.com<mailto:michael-d.boucher@hp.com> Visit www.autonomy.com<http://www.autonomy.com/>

3 3

[Pool] Use singleton_pool in struct
by Claude 12 Oct '12

12 Oct '12

Hi! I have a problem with singleton_pool when I use it into a struct. I think that this problem is my bad knowledge of C++ and not a problem of boost pool. #include <iostream> #include <boost/pool/pool_alloc.hpp> using namespace std; struct data { int a,b; char name[50]; }; struct MyOrderTag {}; typedef boost::singleton_pool<MyOrderTag,sizeof(data)> poolMemory; struct myStruct { struct MyOrderTag {}; typedef boost::singleton_pool<MyOrderTag,sizeof(data)> poolMemory; }; int main() { data *d = (data*)poolMemory::malloc(); //This is ok myStruct ms; // data *d1 = (data*)ms.poolMemory::malloc(); //Error! d->a = 2; poolMemory::release_memory(); return 0; } I obtain a compiler error on row: data *d1 = (data*)ms.poolMemory::malloc(); The poolMemory in struct is only a typedef and not a struct field. How can I use a singleton_pool into a struct? -- View this message in context: http://boost.2283326.n4.nabble.com/Pool-Use-singleton-pool-in-struct-tp4636… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

[coroutine] new versions
by Oliver Kowalke 12 Oct '12

12 Oct '12

I've uploaded two re-factored versions - I think most of the suggestions from the review are implemented (namespace is not corrected and documentation not updated yet). 1.) http://ok73.ok.funpic.de/boost-coroutine-self.zip 2.) http://ok73.ok.funpic.de/boost-coroutine-coro.zip Version 1) requires that coroutine-fn has only one argument == coroutine<>::self_t. Other arguments are accessed via coroutine<>::self_t::get< int >() and results via coroutine<>::get(). interface provides input/output iterators. typedef coroutine< int( int, int> > coro_t; int fn( coro_t::self_t & c) { int x = c.get< 0 >(); int y = c.get< 1 >(); c.yield( x +y); ... } coro_t coro( fn); int res = c( 3, 7).get(); Version 2) requires that coroutine-fn has only one argument too == coroutine<> with inverted signature. Other arguments are access via coroutine<>::get(). interface provides input/output iterators. typedef coroutine< int( int, int> > coro_t; int fn( coroutine< tuple< int, int >( int) & c) { int x = c.get().get< 0 >(); int y = c.get().get< 1 >(); c( x +y); ... } coro_t coro( fn); int res = c( 3, 7).get(); Both implementations are not optimized - I think we should get a small and clean interface first. Comments? regards, Oliver

3 4

[interprocess] error sending message
by Ian Esten 12 Oct '12

12 Oct '12

Hi all, I've got a problem using boost::interprocess::memory_queue on Windows - when trying to call send(), I get a null pointer returned by free_msg. This is because there is an offset_ptr with an offset of 1 at the requested location, causing null to be returned. An exception is then thrown with the message "boost::interprocess::message_queue corrupted". Here is a brief summary of my two applications: Application 1: - a Windows service - creates two message queues, messagesToApplication and messagesToService - creates a thread that waits for messages in messagesToService Application 2: - a Windows application - opens the two message queues, with open_only. - tries to send a message to Application 1, the Windows service after it opens the message queues. Everything works right up until application 2 tries to send a message via messagesToService. I haven't yet been able to identify why the offset_ptr has an offset of 1. If anybody has any suggestions as to what I might be doing wrong, I'd very much appreciate it! Thanks, Ian

2 2

BOOST_FOREACH prevent 100% code coverage.
by Marcin Zawadzki 12 Oct '12

12 Oct '12

Hi, I'm using BOOST_FOREACH in my code. And because it's macro so the whole code behind the macro is inserted in place where it's used. So finally when generating code coverage using gcc/gcov for my file it says that I have not covered branches in line with BOOST_FOREACH. And the question is - is it possible to somehow exclude BOOST_FOREACH form coverage results? Thanks, Marcin

2 1

Get patch to boost/property_tree/detail/json_parser_write.hpp included in release?
by Shane Turner 11 Oct '12

11 Oct '12

Is there any chance that patch to boost/property_tree/detail/json_parser_write.hpp provided in https://svn.boost.org/trac/boost/ticket/5598 could be included in the latest release? It would save me from having to manage the patch in our development environment. Thanks, Shane Turner -- Shane Turner Senior Software Developer phone +1 (902) 406--8375 x1008 email Shane.Turner(a)NewPace.ca <mailto:Shane.Turner@newpace.ca> aim <aim:GoIm?screenname=Shane.Turner@newpace.ca>/msn <msnim:chat?contact=Shane.Turner@newpace.ca> Shane.Turner(a)NewPace.ca <aim:GoIm?screenname=Shane.Turner@newpace.ca> skype saturnjct <skype:saturnjct>

1 0

[smart_ptr] forward instead of including shared_ptr.hpp
by Rune Lund Olesen 11 Oct '12

11 Oct '12

Hello all Anyone got an opinion on this. I looked in boost, and there doesn't seem to be forwards for this. Suppose I am writing my .h file, instead of including shared_ptr.hpp i could just forward it using the following: namespace boost { template <class T> class smart_ptr<T>; } My concern is compilation time, as im going to do this in 1000+ .h files. If, in the user code, the function returning smart_ptr is not used, this could save some compilation time, but then again is that enough to justify a forward ? Regards Rune

1 0

Re: [Boost-users] [CMake] [boost][b2] Differenciate 32bit and 64 bit binaries when using CMake.
by Klaim - Joël Lamotte 11 Oct '12

11 Oct '12

Júlio Hoffimann said: > > I don't know if i understood correctly, but you can set the library > directory by hand, please refer to > /usr/share/cmake-<version>/Modules/FindBoost.cmake, in particular the > variable BOOST_LIBRARYDIR. On Thu, Oct 11, 2012 at 1:29 PM, Miller, Frank <FMiller(a)sjm.com> wrote: > A simple solution would be to install only the 64bit version of boost > into a new directory and change the environment variable to point there. > Then FindBoost will only be able to see the version you want. > Thanks, this will solve my immediate problem, but it don't solve it in general. (I will use it though, so thanks) I can't guarantee where the boost libraries are installed for other developers of my project, that's why I use FindBoost. My current understanding is that boost don't have a specific default lib dir for different address models, which is the source of the problem as FindBoost script can't rely on a protocol to find these lib files. Am I correct? Joel Lamotte

1 0

[boost][CMake][b2] Differenciate 32bit and 64 bit binaries when using CMake.
by Klaim - Joël Lamotte 11 Oct '12

11 Oct '12

I am having a problem with b2 on Windows using Visual Studio (2010 & 2012 but it is irrelevant): Until now I was building boost with b2 in a way that would first build 32 bit version in the default library directory, then the 64bit version in lib/64 . I wasn't using the 64bit version until this morning so I didn't get any problem whatever my use of boost was. I often use Cmake these days and I set the boost environment variables for FindBoost CMake script to find it. My problem is that I'm trying now to use the 64 bit version now and CMake FindBoost script will only find the 32 bit version. CMake correctly assume that the library files in the lib directory are the one to use, however it have no apparent way to find if it is for 64 or 32 bit. Now I'm not sure how to fix this. I see two solutions but I don't see how to apply them: 1. make b2 generate lib and dll files with an additional indication on if it's 64 or 32 bit address model. I didn't find such option in b2 --help so I assume that it is not possible? 2. find a way for CMake FindBoost to automatically find the 64 bit binaries instead of the 32 bit binaris. I don't see a clear solution to achieve this, because it depends a lot on how boost have been compiled. Note: I don't want to use a default boost installation, I want to use my custom build. Any advice on how I should proceed? Thanks for your patience. Joel Lamotte

2 1

[boost::filesystem] Getting the uid or gid of a file
by Avishay Orpaz 11 Oct '12

11 Oct '12

The filesystem library does not include any function to access the uid and gid of a file. Is there other way than calling the native stat()? Avishay

1 0

[mpi] Collectives on intercommunicator ?
by Alain O Miniussi 11 Oct '12

11 Oct '12

Am I correct in assuming that collective communications are not supported with Boost.MPI intercommunicators ? Thanks -- Alain Miniussi Responsable Tech. Centre de Calcul Haute Performance Observatoire de la Côte d'Azur - BP 4229 - 06304 Nice Cedex 4 tel: +33 4 92 00 30 09 https://crimson.oca.eu

2 2

Asio and ZeroMQ
by Matthias Vallentin 11 Oct '12

11 Oct '12

A while ago, Maciej Gajewski started an effort to use Asio to observe a ZeroMQ socket [1]. Based on his code, I put together a thin library that wraps the implementation details. Since other have requested a working example, here it is now at github: https://github.com/mavam/bmq Any feedback is highly appreciated. A basic usage example looks like this: #include <boost/asio/io_service.hpp> #include <bmq.h> int main() { boost::asio::io_service io; bmq::context ctx(1); bmq::component c(ctx, io); auto sink = c.add_sink(ZMQ_PAIR, "inproc://x"); c.subscribe(sink, [](bmq::message&& msg) { std::string str(static_cast<char*>(msg.data()), msg.size()); std::cout << str << std::endl; }); auto source = c.add_source(ZMQ_PAIR, "inproc://x"); bmq::message msg(const_cast<char*>("foo"), 3, nullptr); source->send(msg); // Execute message handler. io.poll(); return 0; } At this point, the library is really thin and only provides very rudimentary wrapping of ZeroMQ. In the future, I plan to extend it in order to facilitate applications that build on message-passing. The dataflow abstraction I envision is essentially a directed graph, where nodes represent components and edges communication links. 0mq provides the edges and the Asio handles asynchronous event processing at the component level. The motiviation is that this model lends itself well for scaling out distributed systems over large clusters. Matthias [1] http://permalink.gmane.org/gmane.network.zeromq.devel/9538

4 4

[1.52.0] Beta release candidates available
by Marshall Clow 10 Oct '12

10 Oct '12

Release candidate files for 1.52.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: 61a852c923c7e27d84fd2e6336d787f2 *boost_1_52_0_beta1_rc1.tar.gz 956fb476326ee634225c683612493fdd *boost_1_52_0_beta1_rc1.tar.bz2 703663eca3122152031c5555e26845c0 *boost_1_52_0_beta1_rc1.zip b277b6f36ead9df9a0754c868956f30c *boost_1_52_0_beta1_rc1.7z Thanks, --The release managers

4 10

[boost test] spelling error
by Ovanes Markarian 09 Oct '12

09 Oct '12

Can you please fix the spelling error in http://www.boost.org/doc/libs/1_51_0/libs/test/doc/html/tutorials/new-year-… BOOST_AUTO_EST_CASE( constructors_test ) Should be BOOST_AUTO_TEST_CASE This error is in both code snippets. Regards, Ovanes

2 1

Multiple Versions of Boost in the Same Executable
by Aaron_Wright＠selinc.com 09 Oct '12

09 Oct '12

I have a large executable that loads shared libraries as plugins. Some of those shared libraries dynamically link with an old boost version that's part of the system (/usr/lib) when they are loaded. I want to build my own plugin shared library, but I want to use a newer boost version. I tend to link boost in statically. My question is, will it cause any issues if I create a shared library that is statically linked with a newer version of boost, and have it loaded by the same executable that is dynamically linked with an old version of boost? I hoping this'll work, as I can't upgrade the system boost very easily. --- Aaron Wright

3 3

boost::bind issues
by Littlefield, Tyler 09 Oct '12

09 Oct '12

Hello all: I'm trying to boost::bind a couple of callbacks and was getting errors; could someone help me figure out what's going on? First, the errors: 19:22:36: Compiling staticObject.cpp. staticObject.cpp: In constructor â€˜StaticObject::StaticObject()â€™: staticObject.cpp:20:143: error: no matching function for call to â€˜OlcStringEntry::OlcStringEntry(std::string, int, boost::_bi::bind_t<std::basic_string<char>, boost::_mfi::cmf0<std::basic_string<char>, BaseObject>, boost::_bi::list1<boost::_bi::value<StaticObject*> > >, boost::_bi::bind_t<void, boost::_mfi::mf1<void, BaseObject, const std::basic_string<char>&>, boost::_bi::list2<boost::_bi::value<StaticObject*>, boost::arg<1> > >)â€™ staticObject.cpp:20:143: note: candidates are: In file included from staticObject.h:7:0, from staticObject.cpp:5: olc.h:48:3: note: OlcStringEntry::OlcStringEntry(const string&, FLAG, StringGetter&, StringSetter&) olc.h:48:3: note: no known conversion for argument 3 from â€˜boost::_bi::bind_t<std::basic_string<char>, boost::_mfi::cmf0<std::basic_string<char>, BaseObject>, boost::_bi::list1<boost::_bi::value<StaticObject*> > >â€™ to â€˜StringGetter& {aka boost::function<std::basic_string<char>()>&}â€™ olc.h:42:7: note: OlcStringEntry::OlcStringEntry(const OlcStringEntry&) olc.h:42:7: note: candidate expects 1 argument, 4 provided now, here's how I call it: AddOlc(new OlcStringEntry(std::string("name"), OF_NORMAL, boost::bind(&BaseObject::GetName, this), boost::bind(&BaseObject::SetName, this, _1))); baseobject's relevant methods look like: virtual std::string GetName() const; virtual void SetName(const std::string &s); and the relevant tidbits from olc.h: typedef boost::function<std::string()> StringGetter; typedef boost::function<void (const std::string&)> StringSetter; and OlcStringEntry's ctor looks like: OlcStringEntry(const std::string &name, FLAG flag, StringGetter& get, StringSetter& set); Any info here would be appreciated. Thanks, -- Take care, Ty http://tds-solutions.net The aspen project: a barebones light-weight mud engine: http://code.google.com/p/aspenmud He that will not reason is a bigot; he that cannot reason is a fool; he that dares not reason is a slave.

2 1

CSR graph and Dijkstra's to lower graph memory
by jer.k 08 Oct '12

08 Oct '12

Hello, This is my first post and I'm very new to BOOST, so please let me know if I have missed some of the mailing list etiquette :) When I run Dijkstra's on my graph, I quickly run out of memory and I'm trying to find ways to lower the memory needed to store the graph. My graphs has around ~3,600,000 nodes and ~580,000,000 edges (I will eventually need a graph at least 5x this number - more if possible). I only store a weight (double) at each edge (I don't need to store any information at each node) and find that while this only takes about 1.5 hrs to run, this takes up around ~95GB (I have access to a cluster so I can run these high memory jobs). I use an adjacency_list to store this graph. typedef adjacency_list < setS, vecS, undirectedS, no_property, property < edge_weight_t, double > > graph_t; My two questions are: 1) Is this a reasonable amount of memory to expect a graph of this size using an adjacency_list? Or am I doing some terribly wrong? This is much more memory needed than I expected. 2) From what I understand, the compressed sparse row (CSR) graph is a possible solution to lowering the memory requirements as I know the number of edges and the number of nodes prior to forming the graph. I've been going through the documentation and I followed this tread <http://boost.2283326.n4.nabble.com/Graph-On-Dijkstra-SSSP-performance-td444…> which had an example of using a CSR instead of an adjacency_list and running Dijkstra's. However I can't seem to get the last step (last reply by Jeremiah Willcock) of > "plus adding the weight map parameter explicitly > to the call to dijkstra_shortest_paths_no_color_map" to work successfully. I guess I'm not sure how to add the weigh map parameter to the Dijkstra's call. The following is the relevant code dealing with edge weights. ======= ... struct Edge_Cost { double weight;}; // Needed for bundled properties. Edge_Cost *edgeCosts = new Edge_Cost[2]; // Add 3 edges costs. edgeCosts[0].weight = (2.0); edgeCosts[1].weight = (5.2); edgeCosts[2].weight =(3.33); ... typedef compressed_sparse_row_graph<directedS, WebPage, // From the example docs on CSR Edge_Cost // The struct. > graph_t; graph_t g(boost::edges_are_unsorted, &the_edges[0], &the_edges[0] + numEdges, edgeCosts, // Add the weights here??? numNodes); ... boost::dijkstra_shortest_paths(g, // The graph. s, // VertexDescriptor - the source vertex. &p[0], &d[0], edgeCosts, // <--- WHAT DO I PUT HERE?? indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0, default_dijkstra_visitor() ); ======= When I run this, I get several errors, the first is: error C2664: 'boost::get' : cannot convert parameter 2 from 'boost::detail::csr_edge_descriptor<Vertex,EdgeIndex>' to 'ptrdiff_t' c:\boost_1_49_0\boost_1_49_0\boost\graph\dijkstra_shortest_paths.hpp 162 I might be totally off here so please let me know :) Thanks! - Jeremy -- View this message in context: http://boost.2283326.n4.nabble.com/CSR-graph-and-Dijkstra-s-to-lower-graph-… Sent from the Boost - Users mailing list archive at Nabble.com.

4 9

Determining whether a key already exists in a labeled graph
by eric 08 Oct '12

08 Oct '12

Is there a way to tell if a labeled graph already contains a key? As I'm constructing my graph from database data, I would like to check whether a node's parent already exists, and if not create it. -- View this message in context: http://boost.2283326.n4.nabble.com/Determining-whether-a-key-already-exists… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Linking problem - boost 1.51
by Daniel Santos 07 Oct '12

07 Oct '12

Dear list, I'm starting with boost (Boost.Asio) and I'm following the tutorial available at Boost.Asio web-page. I'm stuck at part 5 (Timer.5) because I'm getting the following linker error: *timer_5.cpp:(.text+0xb3): undefined reference to `boost::thread::~thread()' * *timer_5.cpp:(.text+0xe1): undefined reference to `boost::thread::~thread()' * *collect2: error: ld returned 1 exit status* I'm linking boost_system, boost_thread and pthread (I compiled the boost libraries and at some point I thought that I was including .hpp files from a different version of the libraries but I specified the paths of both .hpp and libraries and the problem remains). The system runs GNU/Linux 64bits (Fedora 17) with GCC 4.7.2 and boost 1.51.0. Any idea? Thanks i advance, -- Daniel

2 4

[Sandbox - endian] Why is endian still in sandbox?
by Nathaniel J Fries 07 Oct '12

07 Oct '12

A fairly novel (at least when put up against more intricate labours like asio, filesystem, and their like) project which appears to be finished and would be a very useful companion to existing libraries sits in the sandbox. Is there a reason for this?

3 3

[exception,serialization] transporting exceptions
by Brian Budge 05 Oct '12

05 Oct '12

Hi all - I like that boost::exception provides a mechanism to copy exceptions. This can be used to transport an exception across thread boundaries, which is nice. I'm running a program that can optionally start nodes using MPI to do back-end computations. I'd like to be able to "copy" the exception from one node to another. Are there any existing tools for something like a serialization of these kinds of exceptions? In non-MPI mode, I'd like to transport the exception across thread boundaries, pass it through some functions (causing actions to be taken along the way), and then finally to rethrow the exception. In MPI mode I want all of that PLUS, in place of one of the function calls, I'd like to transport the exception across MPI in some way. Are there any semi-automatic tools already in existence that will get me this (or close)? Or do I need to implement boost serialization for my entire exception hierarchy? If I do the latter, it seems I will need to operator new the exception, and will not easily be able to know when I can delete in a catch? Thanks, Brian

2 3

Trouble w/ fruchterman-reingold
by eric 05 Oct '12

05 Oct '12

I'm seeing a weird problem in fruchterman_reingold.hpp that after the displacements are calculated for every vertex, it gets down to the loop where it updates the positions (starting on line 327), and all the displacements are (0,0) by that point (they had been sensible values up in the calculation loop). Any idea what I could be doing to cause that? Here is my code: struct spring_attractive_force { template<typename Graph, typename T> T operator()(typename graph_traits<Graph>::edge_descriptor, T k, T d, const Graph&) const { return d; } }; struct magnetic_repulsive_force { template<typename Graph, typename T> T operator()(typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, T k, T d, const Graph&) const { return 1 / (d * d); } }; typedef adjacency_list<listS, listS, undirectedS, // Vertex properties property<vertex_index_t, int, property<vertex_position_t, point> >, // Edge properties property<edge_weight_t, double> > Graph; enum {A, B, C, D, E, F, G, H}; simple_edge triangular_edges[14] = { {A, B}, {B, C}, {C, A}, {D, E}, {E, F}, {F, G}, {G, H}, {H, D}, {D, F}, {F, H}, {H, E}, {E, G}, {G, D} }; Graph g(&triangular_edges[0], &triangular_edges[13], 8); // Generate (x,y) coordinates for every node // - Randomly layout vertices of graph minstd_rand gen; rectangle_topology<> rect_top(gen, -25, -25, 25, 25); random_graph_layout(g, get(vertex_position, g), rect_top); // - Run Fruchterman Reingold algorithm on them typedef square_topology<> Topology; Topology topology(gen, 50.0); fruchterman_reingold_force_directed_layout(g, get(vertex_position, g), topology, attractive_force(spring_attractive_force()). repulsive_force(magnetic_repulsive_force()). force_pairs(all_force_pairs()). cooling(linear_cooling<double>(100))); -- View this message in context: http://boost.2283326.n4.nabble.com/Trouble-w-fruchterman-reingold-tp4636494… Sent from the Boost - Users mailing list archive at Nabble.com.

2 13

link errors with boost serialization
by xavier 05 Oct '12

05 Oct '12

I have just built boost_1_51_1 with no problems on linux redhat 5.5 64-bit machine However, when i try to link a program that uses the g++ client_test.o -rdynamic -L/opt/boost_1_51_0/stage/lib -lboost_serialization -lboost_wserialization -o client_test it gives the following error: client_test.o: In function `boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()': client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEC1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()]+0x12): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::extended_type_info_typeid_0()' client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEC1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()]+0x27): undefined reference to `boost::serialization::extended_type_info::self_register()' client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEC1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::extended_type_info_typeid_1()]+0x3a): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0()' client_test.o: In function `boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()': client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionED0Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()]+0x1d): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0()' client_test.o: In function `boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()': client_test.cpp:(.text._ZN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionED1Ev[boost::serialization::detail::extended_type_info_typeid_1<gps_position const>::~extended_type_info_typeid_1()]+0x1d): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0()' client_test.o:(.rodata._ZTVN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEE[vtable for boost::serialization::detail::extended_type_info_typeid_1<gps_position const>]+0x10): undefined reference to `boost::serialization::detail::extended_type_info_typeid_0::less_than(boost::serialization::extended_type_info const&) const' client_test.o:(.rodata._ZTIN5boost13serialization6detail27extended_type_info_typeid_1IK12gps_positionEE[typeinfo for boost::serialization::detail::extended_type_info_typeid_1<gps_position const>]+0x10): undefined reference to `typeinfo for boost::serialization::detail::extended_type_info_typeid_0 What could be causing the problem ? -- View this message in context: http://boost.2283326.n4.nabble.com/link-errors-with-boost-serialization-tp4… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Boost TraitsType Question
by Rawate, Vishal CIV NAVAIR-WD-5-2-7-1-1-0-E., 527110E 04 Oct '12

04 Oct '12

Hello, I am writing a function using templates in C++.I want to find the type of variable that is being to the function. I was wondering if I could use the Boost TypeTraits library or is there another library that I can use. I would highly appreciate any help. Thanking in advance. Vishal CodeSnipet: Template<typename T> Void setTag(T myVariable) { If(T == short) { Do something; } If(T == long) { Do something; } }

4 5

[Review Report] ODEInt accepted
by Steven Watanabe 04 Oct '12

04 Oct '12

AMDG The review of the ODEInt library submitted by Mario Mulansky and Karsten Ahnert ended last Friday. Many thanks to everyone who participated in this review. The library is ACCEPTED into Boost unconditionally. Summary: 7 ACCEPT 1 ABSTAIN Reviews: http://lists.boost.org/Archives/boost/2012/09/196733.php http://lists.boost.org/Archives/boost/2012/09/196882.php http://lists.boost.org/Archives/boost/2012/09/196883.php http://lists.boost.org/Archives/boost/2012/10/196966.php http://lists.boost.org/Archives/boost/2012/10/196965.php http://lists.boost.org/boost-users/2012/09/76089.php http://lists.boost.org/boost-users/2012/09/76058.php http://lists.boost.org/boost-users/2012/09/76069.php Other comments: http://lists.boost.org/Archives/boost/2012/09/196756.php The reviews were overwhelmingly positive. Most reviewers were satisfied with the library documentation and interfaces. Issues: These were points brought up by reviewers. The authors are free to accept or reject any of these at their discretion. - A number of minor documentation corrections. - Automatically deduce the correct algebra from the state type. - Use a default initial step size. - Allow breaking out of the algorithms In Christ, Steven Watanabe

2 1

Re: [Boost-users] [odeint] Can odeint integrate a 2-dimensional function?
by Karsten Ahnert 04 Oct '12

04 Oct '12

On 10/04/2012 03:28 PM, Rob Conde wrote: > Say I have an equation that is a function of x and y...can I use odeint to > integrate this function over a 2-d region (i.e. a square or a circle, etc.)? > If so, are there any examples of this? I don't think this is possible. This sound like integration of a known function. Odeint is devoted to solve ordinary differential equations. Karsten

2 1

[process] how to suggest bugs/fixes for boost.process?
by Brian Budge 04 Oct '12

04 Oct '12

Hi all - I've started using boost.process despite the fact that it is not an official boost library. I've founds some cases that don't compile or give warnings, and I'd like to log a bug with possible fixes somewhere. Given that the library is not officially in boost, how should I go about this? Thanks, Brian

3 2

Moving an std::string into a boost::thread in C++03
by Adi Shavit 04 Oct '12

04 Oct '12

Hi, I'm using boost 1.51 on multiple platforms and compilers without C++11. In my main thread, I have a very long, expensive to copy, std::string veryLongString, that I need to pass to a new thread for processing. After the new thread is created I have no more use for veryLongString, hence I'd like to *move *it into the boost::thread ctor. Obviously, if veryLongString was created as a shared_ptr<std::string> then I could just *copy* the shared_ptr into the thread ctor, but it wasn't, so I'd need to copy it anyway. How can I [boost::]move() veryLongString into the boost::thread ctor (probably using via boost::bind)? Is this possible? Thanks, Adi

3 3

Re: [Boost-users] [asio] Custom asynchronous service
by Marat Abrarov 04 Oct '12

04 Oct '12

Hi Acer, > I would like to adapt my class to asio for offering > async_do_something(param, callback) interfaces. http://sourceforge.net/projects/asio-samples/ especially (SVN): https://asio-samples.svn.sourceforge.net/svnroot/asio-samples/trunk/include… https://asio-samples.svn.sourceforge.net/svnroot/asio-samples/trunk/include… or https://asio-samples.svn.sourceforge.net/svnroot/asio-samples/trunk/include… https://asio-samples.svn.sourceforge.net/svnroot/asio-samples/trunk/include… > After reading examples presented in asio/examples/services/ and some asio > source code. > > I found the example does not do invoke callback stuff (e.g. > asio/examples/service/logger_service.cpp). > > In case of asio source code, there are classes such as > detail::wait_handler<> that wrap user callbacks for invoked later. It's not a wrapper for deferred invocation. Here's my implementation of handler parking (Asio custom memory allocation and custom invocation strategy are supported): https://asio-samples.svn.sourceforge.net/svnroot/asio-samples/trunk/include… Regards, Marat Abrarov.

1 0

[BGL] vecS for vertex container and vertex index adjustments
by Sergey Mitsyn 03 Oct '12

03 Oct '12

Hi all, I know that while using vecS for vertices one has no vertex iterator stability upon removing vertices. But I have a question if there exists something like vertex _index_ stability. The documentation says that indices for vertices are automatically adjusted so that they are still in contiguous range, but it is not specified how it is done. Is it okay to assume that if a vertex with an index I is removed, then vertices with indices I have their indices decreased by one? The actual problem is removing all vertices meeting some condition. Is the following code ok? // traverse all vertices and remove those for which predicate // condition_to_remove_vertex returns true. // graph is adjacency_list<.., vecS, ...> vertex_iterator vi = vertices(graph).first, vi_end = vertices(graph).second; while (vi != vi_end) { if (condition_to_remove_vertex(vi, graph)) { vertices_size_type end_index = vertex_index[*vi_end] , vi_index = vertex_index[*vi]; remove_vertex_f(*vi, graph); // vi and vi_end are invalid --end_index; vi = vertices(graph).first + vi_index; vi_end = vertices(graph).first + end_index; // now vi and vi_end are valid again } else ++vi; } This way seems to be more effective than to start iteration again every time a vertex is removed. ------------ Sergey Mitsyn.

3 14

C++ (boost) library for serial port communication
by Alexander Dietz 03 Oct '12

03 Oct '12

Hi all, I wonder if there is a boost-library that enables easy and robust communication to a serial port, just as e.g. the python library pyserial does. Maybe there is a boost-library which can be used for those purpose instead of implementing my own C-style classes and functions? Thanks a lot, Alex

5 7

A couple of odeint questions
by Tiago Gehring 02 Oct '12

02 Oct '12

Hello, I've been using the odeint library for some time now - and I really like it, thanks for the great work! I know that the odeint library is currently being reviewed but I'm actually writing here to ask a couple of questions about my usage scenario, hope that I'm in the right place. My usage scenario involves neural networks where I have a set of n equations for the N neurons themselves and another m equations for all the M synapses (connections) where usually M >> N and the two sets of equations depends on each other. What I'm trying to do is to put all these N + M equations into one large system and to integrate them at once while also keeping the state vectors separated. This is because of the different dimensionality of the two sets of equations and because my intention is to later use OpenCL to do the calculations (which as I understand works better if you use something like a vexcl::multivector<double, M> + another vexcl::multivector<double N> and I don't see how to pack all of this in one large state vector); So my first question is: can I somehow "combine" two sets of state vectors into one thing or integrate two systems in parallel (synchronously)? I tried the former (one combined state object) and even defined my own combined algebra (a std::pair of std::vectors - later vexcl::multivectors) but then stumbled into problems with my value type (which I defined as a std::array<double, 2>). It seems that I have to define all possible mathematical and comparison operations for my pairs (arrays). And my second question: my problem involves integrating the system until one of the neurons fires - at which point it's state variable (membrane potential) jumps to a fixed value, i.e., I have a sharp discontinuity in the state variable. My way of dealing with this right now was to implement a custom integration function (based on the adaptive integration one) which has a built in function that checks if the threshold was reached at every integration step. When this happens I break the integration, reset the state of the neuron in question to the fixed value and start integrating again. I wonder if it's possible to solve this in an easier way... Is it possible for example to change the state on the fly and can the system handle discontinuities? (i.e. can I integrate without stopping each time a neuron fires). Thanks a lot, Tiago

2 2

lisp like operetor collection on well kown C++ data structure
by Niitsuma Hirotaka 02 Oct '12

02 Oct '12

I wrote scm2cpp.hpp https://github.com/niitsuma/scm2cpp.hpp/blob/master/scm2cpp.hpp scm2cpp.hpp is lisp like operetor collection on well kown C++ data structure lisp function car cdr cons list-ref set-car! .. etc can use for std::vector std::list boost::ptr_list boost::fusion::list and std::pair is regard as cons example usage https://github.com/niitsuma/scm2cpp.hpp/blob/master/usage.cpp https://github.com/niitsuma/scm2cpp.hpp/blob/master/list-test.cpp Also eq? eqv? equal? quote symbol functions are implemented. plz see usege https://github.com/niitsuma/scm2cpp.hpp/blob/master/equal-test.cpp eq? function implimeted as direct addrest comparison template<typename T> bool is_eq(T & x, T & y) {return (&x)==(&y);} thus cons(T, std::list<T>) becomes boost::ptr_list<T> All lisp like operator keep same address for same object.

1 0

[Build] configure files copied into stage directory
by Alexander Khomyak 01 Oct '12

01 Oct '12

Hi. I build library binaries from source using build system. And now the system copies dll and lib-files into stage directory. But I also need to copy pdb-files. How to configure the build system to do so? Regards, Alexander Khomyak

1 0

[ICL] Specific interval_map
by A G 01 Oct '12

01 Oct '12

Hello, I am trying to see whether I can use interval_map for my project. I was initially amazed with interval_map and thought this would be it, but then I have some doubts: I need a interval tree like interval_map, but the aggregated values have the following equivalent property: equal to the length of the interval it is aggregated with. An example: [0:3] -> 3 [4:8] -> 4 Then if I add the interval [2:5] with aggregated value 3 (step 1) to this container, this should end up with: [0:1] -> 1 [2:3] -> 1 [4:5] -> 1 [6:8] -> 2 which I would later need to change into (step 2) : [0:1] -> 1 [2:5] -> 3 ([2:3] and [4:5] are merged because what matter is the last inserted interval: [2:3]). [6:8] -> 2 I am not sure I can do step 1 in just overloading the operator+= over my aggregated values. Could you please confirm ? If so, is there any part of the library I can reuse to do this task (like a function overloading, but which one) or do I have to rewrite an ad-hoc insert-like method myself ? Thank you for your hints. BR, AG.

2 2

Video About Open Source Credit Rating Tool Using Boost
by Marc Joffe 30 Sep '12

30 Sep '12

I am looking for users and developers interested in collaborating on an open source sovereign rating model project. If you don't agree with your country's credit rating, here is a chance to do something about it! A video describing this project is available at http://www.youtube.com/watch?v=71d3FXCqKtY and a journal article explaining the rationale can be found at http://econjwatch.org/articles/rating-government-bonds-can-we-raise-our-grad e. The tool is available at http://www.publicsectorcredit.org/pscf.html. Source is posted at http://www.github.com/joffemd/pscf. The tool uses a Monte Carlo simulation which includes calls to Boost's normal and Cauchy random number generators. There are many opportunities for improvement upon the initial version. Please contact me if interested. Regards, Marc Joffe Public Sector Credit Solutions marc(a)publicsectorcredit.org

2 1

Re: [Boost-users] [Review] ODEInt review starts today, September 19, ends September 28
by Mario Mulansky 29 Sep '12

29 Sep '12

Hi Paul, thanks for your comments, I have just a quick note. > ... > Modern expression templates are de rigeur. Works with Boost.Units which > is a big plus. Also meshes > with Fusion and Arbitrary Precision types so will presumably work with > the recently accept > Multiprecision library. Yes, odeint works out-of-box with the Multiprecision library. I have checked this in the course of the multiprecision review process [1]. Best, Mario [1] http://lists.boost.org/Archives/boost/2012/06/194473.php

2 1

[Serialization] GCC Symbol Visibility
by drivehappy 29 Sep '12

29 Sep '12

I'm attempting to build the serialization library outside of the standard build mechanism for Boost. For the most part this works great, with the exception that the symbol visibility under GCC is not defined correctly - our compiler settings set visibility to "hidden". Snippets from boost/serialization/config.hpp: #define BOOST_SERIALIZATION_DECL(T) __declspec(dllexport) T ... #define BOOST_SERIALIZATION_DECL(T) __declspec(dllimport) T I believe there has been previous discussion on changing these to BOOST_SYMBOL_EXPORT and BOOST_SYMBOL_IMPORT respectively since the __declspec is MSVC specific (http://boost.2283326.n4.nabble.com/Questions-regarding-new-visibility-stuff…) Additionally a patch was suggested (https://svn.boost.org/trac/boost/ticket/2114) that I believe at the time covered all of the boost libraries with the same changes. It doesn't appear to have gotten into Boost.Serialization (at least as of 1.51). If it would save time I could provide a patch specifically for Serialization. Thanks.

2 1

Handling core dumps when process is holding boost interprocess lock
by Rajalakshmi Iyer 28 Sep '12

28 Sep '12

Hello, I am working on application where several multi-threaded processes are attempting to acquire a lock on the shared memory files managed via boost interprocess. It appears that if one of these processes dumps a core while holding a lock on the shared memory file, all the other processes end up waiting for this lock to be released. Any ideas on how this can be overcome? I want to ensure that when a process that is holding the lock dies, it should ensure that the lock is released. Thanks, Raj -- *Twitter: @Blismedia <http://twitter.com/#%21/blismobile> BlisMedia 32 Percy Street, London W1T 2DE www.blismedia.com <http://www.blismobile.com/>** *** <http://www.blismobile.com/>* ****[image: Follow on Twitter]* <http://twitter.com/#%21/blismobile>*[image: Blis Website]* <http://www.blismobile.com/> *This communication is from Blis Media Ltd, a company registered in England and Wales with registered number 06455773. Its registered office is 32 Percy Street, London W1T 2DE, United Kingdom.* * * *This communication contains information that is confidential and may also be privileged. It is for the exclusive use of the intended recipient(s). If you are not the intended recipient(s), please (1) notify info(a)blismedia.com<info(a)blismobile.com> by forwarding this email and delete all copies from your system and (2) note that disclosure, distribution, copying or use of this communication is strictly prohibited. Email communications cannot be guaranteed to be secure or free from error or viruses. All emails sent to or from a Blismobile email account are securely archived and stored by an external supplier. This email does not constitute a contractual agreement; such agreements are in specified contractual or Insertion Order (IO) form only and exclusively contain all the terms to which Blis Mobile Ltd will be bound. To the extent permitted by law, Blis Mobile Ltd does not accept any liability for use of or reliance on the contents of this email by any person save by the intended recipient(s) to the extent agreed in a contract or Insertion Order.* * * *Opinions, conclusions and other information in this email which have not been delivered by way of the business of Breeze Tech (UK) Ltd are neither given nor endorsed by it.*

2 1

Review of ODEInt
by Rhys Ulerich 28 Sep '12

28 Sep '12

Here is my review of the proposed ODEInt library... I'm abstaining on the yes/no library acceptance vote. > - What is your evaluation of the design? As a user, I can find my way around. Several particular nits appear in my miscellaneous comments section. I'm not convinced that the interfaces, which differ from many other ODE integration packages, are a marked improvement from those other packages (e.g. GSL, PETSc, Trilinos, SUNDIALS, etc). I think that adding more than classical use cases could be difficult, in particular IMEX schemes. In particular, my personal research code (a turbulence DNS platform requiring semi-implicit time advance for a hyperbolic PDE system) could not be retrofit into this framework. > - What is your evaluation of the implementation? I've not read through the implementation. > - What is your evaluation of the documentation? Fairly good on the whole. I wish the math more clearly appeared using display-style equations rather than inline text. One table appears repeatedly and many links are missing. The applications section is quite nice. > - What is your evaluation of the potential usefulness of the library? I think the collection of features are useful, but I'd not adopt this library over the GSL, PETSc's time steppers, or Trilino's Rythmos when working in C or C++. GSL's APIs are quite easy and have no learning curve. PETSc's steppers are very powerful and support many new, exotic schemes. Rythmos build atop clean C++ vector space abstractions from the rest of Trilinos. odeint-v2 doesn't seem to beat any of these three alternatives at their game nor does it feel like enough of a winning compromise to make it compelling to me. > - Did you try to use the library? With what compiler? Did you have any problems? No. > - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 45 minutes of reading. > - Are you knowledgeable about the problem domain? Somewhat. In conclusion, I'm thrilled to see someone put forward an ODE integration library for Boost but I feel the design doesn't address current application needs and best practices in many portions of the numerical PDE communities. That said, I applaud the authors' effort and I'm sure odeint-v2 will be useful for other folks. - Rhys P.S.: Miscellaneous, jumbled comments: Within the documentation, Table 1.1's stepper algorithm classes should link to the class. Ditto for lists of models within, e.g., http://headmyshoulder.github.com/odeint-v2/doc/boost_numeric_odeint/concept… Table 1.2 appears to duplicate Table 1.1 and should simply be linked. Ditto for Table 1.7. Stray < and > appear within the generated documentation, e.g. at http://headmyshoulder.github.com/odeint-v2/doc/boost_numeric_odeint/concept… sys.first(...) and sys.second(...) don't describe what's happening within the ImplicitSystem interface. sys.calculate_dxdt(...) and sys.calculate_dfdx(...) describe the operations involved. That they're called in some sequence shouldn't determine the names. Moreover, sometimes big gains can be made by simultaneously computing the Jacobian and the function evaluation in a single call. ImplicitSystem should be a System, but it's not. System should use a calculate_dxdt(...) method rather than operator(...) so that one has a hierarchy of system concepts. Similar naming concerns apply to the symplectic system concepts. In- versus out-of-place do_step(...) method signatures should differ by more than the method signatures. In my own codes I've used terminology like 'apply' and 'accumulate' and modeled the signatures off Level 1 and Level 2 BLAS calls. WRT ImplicitSystem, either providing or recommending some mechanism for finite differenced or complex-stepped Jacobians would be useful. Naming inconsistencies in the dense output schemes: bulirsch_stoer_dense_out vs rosenbrock4_dense_output Unclear if the design permits low storage Runge Kutta schemes, singly diagonally implicit.schemes, and other fun implicit-explicit things. E.g., there are IMEX schemes with different formal orders of accuracy for the implicit vs explicit portions of the scheme. Unclear if the design permits CFL-related maximum stable step sizes within f(u). The System interface would need to be adapted to have each method return maximum stable eigenvalue magnitudes for first and second order differential operators.` Rather than limiting implicit systems to folks using uBLAS matrices, it may be better to define the abstract operations a class would need to support to plug into the ImplicitSystem infrastructure. Especially because getting a uBLAS "wrapper" around an existing chunk of memory is quite a PITA and relies upon non-standard parts of the uBLAS (See, e.g., http://agentzlerich.blogspot.com/2009/10/boostublasshallowarrayadaptor.html) Why in http://headmyshoulder.github.com/odeint-v2/doc/boost_numeric_odeint/odeint_… are static_casts preferred to using constructors a la Value(2) / Value(3)?

2 1

[Review] ODEInt review starts today, September 19, ends September 28
by Steven Watanabe 28 Sep '12

28 Sep '12

AMDG The review of Karsten Ahnert and Mario Mulansky's ODEInt library starts today September 19th and will end on September 28. -------------------------------------- About the library: odeint provides routines for numerically solving Ordinary Differential Equations, a task heavily required when approaching scientific problems numerically. In odeint we have implemented the most common algorithms in a modern, generic way which provides several advantages over existing implementations. The main focus of odeint is to separate algorithms from the underlying basic computation unit. This allows for example to easily use the power of modern GPUs via CUDA or OpenCL to speed up computational heavy simulations. Features: - provides most of the standard algorithms, including step size control, dense ouput and extrapolation routines - symplectic routines for Hamiltonian systems - implicit routines based on boost::ublas (MTL4 in progress) - high level integrate functions - interchangeable computation backend with existing bindings to CUDA and OpenCL - native support of ODEs defined for complex values - support of Boost.Units in most of the algorithms - support of arbitrary precision types You can download the library and view the documentation here: zip: http://github.com/headmyshoulder/odeint-v2/zipball/master github: http://headmyshoulder.github.com/odeint-v2/ docs: http://headmyshoulder.github.com/odeint-v2/doc/index.html -------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? In Christ, Steven Watanabe

5 5