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

[test] Bluegene/Q issue: sigaltstack
by Ewart Timothée 14 Jul '14

14 Jul '14

Dear All, I already posted on the boost.test user mailing list, but as my question was to technical they forward me their ( http://lists.boost.org/boost-testing/2014/07/7692.php ) I installed/compiled boost on the BG/Q (with gcc provided by IBM) but I am confronted to a issue, the framework crashed (compute node) due to a call to the system function sigaltstack. >From my previous post, a boost user suggests me to disable a macro into execution_monitor.ipp line 176 https://github.com/boostorg/test/blob/boost-1.55.0/include/boost/test/impl/… If I disable this macro the framework works well. Into Boost, this macro is defined between a !defined # if !defined(__CYGWIN__) && !defined(__QNXNTO__) # define BOOST_TEST_USE_ALT_STACK # endif Should we add a C++ macro provided by the compiled to disable this define ? I give a list of the macro of GCC for the BG/Q #define __DBL_MIN_EXP__ (-1021) #define __FLT_MIN__ 1.17549435e-38F #define __CHAR_BIT__ 8 #define _ARCH_PPCGR 1 #define __PPC64__ 1 #define __WCHAR_MAX__ 2147483647 #define __GCC_HAVE_SYNC_COMPARE_AND_SWAP_1 1 #define __GCC_HAVE_SYNC_COMPARE_AND_SWAP_2 1 #define __GCC_HAVE_SYNC_COMPARE_AND_SWAP_4 1 #define __DBL_DENORM_MIN__ 4.9406564584124654e-324 #define __GCC_HAVE_SYNC_COMPARE_AND_SWAP_8 1 #define __FLT_EVAL_METHOD__ 0 #define __unix__ 1 #define __DBL_MIN_10_EXP__ (-307) #define __FINITE_MATH_ONLY__ 0 #define __GNUC_PATCHLEVEL__ 6 #define __DEC64_MAX_EXP__ 385 #define __SHRT_MAX__ 32767 #define __LDBL_MAX__ 1.79769313486231580793728971405301e+308L #define _ARCH_PPC 1 #define __UINTMAX_TYPE__ long unsigned int #define __linux 1 #define __DEC32_EPSILON__ 1E-6DF #define __CHAR_UNSIGNED__ 1 #define __LDBL_MAX_EXP__ 1024 #define __linux__ 1 #define __SCHAR_MAX__ 127 #define __DBL_DIG__ 15 #define __SIZEOF_INT__ 4 #define __SIZEOF_POINTER__ 8 #define __USER_LABEL_PREFIX__ #define __STDC_HOSTED__ 1 #define __LDBL_HAS_INFINITY__ 1 #define __FLT_EPSILON__ 1.19209290e-7F #define __LDBL_MIN__ 2.00416836000897277799610805135016e-292L #define __DEC32_MAX__ 9.999999E96DF #define __SIZEOF_LONG__ 8 #define __DECIMAL_DIG__ 33 #define __gnu_linux__ 1 #define __LDBL_HAS_QUIET_NAN__ 1 #define __GNUC__ 4 #define __FLT_HAS_DENORM__ 1 #define __SIZEOF_LONG_DOUBLE__ 16 #define __BIGGEST_ALIGNMENT__ 16 #define __DBL_MAX__ 1.7976931348623157e+308 #define __DBL_HAS_INFINITY__ 1 #define __DEC32_MIN_EXP__ (-94) #define __LDBL_HAS_DENORM__ 1 #define __DEC128_MAX__ 9.999999999999999999999999999999999E6144DL #define __DEC32_MIN__ 1E-95DF #define __DBL_MAX_EXP__ 1024 #define __DEC128_EPSILON__ 1E-33DL #define __LONG_LONG_MAX__ 9223372036854775807LL #define __SIZEOF_SIZE_T__ 8 #define __PPC__ 1 #define __SIZEOF_WINT_T__ 4 #define __bg__ 1 #define __GXX_ABI_VERSION 1002 #define __FLT_MIN_EXP__ (-125) #define __DBL_MIN__ 2.2250738585072014e-308 #define __LONGDOUBLE128 1 #define __LP64__ 1 #define __DEC128_MIN__ 1E-6143DL #define __REGISTER_PREFIX__ #define __DBL_HAS_DENORM__ 1 #define __NO_INLINE__ 1 #define __FLT_MANT_DIG__ 24 #define __VERSION__ "4.4.6" #define __BIG_ENDIAN__ 1 #define __powerpc64__ 1 #define __DEC64_EPSILON__ 1E-15DD #define __DEC128_MIN_EXP__ (-6142) #define __powerpc__ 1 #define unix 1 #define __SIZE_TYPE__ long unsigned int #define __ELF__ 1 #define __FLT_RADIX__ 2 #define __LDBL_EPSILON__ 4.94065645841246544176568792868221e-324L #define __SIZEOF_PTRDIFF_T__ 8 #define __DEC32_SUBNORMAL_MIN__ 0.000001E-95DF #define __FLT_HAS_QUIET_NAN__ 1 #define __FLT_MAX_10_EXP__ 38 #define __LONG_MAX__ 9223372036854775807L #define __DEC128_SUBNORMAL_MIN__ 0.000000000000000000000000000000001E-6143DL #define __FLT_HAS_INFINITY__ 1 #define __unix 1 #define __DEC64_MAX__ 9.999999999999999E384DD #define __CHAR16_TYPE__ short unsigned int #define __DEC64_MANT_DIG__ 16 #define __DEC32_MAX_EXP__ 97 #define _BIG_ENDIAN 1 #define linux 1 #define __LDBL_MANT_DIG__ 106 #define __DBL_HAS_QUIET_NAN__ 1 #define __WCHAR_TYPE__ int #define __SIZEOF_FLOAT__ 4 #define __DEC64_MIN_EXP__ (-382) #define __FLT_DIG__ 6 #define __INT_MAX__ 2147483647 #define __LONG_DOUBLE_128__ 1 #define __FLT_MAX_EXP__ 128 #define __DBL_MANT_DIG__ 53 #define __DEC64_MIN__ 1E-383DD #define __WINT_TYPE__ unsigned int #define __SIZEOF_SHORT__ 2 #define __LDBL_MIN_EXP__ (-968) #define __LDBL_MAX_10_EXP__ 308 #define __DBL_EPSILON__ 2.2204460492503131e-16 #define _LP64 1 #define __SIZEOF_WCHAR_T__ 4 #define __DEC_EVAL_METHOD__ 2 #define __INTMAX_MAX__ 9223372036854775807L #define __FLT_DENORM_MIN__ 1.40129846e-45F #define _CALL_AIX 1 #define __bgq__ 1 #define __CHAR32_TYPE__ unsigned int #define __FLT_MAX__ 3.40282347e+38F #define __SIZEOF_DOUBLE__ 8 #define __FLT_MIN_10_EXP__ (-37) #define _CALL_AIXDESC 1 #define __INTMAX_TYPE__ long int #define __DEC128_MAX_EXP__ 6145 #define __GNUC_MINOR__ 4 #define __DEC32_MANT_DIG__ 7 #define __DBL_MAX_10_EXP__ 308 #define __LDBL_DENORM_MIN__ 4.94065645841246544176568792868221e-324L #define __STDC__ 1 #define __PTRDIFF_TYPE__ long int #define __DEC64_SUBNORMAL_MIN__ 0.000000000000001E-383DD #define _ARCH_PPC64 1 #define __DEC128_MANT_DIG__ 34 #define __LDBL_MIN_10_EXP__ (-291) #define __SIZEOF_LONG_LONG__ 8 #define __LDBL_DIG__ 31 #define __GNUC_GNU_INLINE__ 1 We may add one of this to the framework to have a correct execution Cheers, ++t Timothée Ewart, Ph. D. http://www.linkedin.com/in/tewart timothee.ewart(a)epfl.ch<mailto:timothee.ewart@epfl.ch>

4 6

boost::asio
by imran sheikh 14 Jul '14

14 Jul '14

hi, I used the following piece of code after following your suggestions. Iam new to boost and even multi-threading When I ran this piece of code on my machine I found that for every run 4 threads are only used out of the pool. As I have 4 cores in my machine. Is it so?? #include<iostream>#include<boost/asio.hpp>#include<boost/thread.hpp>boost::atomic_int thrd_gen(0);voiddowork(inti){thread_local inttid =++thrd_gen;std::cout <<"hello";std::cout <<" thread ID :"<<tid <<"\n";}intmain(){boost::asio::io_service ioservice;boost::thread_group group;boost::optional<boost::asio::io_service::work>work(boost::asio::io_service::work{ioservice});for(size_ti=0;i<boost::thread::hardware_concurrency();i++){group.create_thread(boost::bind(&boost::asio::io_service::run,&ioservice));}std::cout <<"in main thread size="<<group.size()<<std::endl;for(inti =0;i <=5;++i){for(inti=0;i<5;i++){ioservice.post(boost::bind(dowork,10));}boost::this_thread::sleep_for(boost::chrono::milliseconds(600));std::cout <<"waking up\n";}work.reset();// allow threads to exitgroup.join_all();// await proper thread shutdown } Also, my application is time-sensitive and I need to do some time measures. If I use sleep my results will be incorrect. So, please suggest an alternative way to get notified when all the threads finish without using sleep. Thanks for your time on this

2 2

Fw: boost::asio
by imran sheikh 14 Jul '14

14 Jul '14

On Saturday, 12 July 2014 11:10 AM, "boost-users-owner(a)lists.boost.org" <boost-users-owner(a)lists.boost.org> wrote: ----- Forwarded Message ----- To post messages to the Boost Users mailing list, you will need to subscribe this e-mail address via the Boost mailing list web page at: http://lists.boost.org/mailman/listinfo.cgi/boost-users You will need to take this step even if you intend to post only through GMane or some other news gateway. In this case, you may wish to edit your subscription options to turn off mail delivery. On Friday, 11 July 2014 11:00 PM, imran sheikh <s.imran0508(a)yahoo.com> wrote: hi all, i am using boost::asio:: ioservice for the multi-threading in c++. i got stuck ...please see and help. code is like this, discription: > i am creating threadpool using ioservice. > creating threads 100. > in while (which is 5 times)loop at a time i want to post(posting at do work) 5 threads. > then i do work reset and like this.. >i print thread-id also problems:: >threadpool size is 100. > but at a posting time it didn't taking the 5 threads..when i printed a id its same for 5 thread > so its not executing in parallel..why? > i want to post five threads at a time(different threads means thread id is different must)..from threapool..and like this for whole while loop rotation..?????????????????????????? void dowork(int i) { std::cout<<"hello"<<std::endl; cout<<" thread ID :"<<boost::this_thread::get_id(); } int main() { int ch; int i; boost::asio::io_service ioservice; boost::thread_group threadpool; auto_ptr<boost::asio::io_service::work> work(new boost::asio::io_service::work(ioservice)); for(i=0;i<100;i++) { threadpool.create_thread( boost::bind(&boost::asio::io_service::run, &ioservice)); } ch=0; while(ch <= 5) { ch++; cout<<"in main"<<boost::this_thread::get_id()<<endl; for(i=0;i<5;i++) { ioservice.post(boost::bind(dowork,10)); } std::cout<<"size="<<threadpool.size()<<std::endl; work.reset(); ioservice.reset(); ioservice.run(); } } please give me suggestion.i got stuck with it.

2 5

Re: [Boost-users] [coroutine] Is there a max number of coroutines that can be created?
by José 12 Jul '14

12 Jul '14

2 1

1.56.0 beta 1 release candidates available for testing
by Marshall Clow 12 Jul '14

12 Jul '14

Release candidate files for 1.56.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: MD5 (boost-1_56_0b1_rc1.7z) = a23e0b5f503c82970c9754dbc8324256 MD5 (boost-1_56_0b1_rc1.tar.bz2) = c6c8486dde4375896f302bdfe1fd3d2f MD5 (boost-1_56_0b1_rc1.tar.gz) = 1042e97a9f354b7187326fa1f9eb313e MD5 (boost-1_56_0b1_rc1.zip) = 984a70feac785d908d8f75ea9d8d2158 Since this is the first post-git release, we are expecting some teething pains with this release. Please test extensively. Thank you. --The release managers

2 1

[uuid] stale 1.55 source/build
by Michael Powell 12 Jul '14

12 Jul '14

Hello, I'm not 100% positive, I downloaded stale source and/or binary build of boost 1.55, supposedly, but I am finding that tickets which were reported to have been included in that version are not in the build. I'll retrace my steps to find where that build came from, but I seriously question whether this build included the latest 1.55 code. i.e. uuid fixes, which I am finding are still happening in the download: Error 1 error C4996: 'std::_Swap_ranges': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' c:\program files (x86)\microsoft visual studio 12.0\vc\include\algorithm 925 1 xml and with reported fixes: https://svn.boost.org/trac/boost/attachment/ticket/9503/uuid.hpp This is not in the code that I have. i.e. typedef uint8_t value_type; typedef uint8_t& reference; typedef uint8_t const& const_reference; typedef uint8_t* iterator; typedef uint8_t const* const_iterator; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; versus: typedef uint8_t value_type; typedef std::array<value_type, static_size> data_type; typedef data_type::size_type size_type; typedef data_type::difference_type difference_type; typedef data_type::iterator iterator; typedef data_type::const_iterator const_iterator; typedef data_type::reference reference; typedef data_type::const_reference const_reference; in the reported patch. In two attempts to 1) build from source myself, 2) download read-built binaries, both have stale versions of source, without the reported patches. This is not the first time I've encountered such an issue, with the first being failure to build from source several weeks ago now at least. What with the Git submodule advances, could it be Git submodule(s) were not updated or something along those lines? Any thoughts? Recommendations where to find a reliable 1.55 build? Thank you... Best regards, Michael Powell

2 3

Re: [Boost-users] [coroutine] Is there a max number of coroutines that can be created?
by José 11 Jul '14

11 Jul '14

2 1

[coroutine] Is there a max number of coroutines that can be created?
by José 11 Jul '14

11 Jul '14

3 2

[logging] Setting log level works if set_filter called from main, but not if called from a function in a static library
by Hickman, Steve (AdvTech) 10 Jul '14

10 Jul '14

To make setting the log level at runtime easy, I created the following routine: -----Utiliites.hpp namespace Utilities { void setLogLevel(const std::string &level); }; ------Utilities.cpp ----- #include "Utilities.hpp" #include <boost/log/core.hpp> #include <boost/log/expressions.hpp> namespace logging = boost::log; #define SET_IF_LOG_LEVEL(lvlVar, levelVal) \ if (lvlVar.compare( #levelVal ) == 0) \ { \ logging::core::get()->set_filter \ ( \ logging::trivial::severity >= logging::trivial:: ## levelVal \ ); \ } void Utilities::setLogLevel(const std::string &level) { // default is debug std::string lvl = (level.length() > 0)?level:"debug"; Utilities::lowerCase(lvl); // just to make sure we're consistent if (lvl.compare("disabled") == 0) boost::log::core::get()->set_logging_enabled(false); SET_IF_LOG_LEVEL(lvl,trace); SET_IF_LOG_LEVEL(lvl,debug); SET_IF_LOG_LEVEL(lvl,info); SET_IF_LOG_LEVEL(lvl,warning); SET_IF_LOG_LEVEL(lvl,error); SET_IF_LOG_LEVEL(lvl,fatal); } -------------------main.cpp ------------------------------ #include <boost/log/core.hpp> #include <boost/log/expressions.hpp> namespace logging = boost::log; int main(int argc, char** argv) { if (argc > 1) { Utilities::setLogLevel(argv[1]); } //logging::core::get()->set_filter // ( // logging::trivial::severity >= logging::trivial::debug // ); BOOST_LOG_TRIVIAL(trace) << "Utilities unit test main starting " << std::endl; } ------------------------ Utilities.cpp is compiled as part of a static library that is linked to my main routine. If I call this function from my main routine, it appears to have no effect. I still get every logging message no matter what level I attempt to set. However, if I call logging::core::get()->set_filter() from my main routine (passing an appropriate level) it works as expected. I'm not certain what's happening here. Is it possible that logging::core::get() isn't actually dealing with a singleton? That the pointer returned by get() when called from my library is not the same as the pointer returned by the same call in my main routine? And, regardless of what is happening, how do I fix this? I'm using Visual Studio 2012 building Debug Win32 console application. Running on Windows 7 64bit. Steve Hickman System Architect, Flight Deck of the Future 480-236-8367

1 0

[log] , [smart_ptr] global logger declaration issues tons of warnings
by Valerii Valeev 10 Jul '14

10 Jul '14

Hello, global logger declaration as follows BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT(mylog_master, boost::log::sources::severity_logger<boost::log::trivial::severity_level>); issues a lots of warnings (see below) pointing to some smart_ptr code. If anyone could advice - does it look like my problem or something else – it would be greatly appreciated. Cheers, Valerii. Warning text: In file included from /usr/local/boost-1.55.0/include/boost/smart_ptr/make_shared_object.hpp:17, from /usr/local/boost-1.55.0/include/boost/log/sources/global_logger_storage.hpp:21, from /usr/local/boost-1.55.0/include/boost/log/common.hpp:24, from mylog.cpp:10: /usr/local/boost-1.55.0/include/boost/smart_ptr/detail/sp_forward.hpp: In function ‘T&& boost::detail::sp_forward(T&) [with T = const char*]’: /usr/local/boost-1.55.0/include/boost/smart_ptr/make_shared_object.hpp:218: instantiated from ‘typename boost::detail::sp_if_not_array<T>::type boost::make_shared(Arg1&&, Args&& ...) [with T = boost::log::v2s_mt_posix::sources::aux::logger_holder<boost::log::v2s_mt_posix::sources::severity_logger<boost::log::v2s_mt_posix::trivial::severity_level> >, Arg1 = const char*, Args = unsigned int, mylog_master::logger_type]’ /usr/local/boost-1.55.0/include/boost/log/sources/global_logger_storage.hpp:141: instantiated from ‘static boost::shared_ptr<boost::log::v2s_mt_posix::sources::aux::logger_holder_base> boost::log::v2s_mt_posix::sources::aux::logger_singleton<TagT>::construct_logger() [with TagT = mylog_master]’ /usr/local/boost-1.55.0/include/boost/log/sources/global_logger_storage.hpp:121: instantiated from ‘static void boost::log::v2s_mt_posix::sources::aux::logger_singleton<TagT>::init_instance() [with TagT = mylog_master]’ /usr/local/boost-1.55.0/include/boost/log/detail/singleton.hpp:45: instantiated from ‘static StorageT& boost::log::v2s_mt_posix::aux::lazy_singleton<DerivedT, StorageT>::get() [with DerivedT = boost::log::v2s_mt_posix::sources::aux::logger_singleton<mylog_master>, StorageT = boost::shared_ptr<boost::log::v2s_mt_posix::sources::aux::logger_holder<boost::log::v2s_mt_posix::sources::severity_logger<boost::log::v2s_mt_posix::trivial::severity_level> > >]’ /usr/local/boost-1.55.0/include/boost/log/sources/global_logger_storage.hpp:112: instantiated from ‘static typename TagT::logger_type& boost::log::v2s_mt_posix::sources::aux::logger_singleton<TagT>::get() [with TagT = mylog_master]’ ../../include/myproject/mylog.hpp:20: instantiated from here /usr/local/boost-1.55.0/include/boost/smart_ptr/detail/sp_forward.hpp:30: warning: returning reference to temporary mylog.hpp:20 is the line where global logger is declared: BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT(mylog_master, boost::log::sources::severity_logger<boost::log::trivial::severity_level>); And my platform / compiler: $ gcc -v Using built-in specs. Target: x86_64-redhat-linux Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=http://bugzilla.redhat.com/bugzilla --enable-bootstrap --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-gnu-unique-object --enable-languages=c,c++,objc,obj-c++,java,fortran,ada --enable-java-awt=gtk --disable-dssi --with-java-home=/usr/lib/jvm/java-1.5.0-gcj-1.5.0.0/jre --enable-libgcj-multifile --enable-java-maintainer-mode --with-ecj-jar=/usr/share/java/eclipse-ecj.jar --disable-libjava-multilib --with-ppl --with-cloog --with-tune=generic --with-arch_32=i686 --build=x86_64-redhat-linux Thread model: posix gcc version 4.4.7 20120313 (Red Hat 4.4.7-3) (GCC)

1 0

Limitations of BOOST_COROUTINES_V2 (pass by reference)
by Mueller-Roemer, Johannes Sebastian 09 Jul '14

09 Jul '14

Hi, aside from the fact that the new coroutines are - apparently intentionally - only unidirectional now (currently not much of an issue for me), I noticed that it is apparently no longer possible to yield values by reference as shown in the following example: #include <fstream> #include <string> #include <iostream> #include <boost/coroutine/all.hpp> using type = std::string; auto lines_from_file(char const * fname) -> boost::coroutines::coroutine<type>::pull_type { using namespace boost::coroutines; return coroutine<type>::pull_type{ [fname](coroutine<type>::push_type& yield) { std::string line; std::ifstream stream(fname); while(stream) std::getline(stream, line), yield(line); }, attributes(fpu_not_preserved) }; } int main(int, char**) { auto lines = lines_from_file("test.txt"); unsigned count = 0; for(auto& line : lines) std::cout << std::setw(4) << ++count << ": " << line << "\n"; } If one changes type to std::string const & the example no longer compiles. If I use the old BOOST_COROUTINES_V1 API boost::coroutines::coroutine<std::string const &()> works just fine. Is this limitation also intentional (why?) or is this an unintentional regression? Regards Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de

4 9

Boost.python with custom (Anaconda) python installation on Mac OSX
by Gianluca Meneghello 09 Jul '14

09 Jul '14

Dear all, Sorry for asking a probably basic question, I have been trying to use boost. python with Anaconda python (https://store.continuum.io/cshop/anaconda/) on Mac OSX without success. My current installation works with the standard OSX python, for example by running the test in boost_1_55_0/libs/python/example/quickstart using the following command: $/usr/bin/python test_extending.py where /usr/bin/python is the default OSX python. In contrast the command: $python test_extending.py where python is the custom Anaconda one fails with Trying: from extending import * Expecting nothing Fatal Python error: PyThreadState_Get: no current thread Abort trap: 6 I understand this is due to boost linking the wrong python --- i.e. the system python instead of the Anaconda one - -- but I cannot make up my mind on how to change this, despite the fact that the project-config.jam file created by bootstrap.sh seems to correctly point to the anaconda installation. Please let me know if I can provide more details. Thanks in advance for your help, gianluca

1 0

[ptr_container] usage of auto_type
by Olaf Peter 09 Jul '14

09 Jul '14

Hello, I have the following code fragment: typedef boost::ptr_vector<T> vector_t; typedef message_vector_t::auto_type auto_t; .... vector_t v; { auto_t x(new T) // do something with x v.push_back(x.release()); // here rise my question } according http://www.boost.org/doc/libs/1_53_0/libs/ptr_container/doc/examples.html #6 Do I have to release x all the time? E.g. I want to use it in the loop, where at the end I have to push_back the value, where for my understanding x goes out of scope and hence is released automatically. After studying the header, there is no push_back for auto_type (which is static_move_ptr), but for std::auto_ptr (which is imo deprecated in C++11) and T (which converts it into an auto_type again). Is it correct or do I miss something?

2 1

Wrapper to C++ Lists using Python Boost
by Kv Gopalkrishnan 09 Jul '14

09 Jul '14

Hi all I am relatively new to python boost and am trying to wrap a list of pairs using an iterator. In the Public section I have namespace sky{ class FindNextMask{ public: FindNextMask() {}; FindNextMask(int i):iter(i){} bool operator()(const pair<int,string>& p)const{ if (iter <= p.first) return true; else return false; } private: int iter; }; Then in another class say S class S { private: list<pair<int,string> > A; } I am unable to find a solution to this. Any help in this context would be appreciated. I know to write wrappers for pairs and vectors but I do not understand how to extend this to C++ lists and connect it with iterators and operators. class_<std::vector<std::pair<double, double> > >("VectorOfPairs") .def(vector_indexing_suite<std::vector<std::pair<double,double> > >()); class_<std::pair<double, double> >("DoublePair") // Wrapper for a pair only .def_readwrite("first", &std::pair<double, double>::first) .def_readwrite("second", &std::pair<double, double>::second); Kind Regards K.V.

1 0

boost::function performance issues with C++11
by 饭桶 09 Jul '14

09 Jul '14

Hi, Does anyone know why -std=c++11 causes so much difference on boost::function? I was planed to understand if there any performance issues with big size of parameters. So I wrote a function that takes a vector as parameter, like func2 shows. I know it's better to use a pointer or reference as function parameter. I just want to evaluate the performance, so let's keep the vector as parameter. However, I found that it's quite slow when compiled with -std=c++11. In detail, it takes 173874 milliseconds with C++11, while it takes 3676 seconds without C++11. About 50 times slower!! How can that be? In my opinion, I thought boost::function should had the same performance with std::function. So I decided to try std::function in C++11 directly, Finally, it takes about 29233 milliseconds. That's till 8 times slows! Can anyone tell me what happend here? int func2(std::vector<int> i){ total += i.size(); return i.size(); } const int T = 1000000; s = boost::chrono::system_clock::now(); for (int i = 0; i < T; ++i) call(boost::bind(&func2, v)); e = boost::chrono::system_clock::now(); In case you need to know my enviorment, my OS is Arch, compiler is gcc 4.9.0, and optimizations are default. The execution time (ms) of three versions I tried: boost::function with C++11 : 173874 boost::function without C++11 : 3676 std::function in C++11 : 29233 Any thoughts are appreciated! Thanks, Athrun

6 12

Determine if boost was compiled with c++11
by Chris Stankevitz 08 Jul '14

08 Jul '14

Hello, My project uses cmake, gcc with c++11 support, and boost compiled libraries. Apparently my project must use only boost libraries that were created with c++11. The consequences of not doing this are random crashes. Is there a way I can determine whether or not boost was compiled with a c++11 compiler? I would like to verify, at configure time, that a c++11 version of boost is being used. Thank you, Chris

1 0

Re: [Boost-users] DateTime without serialization
by Macumber, Daniel 08 Jul '14

08 Jul '14

Thanks John, BOOST_SERIALIZATION_NO_LIB worked for me. I assume that some include I am using was inadvertently triggering the auto link with serialization even though I was not using that functionality. Thanks for the help! Dan -----Original Message----- Date: Mon, 07 Jul 2014 18:27:00 +0100 From: John Maddock <boost.regex(a)virgin.net> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] DateTime without serialization Message-ID: <53BAD864.3090800(a)virgin.net> Content-Type: text/plain; charset=ISO-8859-1; format=flowed > Hello, I am using the DateTime library's to/from string > functionality but not the DateTime serialization > functionality. However, when I build my program boost > auto linking keeps trying to link against the serialization > library. Is there a way I can build and link against DateTime > without auto linking against serialization? I am using visual > studio 2013 and boost 1.55. Define BOOST_SERIALIZATION_NO_LIB to disable auto-linking of serialization. However... you should need to #include the date_time serialization code in order to use iostream output? John.

1 0

Re: [Boost-users] boost::function performance issues with C++11
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 08 Jul '14

08 Jul '14

>Right, there are 1000 integers in the vector. If something, say STL, is bottleneck for boost::bind with C++ 11, it >should also be a bottleneck without C++11. And they should have the same performance. However, the fact shows >that C++11 mode has some additional overhead. I wanna figure that out. What if you try with just 1 integer? Does the difference in time stay proportionally the same? Steven

4 4

[spirit] qi xml parser
by Michael Powell 07 Jul '14

07 Jul '14

Hello, I am building out a general use xml parser including attributes, arbitrary number of elements, and so on. So far so good, makes sense parsing names and so forth. However, how do you handle element content? Which could either be a string, or zero or more other elements (basically of the same rule as the enclosing element rule). It would seem you need a terminus, the empty element tag. In such a way that populates the parent (initial) element, and its children (of the same element kind). I'll be adapting structs to capture the results. I am also using a couple of helpful references, for instance: http://www.w3.org/TR/xml11/ http://stackoverflow.com/questions/9473843/boost-spirit-how-to-extend-xml-p… Also not sure quite how to capture the adapted parts at strategic rule opportunities. My domain model will look something like this, keeping it simple as possible: struct xattribute { std::string name; std::string value; }; typedef std::vector<xattribute> xattribute_vector; struct xelement; typedef std::vector<xelement> xelement_vector; struct xelement { std::string name; std::string content; xattribute_vector attributes; xelement_vector children; }; Thanks... Best regards, Michael Powell

2 6

DateTime without serialization
by Macumber, Daniel 07 Jul '14

07 Jul '14

Hello, I am using the DateTime library's to/from string functionality but not the DateTime serialization functionality. However, when I build my program boost auto linking keeps trying to link against the serialization library. Is there a way I can build and link against DateTime without auto linking against serialization? I am using visual studio 2013 and boost 1.55. Thanks, Dan Sent with Good (www.good.com)

3 2

BOOST_OS_UNIX not working
by Troy Heron 07 Jul '14

07 Jul '14

Hello, I've just decided to give Boost.Predef a test drive for the first time and have found a problem using BOOST_OS_UNIX. See the test snippet here: http://pastebin.com/4dLDAhEV This is the output I get using both g++ 4.9.0 and clang++ 3.4.2: BOOST_OS_UNIX: 0 BOOST_OS_LINUX: 1 unix: 1 __unix: 1 _XOPEN_SOURCE: 700 _POSIX_SOURCE: 1 Everything that is defined that should be to make BOOST_OS_UNIX be defined. I haven't seen this mentioned anywhere before. I guess this a bug? I haven't looked at predef headers yet. Thanks, Troy

2 1

How to Wrap a List of pairs with Python Boost
by Kv Gopalkrishnan 07 Jul '14

07 Jul '14

Hi all I am quiet new to python boost and am stuck with a problem with C++ STL lists. I have a data type that is something like this list<pair<int,string> > gap_ls; Which is under the private section. I would like to wrap this like one can do using a vector like this class_<std::vector<std::pair<double, double> > >("VectorOfPairs") .def(vector_indexing_suite<std::vector<std::pair<double,double> > >()); and for pairs I had this class_<std::pair<double, double> >("DoublePair") .def_readwrite("first", &std::pair<double, double>::first) .def_readwrite("second", &std::pair<double, double>::second); But how do I write a wrapper for list<pair<int,string> >gap_ls; Any advice in this context would be appreciated. Kind Regards K.V.

1 0

Re: [Boost-users] Boost-users Digest, Vol 3844, Issue 1
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 05 Jul '14

05 Jul '14

>Date: Sun, 29 Jun 2014 13:21:21 -0300 >From: Agust?n K-ballo Berg? <kaballo86(a)hotmail.com> >To: boost-users(a)lists.boost.org >Subject: Re: [Boost-users] [fusion] maps and arrays >Message-ID: <BLU436-SMTP192734464D2B326EAF70973A7050(a)phx.gbl> >Content-Type: text/plain; charset="ISO-8859-1"; format=flowed >I missed the part where `for_each` was invoking the callable on each >element of the array, that is not how it is supposed to be. You are >right that making a recursive callable is the correct way to obtain that >behavior. Hi Agustin I'm sorry for taking so long to reply to you. I've been swamped. I really appreciate you taking the time to have this discussion with me and helping me to see that the behavior I was experiencing before with the for_each stepping into each array item is not correct. I should remember in the future to try and understand from the documentation what something is doing and not just by empirically testing it. >Without any other information on the error you get, I'm betting that >this is due to adding support for C++11 (not-so) perfect forwarding: > void foo(std::array<int, 2> const&){} > template <typename T> > void bar(T&& v){ foo(std::forward<T>(v)); } > foo({3,4}); // ok > bar({3,4}); // error: {3,4} has no type If I get some time I will play with this. I think that it is a bug that I cannot use braced initializer in c++11 with 1.55 like I could in 1.53. In the meantime I am adding a comment and referencing this discussion to my bug report to show that it is not a bug. I imagine they are not interested in the 1.53 issue we may have uncovered. Regards, Steven

1 0

skip list in boost
by David Frank 05 Jul '14

05 Jul '14

Hi, I found this email thread about submitting skip list implementation to boost: Boost mailing page: Re: [boost] Review managers wanted for augmented data structures Boost mailing page: Re: [boost] Review managers wanted f... Boost : Date view Thread view Subject view Author view Subject: Re: [boost] Review managers wanted for augmented data structures From: Vadim Stadnik (vadimst... View on lists.boost.org Preview by Yahoo But, I do not see it in the current version of boost, I'm wondering if it is somewhere I missed? Thanks, David

2 2

[Graph] Newbie on A*
by Sensei 04 Jul '14

04 Jul '14

Dear all, I am fiddling with the A* example on cities in order to learn how to use the A* search. Obviously, I cannot make it work :) The main goal is this, but I'm way too far from this: make A* fail when the path is longer, **not costlier**, than a constant. But right now I'd just like to have A* working on a graph. :) In order to see the different results, I've paired it with a Dijkstra search, and my A* heuristics is quite simple: constant. Dijkstra works fine, but A* stops at the first node, and the target isn't reached (but a path is available). What am I doing wrong? Forgive me if I'm making a stupid mistake bu I'm completely a newbie! If you need the graph, here's the link: https://dl.dropboxusercontent.com/u/15635416/g.txt Thanks! #include <cstdio> #include <cstdlib> #include <iostream> #include <utility> #include <algorithm> #include <numeric> #include <deque> #include <unordered_set> #include <vector> #include <fstream> #include <list> #include <boost/graph/graph_traits.hpp> #include <boost/graph/compressed_sparse_row_graph.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/breadth_first_search.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/pending/indirect_cmp.hpp> #include <boost/range/irange.hpp> #include <boost/property_map/property_map.hpp> #include <boost/graph/astar_search.hpp> // Properties: weights are int typedef boost::property<boost::edge_weight_t, int> edge_weight; // The graph itself as a compressed sparse row matrix typedef boost::compressed_sparse_row_graph<boost::bidirectionalS, boost::no_property, edge_weight> boost_graph; // Vertex iterator typedef boost::graph_traits<boost_graph>::vertex_iterator vertex_iterator; // Edge iterator typedef boost::graph_traits<boost_graph>::edge_iterator edge_iterator; // Adjacent nodes iterator typedef boost::graph_traits<boost_graph>::adjacency_iterator adjacency_iterator; typedef boost::graph_traits<boost_graph>::out_edge_iterator outward_iterator; typedef boost::graph_traits<boost_graph>::in_edge_iterator inward_iterator; // Property maps typedef boost::property_map<boost_graph, boost::vertex_index_t>::type index_map; //typedef boost::property_map<boost_graph, boost::vertex_name_t> name_map; // Property iterators typedef boost::iterator_property_map<std::size_t*, index_map, std::size_t, std::size_t&> predecessor_map; typedef boost::iterator_property_map<std::size_t*, index_map, std::size_t, std::size_t&> distance_map; bool isValid(std::size_t index) { return (index >= 0) && (index <= 12); } // **************************************************************************** // A* heuristics template <class graph_type> class astar_heuristic : public boost::astar_heuristic<graph_type, std::size_t> { public: typedef typename boost::graph_traits<graph_type>::vertex_descriptor vertex_type; astar_heuristic(vertex_type goal) : goal_(goal) { }; std::size_t operator()(vertex_type u) { return 3; } private: vertex_type goal_; }; // Class to be used to terminate the A* algorithm class exit_astar { public: exit_astar(bool found) { }; }; // A* visitor that terminates when we find the goal template <class vertex_type> class astar_visitor : public boost::default_astar_visitor { public: astar_visitor(vertex_type goal) : goal_(goal) { }; template <class Graph> void examine_vertex(vertex_type u, Graph& g) { //std::cout << "EXAM: " << u << std::endl; if (u == goal_) throw exit_astar(true); } private: vertex_type goal_; }; // **************************************************************************** int main(int argc, const char * argv[]) { std::vector<std::pair<std::size_t, std::size_t>> graph_edges; std::vector<int> edge_weight; int n_nodes; int read_a, read_b, read_w; n_nodes = -1; std::ifstream igraph("/Users/senseiwa/Documents/Projects/scratch/tbb/g.txt"); while(igraph >> read_a >> read_b >> read_w) { if (read_a > n_nodes) n_nodes = read_a; if (read_b > n_nodes) n_nodes = read_b; read_a--; read_b--; graph_edges.push_back(std::make_pair(read_a, read_b)); edge_weight.push_back(read_w); } std::cout << "+++ READ # NODES: " << n_nodes << std::endl; // Create the graph boost_graph graph(boost::edges_are_unsorted_multi_pass, graph_edges.begin(), graph_edges.end(), edge_weight.data(), n_nodes); std::cout << "Graph statistics: " << std::endl; std::cout << "Nodes: " << boost::num_vertices(graph) << std::endl; std::cout << "Edges: " << graph_edges.size() << std::endl; edge_iterator ei, ee; std::size_t source_node = std::stoul(argv[1]); std::size_t destination_node = std::stoul(argv[2]); std::cout << ">> SOURCE NODE " << source_node << std::endl; std::cout << "Degrees in/out: " << source_node << std::endl; std::cout << boost::in_degree(boost::vertex(source_node, graph), graph) << std::endl; std::cout << boost::out_degree(boost::vertex(source_node, graph), graph) << std::endl; std::cout << "Degrees in/out: " << destination_node << std::endl; std::cout << boost::in_degree(boost::vertex(destination_node, graph), graph) << std::endl; std::cout << boost::out_degree(boost::vertex(destination_node, graph), graph) << std::endl; std::vector<std::size_t> preds(boost::num_vertices(graph)); std::vector<std::size_t> dists(boost::num_vertices(graph)); index_map idx_map = boost::get(boost::vertex_index, graph); predecessor_map pred_map(preds.data(), idx_map); distance_map dist_map(dists.data(), idx_map); boost::dijkstra_shortest_paths(graph, source_node, boost::distance_map(dist_map).predecessor_map(pred_map)); typedef std::vector<boost_graph::edge_descriptor> path_type; path_type spath; std::cout << ">> SOURCE NODE " << source_node << std::endl; std::cout << ">> DESTINATION NODE " << destination_node << std::endl; // ******* DIJKSTRA ******************************************************** std::size_t v = destination_node; // We want to start at the destination and work our way back to the source for(std::size_t u = pred_map[v]; // Start by setting 'u' to the destintaion node's predecessor u != v; // Keep tracking the path until we get to the source v = u, u = pred_map[v]) // Set the current vertex to the current predecessor, and the predecessor to one level up { std::pair<boost_graph::edge_descriptor, bool> edgePair = boost::edge(u, v, graph); boost_graph::edge_descriptor edge = edgePair.first; spath.push_back(edge); } // Write shortest path int totalDistance = 0; for(path_type::reverse_iterator pathIterator = spath.rbegin(); pathIterator != spath.rend(); ++pathIterator) { std::cout << boost::source(*pathIterator, graph) << " - " << boost::target(*pathIterator, graph) << " = " << boost::get(boost::edge_weight, graph, *pathIterator) << std::endl; totalDistance += boost::get(boost::edge_weight, graph, *pathIterator); } std::cout << "Shortest Dijkstra path from " << source_node << " to " << destination_node << " cost " << totalDistance << std::endl; // ******* A* ************************************************************** // A* search predecessor and cost std::vector<std::size_t> p(boost::num_vertices(graph)); std::vector<std::size_t> d(boost::num_vertices(graph)); try { // A* parameter interface astar_search(graph, source_node, astar_heuristic<boost_graph>(destination_node), boost::predecessor_map(&p[0]).distance_map(&d[0]).visitor(astar_visitor<std::size_t>(destination_node))); } catch(exit_astar fg) { std::list<std::size_t> shortest_path; for(std::size_t v = source_node; ; v = p[v]) { shortest_path.push_front(v); if(p[v] == v) break; } auto spi = shortest_path.begin(); std::cout << "node " << source_node << std::endl; for(++spi; spi != shortest_path.end(); ++spi) std::cout << "node " << *spi << std::endl; std::cout << "Shortest A* path from " << source_node << " to " << destination_node << " cost " << d[destination_node] << std::endl; std::cout << shortest_path.size() << std::endl; return 0; } std::cout << "Didn't find a path from " << source_node << "to" << destination_node << "!" << std::endl; return 0; } +++ READ # NODES: 200 Graph statistics: Nodes: 200 Edges: 4000 >> SOURCE NODE 1 Degrees in/out: 1 0 35 Degrees in/out: 192 39 1 >> SOURCE NODE 1 >> DESTINATION NODE 192 1 - 47 = 2 47 - 91 = 3 91 - 120 = 1 120 - 175 = 1 175 - 192 = 10 Shortest Dijkstra path from 1 to 192 cost 17 node 1 Shortest A* path from 1 to 192 cost 17 1

2 2