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

[1.56.0] Beta 1 Available
by Marshall Clow 22 Jul '14

22 Jul '14

Boost release 1.56.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost/1.56.0.beta.1/ This release contains 2 new libraries: * Align: Memory alignment functions, allocators, and adaptors, from Glen Fernandes. * Type_Index: Runtime/Compile time copyable type info, from Antony Polukhin. Modularization Boost version control has migrated to a system using git submodules. This shouldn't make too much of a difference to users, although the directory structure is now a bit different. Parts of some libraries have been moved into different modules, and several new modules have been extracted from existing code. All header paths should remain the same. The new modules are: * Assert: Customizable assert macros. Maintained by Peter Dimov. * Core: Core utilities used by other libraries, with minimal dependencies. Maintained by Peter Dimov, Glen Fernandes and Andrey Semashev. * Lexical_Cast: General literal text conversions, such as an int represented a string, or vice-versa, from Kevlin Henney. * Throw_Exception: A common infrastructure for throwing exceptions from Boost libraries, from Emil Dotchevski. * Winapi: Windows API declarations without <windows.h>, for internal Boost use. For details of what's in the release, see http://www.boost.org/users/history/version_1_56_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

9 12

Building modular-boost on windows with masm32?
by Alle Meije Wink 22 Jul '14

22 Jul '14

Dear all, I have tried to build modular-boost on windows (win7 64bit) using the mingw toolset. The steps that I followed (after some trial & error) are: 1. clone boost-modular from into %home%\usr\local\boost 2. in that boost directory; type bootstrap mingw ===========output=============== Building Boost.Build engine Bootstrapping is done. To build, run: .\b2 To adjust configuration, edit 'project-config.jam'. Further information: - Command line help: .\b2 --help - Getting started guide: http://boost.org/more/getting_started/windows.html - Boost.Build documentation: http://www.boost.org/boost-build2/doc/html/index.html ================================ 3. after apparently successful bootstrap, type b2 -a -d+2 -q --prefix=c:\users\amwink\usr\local --build-type=complete --build-dir=build toolset=gcc link=shared runtime-link=shared The output is below. So the commands cl.exe and ml.exe, which are not in mingw but can be used from the masm32 package are found, but their output is not recognised (as I understand) Is that correct? Would there be a way around this other than installing VC++? Many thanks Alle Meije ===========output=============== Building the Boost C++ Libraries. Performing configuration checks - symlinks supported : yes (cached) - 32-bit : yes (cached) - arm : no (cached) - mips1 : no (cached) - power : no (cached) - sparc : no (cached) - x86 : yes (cached) - has_icu builds : no (cached) warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam - zlib : no (cached) - iconv (libc) : no (cached) - iconv (separate) : yes (cached) - icu : no (cached) - icu (lib64) : no (cached) - g++ -shared-* supported : no (cached) - message-compiler : no (cached) - compiler-supports-ssse3 : yes (cached) - compiler-supports-avx2 : yes (cached) - gcc visibility : yes (cached) - long double support : yes (cached) warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. warning: No python installation configured and autoconfiguration note: failed. See http://www.boost.org/libs/python/doc/building.html note: for configuration instructions or pass --without-python to note: suppress this message and silently skip all Boost.Python targets - zlib : no (cached) - zlib : no (cached) warning: Skipping Boost.Locale library with threading=single. warning: Skipping Boost.Thread library with threading=single. warning: Skipping Boost.Wave library with threading=single. - zlib : no (cached) Component configuration: - atomic : building - chrono : building - container : building - context : building - coroutine : building - date_time : building - exception : building - filesystem : building - graph : building - graph_parallel : building - iostreams : building - locale : building - log : building - math : building - mpi : building - program_options : building - python : building - random : building - regex : building - serialization : building - signals : building - sync : building - system : building - test : building - thread : building - timer : building - wave : building gcc.compile.c++ build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\lockpool.o "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_DYN_LINK=1 -DBOOST_ATOMIC_SOURCE -DBOOST_USE_WINDOWS_H -DNDEBUG -D_WIN32_WINNT=0x0500 -I"." -c -o "build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\lockpool.o" "libs\atomic\src\lockpool.cpp" gcc.link.dll build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll.a "g++" "-Wl,--out-implib,build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll.a" -o "build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll" -shared -Wl,--start-group "build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\lockpool.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -mthreads -lkernel32 common.copy stage\lib\libboost_atomic-mgw48-mt-1_56.dll.a copy /b "build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll.a" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_atomic-mgw48-mt-1_56.dll.a" build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll.a 1 file(s) copied. common.copy stage\lib\libboost_atomic-mgw48-mt-1_56.dll copy /b "build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_atomic-mgw48-mt-1_56.dll" build\boost\bin.v2\libs\atomic\build\gcc-mingw-4.8.1\release\threading-multi\libboost_atomic-mgw48-mt-1_56.dll 1 file(s) copied. gcc.compile.c++ build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\error_code.o "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DNDEBUG -I"." -c -o "build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\error_code.o" "libs\system\src\error_code.cpp" gcc.link.dll build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll.a "g++" "-Wl,--out-implib,build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll.a" -o "build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll" -shared -Wl,--start-group "build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\error_code.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -mthreads common.copy stage\lib\libboost_system-mgw48-mt-1_56.dll.a copy /b "build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll.a" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_system-mgw48-mt-1_56.dll.a" build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll.a 1 file(s) copied. common.copy stage\lib\libboost_system-mgw48-mt-1_56.dll copy /b "build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_system-mgw48-mt-1_56.dll" build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll 1 file(s) copied. gcc.compile.c++ build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\chrono.o "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -mthreads -Wextra -Wno-long-long -Wno-variadic-macros -pedantic -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRE CATED -DNDEBUG -I"." -c -o "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\chrono.o" "lib s\chrono\src\chrono.cpp" gcc.compile.c++ build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\thread_clock.o "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -mthreads -Wextra -Wno-long-long -Wno -variadic-macros -pedantic -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DNDEBUG -I"." -c -o "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\thread_clock.o " "libs\chrono\src\thread_clock.cpp" gcc.compile.c++ build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\process_cpu_clocks.o "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -mthreads -Wextra -Wno-long-long -Wno-variadic-macros -pedantic -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRE CATED -DNDEBUG -I"." -c -o "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\process_cpu_clocks.o" "libs\chrono\src\process_cpu_clocks.cpp" gcc.link.dll build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll.a "g++" "-Wl,--out-implib,build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll.a" -o "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll" -shared -Wl,--start-group "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-m ulti\chrono.o" "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\thread_clock.o" "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\process_cpu_clocks.o" "build\boost\bin.v2\libs\system\build\gcc-mingw-4.8.1\release\threading-multi\libboost_system-mgw48-mt-1_56.dll.a" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -mthreads common.copy stage\lib\libboost_chrono-mgw48-mt-1_56.dll.a copy /b "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll.a" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_chrono-mgw48-mt-1_56.dll.a" build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll.a 1 file(s) copied. common.copy stage\lib\libboost_chrono-mgw48-mt-1_56.dll copy /b "build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_chrono-mgw48-mt-1_56.dll" build\boost\bin.v2\libs\chrono\build\gcc-mingw-4.8.1\release\threading-multi\libboost_chrono-mgw48-mt-1_56.dll 1 file(s) copied. gcc.compile.c build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\alloc_lib.o "g++" -x c -O3 -finline-functions -Wno-inline -Wall -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_CONTAINER_DYN_LINK=1 -DN DEBUG -I"." -c -o "build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\alloc_lib.o" "libs\container\src\alloc_lib.c" gcc.link.dll build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll.a "g++" "-Wl,--out-implib,build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll.a" -o "build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll" -shared -Wl,--start-group "build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\alloc_lib.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -mthreads common.copy stage\lib\libboost_container-mgw48-mt-1_56.dll.a copy /b "build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll.a" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_container-mgw48-mt-1_56.dll.a" build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll.a 1 file(s) copied. common.copy stage\lib\libboost_container-mgw48-mt-1_56.dll copy /b "build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll" + this-file-does-not-exist-A698EE7806899E69 "stage\lib\libboost_container-mgw48-mt-1_56.dll" build\boost\bin.v2\libs\container\build\gcc-mingw-4.8.1\release\threading-multi\libboost_container-mgw48-mt-1_56.dll 1 file(s) copied. Jamfile<C:\Users\amwink\usr\local\boost\libs\context\build>.masm build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\make_i386_ms_pe_masm.o ml /c /Fo"build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\make_i386_ms_pe_masm.o" "libs\context\src\asm\make_i386_ms_pe_masm.asm" Microsoft (R) Macro Assembler Version 6.14.8444 Copyright (C) Microsoft Corp 1981-1997. All rights reserved. Assembling: libs\context\src\asm\make_i386_ms_pe_masm.asm Jamfile<C:\Users\amwink\usr\local\boost\libs\context\build>.masm build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\jump_i386_ms_pe_masm.o ml /c /Fo"build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\jump_i386_ms_pe_masm.o" "libs\context\src\asm\jump_i386_ms_pe_masm.asm" Microsoft (R) Macro Assembler Version 6.14.8444 Copyright (C) Microsoft Corp 1981-1997. All rights reserved. Assembling: libs\context\src\asm\jump_i386_ms_pe_masm.asm gcc.compile.c++ build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\threading-multi\dummy.o "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_CONTEXT_DYN_LINK=1 -DBOOST_CONTEXT_SOURCE -DNDEBUG -I"." -c -o "build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\ threading-multi\dummy.o" "libs\context\src\dummy.cpp" gcc.link.dll build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\threading-multi\libboost_context-mgw48-mt-1_56.dll.a "g++" "-Wl,--out-implib,build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\threading-multi\libboost_context-mgw48-mt-1_56.dll.a" -o "build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\threading-multi\libboost_context-mgw48-mt-1_56.dll" -shared -Wl,--start-group "build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\make_i386_ms_pe_masm.o" "build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\jump_i386_ms_pe_masm.o" "build\boost\bin.v2\libs\co ntext\build\gcc-mingw-4.8.1\release\threading-multi\dummy.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -mthreads build\boost\bin.v2\libs\context\build\gcc-mingw-4.8.1\release\address-model-32\architecture-x86\threading-multi\asm\make_i386_ms_pe_masm.o: file not recognized: File format not recognized collect2.exe: error: ld returned 1 exit status ...skipped <pstage\lib>libboost_context-mgw48-mt-1_56.dll.a for lack of <pbuild\boost\bin.v2\libs\context\build\gcc-ming w-4.8.1\release\threading-multi>libboost_context-mgw48-mt-1_56.dll.a... ...failed updating 1 target... ================================

4 8

[odeint] optional data
by Erik Schultheis 22 Jul '14

22 Jul '14

Dear all, i am simulating particle trajectories, and depending on the data i want to generate i may or may not have to track additional data [boost.ublas c_matrix] along those trajectories. Right now i enable/disable that via a template parameter (so, using std::tuple(vec, vec) or tuple(vec, vec, c_matrix) and fusion_algebra), which has a few drawbacks. The algorithm is already templated to support varying dimensions via a template parameter, so the additional data practically doubles the number of template instantiations for system and all possible observers. This actually got so bad that gcc (mingw gcc 4.8) refuses to compile with debugging enabled. Therefore, i would like to make the switch between tracking the matrix and ignoring it a runtime choice instead of a template parameter. However, the cost of tracking that matrix is quite high (that is why it is optional), but simply disableing the d matrix / dt calculation in the system does not speed up the calculation much (86 s -> 58 s vs 27 s without matrix). A lot of time is spent in adding and multiplying numbers that are not used anywhere, or actually even copying them (e.g std::swap(c_matrix, c_matrix) shows up quite high in gprof (even though i am not sure how reliable the -pg option is in conjunction with -O3)). So what i am asking here is for suggestions how to best let odeint treat the c_matrix as uninitialized memory and never perform any operations on that depending on a runtime parameter. Options i thought of were: * deriving a class from c_matrix and providing my own versions of operator overloads that check a flag: as far as i know, boost.ublas matrices use some template magic to let operators only return expression templates to optimize evaluation if operations are chained, and i would not be sure about how to actually retain that behaviour in case the matrix is tracked. * creating my own algebra class: from what i could tell from a few quick glances into the algebra files, this would probably be conceptually easier than the other option, but would require a lot of repetetive coding. Does anyone have suggestion for a more efficient implementation strategy? Greetings Erik

2 1

[type traits] redefine a type trait
by Michael Powell 21 Jul '14

21 Jul '14

Hello, Question: is there a way to delete or remove a type trait once it has been defined? And/or redefine it? Consider, I've got a default type trait, something like this. template<typename T> struct throws_exceptions { static const bool value = true; }; struct my_object { //does some work with or without exception }; template<> struct throws_exceptions<my_object> { static const bool value = false; } However, in my unit test code, I want to override the default behavior for test purposes. template<> struct throws_exceptions<my_object> { static const bool value = true; } Or just leave the type trait out. Actually, I'm not sure I just considered an answer to my own question. Possibly I need to separate the traits from the underlying things being modified, and leave it as an option whether to include the defaults, or define user-provided traits. Best regards, Michael Powell

1 0

[msm] enque vs defer
by Raj Sambasivan 21 Jul '14

21 Jul '14

Hi boost-users/Christophe, Does enqueue and defer use the same underlying queue, and when i defer can i validate my unit testcase to check on the queue size using get_message_queue_size(). I did a quick test on defer and checking the queue size and it didnt work may be there is something wrong in my test program but wanted to check if anyone tried this out. thank you -raj

2 2

linking err using log
by David Frank 20 Jul '14

20 Jul '14

Has anyone seen this:? boost/log/attributes/attribute_value_impl.hpp:47: undefined reference to `boost::log::v2s_mt_posix::attribute::impl::operator delete(void*, unsigned long)' In function `boost::log::v2s_mt_posix::attributes::attribute_value_impl<boost::posix_time::ptime>::~attribute_value_impl()': Thanks, Dave

1 0

Push-Relabel undirected graph
by Charles Maske 20 Jul '14

20 Jul '14

Hi there, I'm working in a cut-tree implementation of gomoryhu algorithm and I have to compute max-flow on the input graph. I read about efficiency of the push-relabel algorithm and I want to do some tests but I can't get this because all reverse edges have to capacity equals 0. Someone knows one way to workaround this restriction? Other max-flow algorithms in BGL (edmonds-karp and boykov-kolmogorov) don't have this restriction, what do them more fast than push-relabel implementation. Thanks

1 0

Generate random graphs
by Mandy Nour 20 Jul '14

20 Jul '14

Hello all, I need to generate random undirected simple graphs using The Erdos-Rényi methods and to extract its adjacency matrix into an std::vector. -- View this message in context: http://boost.2283326.n4.nabble.com/Generate-random-graphs-tp4665336.html Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[variant] forward declarations
by Michael Powell 18 Jul '14

18 Jul '14

Hello, I've got some structs in a AST of sorts which the main player in the mix is a node. In at least one of the use cases, one of the variant types must be forward declared at the time the node can be declared. Possibly one or two other similar use cases. Error 2 error C2139: 'xml::xelement' : an undefined class is not allowed as an argument to compiler intrinsic type trait '__is_nothrow_constructible' i:\installs\development\boost.org\1.55.0\boost_1_55_0\stage\include\boost\type_traits\has_nothrow_constructor.hpp 24 1 xml However, I am bumping into C2139, above. Is there any way for variant to work with forward declared structs (or classes, etc)? Or am I just asking too much from C++? I am building against Visual Studio 2013, Boost 1.55. Thank you... Best regards, Michael Powell

2 2

boost::lockfree::queue not working with -fgnu-tm
by Philipp Schoppe 18 Jul '14

18 Jul '14

Hello, I try to benchmark different queue implementations. I have a test program which includes the boost lockfree queue and some custom implementations where one is using gcc's STM. In order to compile it, I need to add the -fgnu-tm flag. I am using an up-to-date arch linux system with gcc 4.9.0 and boost 1.55.0 When adding this flag, I get a compilation error. This is a small example that illustrates the problem: errtest.cpp: #include <boost/lockfree/queue.hpp> int main () { boost::lockfree::queue<int> lfqueue; lfqueue.push(234); return 0; } Compiling it using g++ -std=c++11 -lboost_system -g -O3 -Wall -Werror -Wswitch-enum -fgnu-tm errtest.cpp -o test leads to an error.

3 6

[Log] Extract severity value
by Olivier Tournaire 17 Jul '14

17 Jul '14

Hi all, I am trying to extract severity level from a log record, but i seems that I am doing it the wrong way. Here is the code I use: void LogDockWidget::receiveLog(boost::log::record_view const& rec, const std::string& log) { logging::value_ref< logging::trivial::severity_level > level = logging::extract< logging::trivial::severity_level >("Severity", rec); // ... } Here level.get() always returns "info". All my logs are done with the BOOST_LOG_TRIVIAL(...) macro. The formatter whereas displays correctly the severity level. Here is how it is defined: void LogDockWidget::init_logging() { boost::shared_ptr< logging::core > core = logging::core::get(); typedef sinks::synchronous_sink< QTextEditFormattedSinkBackend > sink_t; boost::shared_ptr< sink_t > sink(new sink_t); // ... logging::add_file_log( keywords::file_name = logFilename, keywords::auto_flush = true, keywords::format = ( BUILD_LOG_FORMATTER() ) ); sink->set_formatter( BUILD_LOG_FORMATTER() ); core->add_sink(sink); // Add attributes that we will use logging::add_common_attributes(); core->add_global_attribute( "ThreadID", attrs::current_thread_id()); } #define BUILD_LOG_FORMATTER() \ expr::stream \ << "[" << expr::format_date_time< boost::posix_time::ptime >("TimeStamp", "%Y-%m-%d %H:%M:%S") << "] " \ << expr::attr<unsigned int>("LineID") << " " \ << ": <" << logging::trivial::severity << "> " \ << " [" << expr::attr<attrs::current_thread_id::value_type>("ThreadID") << "] " \ << expr::if_(expr::has_attr(scope_attribute)) \ [ \ expr::stream << "[" << scope_attribute << "] " \ ] \ << expr::message Could you please let me know what I am doing wrong? Regards, Olivier

2 2

Re: [Boost-users] Intrusive: Checking for undefined behaviour
by Brian Wood 16 Jul '14

16 Jul '14

Ion Gazta?aga writes: >El 15/07/2014 5:33, Brian Wood escribi?: >> I was reading here about some of the sanitizers >> >> http://cplusplusmusings.wordpress.com/ >> >> and decided to try it out the undefined behavior >> sanitizer on some code. One thing that came >> out was related to the Intrusive library. > > Can you try with the release candidate (http://boost.cowic.de/rc/) for > Boost 1.56? I solved some undefined behaviour issues recently but I > don't know if this is one of them. I tested it with 1.56 now and the sanitizer is no longer reporting a problem with Intrusive. It looks like whatever you did has helped. I appreciate your being on top of this. -- Brian Ebenezer Enterprises - "Let a man so consider us, as servants of Messiah and stewards of the mysteries of G-d." First Corinthians 4 http://webEbenezer.net

2 1

1.56.0 beta release candidate 2 available for testing
by Marshall Clow 16 Jul '14

16 Jul '14

The second release candidate files for 1.56.0 beta 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_0_b1_rc2.7z) = cd6267325a8dadbb82b384c4776ee450 MD5 (boost-1_56_0_b1_rc2.tar.bz2) = b74cd72043b6b2fa16c6690633acb422 MD5 (boost-1_56_0_b1_rc2.tar.gz) = b51810be6737e73a4deee70e84895ca7 MD5 (boost-1_56_0_b1_rc2.zip) = f4ceb73492ae7d9b1843d841498850e5 Since this is the first post-git release, we are expecting some teething pains with this release. Please test extensively. Besides bug fixes the TypeIndex library has been included, and I think that the problems that mjklaim(a)gmail.com was seeing have been fixed. I would like to post this to SourceForge Thursday night/Friday morning, if possible. Thank you. --The release managers

9 12

[log] translating 3rd party logging messages
by Olaf Peter 16 Jul '14

16 Jul '14

Hello, shown my translator for Qt using boost.log: void qt_message_translator(QtMsgType type, const QMessageLogContext &context, const QString &msg) { QString const context_message = QString("Qt [") + context.function + " (" + context.file + ":" + QString::number(context.line) + ")] "; QByteArray const ctx_msg = context_message.toUtf8(); QByteArray const qt_msg = msg.toUtf8(); boost::log::sources::severity_logger<severity_level> slg; switch (type) { case QtDebugMsg: BOOST_LOG_SEV(slg, debug) << ctx_msg.constData() << qt_msg.constData(); break; case QtWarningMsg: BOOST_LOG_SEV(slg, warning) << ctx_msg.constData() << qt_msg.constData(); break; case QtCriticalMsg: BOOST_LOG_SEV(slg, error) << ctx_msg.constData() << qt_msg.constData(); break; case QtFatalMsg: BOOST_LOG_SEV(slg, fatal) << ctx_msg.constData() << qt_msg.constData(); break; default: BOOST_LOG_SEV(slg, fatal) << ctx_msg.constData() << qt_msg.constData(); break; } } ... qInstallMessageHandler(qt_message_translator); The problem is more of cosmetic nature; the logging format output is different from what is used normally - it looks alien. Since the context data is available I assume I can write an own logging source writing/fill the log records filled with the context information. Additionally I want to add a "Scope" or "Library" flag "Qt" (Scope may be not the best choise since it's used in another context). But I didn't find an example in the boost.log module to find the entry; is writing an own source the right way? How to use it in the qt_message_translator? Thanks, Olaf

1 2

adjacency_list.hpp won't compile
by Alexander While 16 Jul '14

16 Jul '14

Hello, I just recently found Boost, and I am attempting to use it in a project I am working on. However, in my attempts to make simple graphs with the graph/adjacency_list.hpp subdirectory, I get a compiler error within the code for adjacency_list.hpp. I don't know if I can copy the error message correctly, but the errors seem centered around lines 1503-1505, those saying typedef typename lookup_one_property<vertex_property_type, vertex_bundle_t>::type vertex_bundled; typedef typename lookup_one_property<edge_property_type, edge_bundle_t>::type edge_bundled; typedef typename lookup_one_property<graph_property_type, graph_bundle_t>::type graph_bundled; then lines 2027 and 275 are mentioned. The code I myself wrote compiles fine on its own. I'm using the IDE Dev-C++.

2 1

Intrusive: Checking for undefined behaviour
by Brian Wood 15 Jul '14

15 Jul '14

I was reading here about some of the sanitizers http://cplusplusmusings.wordpress.com/ and decided to try it out the undefined behavior sanitizer on some code. One thing that came out was related to the Intrusive library. /home/brian/boost_1_55_0/boost/intrusive/detail/tree_node.hpp:164:44: runtime error: member access within null pointer of type 'const boost::intrusive::bhtraits<myString, boost::intrusive::rbtree_node_traits<void *, false>, 2, boost::intrusive::default_tag, 3>' I have a couple of lines that may be related to: struct myString : set_base_hook<::boost::intrusive::link_mode<::boost::intrusive::auto_unlink> > and ::boost::intrusive::set<myString, constant_time_size<false> > files; Can someone tell me how serious this is? Thank you. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

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

15 Jul '14

1 0

[Boost Log] how to print source code file name and line number in boost log
by Pritesh Acharya 15 Jul '14

15 Jul '14

Boost version: 1.55.0 OS: Windows 8 IDE: Visual Studio 2010 Boost Module: Boost Log I'm using Boost Logging in my C++ application. I have been able to generate log of this format [2014-Jul-15 10:47:26.137959]: <debug> A regular message I want to be able to add source file name and line number where the log is generated, But i'm not able to do so. [2014-Jul-15 10:47:26.137959]: <debug> [filename:line_no] A regular message example: [2014-Jul-15 10:47:26.137959]: <debug> [helloworld.cpp : 12] A regular message Source Code: #include <boost/log/core.hpp>#include <boost/log/trivial.hpp>#include <boost/log/expressions.hpp>#include <boost/log/sinks/text_file_backend.hpp>#include <boost/log/utility/setup/file.hpp>#include <boost/log/utility/setup/common_attributes.hpp>#include <boost/log/sources/severity_logger.hpp>#include <boost/log/sources/record_ostream.hpp>#include <boost/log/expressions.hpp>#include <boost/log/support/date_time.hpp>#include <boost/log/attributes/attribute.hpp>#include <boost/log/attributes/attribute_cast.hpp>#include <boost/log/attributes/attribute_value.hpp>#include <boost/make_shared.hpp>#include <boost/property_tree/ptree.hpp> namespace logging = boost::log;namespace src = boost::log::sources;namespace sinks = boost::log::sinks;namespace keywords = boost::log::keywords; void init(){ logging::add_file_log ( keywords::file_name = "sample_%N.log", /*< file name pattern >*/ keywords::rotation_size = 10*1024*1204, /*< rotate files every 10 MiB... >*/ keywords::time_based_rotation = sinks::file::rotation_at_time_point(0, 0, 0), /*< ...or at midnight >*/ keywords::format = ( boost::log::expressions::stream << boost::log::expressions::format_date_time< boost::posix_time::ptime >("TimeStamp", "%Y-%m-%d_%H:%M:%S.%f") << ": <" << boost::log::trivial::severity << "> " << boost::log::expressions::smessage ) );} int main(int, char*[]){ init(); logging::add_common_attributes(); using namespace logging::trivial; src::severity_logger< severity_level > lg; BOOST_LOG_SEV(lg, debug) << "A regular message"; return 0;}

1 0

TCP resolver creates TppWorkerThreads on windows only
by Chris Stankevitz 14 Jul '14

14 Jul '14

Hello, When I run the following code on windows, some threads are created, presumably by winsock. These threads are "named" _TppWorkerThread. This does not happen on linux. These threads do not stop when all the boost objects go out of scope, but I wish they did. Q1: Am I doing something wrong? Q2: Is there a boost way for me to stop these threads? Thank you, Chris int main() { { boost::asio::io_service DummyIoService; boost::asio::ip::tcp::resolver Resolver(DummyIoService); Resolver.resolve( boost::asio::ip::tcp::resolver::query("localhost", "3000")); } // At this point, there are three extra threads running: // // _TppWorkerThread@4 _ZwWaitForWorkViaWorkerFactory@8 // _TppWorkerThread@4 _ZwWaitForWorkViaWorkerFactory@8 // _TppWaiterpThread@4 _ZwWaitForMultipleObjects@20 return 0; }

2 2

[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

Re: [Boost-users] Boost-users Digest, Vol 3847, Issue 2
by Jorge Bellon 04 Jul '14

04 Jul '14

Buenos días Vicenç, Te envío la respuesta del desarrollador de la librería. Tiene sentido lo que dice. La única pega, quizás, sería que, en caso de no haber memoria disponible, tardaríamos al menos tanto tiempo como el "round-trip latency" antes de darnos cuenta... Un saludo, Jorge > Message: 1 > Date: Thu, 03 Jul 2014 20:08:33 +0200 > From: Ion Gazta?aga <igaztanaga(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Interprocess] Managed segment placement > Message-ID: <53B59C21.9040901(a)gmail.com> > Content-Type: text/plain; charset=UTF-8; format=flowed > > El 03/07/2014 10:24, Jorge Bellon escribi?: > > Hi Ion, > > Thank you for the info. > > > > The use case would be to manage a memory pool allocated on a remote node. > > > > This would be used by a run-time library for distributed programming. It > > would allocate a memory region and manage this memory from another node, > > so that we can perform operations with that piece of memory (allocate > > portions, transfer data, etc.) without the intervention of the local > > node. > > Why can't you put the manager in the remote node? The manager also needs > to allocate memory for indexes that track the position of named/unique > objects and that memory comes from the memory region also used to > construct objects. If you don't need named objects you can use a null > index to minimize used memory. > > Do you need to shared this remote node memory between processes? If you > only use remote memory from a single process you can speed things a bit > using raw pointers: > > typedef basic_managed_external_buffer < > char, > rbtree_best_fit<null_mutex_family, void* >, > null_index > > > my_managed_external_buffer; > > If you want to serialize objects then you should use offset_ptr<void> > instead of void*. > > I still miss the point of separating the manager (which is placed in the > beginning of the memory region) and the rest of the region. > > Best, > > Ion WARNING / LEGAL TEXT: This message is intended only for the use of the individual or entity to which it is addressed and may contain information which is privileged, confidential, proprietary, or exempt from disclosure under applicable law. If you are not the intended recipient or the person responsible for delivering the message to the intended recipient, you are strictly prohibited from disclosing, distributing, copying, or in any way using this message. If you have received this communication in error, please notify the sender and destroy and delete any copies you may have received. http://www.bsc.es/disclaimer

1 0

Re: [Boost-users] [atomic] ThreadSanitizer reports a data race when using the code from "reference counting" example
by Adam Romanek 04 Jul '14

04 Jul '14

On 01.07.2014 10:49, Andrey Semashev wrote: > On Tue, Jul 1, 2014 at 12:41 PM, Adam Romanek wrote: >> On 01.07.2014 10:36, Andrey Semashev wrote: >>> >>> On Tue, Jul 1, 2014 at 12:20 PM, Andrey Semashev >>> wrote: >>>> >>>> On Tue, Jul 1, 2014 at 11:20 AM, Adam Romanek >>>> wrote: >>>>> >>>>> Andrey, >>>>> >>>>> If you don't mind, please have a look at the conversation that I started >>>>> on >>>>> boost-users list [1] a few days back. Since you're the maintainer of >>>>> Boost.Atomic I'd like to know your opinion on this issue. Or maybe I >>>>> should >>>>> repost this on boost-dev list? >>>> >>>> >>>> I don't follow users list, mostly because I can't even keep up with >>>> the developers list. So it's better to reach me on the dev list. >>>> >>>> The code in the StackOverflow topic indeed contains a potential >>>> problem. The fetch_sub(release) operation prevents previous operations >>>> from sinking past it and atomic_thread_fence(acquire) prevents the >>>> following operations from floating above it. However, these two >>>> barriers themselves can be reordered creating a window where >>>> operations before fetch_sub(release) and after >>>> atomic_thread_fence(acquire) may overlap. I believe, this is permitted >>>> on both the compiler and hardware levels. This doesn't mean that's >>>> what is actually happening and being flagged by TSan; it is still >>>> possible that some TSan bug is exposed. The fact that replacing >>>> atomic_thread_fence(acquire) with fetch_add(acquire) speaks in favor >>>> of the bug suspicion. >>> >>> >>> Actually, no, fetch_add(acquire) is significantly different from the >>> fence. It operates on the same object as the previous >>> fetch_sub(release), so it must observe its effects and cannot be >>> reordered. >>> >> >> After reading your first response I thought you're suggesting that the >> "reference counting" example in Boost.Atomic docs is broken. But hopefully >> we agree that it's fine, right? :) > > The example in the docs is indeed not correct. I believe, it should be > corrected to use acq_rel memory order in intrusive_ptr_release. The > fence can be removed then. I'll fix it as soon as I have some time. > >> So I guess this is a false positive from TSan, as suggested by others on SO. >> I'll ask this on TSan's mailing list, lets see what they say. > > Ok, let me know if there are other considerations from TSan devs. > See above for my private conversation with Andrey Semashev on this topic (he does not follow the boost-users mailing list). Andrey says that the "reference counting example" from Boost.Atomic docs is broken. What do you think about this? WBR, Adam Romanek

2 2

[msm] more than 10 states causes long compilation error
by Raj Sambasivan 04 Jul '14

04 Jul '14

Hi, I get a long compilation error when i include the last line, i tried including #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE 30 // or whatever you need #define BOOST_MPL_LIMIT_MAP_SIZE 30 but still have the same problem, compilation error is at the bottom. any help? struct transition_table: boost::mpl::vector< Row<Empty, NewOrderRequest, PendingNew, handleNewOrderRequest>, Row<PendingNew, AckedResponse, Acked, handleAckedResponse>, Row<PendingNew, OrderRejectedResponse, OrderRejected, handleOrderRejectedResponse>, Row<PendingNew, CancelRequest, PendingCancel, handleCancelRequest>, Row<PendingCancel, CanceledResponse, Canceled, handleCanceledResponse >, Row<PendingCancel, CancelRejected, CancelRejected, handleCancelRejectedResponse>, Row<PendingReplace, ReplacedResponse, Replaced, handleReplacedResponse >, Row<PendingReplace, ReplaceRejected, ReplaceRejected, handleReplaceRejectedResponse>, Row<Acked, CancelRequest, PendingCancel, handleCancelRequest>, Row<Acked, FilledResponse, Filled, handleFilledResponse> > { }; compilation error (truncated) g++ -I/boost_1_55_0/ -c -Wall test.cpp In file included from test.cpp:1: In file included from ./Order.H:11: In file included from /boost_1_55_0/boost/msm/back/state_machine.hpp:28: In file included from /boost_1_55_0/boost/fusion/include/as_set.hpp:10: */boost_1_55_0/boost/fusion/container/set/convert.hpp:24:30: **error: * *implicit* * instantiation of undefined template 'boost::fusion::detail::as_set<11>'* typedef typename gen:: * ^* */boost_1_55_0/boost/msm/back/state_machine.hpp:1164:50: note: *in instantiation of template class 'boost::fusion::result_of::as_set<boost::mpl::s_item<Filled, boost::mpl::s_item<ReplaceRejected, boost::mpl::s_item<Replaced, boost::mpl::s_item<CancelRejected, boost::mpl::s_item<Canceled, boost::mpl::s_item<OrderRejected, boost::mpl::s_item<Acked, boost::mpl::s_item<PendingReplace, boost::mpl::s_item<PendingCancel, boost::mpl::s_item<PendingNew, boost::mpl::s_item<Empty, boost::mpl::set0<mpl_::na> > > > > > > > > > > > >' requested here typedef typename ::boost::fusion::result_of::as_set<state_list>::typ... * ^* *test.cpp:5:37: note: *in instantiation of template class 'boost::msm::back::state_machine<<anonymous>::order_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_>' requested here std::cout << " -> " << state_names[o.current_state()[0]] << std::endl; * ^* */boost_1_55_0/boost/fusion/container/set/detail/as_set.hpp:26:12: note: * template is declared here struct as_set; * ^* In file included from test.cpp:1: In file included from ./Order.H:11: In file included from /boost_1_55_0/boost/msm/back/state_machine.hpp:28: In file included from /boost_1_55_0/boost/fusion/include/as_set.hpp:10: */boost_1_55_0/boost/fusion/container/set/convert.hpp:25:26: **error: * *'apply'* * following the 'template' keyword does not refer to a template* template apply<typename result_of::begin<Sequence>::type>::type * ^~~~~* *test.cpp:5:38: **error: **expected ']'* *...*

2 2

[Interprocess] Managed segment placement
by Jorge Bellon 03 Jul '14

03 Jul '14

Good morning, I'm using Boost::Interprocess' managed external buffer for my application. I would like to know whether it is possible or not to instantiate the segment manager object in a different place other than the buffer itself, so that the whole buffer is used exclusively for data. Thanks in advance, Jorge WARNING / LEGAL TEXT: This message is intended only for the use of the individual or entity to which it is addressed and may contain information which is privileged, confidential, proprietary, or exempt from disclosure under applicable law. If you are not the intended recipient or the person responsible for delivering the message to the intended recipient, you are strictly prohibited from disclosing, distributing, copying, or in any way using this message. If you have received this communication in error, please notify the sender and destroy and delete any copies you may have received. http://www.bsc.es/disclaimer

2 3

[interceptors] How to intercept when a function is called
by Michael Powell 03 Jul '14

03 Jul '14

Hello, I don't know if there is a first or second class library in Boost to do with this already. Or at least a C++ mechanism I could leverage. Basically, I want to hook or intercept when a function call is made. I do not want to change the underlying call, although I suppose that hook could be done as well. For now, I just want a callback when that function calls is made. For instance, a vector push_back listener. I want to listen when items are push_back-ed onto the vector. The items should still land in the vector. I just want the notification when that occurs. I've dug around for different "callback" flavors, but these just seem to be wrappers to an underlying method pointer, bound function, along these lines. I can do that easy enough but it doesn't buy me the interception when the push back is actually called. The tricky part with push_back as well, is that it comes in two flavors, so there needs to be a stand in lambda, something to declare the actual kind of argument(s) I want. Then there's the matter of Variadics. But for now I am not concerned with either of these. Thank you... Best regards, Michael Powell

4 5

How to judge matched rule when looping with sregex_token_iterator in boost.xpressive?
by Li Dong 03 Jul '14

03 Jul '14

Dear all, I would like to use boost.xpressive to parse some string like “a+b:c”, and I wrote the following snippet: sregex reOp = as_xpr('+') | '-' | '*' | '/'; sregex reDelim = as_xpr(':'); sregex reField = +_w; sregex reSimpleToken = reOp | reDelim | reField; string str = "a+b:c"; sregex_token_iterator cur(str.begin(), str.end(), reSimpleToken), end; for (; cur != end; ++cur) { cout << *cur << endl; } which will print: a + b : c but I would also want to know which rule is matched for the sequent operations, for example ‘a’, ‘b’ and ‘c' are matched by reField, and ‘+’ is matched by ‘reOp’. I am very new to boost.xpressive, so if this is not the good way, correct me please. Any help is appreciated! Best, Li

1 0

Program Options - options dependencies
by Angelo Mondaini 02 Jul '14

02 Jul '14

Dear all, I am using the Program Options and I would like to know if I can add options dependencies through the lib. For example, consider a "test" program that has a flag "--has-dependencies" that needs a flag "--dependency" and a flag "--no-depenencies". It would run like this: $./test --no-dependencies Program running... $./test --has-dependencies Error! Flag "--dependency" is needed! $./test --has-dependencies --dependency Program running... PS: I know I can use something like this, but I would like to know if there is a better option: if ( vm.count("--has-dependencies") ) if ( vm.count("--dependency") ) //do something... else //trow an error

1 0

Program Options not saving the values
by Angelo Mondaini 02 Jul '14

02 Jul '14

Dear all, I am having a problem with the Program Options lib. I am using Archlinux and boost-libs 1.55.0-6. Consider the simple code: #include "boost/program_options.hpp" #include <iostream> #include <string> int main(int argc, char** argv) { int add(5); namespace po = boost::program_options; po::options_description desc("Options"); desc.add_options() ("help", "Print help messages") ("add",po::value<int>(&add)->required(), "additional options") ("like", "this"); po::variables_map vm; po::store(po::parse_command_line(argc, argv, desc), vm); if ( vm.count("help") ) { std::cout << "Basic Command Line Parameter App" << std::endl << desc << std::endl; return 1; } std::cout << "var: " << add << std::endl; std::cout << "vm: " << vm["add"].as<int>() << std::endl; po::notify(vm); return 1; } Compiling and running: $ g++ program_options.cpp -lboost_program_options $ ./a.out --add 4 var: 5 vm: 4 Why the value of the variable "add" is not receiving 4? Thanks for any help.

2 2

[ANN] CppCon 2014 program available
by Boris Kolpackov 02 Jul '14

02 Jul '14

The CppCon 2014 Program is now available with talk titles, abstracts, and speakers: http://cppcon.org/conference-program/ The program contains over 100 one-hour sessions by over 70 speakers including plenary sessions by Scott Meyers and Herb Sutter, as well as the keynotes by C++ creator Bjarne Stroustrup on Keeping Simple Things Simple and Mark Maimone on using C++ on Mars: Incorporating C++ into Mars Rover Flight Software. We have also extended the Early Bird deadline to July 9 so you have a week to study the program and still get the Early Bird rate. Hope to see you in Bellevue! Boris

1 0

Why does async_connect() call listen()?
by Soren Dreijer 01 Jul '14

01 Jul '14

Hi there, By coincidence, I ended up looking at a stack trace where my application calls async_connect() on a asio::ip::tcp::socket. Two things took me by surprise: 1. Asio calls listen() under the hood. Why does it do that when I'm just trying to make an outbound TCP connection? 2. If the listen() call above is indeed required, why does it happen on the same thread where I call async_connect()? I thought the point of the method was to defer the work to the reactor? (For what it's worth, I've had a case on a customer's machine where the call to listen() would hang for 30 seconds before returning -- probably because of a bad firewall -- causing my entire app to hang since the code assumes async_connect() is indeed async.) I've included the full stack trace below. Thanks, Soren 0:000> k ChildEBP RetAddr 0117db50 0f681c65 WS2_32!listen 0117db70 0f691013 EvoClr!boost::asio::detail::socket_ops::listen+0x35 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\socket_ops.ipp @ 658] 0117dbd8 0f690e9f EvoClr!boost::asio::detail::socket_select_interrupter::open_descriptors+0x163 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\socket_select_interrupter.ipp @ 78] 0117dbe4 0f690cc0 EvoClr!boost::asio::detail::socket_select_interrupter::socket_select_interrupter+0xf [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\socket_select_interrupter.ipp @ 42] 0117dc1c 0f690c1e EvoClr!boost::asio::detail::select_reactor::select_reactor+0x70 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\select_reactor.ipp @ 48] 0117dc44 0f17837e EvoClr!boost::asio::detail::service_registry::create<boost::asio::detail::select_reactor>+0x4e [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\service_registry.hpp @ 81] 0117dc80 0f6909e9 EvoClr!boost::asio::detail::service_registry::do_use_service+0x9e [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\service_registry.ipp @ 123] 0117dca0 0f6908ee EvoClr!boost::asio::detail::service_registry::use_service<boost::asio::detail::select_reactor>+0x39 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\service_registry.hpp @ 49] 0117dca8 0f68fab0 EvoClr!boost::asio::use_service<boost::asio::detail::select_reactor>+0xe [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\impl\io_service.hpp @ 34] 0117dcbc 0f68f731 EvoClr!boost::asio::detail::win_iocp_socket_service_base::get_reactor+0x30 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\win_iocp_socket_service_base.ipp @ 620] 0117dce4 0f68f6f1 EvoClr!boost::asio::detail::win_iocp_socket_service_base::start_connect_op+0x11 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\win_iocp_socket_service_base.ipp @ 550] 0117dd28 0f68ed22 EvoClr!boost::asio::detail::win_iocp_socket_service<boost::asio::ip::tcp>::async_connect<boost::_bi::bind_t<void,boost::_mfi::mf1<void,Swift::BoostConnection,boost::system::error_code const &>,boost::_bi::list2<boost::_bi::value<boost::shared_ptr<Swift::BoostConnection> >,boost::arg<1> > > >+0xc1 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\win_iocp_socket_service.hpp @ 515] 0117dd68 0f68c41a EvoClr!boost::asio::stream_socket_service<boost::asio::ip::tcp>::async_connect<boost::_bi::bind_t<void,boost::_mfi::mf1<void,Swift::BoostConnection,boost::system::error_code const &>,boost::_bi::list2<boost::_bi::value<boost::shared_ptr<Swift::BoostConnection> >,boost::arg<1> > > >+0x52 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\stream_socket_service.hpp @ 234] 0117ddec 0f68a32e EvoClr!boost::asio::basic_socket<boost::asio::ip::tcp,boost::asio::stream_socket_service<boost::asio::ip::tcp> >::async_connect<boost::_bi::bind_t<void,boost::_mfi::mf1<void,Swift::BoostConnection,boost::system::error_code const &>,boost::_bi::list2<boost::_bi::value<boost::shared_ptr<Swift::BoostConnection> >,boost::arg<1> > > >+0x11a [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\basic_socket.hpp @ 779] 0117de9c 0f210146 EvoClr!Swift::BoostConnection::connect+0x11e [c:\private\src\vendor\swift\swiften\network\boostconnection.cpp @ 70]

4 4

[serialization] avoid nvp for wrapper class
by dariomt＠gmail.com 01 Jul '14

01 Jul '14

Hi list, How do I tell Boost.Serialization to serialize a wrapper as the primitive type, without requiring an nvp wrapper? I specifically don't want an extra level in the xml output. Example: given BOOST_STRONG_TYPEDEF(int, myInt); I'd like myInt to be serialized as an int. Thanks!

1 0

[atomic] ThreadSanitizer reports a data race when using the code from "reference counting" example
by Adam Romanek 01 Jul '14

01 Jul '14

Hi Boosters! I'd like to draw your attention to an issue with Boost.Atomic that I encountered when using ThreadSanitizer. The problem is that when using the code shown in "reference counting" example [1] from the docs, the ThreadSanitizer reports a data race. Everything is described in detail in a StackOverflow thread [2] so I don't want to repeat all that here. Please help me determine whether it's a false positive, an issue in Boost.Atomic or a wrong usage of the code. Additionally, I don't understand this: Write of size 1 at 0x7d040000f7f0 by thread T2: #0 operator delete(void*) <null>:0 (a.out+0x00000004738b) What kind of write does ThreadSanitizer might refer to? WBR, Adam Romanek [1] http://www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html#bo… [2] http://stackoverflow.com/questions/24446561/threadsanitizer-reports-data-ra…

2 3

Intel 14.0.1 error with boost::bind
by Aniket Pugaonkar 01 Jul '14

01 Jul '14

Hi, I am using a test program for compiling a boost::bind in Intel MIC(Xeom Phi). Here are the details of the code and platform on which it is compiled. I am using thread building blocks in my code, but the following code does not contain any TBB threads. The errors in my test code below and original code are same. Compiler : Intel 13.0.1 / intel 14.0.1 SP1 Update 3 (latest from intel composer XE trial version) I am using our lab's compiler installed on a cluster. The TBB is installed in my home directory. boost 1.55 is also installed in my home location. Compiled for MIC: icpc -mmic -L/home/aniketnp/tbb42_20140122oss/lib/mic -std=c++11 -I/home/aniketnp/boost_1_55_0 -I/home/aniketnp/tbb42_20140122oss/include test.cpp Scenario: a functor takes 2 arguments in its operator()() by using a boost::bind() method. The operator()() method contains a function which uses comparisons ( < or > ) using if-else logic. The error pops up here. Here is the following code. #include <iostream> #include <boost/bind.hpp> using namespace std; struct Info_t { int start; int end; Info_t(int s=0,int e=0) : start(s), end(e) { } }; template <typename T, typename time> void process_info(const T& info1, const T& info2, const time& t) { //the below gives compiler error * if ((info1.start < info2.end) && (info2.end > info1.end) && (info1.end < info2.start) )* std::cout << "yess error with mic" << std::endl; //the below if works fine if ((info1.start < info2.end) && (info2.end > info1.end)) std::cout << "no error at all" << std::endl; } template<typename Time> struct my_functor { public: my_functor() { } my_functor(Time& time_) : time(time_) { } typedef void result_type; template<typename info_t> void operator()(const info_t& info1, const info_t& info2) { const auto& i1 = info1; const auto& i2 = info2; process_info<info_t, Time> (i1,i2, time); } private: Time& time; }; int main() { Info_t i1(10,2); Info_t i2(2,10); int t = 1; auto func = boost::bind( my_functor<int>(t), _1, _2 ); func(i1,i2); return 0; } test.cpp(16): error: expression must have a constant value if ((info1.start < info2.end) && (info2.end > info1.end) && (info1.end < info2.start) ) ^ detected during: instantiation of "void my_functor<Time>::operator()(const info_t &, const info_t &) [with Time=int, info_t=Info_t]" at line 313 of "/home/aniketnp/boost_1_55_0/boost/bind/bind.hpp" instantiation of "void boost::_bi::list2<A1, A2>::operator()(boost::_bi::type<void>, F &, A &, int) [with A1=boost::arg<1>, A2=boost::arg<2>, F=my_functor<int>, A=boost::_bi::list2<Info_t &, Info_t &>]" at line 61 of "/home/aniketnp/boost_1_55_0/boost/bind/bind_template.hpp" instantiation of "boost::_bi::bind_t<R, F, L>::result_type boost::_bi::bind_t<R, F, L>::operator()(A1 &, A2 &) [with R=boost::_bi::unspecified, F=my_functor<int>, L=boost::_bi::list2<boost::arg<1>, boost::arg<2>>, A1=Info_t, A2=Info_t]" at line 48 test.cpp(16): error: this operator is not allowed in a template argument expression if ((info1.start < info2.end) && (info2.end > info1.end) && (info1.end < info2.start) ) ^ detected during: instantiation of "void my_functor<Time>::operator()(const info_t &, const info_t &) [with Time=int, info_t=Info_t]" at line 313 of "/home/aniketnp/boost_1_55_0/boost/bind/bind.hpp" instantiation of "void boost::_bi::list2<A1, A2>::operator()(boost::_bi::type<void>, F &, A &, int) [with A1=boost::arg<1>, A2=boost::arg<2>, F=my_functor<int>, A=boost::_bi::list2<Info_t &, Info_t &>]" at line 61 of "/home/aniketnp/boost_1_55_0/boost/bind/bind_template.hpp" instantiation of "boost::_bi::bind_t<R, F, L>::result_type boost::_bi::bind_t<R, F, L>::operator()(A1 &, A2 &) [with R=boost::_bi::unspecified, F=my_functor<int>, L=boost::_bi::list2<boost::arg<1>, boost::arg<2>>, A1=Info_t, A2=Info_t]" at line 48 test.cpp(16): error: expected a ">" if ((info1.start < info2.end) && (info2.end > info1.end) && (info1.end < info2.start) ) ^ detected during: instantiation of "void my_functor<Time>::operator()(const info_t &, const info_t &) [with Time=int, info_t=Info_t]" at line 313 of "/home/aniketnp/boost_1_55_0/boost/bind/bind.hpp" instantiation of "void boost::_bi::list2<A1, A2>::operator()(boost::_bi::type<void>, F &, A &, int) [with A1=boost::arg<1>, A2=boost::arg<2>, F=my_functor<int>, A=boost::_bi::list2<Info_t &, Info_t &>]" at line 61 of "/home/aniketnp/boost_1_55_0/boost/bind/bind_template.hpp" instantiation of "boost::_bi::bind_t<R, F, L>::result_type boost::_bi::bind_t<R, F, L>::operator()(A1 &, A2 &) [with R=boost::_bi::unspecified, F=my_functor<int>, L=boost::_bi::list2<boost::arg<1>, boost::arg<2>>, A1=Info_t, A2=Info_t]" at line 48 As a workaround, I try to do this, but same error if ((info2.start < info2.end) && (info2.end > info1.end) ) { if ( info1.end < info2.start) //do something } // error is propagated towards inner if loop test.cpp(17): error: expression must have a constant value if ( info1.end < info2.start) ^ detected during: instantiation of "void my_functor<Time>::operator()(const info_t &, const info_t &) [with Time=int, info_t=Info_t]" at line 313 of "/home/aniketnp/boost_1_55_0/boost/bind/bind.hpp" instantiation of "void boost::_bi::list2<A1, A2>::operator()(boost::_bi::type<void>, F &, A &, int) [with A1=boost::arg<1>, A2=boost::arg<2>, F=my_functor<int>, A=boost::_bi::list2<Info_t &, Info_t &>]" at line 61 of "/home/aniketnp/boost_1_55_0/boost/bind/bind_template.hpp" instantiation of "boost::_bi::bind_t<R, F, L>::result_type boost::_bi::bind_t<R, F, L>::operator()(A1 &, A2 &) [with R=boost::_bi::unspecified, F=my_functor<int>, L=boost::_bi::list2<boost::arg<1>, boost::arg<2>>, A1=Info_t, A2=Info_t]" at line 49 test.cpp(17): error: this operator is not allowed in a template argument expression (rest error is the same) ------------------------------------------------------------------------------------------------- Now, if I compile it without " -mmic " flag, then there is no compiler errors. I compile with this : icpc -L/home/aniketnp/tbb42_20140122oss/lib/intel64/gcc4.4 -std=c++11 -I/home/aniketnp/boost_1_55_0 -I/home/aniketnp/tbb42_20140122oss/include test.cpp I dont get any error. It compiles and runs fine. Any thoughts ? Please let me know. -- Thanks and regards, Aniket Pugaonkar

1 0

Oneshot fixture per test suit
by Florian Lindner 30 Jun '14

30 Jun '14

Hello, is it possible to have a test fixture that is created once per test suite and is destroyed after the last test of the test suite has been ran? A test suite level fixture is created before each and every test, a global fixture just once for the entire test programm. Thanks, Florian

1 0

Re: [Boost-users] [fusion] maps and arrays
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 29 Jun '14

29 Jun '14

From: Agust?n K-ballo Berg? Subject: Re: [Boost-users] [fusion] maps and arrays >Not an official answer in any way, but considering it's not explicitly >documented as supported and your test case also fails when replacing >`fusion::map` with `std::tuple` I would consider it just a fluke in the >past. On the other hand, the following code compiles correctly (albeit >with possibly a warning): Hi Agustin thanks for your reply. You are correct that what I'm doing is not documented. In fact, it doesn't really make sense now that I look at it. The for_each should be called on each type. If the type is an array it doesn't make sense for a for_each to break down the array. That said, there should be some way to specialize operator() in the functor passed to it in order to correctly handle array types. > typedef std::tuple<short, > int, > std::array<int, 2>, // note std::array > std::string > test_t; You inspired me with your use of std::array to try it out in my example. I changed "print_me" to use t.second instead of just t (which is correct) and then made a template function to support std::array with std::cout. That did the trick. Of course, the real goal here would be to handle it on the for_each side not the cout side, as outputting the types is not always the goal. > test_t test{1, 2, {}, {"hello"}}; You know one other weird thing, is that with boost 1.53 I could initialize this with std::array<int, 2> as: test_1 test{1,2, {{3,4}}, {"hello"}}; Now with 1.55 it's only working with: test_1 test{1,2,std::int<array, 2>{3, 4}, "hello"}; //missing braces on string correct I'm using both gcc 4.8.3 and clang 3.4.1. Steven

2 1

[thread] mutex is locked
by gast128 29 Jun '14

29 Jun '14

Dear all, does anybody know if there is a possibility to check if a mutex is locked? There is an 'owns_lock' on the lock type but not on the mutex. The main use case for me is debugging (and documentation) purposes: void MyClass::Process() { boost::unique_lock<boost::mutex> lck(m_mtx); ProcessImpl(); } void MyClass::ProcessImpl() { _ASSERT(m_mtx.is_locked()); //does not exist :( }

4 4

Selecting one element per fusion sequence using mpl::int_s
by gsermaid 29 Jun '14

29 Jun '14

Dear all, I am trying to create a fusion sequence whose elements are non-const references to the elements of given set of sequences. In particular, for a given sequence of integral constants, say vector< int_<2>, int_<1> >, and two fusion sequences, say X = vector< X0, X1, X2, X3 > and Y = vector< Y0, Y1, Y2 >, I would like to create the following sequence R = vector< X2&, Y1& >, such that at<0>(R) == at<2>(X) and at<1>(R) == at<1>(Y). I am using fusion::transform to achieve the above but the transform function takes the sequences as const references so I end up with R = vector<const X2&, const Y1&>, which is not what I want. Below is my code; any ideas on how to get a sequence of non-const references would be greatly appreciated. Thanks for reading! #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/transform.hpp> #include <boost/fusion/sequence/io/out.hpp> #include <boost/fusion/include/at.hpp> #include <boost/mpl/assert.hpp> #include <boost/type_traits.hpp> #include <iostream> using namespace boost::fusion; using boost::mpl::int_; using my_ints = vector< int_<2>, int_<1> >; using my_x = vector<int, double, unsigned, float>; using my_y = vector<unsigned, float, long>; using joined = vector<my_x, my_y>; struct my_functor { template <class I, class Seq> typename result_of::at<Seq, I>::type operator()(I& i, Seq& seq) const { return boost::fusion::at<I>(seq); } }; int main() { my_ints ints; my_x x(-2, 3.5, 15, -1.3); my_y y(4, 10.1, 100); joined jv(x, y); auto tv = transform(ints, jv, my_functor()); std::cout << tv << std::endl; // prints (15 10.1) // these two fail to compile because the first argument is const-qualified BOOST_MPL_ASSERT(( boost::is_same< decltype(at_c<0>(tv)), unsigned& > )); BOOST_MPL_ASSERT(( boost::is_same< decltype(at_c<1>(tv)), float& > )); }

2 1

[fusion] maps and arrays
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 28 Jun '14

28 Jun '14

I've had some code written with boost 1.53 a while ago that uses fusion maps to define at compile-time packet structures. There is then compile time generated code that handles marshaling, unmarshaling, and packet size calculation on these structures. One of the big reasons for going this route was the ability to have arrays contained in the packets. When upgrading from boost 1.53 to 1.55 on my Gentoo box, this all broke. I posted a bug report at https://svn.boost.org/trac/boost/ticket/10133 but it seems fusion bug reports don't get much activity here. I'm contacting the list to ask if the use of arrays in containers was just a fluke or if it should be working and something happened in 1.55 (or possibly 1.54 which I never tried.) If this is not something that should be supported then I will abandon this code and go with something else. It's been really nice to work on some client/server stuff with it because the work that went in to handle the code generation saves a lot of time going forward. Thanks, Steven

2 1

Boost.Coroutine with segmentation fault
by Van Pers 27 Jun '14

27 Jun '14

Hi all, I am writting a code with Coroutines lib, this code uses coroutines in a recursive way but when I create a large number of coroutines the program crashes (segmentation fault). I write a simplified version that reproduces this error: #include<iostream> #include<cstdlib> #include<boost/coroutine/all.hpp> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> class FClass{ private: int n; public: boost::coroutines::coroutine<void>::pull_type* startResume; FClass(int n) : n(n){ startResume = NULL; } void resume(){ if(startResume && *(startResume)) (*(startResume))(); } void doSomething ( boost::coroutines::coroutine< void >::push_type & fPause){ if (n > 2){ FClass* tc1 = new FClass(--n); tc1->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind( &FClass::doSomething, tc1, _1) ); FClass* tc2 = new FClass(--n); tc2->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind( &FClass::doSomething, tc2, _1) ); fPause(); tc1->resume(); tc2->resume(); } return; } }; int main(int argc, char** argv){ int max = 10; if (argc > 1){ max = atoi(argv[1]); } FClass* firstObject = new FClass (max) ; firstObject->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind(&FClass::doSomething, firstObject, _1) ); firstObject->resume(); } gdb output reports:"memset () at ../sysdeps/x86_64/memset.S:78 ../sysdeps/x86_64/memset.S:No such file or directory." Anybody can help me? Regards, Van

1 0

core when using managed shared memory -- file based
by Sean K 27 Jun '14

27 Jun '14

I have a client and server set up where the client would write to the shared memory via a managed memory vector. And then the server would read that shared memory via the managed mapped file. It works for most situations. However, I just ran into a situation where the client -- writing to the vector, crashes. and I am trying to figure out what caused the crash. Below are the client (writer) and the server (reader) source code.... as close as to the current. Any insights as to why the vector.push_back() crashed? (this is happening on RH 5.9 64 bit OS.. but the code is compiled for 32 bit.) client: #include <iostream> #include <iostream> #include <string> #include <cstdlib> using namespace std; #include "fileheader.h" int main() { std::string data = "Hello"; char myinput[1024]; printf("enter number of count \n"); scanf("%s", &myinput); printf("You entered %s \n", myinput); data = myinput; int count = std::atoi(myinput); for (int counter = 0; counter < count; counter ++) { try { std::string tmpPath = "/var/tmp/log/testfile/ManagedMappedFile";; printf("temp directory: %s \n", tmpPath.c_str()); managed_mapped_file segment(open_or_create, tmpPath.c_str(), SHARED_MEMORY_SIZE); printf("initialized managed shared memory \n"); BString bstrData(segment.get_segment_manager()); bstrData = "hello world"; StrAllocator alloc_init(segment.get_segment_manager()); printf("ALLOCATED memory successfully\n"); BStrVector *myvec = segment.find_or_construct<BStrVector> (SHARED_VECTOR_NAME)(alloc_init); myvec->push_back(bstrData); segment.flush(); printf("inserted mystring into shmvector %d\n", counter); } catch (boost::interprocess::bad_alloc e) { printf("we caught bad alloc\n"); printf("explanation: %s\n", e.what()); printf("error code: %d\n", e.get_error_code()); printf("native: %d\n", e.get_native_error()); break; } catch (...) { printf("caught unknown exception\n"); } } printf("wrote number"); return 0; } contents of fileheader.h #ifndef FILEHEADER_H_ #define FILEHEADER_H_ #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/managed_mapped_file.hpp> #include <boost/thread/thread.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/string.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/detail/tmp_dir_helpers.hpp> using namespace boost::interprocess; typedef boost::interprocess::managed_mapped_file::segment_manager segment_manager_t; typedef boost::interprocess::allocator<char, segment_manager_t> ShmemAllocator; typedef boost::interprocess::basic_string<char, std::char_traits<char>, ShmemAllocator> BString; typedef boost::interprocess::allocator<BString, segment_manager_t> StrAllocator; typedef boost::interprocess::vector<BString, StrAllocator> BStrVector; typedef std::pair<BString *, std::size_t> BStringPair; typedef std::pair<BStrVector *, std::size_t> BStrVectorPair; const char * SHARED_VECTOR_NAME = "MyVector"; const int SHARED_MEMORY_SIZE = 65536; #endif /* FILEHEADER_H_ */ g++ -m32 -fPIC -Xlinker -zmuldefs filewriter.cpp -o writer -I/cots/boost_1_42_0/include -L/cots/boost_1_42_0/lib -lboost_thread -lboost_system -pthread Server: #include <iostream> #include <string> #include <cstdlib> using namespace std; #include "../../filewriter/src/fileheader.h" int main() { int count = 0; std::string tmpPath = "/var/tmp/log/testfile"; //boost::interprocess::detail::get_tmp_base_dir(tmpPath); printf("temp directory: %s \n", tmpPath.c_str()); //boost::interprocess::detail::create_tmp_dir_and_get_filename("ManagedMappedFile", tmpPath); printf("temp file: %s \n", tmpPath.c_str()); // file_mapping::remove(tmpPath.c_str()); while (true) { try { managed_mapped_file segment(open_only, tmpPath.c_str()); if (segment.get_num_named_objects() > 0){ BStrVectorPair message = segment.find<BStrVector> (SHARED_VECTOR_NAME); printf("stuff in memory\n"); int size = message.first->size(); int retcode = 0; bool success=true; printf("PROCESS: Number of messages: %d\n", size); for (int imessage=0; imessage < size ; imessage++){ const char * const buffer = message.first->at(imessage).c_str(); int len = message.first->at(imessage).length(); printf("PROCESS: going to process this message: %s\n" , buffer); } printf("p.second: %d \n", message.second); segment.destroy<BStrVectorPair>(SHARED_VECTOR_NAME); } } catch (exception& e){ printf("exception %s", e.what()); } catch (...){ printf("unexpected exception"); } int msecs = 2000; boost::this_thread::sleep(boost::posix_time::milliseconds(msecs)); printf("sleeping...\n"); } return 0; } g++ -m32 -fPIC -Xlinker -zmuldefs filereader.cpp -o reader -I/cots/boost_1_42_0/include -L/cots/boost_1_42_0/lib -lboost_thread -lboost_system -pthread

1 0

Unexpected behavior when using as::ftime() of Boost Locale library
by Mouse Beer 27 Jun '14

27 Jun '14

Hi all, I see a mismatch when using %Y format specifier with as::ftime. It looks like it outputs the year according to the week of the year. I hope I didn't miss or misunderstand anything... please find my small test program attached for reference. It was compiled as follows: g++ -g -Wall -I /opt/boost/1.55/include -L /opt/boost/1.55/lib -lboost_locale -lboost_thread -lboost_system -licuuc -licui18n -licudata -lpthread -lrt boost_dates_test.cpp I am running on Debian Testing: $ ldd a.out linux-vdso.so.1 (0x00007fffa39fe000) libboost_locale.so.1.55.0 => /opt/boost/1.55/lib/libboost_locale.so.1.55.0 (0x00007fba3335b000) libboost_thread.so.1.55.0 => /opt/boost/1.55/lib/libboost_thread.so.1.55.0 (0x00007fba33142000) libboost_system.so.1.55.0 => /opt/boost/1.55/lib/libboost_system.so.1.55.0 (0x00007fba32f3e000) libicuuc.so.52 => /usr/lib/x86_64-linux-gnu/libicuuc.so.52 (0x00007fba32ba2000) libicui18n.so.52 => /usr/lib/x86_64-linux-gnu/libicui18n.so.52 (0x00007fba3279a000) libicudata.so.52 => /usr/lib/x86_64-linux-gnu/libicudata.so.52 (0x00007fba30f2c000) libpthread.so.0 => /lib/x86_64-linux-gnu/libpthread.so.0 (0x00007fba30d0f000) librt.so.1 => /lib/x86_64-linux-gnu/librt.so.1 (0x00007fba30b07000) libstdc++.so.6 => /usr/lib/x86_64-linux-gnu/libstdc++.so.6 (0x00007fba307fb000) libm.so.6 => /lib/x86_64-linux-gnu/libm.so.6 (0x00007fba304fa000) libgcc_s.so.1 => /lib/x86_64-linux-gnu/libgcc_s.so.1 (0x00007fba302e4000) libc.so.6 => /lib/x86_64-linux-gnu/libc.so.6 (0x00007fba2ff3a000) libboost_chrono.so.1.55.0 => /opt/boost/1.55/lib/libboost_chrono.so.1.55.0 (0x00007fba2fd34000) libdl.so.2 => /lib/x86_64-linux-gnu/libdl.so.2 (0x00007fba2fb2f000) /lib64/ld-linux-x86-64.so.2 (0x00007fba33642000) The program shows the output of cout<<date_time and cout<<as:ftime("%Y-%m...")<<date_time If a mismatch in the year is detected, a "!" is added at the end of the line. When running with en_US locale, the output is as follows: [ 10:49:40 ] [0] $ export LC_ALL=en_US.utf8 [ 10:50:39 ] [0] $ locale LANG= LANGUAGE= LC_CTYPE="en_US.utf8" LC_NUMERIC="en_US.utf8" LC_TIME="en_US.utf8" LC_COLLATE="en_US.utf8" LC_MONETARY="en_US.utf8" LC_MESSAGES="en_US.utf8" LC_PAPER="en_US.utf8" LC_NAME="en_US.utf8" LC_ADDRESS="en_US.utf8" LC_TELEPHONE="en_US.utf8" LC_MEASUREMENT="en_US.utf8" LC_IDENTIFICATION="en_US.utf8" LC_ALL=en_US.utf8 [ 10:50:41 ] [0] $ ./a.out Dec 27, 2000, 12:00:00 AM ++ 2000-12-27 00:00:00 Dec 28, 2000, 12:00:00 AM ++ 2000-12-28 00:00:00 Dec 29, 2000, 12:00:00 AM ++ 2000-12-29 00:00:00 Dec 30, 2000, 12:00:00 AM ++ 2000-12-30 00:00:00 Dec 31, 2000, 12:00:00 AM ++ 2001-12-31 00:00:00 ! Jan 1, 2001, 12:00:00 AM ++ 2001-01-01 00:00:00 Jan 2, 2001, 12:00:00 AM ++ 2001-01-02 00:00:00 Jan 3, 2001, 12:00:00 AM ++ 2001-01-03 00:00:00 Jan 4, 2001, 12:00:00 AM ++ 2001-01-04 00:00:00 Jan 5, 2001, 12:00:00 AM ++ 2001-01-05 00:00:00 Dec 27, 2001, 12:00:00 AM ++ 2001-12-27 00:00:00 Dec 28, 2001, 12:00:00 AM ++ 2001-12-28 00:00:00 Dec 29, 2001, 12:00:00 AM ++ 2001-12-29 00:00:00 Dec 30, 2001, 12:00:00 AM ++ 2002-12-30 00:00:00 ! Dec 31, 2001, 12:00:00 AM ++ 2002-12-31 00:00:00 ! Jan 1, 2002, 12:00:00 AM ++ 2002-01-01 00:00:00 Jan 2, 2002, 12:00:00 AM ++ 2002-01-02 00:00:00 Jan 3, 2002, 12:00:00 AM ++ 2002-01-03 00:00:00 Jan 4, 2002, 12:00:00 AM ++ 2002-01-04 00:00:00 Jan 5, 2002, 12:00:00 AM ++ 2002-01-05 00:00:00 Dec 27, 2002, 12:00:00 AM ++ 2002-12-27 00:00:00 Dec 28, 2002, 12:00:00 AM ++ 2002-12-28 00:00:00 Dec 29, 2002, 12:00:00 AM ++ 2003-12-29 00:00:00 ! Dec 30, 2002, 12:00:00 AM ++ 2003-12-30 00:00:00 ! Dec 31, 2002, 12:00:00 AM ++ 2003-12-31 00:00:00 ! Jan 1, 2003, 12:00:00 AM ++ 2003-01-01 00:00:00 Jan 2, 2003, 12:00:00 AM ++ 2003-01-02 00:00:00 Jan 3, 2003, 12:00:00 AM ++ 2003-01-03 00:00:00 Jan 4, 2003, 12:00:00 AM ++ 2003-01-04 00:00:00 Jan 5, 2003, 12:00:00 AM ++ 2003-01-05 00:00:00 Dec 27, 2003, 12:00:00 AM ++ 2003-12-27 00:00:00 Dec 28, 2003, 12:00:00 AM ++ 2004-12-28 00:00:00 ! Dec 29, 2003, 12:00:00 AM ++ 2004-12-29 00:00:00 ! Dec 30, 2003, 12:00:00 AM ++ 2004-12-30 00:00:00 ! Dec 31, 2003, 12:00:00 AM ++ 2004-12-31 00:00:00 ! Jan 1, 2004, 12:00:00 AM ++ 2004-01-01 00:00:00 Jan 2, 2004, 12:00:00 AM ++ 2004-01-02 00:00:00 Jan 3, 2004, 12:00:00 AM ++ 2004-01-03 00:00:00 Jan 4, 2004, 12:00:00 AM ++ 2004-01-04 00:00:00 Jan 5, 2004, 12:00:00 AM ++ 2004-01-05 00:00:00 Dec 27, 2004, 12:00:00 AM ++ 2005-12-27 00:00:00 ! Dec 28, 2004, 12:00:00 AM ++ 2005-12-28 00:00:00 ! Dec 29, 2004, 12:00:00 AM ++ 2005-12-29 00:00:00 ! Dec 30, 2004, 12:00:00 AM ++ 2005-12-30 00:00:00 ! Dec 31, 2004, 12:00:00 AM ++ 2005-12-31 00:00:00 ! Jan 1, 2005, 12:00:00 AM ++ 2005-01-01 00:00:00 Jan 2, 2005, 12:00:00 AM ++ 2005-01-02 00:00:00 Jan 3, 2005, 12:00:00 AM ++ 2005-01-03 00:00:00 Jan 4, 2005, 12:00:00 AM ++ 2005-01-04 00:00:00 Jan 5, 2005, 12:00:00 AM ++ 2005-01-05 00:00:00 Dec 27, 2005, 12:00:00 AM ++ 2005-12-27 00:00:00 Dec 28, 2005, 12:00:00 AM ++ 2005-12-28 00:00:00 Dec 29, 2005, 12:00:00 AM ++ 2005-12-29 00:00:00 Dec 30, 2005, 12:00:00 AM ++ 2005-12-30 00:00:00 Dec 31, 2005, 12:00:00 AM ++ 2005-12-31 00:00:00 Jan 1, 2006, 12:00:00 AM ++ 2006-01-01 00:00:00 Jan 2, 2006, 12:00:00 AM ++ 2006-01-02 00:00:00 Jan 3, 2006, 12:00:00 AM ++ 2006-01-03 00:00:00 Jan 4, 2006, 12:00:00 AM ++ 2006-01-04 00:00:00 Jan 5, 2006, 12:00:00 AM ++ 2006-01-05 00:00:00 Dec 27, 2006, 12:00:00 AM ++ 2006-12-27 00:00:00 Dec 28, 2006, 12:00:00 AM ++ 2006-12-28 00:00:00 Dec 29, 2006, 12:00:00 AM ++ 2006-12-29 00:00:00 Dec 30, 2006, 12:00:00 AM ++ 2006-12-30 00:00:00 Dec 31, 2006, 12:00:00 AM ++ 2007-12-31 00:00:00 ! Jan 1, 2007, 12:00:00 AM ++ 2007-01-01 00:00:00 Jan 2, 2007, 12:00:00 AM ++ 2007-01-02 00:00:00 Jan 3, 2007, 12:00:00 AM ++ 2007-01-03 00:00:00 Jan 4, 2007, 12:00:00 AM ++ 2007-01-04 00:00:00 Jan 5, 2007, 12:00:00 AM ++ 2007-01-05 00:00:00 Dec 27, 2007, 12:00:00 AM ++ 2007-12-27 00:00:00 Dec 28, 2007, 12:00:00 AM ++ 2007-12-28 00:00:00 Dec 29, 2007, 12:00:00 AM ++ 2007-12-29 00:00:00 Dec 30, 2007, 12:00:00 AM ++ 2008-12-30 00:00:00 ! Dec 31, 2007, 12:00:00 AM ++ 2008-12-31 00:00:00 ! Jan 1, 2008, 12:00:00 AM ++ 2008-01-01 00:00:00 Jan 2, 2008, 12:00:00 AM ++ 2008-01-02 00:00:00 Jan 3, 2008, 12:00:00 AM ++ 2008-01-03 00:00:00 Jan 4, 2008, 12:00:00 AM ++ 2008-01-04 00:00:00 Jan 5, 2008, 12:00:00 AM ++ 2008-01-05 00:00:00 Dec 27, 2008, 12:00:00 AM ++ 2008-12-27 00:00:00 Dec 28, 2008, 12:00:00 AM ++ 2009-12-28 00:00:00 ! Dec 29, 2008, 12:00:00 AM ++ 2009-12-29 00:00:00 ! Dec 30, 2008, 12:00:00 AM ++ 2009-12-30 00:00:00 ! Dec 31, 2008, 12:00:00 AM ++ 2009-12-31 00:00:00 ! Jan 1, 2009, 12:00:00 AM ++ 2009-01-01 00:00:00 Jan 2, 2009, 12:00:00 AM ++ 2009-01-02 00:00:00 Jan 3, 2009, 12:00:00 AM ++ 2009-01-03 00:00:00 Jan 4, 2009, 12:00:00 AM ++ 2009-01-04 00:00:00 Jan 5, 2009, 12:00:00 AM ++ 2009-01-05 00:00:00 Dec 27, 2009, 12:00:00 AM ++ 2010-12-27 00:00:00 ! Dec 28, 2009, 12:00:00 AM ++ 2010-12-28 00:00:00 ! Dec 29, 2009, 12:00:00 AM ++ 2010-12-29 00:00:00 ! Dec 30, 2009, 12:00:00 AM ++ 2010-12-30 00:00:00 ! Dec 31, 2009, 12:00:00 AM ++ 2010-12-31 00:00:00 ! Jan 1, 2010, 12:00:00 AM ++ 2010-01-01 00:00:00 Jan 2, 2010, 12:00:00 AM ++ 2010-01-02 00:00:00 Jan 3, 2010, 12:00:00 AM ++ 2010-01-03 00:00:00 Jan 4, 2010, 12:00:00 AM ++ 2010-01-04 00:00:00 Jan 5, 2010, 12:00:00 AM ++ 2010-01-05 00:00:00 Dec 27, 2010, 12:00:00 AM ++ 2011-12-27 00:00:00 ! Dec 28, 2010, 12:00:00 AM ++ 2011-12-28 00:00:00 ! Dec 29, 2010, 12:00:00 AM ++ 2011-12-29 00:00:00 ! Dec 30, 2010, 12:00:00 AM ++ 2011-12-30 00:00:00 ! Dec 31, 2010, 12:00:00 AM ++ 2011-12-31 00:00:00 ! Jan 1, 2011, 12:00:00 AM ++ 2011-01-01 00:00:00 Jan 2, 2011, 12:00:00 AM ++ 2011-01-02 00:00:00 Jan 3, 2011, 12:00:00 AM ++ 2011-01-03 00:00:00 Jan 4, 2011, 12:00:00 AM ++ 2011-01-04 00:00:00 Jan 5, 2011, 12:00:00 AM ++ 2011-01-05 00:00:00 Dec 27, 2011, 12:00:00 AM ++ 2011-12-27 00:00:00 Dec 28, 2011, 12:00:00 AM ++ 2011-12-28 00:00:00 Dec 29, 2011, 12:00:00 AM ++ 2011-12-29 00:00:00 Dec 30, 2011, 12:00:00 AM ++ 2011-12-30 00:00:00 Dec 31, 2011, 12:00:00 AM ++ 2011-12-31 00:00:00 Jan 1, 2012, 12:00:00 AM ++ 2012-01-01 00:00:00 Jan 2, 2012, 12:00:00 AM ++ 2012-01-02 00:00:00 Jan 3, 2012, 12:00:00 AM ++ 2012-01-03 00:00:00 Jan 4, 2012, 12:00:00 AM ++ 2012-01-04 00:00:00 Jan 5, 2012, 12:00:00 AM ++ 2012-01-05 00:00:00 Dec 27, 2012, 12:00:00 AM ++ 2012-12-27 00:00:00 Dec 28, 2012, 12:00:00 AM ++ 2012-12-28 00:00:00 Dec 29, 2012, 12:00:00 AM ++ 2012-12-29 00:00:00 Dec 30, 2012, 12:00:00 AM ++ 2013-12-30 00:00:00 ! Dec 31, 2012, 12:00:00 AM ++ 2013-12-31 00:00:00 ! Jan 1, 2013, 12:00:00 AM ++ 2013-01-01 00:00:00 Jan 2, 2013, 12:00:00 AM ++ 2013-01-02 00:00:00 Jan 3, 2013, 12:00:00 AM ++ 2013-01-03 00:00:00 Jan 4, 2013, 12:00:00 AM ++ 2013-01-04 00:00:00 Jan 5, 2013, 12:00:00 AM ++ 2013-01-05 00:00:00 Dec 27, 2013, 12:00:00 AM ++ 2013-12-27 00:00:00 Dec 28, 2013, 12:00:00 AM ++ 2013-12-28 00:00:00 Dec 29, 2013, 12:00:00 AM ++ 2014-12-29 00:00:00 ! Dec 30, 2013, 12:00:00 AM ++ 2014-12-30 00:00:00 ! Dec 31, 2013, 12:00:00 AM ++ 2014-12-31 00:00:00 ! Jan 1, 2014, 12:00:00 AM ++ 2014-01-01 00:00:00 Jan 2, 2014, 12:00:00 AM ++ 2014-01-02 00:00:00 Jan 3, 2014, 12:00:00 AM ++ 2014-01-03 00:00:00 Jan 4, 2014, 12:00:00 AM ++ 2014-01-04 00:00:00 Jan 5, 2014, 12:00:00 AM ++ 2014-01-05 00:00:00 When running with de_DE locale, the output is as follows: [ 10:51:42 ] [0] $ export LC_ALL=de_DE.utf8 [ 10:55:04 ] [0] $ locale LANG= LANGUAGE= LC_CTYPE="de_DE.utf8" LC_NUMERIC="de_DE.utf8" LC_TIME="de_DE.utf8" LC_COLLATE="de_DE.utf8" LC_MONETARY="de_DE.utf8" LC_MESSAGES="de_DE.utf8" LC_PAPER="de_DE.utf8" LC_NAME="de_DE.utf8" LC_ADDRESS="de_DE.utf8" LC_TELEPHONE="de_DE.utf8" LC_MEASUREMENT="de_DE.utf8" LC_IDENTIFICATION="de_DE.utf8" LC_ALL=de_DE.utf8 [ 10:55:05 ] [0] $ ./a.out 27.12.2000 00:00:00 ++ 2000-12-27 00:00:00 28.12.2000 00:00:00 ++ 2000-12-28 00:00:00 29.12.2000 00:00:00 ++ 2000-12-29 00:00:00 30.12.2000 00:00:00 ++ 2000-12-30 00:00:00 31.12.2000 00:00:00 ++ 2000-12-31 00:00:00 01.01.2001 00:00:00 ++ 2001-01-01 00:00:00 02.01.2001 00:00:00 ++ 2001-01-02 00:00:00 03.01.2001 00:00:00 ++ 2001-01-03 00:00:00 04.01.2001 00:00:00 ++ 2001-01-04 00:00:00 05.01.2001 00:00:00 ++ 2001-01-05 00:00:00 27.12.2001 00:00:00 ++ 2001-12-27 00:00:00 28.12.2001 00:00:00 ++ 2001-12-28 00:00:00 29.12.2001 00:00:00 ++ 2001-12-29 00:00:00 30.12.2001 00:00:00 ++ 2001-12-30 00:00:00 31.12.2001 00:00:00 ++ 2002-12-31 00:00:00 ! 01.01.2002 00:00:00 ++ 2002-01-01 00:00:00 02.01.2002 00:00:00 ++ 2002-01-02 00:00:00 03.01.2002 00:00:00 ++ 2002-01-03 00:00:00 04.01.2002 00:00:00 ++ 2002-01-04 00:00:00 05.01.2002 00:00:00 ++ 2002-01-05 00:00:00 27.12.2002 00:00:00 ++ 2002-12-27 00:00:00 28.12.2002 00:00:00 ++ 2002-12-28 00:00:00 29.12.2002 00:00:00 ++ 2002-12-29 00:00:00 30.12.2002 00:00:00 ++ 2003-12-30 00:00:00 ! 31.12.2002 00:00:00 ++ 2003-12-31 00:00:00 ! 01.01.2003 00:00:00 ++ 2003-01-01 00:00:00 02.01.2003 00:00:00 ++ 2003-01-02 00:00:00 03.01.2003 00:00:00 ++ 2003-01-03 00:00:00 04.01.2003 00:00:00 ++ 2003-01-04 00:00:00 05.01.2003 00:00:00 ++ 2003-01-05 00:00:00 27.12.2003 00:00:00 ++ 2003-12-27 00:00:00 28.12.2003 00:00:00 ++ 2003-12-28 00:00:00 29.12.2003 00:00:00 ++ 2004-12-29 00:00:00 ! 30.12.2003 00:00:00 ++ 2004-12-30 00:00:00 ! 31.12.2003 00:00:00 ++ 2004-12-31 00:00:00 ! 01.01.2004 00:00:00 ++ 2004-01-01 00:00:00 02.01.2004 00:00:00 ++ 2004-01-02 00:00:00 03.01.2004 00:00:00 ++ 2004-01-03 00:00:00 04.01.2004 00:00:00 ++ 2004-01-04 00:00:00 05.01.2004 00:00:00 ++ 2004-01-05 00:00:00 27.12.2004 00:00:00 ++ 2004-12-27 00:00:00 28.12.2004 00:00:00 ++ 2004-12-28 00:00:00 29.12.2004 00:00:00 ++ 2004-12-29 00:00:00 30.12.2004 00:00:00 ++ 2004-12-30 00:00:00 31.12.2004 00:00:00 ++ 2004-12-31 00:00:00 01.01.2005 00:00:00 ++ 2004-01-01 00:00:00 ! 02.01.2005 00:00:00 ++ 2004-01-02 00:00:00 ! 03.01.2005 00:00:00 ++ 2005-01-03 00:00:00 04.01.2005 00:00:00 ++ 2005-01-04 00:00:00 05.01.2005 00:00:00 ++ 2005-01-05 00:00:00 27.12.2005 00:00:00 ++ 2005-12-27 00:00:00 28.12.2005 00:00:00 ++ 2005-12-28 00:00:00 29.12.2005 00:00:00 ++ 2005-12-29 00:00:00 30.12.2005 00:00:00 ++ 2005-12-30 00:00:00 31.12.2005 00:00:00 ++ 2005-12-31 00:00:00 01.01.2006 00:00:00 ++ 2005-01-01 00:00:00 ! 02.01.2006 00:00:00 ++ 2006-01-02 00:00:00 03.01.2006 00:00:00 ++ 2006-01-03 00:00:00 04.01.2006 00:00:00 ++ 2006-01-04 00:00:00 05.01.2006 00:00:00 ++ 2006-01-05 00:00:00 27.12.2006 00:00:00 ++ 2006-12-27 00:00:00 28.12.2006 00:00:00 ++ 2006-12-28 00:00:00 29.12.2006 00:00:00 ++ 2006-12-29 00:00:00 30.12.2006 00:00:00 ++ 2006-12-30 00:00:00 31.12.2006 00:00:00 ++ 2006-12-31 00:00:00 01.01.2007 00:00:00 ++ 2007-01-01 00:00:00 02.01.2007 00:00:00 ++ 2007-01-02 00:00:00 03.01.2007 00:00:00 ++ 2007-01-03 00:00:00 04.01.2007 00:00:00 ++ 2007-01-04 00:00:00 05.01.2007 00:00:00 ++ 2007-01-05 00:00:00 27.12.2007 00:00:00 ++ 2007-12-27 00:00:00 28.12.2007 00:00:00 ++ 2007-12-28 00:00:00 29.12.2007 00:00:00 ++ 2007-12-29 00:00:00 30.12.2007 00:00:00 ++ 2007-12-30 00:00:00 31.12.2007 00:00:00 ++ 2008-12-31 00:00:00 ! 01.01.2008 00:00:00 ++ 2008-01-01 00:00:00 02.01.2008 00:00:00 ++ 2008-01-02 00:00:00 03.01.2008 00:00:00 ++ 2008-01-03 00:00:00 04.01.2008 00:00:00 ++ 2008-01-04 00:00:00 05.01.2008 00:00:00 ++ 2008-01-05 00:00:00 27.12.2008 00:00:00 ++ 2008-12-27 00:00:00 28.12.2008 00:00:00 ++ 2008-12-28 00:00:00 29.12.2008 00:00:00 ++ 2009-12-29 00:00:00 ! 30.12.2008 00:00:00 ++ 2009-12-30 00:00:00 ! 31.12.2008 00:00:00 ++ 2009-12-31 00:00:00 ! 01.01.2009 00:00:00 ++ 2009-01-01 00:00:00 02.01.2009 00:00:00 ++ 2009-01-02 00:00:00 03.01.2009 00:00:00 ++ 2009-01-03 00:00:00 04.01.2009 00:00:00 ++ 2009-01-04 00:00:00 05.01.2009 00:00:00 ++ 2009-01-05 00:00:00 27.12.2009 00:00:00 ++ 2009-12-27 00:00:00 28.12.2009 00:00:00 ++ 2009-12-28 00:00:00 29.12.2009 00:00:00 ++ 2009-12-29 00:00:00 30.12.2009 00:00:00 ++ 2009-12-30 00:00:00 31.12.2009 00:00:00 ++ 2009-12-31 00:00:00 01.01.2010 00:00:00 ++ 2009-01-01 00:00:00 ! 02.01.2010 00:00:00 ++ 2009-01-02 00:00:00 ! 03.01.2010 00:00:00 ++ 2009-01-03 00:00:00 ! 04.01.2010 00:00:00 ++ 2010-01-04 00:00:00 05.01.2010 00:00:00 ++ 2010-01-05 00:00:00 27.12.2010 00:00:00 ++ 2010-12-27 00:00:00 28.12.2010 00:00:00 ++ 2010-12-28 00:00:00 29.12.2010 00:00:00 ++ 2010-12-29 00:00:00 30.12.2010 00:00:00 ++ 2010-12-30 00:00:00 31.12.2010 00:00:00 ++ 2010-12-31 00:00:00 01.01.2011 00:00:00 ++ 2010-01-01 00:00:00 ! 02.01.2011 00:00:00 ++ 2010-01-02 00:00:00 ! 03.01.2011 00:00:00 ++ 2011-01-03 00:00:00 04.01.2011 00:00:00 ++ 2011-01-04 00:00:00 05.01.2011 00:00:00 ++ 2011-01-05 00:00:00 27.12.2011 00:00:00 ++ 2011-12-27 00:00:00 28.12.2011 00:00:00 ++ 2011-12-28 00:00:00 29.12.2011 00:00:00 ++ 2011-12-29 00:00:00 30.12.2011 00:00:00 ++ 2011-12-30 00:00:00 31.12.2011 00:00:00 ++ 2011-12-31 00:00:00 01.01.2012 00:00:00 ++ 2011-01-01 00:00:00 ! 02.01.2012 00:00:00 ++ 2012-01-02 00:00:00 03.01.2012 00:00:00 ++ 2012-01-03 00:00:00 04.01.2012 00:00:00 ++ 2012-01-04 00:00:00 05.01.2012 00:00:00 ++ 2012-01-05 00:00:00 27.12.2012 00:00:00 ++ 2012-12-27 00:00:00 28.12.2012 00:00:00 ++ 2012-12-28 00:00:00 29.12.2012 00:00:00 ++ 2012-12-29 00:00:00 30.12.2012 00:00:00 ++ 2012-12-30 00:00:00 31.12.2012 00:00:00 ++ 2013-12-31 00:00:00 ! 01.01.2013 00:00:00 ++ 2013-01-01 00:00:00 02.01.2013 00:00:00 ++ 2013-01-02 00:00:00 03.01.2013 00:00:00 ++ 2013-01-03 00:00:00 04.01.2013 00:00:00 ++ 2013-01-04 00:00:00 05.01.2013 00:00:00 ++ 2013-01-05 00:00:00 27.12.2013 00:00:00 ++ 2013-12-27 00:00:00 28.12.2013 00:00:00 ++ 2013-12-28 00:00:00 29.12.2013 00:00:00 ++ 2013-12-29 00:00:00 30.12.2013 00:00:00 ++ 2014-12-30 00:00:00 ! 31.12.2013 00:00:00 ++ 2014-12-31 00:00:00 ! 01.01.2014 00:00:00 ++ 2014-01-01 00:00:00 02.01.2014 00:00:00 ++ 2014-01-02 00:00:00 03.01.2014 00:00:00 ++ 2014-01-03 00:00:00 04.01.2014 00:00:00 ++ 2014-01-04 00:00:00 05.01.2014 00:00:00 ++ 2014-01-05 00:00:00 Sorry for the long post! Did I make any mistake in my program or is this a bug of as::ftime("%Y") formatting? Thank you yery much for your help! Regards, Holger

1 0

[Boost : icpc assignment operator compiler error with boost filter_iterator and filtered_graph
by Aniket Pugaonkar 26 Jun '14

26 Jun '14

Hello, I have the following filter iterator working perfectly with gcc 4.7 and 4.9 as well (C++11 support) But when I compile my code with intel compiler 13.0.1 version I get the following error error: *implicitly generated assignment operator cannot copy: reference member* "my_func::G" ... Details: I am using a filtered_graph over Boost::adjacency_list as my graph type (Graph_t). The vertex_iterator (from graph_traits<Graph_t> .. provides iterator range to iterate over graph vertices. I have to assign each graph vertex an id (using property_maps) and group them together by applying filter_iterator over vertex iterator. example: suppose I want to create 4 subgroups of vertices. So I create a filter predicate which is passed to filter iterator which gives me iterators <fbegin, fend> satisfying the predicate. For FOUR such groups, I get 4 pairs of filter iterators. A vector stores such filter_iterator pairs. std::vector < pair <filter_iterator_t, filter_iterator_t> > my_vector //stores iterator pair. Here is the code: vertex_iterator vbegin, vend; boost::tie(vbegin, vend) = boost::vertices(G); for (int i=0; i<4; ++i) { //for each i, create a filter_pred object my_filter_pred <Graph> filter_pred(G, i) //now create begin and end filter iterators as follows auto fbegin = boost::make_filter_iterator< my_filter_pred<Graph>, vertex_iterator> (filter_pred, vbegin, vend) auto fend = boost::make_filter_iterator< my_filter_pred<Graph>, vertex_iterator> (filter_pred, vend, vend) //fbegin, fend are of type filter iterator //insert the iterator pair into vector my_vector.push_back( std::make_pair (fbegin, fend) ); } The predicate is below : template<typename Graph> struct my_filter_pred { public: my_filter_pred() { } my_filter_pred(Graph& _G, int _value) : G(_G), value(_value) { } template<typename vertex_t> bool operator() (vertex_t vertex) { //get property "p" of vertex in graph G auto p = get (mypropertytype, vertex, G); return (p.val == value); } private: Graph& G; } ERROR : error: implicitly generated assignment operator cannot copy: reference member "my_filter_pred <Graph>::G [with ... ]" I tried to provide my own assignment operator as below: my_filter_pred& operator=(const my_filter_pred& other) { if (this != &other) G = other.G; return *this; } But it gave the same icpc error for actual typedef graph which is below : error: implicitly generated assignment operator cannot copy: " implicit generation of boost::filtered_graph_base<Graph_t> " .... Please help what should I do in this case to work. main motive : is to have a container which stores <iterator, iterator> pair which satisfies a predicate. Filter iterator was the best choice i could have to apply different filter predicate to same vertex_iterator range vbegin, vend; Thanks Aniket Pugaonkar Aniket Pugaonkar

1 0

[Bimap] Iterator invalidation
by Adam Badura 25 Jun '14

25 Jun '14

What are rules for iterator invalidation in Boost.Bimap? I have looked in documentation (version 1.55) but didn't found anything. I'm particularly interested in the bimap<...>::iterator (or ::const_iterator) invalidation. But the question remains valid for any kind of iterators. Adam Badura

2 2

Autobahn for C++: RPC and PubSub
by Tobias Oberstein 24 Jun '14

24 Jun '14

Hi, I'm happy to anounce Autobahn|Cpp - another subproject of Autobahn (http://autobahn.ws) this time for C++ 11 / Boost. Autobahn|Cpp allows remote procedure calls and publish & subscribe messaging for C++ application components and uses boost::future, continuations and Boost/ASIO as underlying network library. Here is how app code looks like: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#show-me-some-c… Using Autobahn|Cpp, you can e.g. call your C++ code from JavaScript running in a browser. And much more. This is an early alpha version, things aren't fully hashed out, but there are a couple of examples included here: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#examples Cheers, /Tobias

2 3

Boost Social Event at CppCon
by Jon Kalb 24 Jun '14

24 Jun '14

Boosters, Because a lot of Boosters are going to be attending CppCon, we¹d like to arrange a social event for Boosters/C++Now regulars. http://cppcon.org/ If you are planning to attend CppCon or even If you are just going to be in or around Bellevue, Washington between September 7th and 12 and you¹d like to join us for dinner, please let us know so we can get a count. Please send mail to: social(a)boost.org Once we settle on a date, etc, we¹ll let everyone who responded know when and where, so please let us know, even if you are a ³maybe.² This year¹s CppCon program includes sessions from a number of Boosters and C++Now regulars with sessions specifically about Boost Libraries. If you are considering attending, please be aware that the Early Bird registration deadline is just days away. http://cppcon.org/registration/ If you are attending, please make your hotel reservations soon. We are likely to sell out of our room block. http://cppcon.org/lodging/ I hope to see you at CppCon. Jon

1 0

Re: [Boost-users] [Boost.Test] BOOST_CHECK_THROW behaviour
by Ghyslain Leclerc 23 Jun '14

23 Jun '14

On 23/06/2014 17:19:01 +1200, Gavin Lambert wrote >>You could try submitting that as a bug report in Trac (if it's not already there), or waiting for Gennadiy Rozental's response. Done. I hope I did it properly. Never reported a bug on Boost before. Quoted our discussion, so that some more info is available if necessary. >>In the meantime, you'd need to write a more intelligent test yourself. I will do it manually. Found someone on Stack Overflow who wanted the same behavior I expected and did it. In case it helps someone, here is the snippet: try { … code that should throw ... BOOST_ERROR( “<function_name> did not throw anything. Expected a <exception_name>” ); } catch( <exception_name> const& ) { //ok, this is the expected case } catch(…) { BOOST_ERROR( “<function_name> has throw an unknown exception, but a <exception_name> was expected.” ); } and the reference: http://stackoverflow.com/questions/21774387/boost-unit-testing-exceptions Thanks again for your help.

1 0

[Boost.Test] BOOST_CHECK_THROW behaviour
by Ghyslain Leclerc 23 Jun '14

23 Jun '14

Hello, Sorry for the long post! I have a simple class, which I am posting a fraction of here for discussion sake: ------------------------------------------------------ class AsciiTableRow { public: void setCol( std::size_t colIdx, std::string const& newContent ); void setCol( std::size_t colIdx, const char* newContent ); private: void checkIdxBound_( std::size_t colIdx, std::string const& msg ); std::vector< std::string > data_; bool maxColWidthIsValid_; } inline void AsciiTableRow::setCol( std::size_t colIdx, std::string const& newVal ) { checkIdxBound_( colIdx, "setCol" ); maxColWidthIsValid_ = false; data_[colIdx] = newVal; } inline void AsciiTableRow::setCol( std::size_t colIdx, const char* newContent ) { setCol( colIdx, std::string( newContent ) ); } inline void AsciiTableRow::checkIdxBound_( std::size_t colIdx, std::string const& msg ) { if( colIdx > data_.size() ) { throw std::out_of_range( "AsciiTableRow::" + msg + " : colIdx out of range" ); } } ------------------------------------------------------ The code above should be sufficient for the discussion and I don’t think any other code is relevant. Should you need to see my constructor and destructor, nothing is virtual so I just copy every value and set some defaults. Nothing fancy, but I will gladly post the code if need be. What I do then is try and devise a test to see if the exception is indeed thrown and if it is the correct one. Here is the code I use: AsciiTableRow testRow; // empty, so any index will throw BOOST_CHECK_THROW( testRow.setCol( 30, 12 ), std::out_of_range ); BOOST_CHECK_THROW( testRow.setCol( 30, 12l ), std::out_of_range ); This works fine. Then, I had the idea to check what the behaviour would be if the wrong exception is thrown. I simply changed the first call like this : BOOST_CHECK_THROW( testRow.setCol( 30, 12 ), std::runtime_error ); BOOST_CHECK_THROW( testRow.setCol( 30, 12l ), std::out_of_range ); I was under the impression (and I might be wrong here, sorry :-( ) that the Boost.Test library would (the numbers are not to mean that order, simply there for enumeration): 1- output a message saying the test has failed, that an exception was indeed thrown, but it was not a runtime_error 2- continue the rest of the test (single test currently) 3- terminate but I actually never get the message of step 1, the execution of the rest of the test seems never occur (the second BOOST_CHECK_THROW) and the program terminate because of my exception and not very gracefully. I guess my questions to the other users here are: - Was my understanding of what BOOST_CHECK_THROW does flawed ? - Is the behaviour normal ? - Is there an obvious problem I am missing with the design of my simple class ? In case it is useful, I am on OSX 10.9. I have compiled boost myself (sources of version 1.55 downloaded from the Boost site). I compile my work with C++11 enabled. I am using GCC 4.7 installed via Macports. Anyhow, any insight will be appreciated. As everyone is busy, thanks in advance to anybody for any time spent on this. Ghyslain

2 1

[asio] Closing async client socket after writing last message
by Nicholas Yue 23 Jun '14

23 Jun '14

Hi, I have adapted the chat tutorial example to send messages to a similar (chat tutorial based) server. It is currently working fine however due to the async_write(), I can't close the socket until after all the pending data has been processed on the server end. I have google and found discussion and mentioned about async_write() completion handler calling socket.close() however, I was not able to find specific detail as to how that is done. I want to avoid closing the connection prematurely as it is asynchronous writing. My current do_write() looks like this void DisplayChatClient::do_write(DisplayChatMessage msg) { DLOG(INFO) << "DisplayChatClient::do_write()"; bool write_in_progress = !write_msgs_.empty(); write_msgs_.push_back(msg); if (!write_in_progress) { boost::asio::async_write(socket_, boost::asio::buffer(write_msgs_.front().data(), write_msgs_.front().length()), boost::bind(&DisplayChatClient::handle_write, this, boost::asio::placeholders::error)); } } void DisplayChatClient::handle_write(const boost::system::error_code& error) { DLOG(INFO) << "DisplayChatClient::handle_write()"; if (!error) { write_msgs_.pop_front(); if (!write_msgs_.empty()) { boost::asio::async_write(socket_, boost::asio::buffer(write_msgs_.front().data(), write_msgs_.front().length()), boost::bind(&DisplayChatClient::handle_write, this, boost::asio::placeholders::error)); } } else { do_close(); } } Cheers -- Nicholas Yue Graphics - Arnold, Alembic, RenderMan, OpenGL, HDF5 Custom Dev - C++ porting, OSX, Linux, Windows http://au.linkedin.com/in/nicholasyue https://vimeo.com/channels/naiadtools

4 7

Boost Filesystem fails with FreeBSD 10, clang, and boost
by Ricky Huang 21 Jun '14

21 Jun '14

Hello all, I am currently migrating to a FreeBSD 10 system which comes default with clang language. I was able to compile Boost just fine. But when I include filesysstem.hpp to it, I get the following error message: > Linking CXX executable boost_clang_test > /usr/bin/ld: : invalid DSO for symbol `_ZN5boost6system15system_categoryEv' definition > /usr/local/lib/libboost_system.so.1.55.0: could not read symbols: Bad value > CC: error: linker command failed with exit code 1 (use -v to see invocation) > *** Error code 1 > > Stop. I am using cmake as my build system, could it be possible that I need to adjust my cmake variables? I am not sure if I've came to correct forum or should this be on FreeBSD, clang, CMake forum(s)? Please let me know if I am at the wrong place… The minimum amount of code to induce the problem are the following 2 files: CMakeLists.txt: cmake_minimum_required(VERSION 2.8) # Find and include Boost libraries find_package(Boost 1.55 COMPONENTS filesystem REQUIRED) include_directories(${Boost_INCLUDE_DIR}) set(LIBS ${LIBS} ${Boost_LIBRARIES}) set(BOOST_CLANG_TEST_SOURCES ${SOURCES} main.cpp) add_executable(boost_clang_test ${BOOST_CLANG_TEST_SOURCES}) target_link_libraries(boost_clang_test ${LIBS}) main.cpp: #include <stdio.h> #include <iostream> #include <sstream> #include <string> #include <boost/filesystem.hpp> using namespace std; using namespace boost::filesystem; const char *progname; int main(int argc, char **argv){ return 0; } Thanks in advance.

3 4

[graph] kamada_kawai_spring_layout warnings
by Michael Olea 21 Jun '14

21 Jun '14

Hi. I'm getting compiler warnings for subscripts out of range from kamada_kawai_spring_layout.hpp. I'm using boost_55_0, compiled with clang: Apple LLVM version 5.1 (clang-503.0.40) (based on LLVM 3.4svn) Target: x86_64-apple-darwin13.2.0 Thread model: posix ../../../../../include/boost/graph/kamada_kawai_spring_layout.hpp:110:49: warning: array index 2 is past the end of the array (which contains 2 elements) [-Warray-bounds] double denom = mat[0][0] * (mat[1][1] * mat[2][2] - mat[2][1] * mat[1][2]) The offending code is: template <> struct linear_solver<3> { template <typename Vec> static Vec solve(double mat[2][2], Vec rhs) { double denom = mat[0][0] * (mat[1][1] * mat[2][2] - mat[2][1] * mat[1][2]) - mat[1][0] * (mat[0][1] * mat[2][2] - mat[2][1] * mat[0][2]) + mat[2][0] * (mat[0][1] * mat[1][2] - mat[1][1] * mat[0][2]); double x_num = rhs[0] * (mat[1][1] * mat[2][2] - mat[2][1] * mat[1][2]) - rhs[1] * (mat[0][1] * mat[2][2] - mat[2][1] * mat[0][2]) + rhs[2] * (mat[0][1] * mat[1][2] - mat[1][1] * mat[0][2]); double y_num = mat[0][0] * (rhs[1] * mat[2][2] - rhs[2] * mat[1][2]) - mat[1][0] * (rhs[0] * mat[2][2] - rhs[2] * mat[0][2]) + mat[2][0] * (rhs[0] * mat[1][2] - rhs[1] * mat[0][2]); double z_num = mat[0][0] * (mat[1][1] * rhs[2] - mat[2][1] * rhs[1] ) - mat[1][0] * (mat[0][1] * rhs[2] - mat[2][1] * rhs[0] ) + mat[2][0] * (mat[0][1] * rhs[1] - mat[1][1] * rhs[0] ); Vec result; result[0] = x_num / denom; result[1] = y_num / denom; result[2] = z_num / denom; return result; } }; Looks like it should be: static Vec solve(double mat[3][3], Vec rhs) ... No?

1 0

stack unwinding with boost::fcontext
by David Frank 20 Jun '14

20 Jun '14

Context - 1.53.0 beta1 Context - 1.53.0 beta1 Context Struct fcontext_t and related functions Each instance of fcontext_t represents a context (CPU registers and stack space). View on www.boost.org Preview by Yahoo I'm wondering if there is any example showing how to do stack unwinding as described at the bottom of the above link as quoted below: " Stack unwinding Sometimes it is necessary to unwind the stack of an unfinished context to destroy local stack variables so they can release allocated resources (RAII pattern). The user is responsible for this task. " Thanks, Frank

2 1

[coroutine] await_emu example
by bbxiong 20 Jun '14

20 Jun '14

Hi, coroutine listers! The example is very awesome. but after reading though the source, i have a question: Is any limitation makes a push_coroutine must be caller and pull_coroutine must be the coro? This way, we have to yield out at the first line of coroutine function by calling caller(), just like the example showed: typedef coroutines::pull_coroutine<void> coro_pull; typedef coroutines::pull_coroutine<void> coro_push; auto asynchronous(F f) -> future<decltype(f())> { typedef promise<decltype(f())> CoroPromise; CoroPromise coro_promise; auto coro_future = coro_promise.get_future(); CurrentCoro current_coro = { make_shared<coro_pull>(std::bind([f](CoroPromise &coro_promise, coro_push &caller) { caller(); coro_stack.top().caller = &caller; coro_promise.set_value(f()); }, std::move(coro_promise), placeholders::_1); }; coro_stack.push(std::move(current_coro)); (*coro_stack.top().coro)(); coro_stack.pop(); return coro_future; } There is an extra call to caller() in coroutine function to jump out to prepare coro stack. Why not swap coro_pull and coro_push like this: auto asynchronous(F f) -> future<decltype(f())> { typedef promise<decltype(f())> CoroPromise; CoroPromise coro_promise; auto coro_future = coro_promise.get_future(); CurrentCoro current_coro = { make_shared<coro_push>(std::bind([f](CoroPromise &coro_promise, coro_pull &caller) { coro_stack.top().caller = &caller; coro_promise.set_value(f()); }, std::move(coro_promise), placeholders::_1); }; coro_stack.push(std::move(current_coro)); (*coro_stack.top().coro)(); coro_stack.pop(); return coro_future; } This still works on my machine, and has no extra "call to caller()", push_coroutine is not invoked until we explicitly run it (while pull_coroutine is invoked in constructor). So, my question is, s there any bad effects by using coroutines in this way? Thanks in advance!

2 1

How to use vertex mapping parameter in copy_graph
by Christoph Czurda 19 Jun '14

19 Jun '14

Hello! I want to create a straight line drawing of a planar graph that is not maximal planar. So I want to follow the instructions in http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/straight_line_drawing.h… : "If you want to draw a graph g, you can create a copy g' of g, store a mapping m of vertices in g' to vertices in g, triangulate g', and then send g' in as the input to chrobak_payne_straight_line_drawing. The drawing returned can then be applied to g using m to translate vertices from one graph to another." But I'm stuck at the point where I need to make a copy of the graph and store the vertex-to-vertex mapping between the two graphs. I'm not good enough at C++ to understand from the documentation at http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/copy_graph.html how to provide or access the last parameter orig_to_copy(Orig2CopyMap c) If someone could fill in the missing code in this function, I would be most thankful! void doSomething(MyGraph_t& g){ MyGraph_t g_copy; copy_graph(g, g_copy, [...???...]); // here I would like to access the Orig2CopyMap which stores the mapping }

1 0

Prominent Booster makes a big splash
by Robert Ramey 19 Jun '14

19 Jun '14

Notice that our own Matthias Troyer - important boost contributor made a big splash. http://www.theverge.com/2014/6/19/5824336/google-s-quantum-computer-just-fl… Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Prominent-Booster-makes-a-big-splash-tp4… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[archive] binary archive to memory stream
by Michael Powell 19 Jun '14

19 Jun '14

Hello, I am wrapping my head around archive, specifically binary archive. I'd like to serialize a vector of objects in such a way, I need to capture intermediate vector buffers (literally, to vector of uint8_t) so that I can determine their sizes. After which point the parent object(s) can serialize to file using more conventional, built-in file streams and such. It seems that binary_oarchive is helpful, but still requires there be an ostream or streambuf in the mix. Which, as an adapter layer, while helpful, it still leaves the question of extending streambuf to work with ostream to vector<uint8_t> open. I've read some docs on vectors and streambuf, but they all seem to be geared towards a known-size vector, istream and such. I am interested in a vector that can be streamed to, will grow in size, etc. Some clues seem to hint at underflow, overflow type issues? Any helpful pointers how to go about doing this? Thanks... Best regards, Michael Powell

4 5

[Python]compiling python library
by Miklós Tóth 19 Jun '14

19 Jun '14

Hi All, I want to embed python in my c++ code using boost.python library. As far as I understand I need python headers and libs. So my python27.lib is "incompatible". I want to compile it from code but I failed with mingw32. Could you give me some advice, or links to achieve my goal? I'm using gcc4.6.3 and qt 4.8.2 and boost 1.49 on windows 7. Thanks, Miklós

2 9

Possible problem with property tree and ini files
by Tim Burgess 19 Jun '14

19 Jun '14

Hi, I make the following call in my application, based on Boost 1.55.0: property_tree::ini_parser::read_ini(IniFile.GetFullPath().ToStdString(), IniTree); This works fine for .ini files up to 64kb, but throws an exception for larger files. Is this a known limitation and, if so, can anybody suggest an alternative that could cope with larger files, please? Best wishes. Tim Burgess

1 0

Splitting string at whitespace
by Florian Lindner 17 Jun '14

17 Jun '14

Hello, for some time now I've been trying to split a given string at whitespaces: "A B C" -> "A", "B", "C". I want to use boost/algorithm/string #include "boost/algorithm/string/split.hpp" #include "boost/algorithm/string/compare.hpp" std::vector<std::string> tokenize(const std::string& text ) { std::vector<std::string> tokens; boost::algorithm::split(tokens, text, boost::algorithm::is_equal(" ")); return tokens; } but compilation on gcc 4.9.0 / boost 1.55.0 just gives: test.cpp: In function 'std::vector<std::basic_string<char> > tokenize(const string&)': test.cpp:40:71: error: no matching function for call to 'boost::algorithm::is_equal::is_equal(const char [2])' boost::algorithm::split(tokens, text, boost::algorithm::is_equal(" ")); ^ test.cpp:40:71: note: candidates are: In file included from /usr/include/boost/algorithm/string/finder.hpp:24:0, from /usr/include/boost/algorithm/string/split.hpp:17, from test.cpp:7: /usr/include/boost/algorithm/string/compare.hpp:34:16: note: boost::algorithm::is_equal::is_equal() struct is_equal ^ /usr/include/boost/algorithm/string/compare.hpp:34:16: note: candidate expects 0 arguments, 1 provided /usr/include/boost/algorithm/string/compare.hpp:34:16: note: boost::algorithm::is_equal::is_equal(const boost::algorithm::is_equal&) /usr/include/boost/algorithm/string/compare.hpp:34:16: note: no known conversion for argument 1 from 'const char [2]' to 'const boost::algorithm::is_equal&' What is wrong there? Thanks, Florian

2 1

Boost Voronoi: Automate creation of graph for indoor navigation
by Stadin, Benjamin 16 Jun '14

16 Jun '14

Hi all, I’m provided with geometry data for buildings. The data contains info about the „feature“ type of a geometry (floor, room, stairway, elevator). Now I need to automate the creation of an indoor routing graph (room-to-room navigation) to minimize manual works later on. This is not for a robot scenario – the line parts will be shown on a map application. Therefore it should also look good (routing edges should be centered etc). This is new land for me and I’ll will be grateful for advise how to achieve this. My initial thought is that Voronoi may be helpful. But this alone will probably not be sufficient. Any pointers and examples welcome. Thanks Ben

2 1

[numeric conversation] behavior on std::numeric_limits<double>::max() + eps with numeric_cast
by Olaf Peter 16 Jun '14

16 Jun '14

Hello, at this time I play with numeric_cast and struggle with this: first: double z = std::numeric_limits<double>::max(); z += 2*std::numeric_limits<double>::epsilon(); // doesn't matter if 1*eps std::cout << z << std::endl; std::cout << boost::numeric_cast<double>(z) << '\n'; I would expect that an exception is thrown which isn't, the output is 1.79769e+308 1.79769e+308 and as second: If I write my onw UDT as shown in the tutorial like: namespace my { enum range_check_result { cNonFinite = 0, cInRange = 1, cNegOverflow = 2, cPosOverflow = 3 } ; //! Define a custom range checker template<typename Traits, typename OverFlowHandler> struct range_checker { typedef typename Traits::argument_type argument_type; typedef typename Traits::source_type S; typedef typename Traits::target_type T; //! Check range of integral types. static range_check_result out_of_range(argument_type value) { if(!std::isfinite(value.to_builtin())) // Neither infinity nor NaN. return cNonFinite; else if(value > boost::numeric::bounds<T>::highest()) return cPosOverflow; else if(value < boost::numeric::bounds<T>::lowest()) return cNegOverflow; else return cInRange; } static void validate_range(argument_type value) { BOOST_STATIC_ASSERT(std::numeric_limits<T>::is_bounded); OverFlowHandler()(out_of_range(value)); } }; .... struct bad_numeric_cast : virtual boost::exception, virtual std::bad_cast { ... }; struct rounding_error : virtual boost::exception, std::domain_error { rounding_error() : std::domain_error("NaN or Infinity") {} // XXX Better solution? virtual const char * what() const throw() { return "bad numeric conversion: can not be represented in the target integer type"; } }; struct negative_overflow : virtual bad_numeric_cast { .... }; struct positive_overflow : virtual bad_numeric_cast { .... }; struct overflow_handler { void operator()(range_check_result result) { if(result == cNonFinite) BOOST_THROW_EXCEPTION(rounding_error()); else if(result == cNegOverflow) BOOST_THROW_EXCEPTION(negative_overflow()); else if(result == cPosOverflow) BOOST_THROW_EXCEPTION(positive_overflow()); } }; it doesn't change the result - is this the right way? Thanks, Olaf

4 15

[asio]remote_endpoint throws exception
by higashiyama＠ncad.co.jp 16 Jun '14

16 Jun '14

Hi, I wrote TCP client program using boost::asio. OS: Debian GNU/Linux (x86_64) Boost: 1.49 I use asio::ip::tcp::socket::async_conect function and I called ip::tcp::socket::remote_endpoint at async_connect callback. Like this: // async_resolve handler void my_class::handle_resolve(const boost::system::error_code& error, boost::asio::ip::tcp::resolver::iterator endpoint_iterator) { if (!error) { socket_.async_connect(endpoint, strand_.wrap(...)); } } void my_class::handle_connect(const boost::system::error_code& error, boost::asio::ip::tcp::resolver::iterator endpoint_iterator) { if (!error) { // socket_ is my_class member. socket_.remote_endpoint(); // throw exception ! } ... } ip::tcp::socket::remote_endpoint sometime throws boost::system::system_error exception (error message is "remote_endpoint: Transport endpoint is not connected"). But async_connect is successfully completed. Why does remote_endpoint function throw exception? Thank you,

3 3

[boost::filesystem] Improvement/Suggestion for copy()
by Kyle Ketterer 15 Jun '14

15 Jun '14

Hello all, I was curious about the possible implementation of a progress call back for the copy() ( and related functions) in ::filesystem. With WinAPI you can use CopyFileEx with the possibility of a progress call back. It would be nice to have this ability "out of the box" in boost's namespace. This would be especially be useful for transferring larger files. Thoughts? Thanks

1 0

[geometry] how to using UDT
by Olaf Peter 15 Jun '14

15 Jun '14

Hello, I try to catch some failures using an own user defined type (UDT), but it doesn't compile e.g. it's hardcoded to use std::sqrt: boost_1_55_0/boost/geometry/strategies/cartesian/distance_pythagoras.hpp:165:13: error: no matching function for call to 'sqrt(core::my_type<double>)' further, is there a way to adapt templated points? BOOST_GEOMETRY_REGISTER_POINT_2D(point_type, point_type::coordiante_type, bg::cs::cartesian, x, y) got errrors. Thanks, Olaf

2 2

BGL performance: is pool_allocator possible and does it help iteration performance?
by Jeremy Murphy 15 Jun '14

15 Jun '14

Hi, I'm implementing a graph algorithm that requires a lot of repeated iteration over a graph as it builds it. So I wonder about cache misses. Is it possible to use a pooled allocator with the vector/list that gets used in the VertexList and EdgeList properties of adjacency_list? If there are other techniques for improving search/iteration performance (at the cost of insertion), I'd also be interested. Thanks! Jeremy

1 0

Boost Library Incubator recommended by steering committee
by Beman Dawes 14 Jun '14

14 Jun '14

The Boost Library Incubator (www.blincubator.com) is a web site conceived, designed, and implemented to alleviate the log-jam of libraries waiting to be reviewed by Boost. It helps new library submitters through the process, encourages development of an initial user base, and accumulates feedback in the form of comments, test results and Boost style reviews. The Boost Steering Committee has voted to recommend using the Boost Library Incubator as a prelude to getting a library reviewed by Boost. The Steering Committee recommends libraries currently in the Boost review queue be added to the Incubator by their developers. The relationship between Boost and the Incubator is purely informal, but there as several things Boosters can do to help make the Incubator a success. Authors can submit their libraries and respond to feedback. Users can experiment with submitted libraries and provide feedback on their experience. WordPress/php developers can contribute enhancements to the Boost Library Incubator implementation. The steering committee extends its thanks to Robert Ramey for launching the Boost Library Incubator! --The Boost Steering Committee

3 2

[utility] prior(it, n) for n being an unsigned type
by Adam Romanek 13 Jun '14

13 Jun '14

Hi! I've just finished investigating an issue in my code which led it to an assert/abort in certain cases. It turned out it was caused by the use of boost::prior(it, n) where n was unsigned int with some non-zero value. I found a question [1] on the mailing list back in 2004 which describes this issue. Additionally a solution to this problem was also posted in one of the replies [2]. My question is - why hasn't it made into the repository yet? The current behavior of boost::prior(it, n) when n is unsigned type is far from the one expected by its potential users so I think it should either be properly documented (warned) or fixed immediately. Am I not seeing something? WBR, Adam Romanek [1] http://lists.boost.org/Archives/boost/2004/02/61556.php [2] http://lists.boost.org/Archives/boost/2004/02/61578.php

1 0

std::limits compile errors with boost
by David Frank 13 Jun '14

13 Jun '14

Anyone has seen this?: In file included from ../include/boost/lockfree/detail/freelist.hpp:12, from ../include/boost/lockfree/queue.hpp:24, from test.cpp:2: /usr/local/powerpc-linux-gnu/include/c++/4.3.2/limits:287:22: error: macro "min" requires 2 arguments, but only 1 given Thanks

4 3

<boost::wave> Memory issue when using wave to run a file parser service
by Yong Huang 12 Jun '14

12 Jun '14

Hi all, I run into a memory issue when uses boost wave library. My application runs as a *service *that parses c files. In each individual run, it calls in the wave library through a sub-function call to process one file. I noticed that some memory is not released from wave after each run. The consequence is that the memory usage of the application keeps increasing till the system breaks down. I could reproduce the problem with a simple modification of the quick_start sample code shipped with the boost wave library. (attached below). My system is win64 and I see the problem with both 1.49 and 1.55. (built with b2 toolset=msvc-11.0 address-model=64 --build-type=complete) Something I found during the investigation: * The problem is gone if I build the application with link<static>. (Unfortunately, this is not an option for me) * From the memory usage pattern, it seems that there is a memory pool in place that should have been released after each turn. When repeatedly passing a 4MB file, the memory usage (taken from task maneger) is: 99,700K, 198,404K, 395,404K, 395408K, and 789,396K. When running with static link, the memory usage after each run is: 1800K, 2480K, 2480K, .... The maximum usage is 8300K. Is there any workaround with the problem? Thanks, Yong ------------------------------------- begin of the code --------------------------------------------------- #define BOOST_WAVE_SERIALIZATION 0 // enable serialization #define BOOST_WAVE_BINARY_SERIALIZATION 0 // use binary archives #define BOOST_WAVE_XML_SERIALIZATION 1 // use XML archives /////////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////// // Include Wave itself #include <boost/wave.hpp> /////////////////////////////////////////////////////////////////////////////// // Include the lexer stuff #include <boost/wave/cpplexer/cpp_lex_token.hpp> // token class #include <boost/wave/cpplexer/cpp_lex_iterator.hpp> // lexer class // sub-function that calls into wave int do_it(std::string filename) { boost::wave::util::file_position_type current_position; std::ifstream instream(filename); std::string instring; instream.unsetf(std::ios::skipws); instring = std::string(std::istreambuf_iterator<char>(instream.rdbuf()), std::istreambuf_iterator<char>()); typedef boost::wave::cpplexer::lex_token<> token_type; typedef boost::wave::cpplexer::lex_iterator<token_type> lex_iterator_type; typedef boost::wave::context<std::string::iterator, lex_iterator_type> context_type; typedef boost::wave::cpplexer::lex_token<> TokenType; typedef boost::wave::cpplexer::lex_iterator<TokenType> LexIterator; LexIterator aIter(instring.begin(), instring.end(), TokenType::position_type( filename.c_str()), boost::wave::language_support( boost::wave::support_cpp | boost::wave::support_option_long_long ) ); LexIterator endIter; for (; aIter != endIter; ) { (*aIter).get_value(); ++aIter; } return 0; } int main(int argc, char *argv[]) { int aNum = 1; for (;;) { do_it("c:\\memleak.txt"); std::cout << "Process the file again (0/1)? \n"; scanf("%d", &aNum); if (aNum == 0) { printf("\nYou entered zero so we stop!\n"); return 0; } } return 0; }

2 1

[python] TypeError when left side is noncopyable
by Igor R 12 Jun '14

12 Jun '14

I'm trying to expose an operator: struct my_class : boost::noncopyable {}; my_class &operator <<(my_class &e, int i); // in the module definition: class_<my_class, boost::noncopyable>("my_class") .def(self << int()) ; However, an attempt to invoke this operator in python causes the following error: TypeError: No to_python (by-value) converter found for C++ type: my_class I guess this is related to the fact my_class is noncopyable, isn't it? Is there a workaround for this issue? Thanks.

1 0

Meeting C++ Schedule released
by Jens Weller 12 Jun '14

12 Jun '14

Hello C++ & Boost Community, since last week the schedule for Meeting C++ is released: http://meetingcpp.com/index.php/schedule14.html Like last year Meeting C++ will feature 21 Talks in 3 Tracks, the conference will be opened by Scott Meyers, the closing Keynote will be given by Hartmut Kaiser. This years Theme Track is "Scientific Programming with C++". Also, if your are a student, you have the chance to participate in our student program which will give 50 Students access to the conference: http://meetingcpp.com/index.php/newsreader/items/meeting-cpp-2014-the-stude… kind regards, Jens Weller

1 0

pure virtuals on multiple hierarchy levels
by Igor R 12 Jun '14

12 Jun '14

Hello, What's the right way to wrap the following, when exposing this hierarchy to Python: sturct base { virtual void func1() = 0; }; struct intermediate : base { virtual void func2() = 0; }; struct derived : intermediate { void func1(); void func2(); }; Thanks.

1 0

[BGL]
by Pablo Madoery 11 Jun '14

11 Jun '14

Hello, I Have 2 graphs: graph1 and graph2, and two sets of edge descriptors. One set is associated to edges of graph1 and another set associated to edges of graph2. I don't understand why is it possible to access information about edges of graph2 by using graph1 and the edge descriptors of graph2. I realized of that because of an own mistake when using graphs. What I would like to know is why is that possible to do and if it should be an exception that can handle this situation. I send the code I was using to test this: #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <fstream> #include "GraphInfo.h" using namespace std; using namespace boost; typedef adjacency_list<setS, vecS, bidirectionalS, VertexInfo, EdgeInfo> Graph; void printGraph(Graph graph, string file) { ofstream ofs(file.c_str()); dynamic_properties dp; dp.property("node_id", get(vertex_index, graph)); dp.property("label", get(&EdgeInfo::weight, graph)); write_graphviz_dp(ofs, graph, dp); } int main() { Graph graph1; Graph::vertex_descriptor a1 = add_vertex(graph1); Graph::vertex_descriptor b1 = add_vertex(graph1); Graph::vertex_descriptor c1 = add_vertex(graph1); Graph::edge_descriptor e1 = (add_edge(a1, b1, graph1)).first; Graph::edge_descriptor e2 = (add_edge(b1, a1, graph1)).first; graph1[a1].id = 10; graph1[b1].id = 20; graph1[c1].id = 30; graph1[e1].weight = 1; graph1[e2].weight = 2; Graph graph2; Graph::vertex_descriptor a2 = add_vertex(graph2); Graph::vertex_descriptor b2 = add_vertex(graph2); Graph::vertex_descriptor c2 = add_vertex(graph2); Graph::vertex_descriptor d2 = add_vertex(graph2); Graph::edge_descriptor e4 = (add_edge(c2, b2, graph2)).first; Graph::edge_descriptor e5 = (add_edge(b2, c2, graph2)).first; Graph::edge_descriptor e6 = (add_edge(d2, a2, graph2)).first; Graph::edge_descriptor e7 = (add_edge(a2, d2, graph2)).first; graph2[a2].id = 10; graph2[b2].id = 20; graph2[c2].id = 30; graph2[e4].weight = 13; graph2[e5].weight = 14; graph2[e6].weight = 15; graph2[e7].weight = 16; // WHY IS THIS POSSIBLE TO DO // IT IS ASKING FOR AN EDGE OF GRAPH2 BUT USING GRAPH1 ??? double weight = graph1[e7].weight; cout<<"weight: "<<weight<<endl; printGraph(graph1, "graph1.dot"); printGraph(graph2, "graph2.dot"); cout << "end" << endl; return 0; } Thank you very much

2 1

Fwd: Lexical cast between narrow and wide strings
by Andrew Marlow 11 Jun '14

11 Jun '14

I hope this is the right place to post my question. I expected to be able to convert between narrow and wide strings using boost lexical cast but it fails to compile. I suppose that conversion is not supplied or supported. It would be really useful to me if it was. I am developing on win32 for wince and on wince there seeem to be many places where wide strings are required, especially when using the win32 API. Is there any chance this could be added to boost? I checked using boost 1.55.0 -- Regards, Andrew Marlow http://www.andrewpetermarlow.co.uk

5 6

Is boost asio appropriate for this use case ?
by Aaron Boxer 10 Jun '14

10 Jun '14

I am decoding an image file: the file has tagged header info mixed with 4K pixel code blocks. Platform is primarily windows, but could be osx or linux. Once I read in a code block, I can launch (asynchronously) my decode routine on this block, while continuing to read the file for header info and code blocks. Currently, I do synchronous reads using fread(...). Is is worthwhile to switch to boost asio to asynchronously read in the code blocks? The read callback could trigger my decode routine. But I wouldn't have to wait for the read before I carry on to the next code block. If so, can anyone point me to a reference/tutorial covering boost::asio asynch reads from disk?

3 3

[boost] [pimpl] Boost.Pimpl review canceled
by Glen Fernandes 09 Jun '14

09 Jun '14

Hi everyone, Vladimir has elected to withdraw Boost.Pimpl submission and cancel the formal review. On behalf of Vladimir, thank you for the feedback provided in response to the pre-view announcement mail: it was especially useful to him. Best, Glen

1 0

memory mapped file thread safety
by Aaron Boxer 09 Jun '14

09 Jun '14

Simple question: If I call get_address() on a region, can I pass this pointer to another thread and have this thread access the memory ? Thanks!

2 2