September 2015 - Boost - lists.preview.boost.org

Variadics bug in MSVC-12.0
by Gennadiy Rozental 29 Sep '15

29 Sep '15

Hi, While working on improving of implementation of data driven tests, I found rather annoying bug in MSVC-12.0 with variadic templates. The code seems to work fine with msvc-14.0, gcc 4.8 and clang 3.4. I did not try msvc- 13.0. Does anyone know a workaround? Example follows (try to comment on/off line: auto const& t3). Gennadiy // C++ 14 index_sequence template <std::size_t... Ns> struct index_sequence {}; template<typename IS1, typename IS2> struct merge_index_sequence; template <std::size_t... Ns1, std::size_t... Ns2> struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> { typedef index_sequence<Ns1..., Ns2...> type; }; template <std::size_t B, std::size_t E, typename Enabler = void> struct make_index_sequence { typedef typename merge_index_sequence< typename make_index_sequence<B, (B + E)/2>::type, typename make_index_sequence<(B + E)/2, E>::type>::type type; }; template <std::size_t B, std::size_t E> struct make_index_sequence<B, E, typename std::enable_if<E == B + 1, void>::type> { typedef index_sequence<B> type; }; template <typename... T> using index_sequence_for = typename make_index_sequence<0, sizeof...(T)>::type; ////////////////////////////////////////////////////////////////////////// template<typename T1, typename T2> struct merged_tuple { typedef std::tuple<T1,T2> type; typedef std::tuple<T1 const&,T2 const&> ref; }; template<typename T1, typename ...T> struct merged_tuple<T1, std::tuple<T...>> { typedef std::tuple<T1, T...> type; typedef std::tuple<T1 const&, T const&...> ref; }; template<typename ...T, typename T1> struct merged_tuple<std::tuple<T...>, T1> { typedef std::tuple<T..., T1> type; typedef std::tuple<T const&..., T1 const&> ref; }; template<typename ...T1, typename ...T2> struct merged_tuple<std::tuple<T1...>, std::tuple<T2...>> { typedef std::tuple<T1..., T2...> type; typedef std::tuple<T1 const&..., T2 const&...> ref; }; template<typename ...T1, typename ...T2, std::size_t ...I1, std::size_t ...I2> inline typename merged_tuple<std::tuple<T1...>, std::tuple<T2...>>::ref tuple_merge_impl( std::tuple<T1 const&...> const& a1, std::tuple<T2 const&...> const& a2, index_sequence<I1...> const& , index_sequence<I2...> const& ) { using ref_type = typename merged_tuple<std::tuple<T1...>, std::tuple<T2...>>::ref; return ref_type( std::get<I1>(a1)..., std::get<I2>(a2)... ); } template<typename ...T1, typename ...T2> inline typename merged_tuple<std::tuple<T1...>, std::tuple<T2...>>::ref tuple_merge_impl( std::tuple<T1 const&...> const& a1, std::tuple<T2 const&...> const& a2 ) { return tuple_merge_impl( a1, a2, index_sequence_for<T1...>{}, index_sequence_for<T2...>{} ); } template<typename T> inline std::tuple<T const&> as_tuple( T const& arg ) { return std::tuple<T const&>( arg ); } template<typename ...T> inline std::tuple<T...> const& as_tuple( std::tuple<T...> const& arg ) { return arg; } template<typename T1, typename T2> inline typename merged_tuple<T1, T2>::ref tuple_merge( T1 const& a1, T2 const& a2 ) { return tuple_merge_impl( as_tuple( a1 ), as_tuple( a2 ) ); } int main() { auto const& t1 = tuple_merge( 1, 2 ); auto const& t2 = tuple_merge( 3, 4 ); auto const& t3 = tuple_merge( t1, 5 ); auto const& t4 = tuple_merge( 6, t2 ); return 0; }

1 0

Boost.Test: runtime parameter framework update
by Gennadiy Rozental 29 Sep '15

29 Sep '15

Hi, Over the years there were complains about the interface and functionality of the Boost.Test Unit Test Framework(UTF)'s runtime parameters. Primarily command line arguments handling, but also documentation and few other concerns. This update addresses all these issues, introduces few new features and makes runtime parameters much more user friendly. In addition new implementation significantly simpler. Here is short summary of fixed issues and significant new features: * (new) UTF now requires all user defined arguments to follow UTF specific arguments. They are separated by "--" marker. For example: test.exe --random -- /myarg:17 * (bug) UTF now properly supports arguments with spaces. For example: test.exe --log_sink="file name.txt" * (bug) UTF now reports missing value in arguments. For example: test.exe --log_sink=, produces: Missing an argument value for the parameter log_level in the argument -- log_level= * (bug/new) UTF now reports invalid parameters. Moreover, UTF now supports hints with possible typos. For example: test.exe --colour, produces: An unrecognized parameter in the argument --colour Did you mean one of these? color_output Suggestion is shown when close (1 char distance from unambiguous parameter name) exists. * (new) UTF now report possible ambiguous parameters. For example: test.exe --log=all, produces: An ambiguous parameter name in the argument --log=all Did you mean one of these? log_format log_level log_sink * (new) UTF parameter help now accepts optional parameter name. Moreover you can actually "guess" the name by providing just unambiguous prefix. In this case it shows detailed information about requested parameter, including semantic, possible values and formats. For example: test.exe --help=list_con, produces: Parameter: list_content Lists the content of test tree - names of all test suites and test cases. Command line formats: --list_content[=<HRF|DOT>] Environment variable: BOOST_TEST_LIST_CONTENT Parameter list_content instructs the framework to list the content of the test module instead of executing the test cases. Parameter accepts optional string value indicating the format of the output. Currently the framework supports two formats: human readable format (HRF) and dot graph format (DOT). If value is omitted HRF value is assumed. The changes will be released with next release of boost. Any comments are welcome. Gennadiy

1 0

Graphical debugging extension for VS2015 (Container, Geometry, Polygon, Variant, ...)
by Adam Wulkiewicz 29 Sep '15

29 Sep '15

Hi, For some time now I've been thinking about extending the capabilities of a debugger and to visualize data in more convenient way than the raw numbers. It's obvious to me that in many cases variables could be graphically visualized, in many cases this is the "natural" representation, this would greately simplify the debugging. I haven't found anything like it so I've decided to play with the VS2015 extensions, mostly because they're easy to write. This is what I came up with (see the readme): https://github.com/awulkiew/graphical-debugging Besides adding commonly used native visualizers for types from some Boost libraries it allows to display their graphical representation. The extension support Boost.Geometry models and other types used internally in this library, Boost.Polygon models (polygon_set_data is missing) and boost::variant storing geometries. As a bonus, it's possible to watch containers of values (some STL containers as well as boost::array and contiguous containers from Boost.Container) as charts. Maybe if there were enough interest it'd be worth to extend it and/or to add to the official VS extensions gallery. I'm a Boost.Geometry developer so in the future I plan to support all of the coordinate systems supported by the library, maybe other internals and basically anything that helps me with the development. But I can imagine that variables of types from various Boost libraries could also be visualized, e.g. Polygon's voronoi diagram and internals, Math's quaternions as 3D Axis-Angle, std::complex as a point on a plane, containers of complex numbers and in general arbitrary types represented somehow as a 1D, 2D or 3D objects, CircularBuffer e.g. as a pie chart, BGL's graphs, maybe GIL's images, Interprocess' shared memory blocks?, etc. So feel free to share suggestions and contribute if you like. Regards, Adam

3 5

Trying out CLion.. Free license..
by Rene Rivera 29 Sep '15

29 Sep '15

As some of you are aware JetBrains recently release a new IDE that has some rather cool features (re: <https://www.jetbrains.com/clion/>) for C++ programmers. I am personally interested in using CLion for Boost work. In particular I'm hoping to write a CLion plug-in that integrates Boost Build into the IDE. And hence I've have taken it upon myself to arrange for Boost developers to get licenses for library authors to use, if they so wish. If you are interested in getting a CLion license and are a current Boost Library author here's what I need: * An email from you requesting that you want a license. * In that email indicate which Boost libraries you are an author, or maintainer, of. * Send the email from an account that you want me to send you the license when we get it. I want to avoid having to update email information a year from now when I need to renew the licenses. * You have until the end of this week, roughly, to send that email. I'll collect that and request the Boost licenses from JetBrains. And "pass" them out with instructions as needed. Rene. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

6 7

CLion plug-in for Boost.Build (was: Trying out CLion.. Free license..)
by Mateusz Loskot 28 Sep '15

28 Sep '15

On 28 September 2015 at 21:19, Rene Rivera <grafikrobot(a)gmail.com> wrote: > On Mon, Sep 28, 2015 at 2:14 PM, Robert Ramey <ramey(a)rrsd.com> wrote: >> On 9/28/15 11:45 AM, Rene Rivera wrote: >> >>> As some of you are aware JetBrains recently release a new IDE that has >>> some >>> rather cool features (re: <https://www.jetbrains.com/clion/>) for C++ >>> programmers. I am personally interested in using CLion for Boost work. In >>> particular I'm hoping to write a CLion plug-in that integrates Boost Build >>> into the IDE. And hence I've have taken it upon myself to arrange for >>> Boost >>> developers to get licenses for library authors to use, if they so wish. >>> >> >> Hmm - wouldn't it be easier just to use CMake. You wouldn't have to write >> any plugin. The serialization library includes CMake files for that >> library's build and test and it works quite well. >> > > IMO no.. But I know that opinions differ ;-) Some time ago, I developed basic Boost.Build plugin for Qt Creator https://github.com/mloskot/qt-creator-plugin-boostbuild/ which interacts with the b2.exe command line. At that time, I also briefely discussed some API ideas with Volodya. Later, Volodya implemented the Boost.Build API and server mode http://lists.boost.org/boost-build/2015/03/27906.php May I ask, which option are you going to choose for your plugin? Is it going to be the command line approach, the new BB API or anything else? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 2

[test] Regression - overloaded virtual function "boost::unit_test::test_observer::test_unit_skipped" is only partially overridden
by Vicente J. Botet Escriba 25 Sep '15

25 Sep '15

Hi, there is a regression in Boost.Test. Test output: boost/bin.v2/libs/test/build/intel-linux/release/link-static/threading-multi Rev 32fc9643eb674d60616412bb427bb6e0f0300cc0 / Thu, 24 Sep 2015 19:13:08 +0000 Compile [2015-09-24 20:55:11 UTC]: succeed "icpc" -c -xc++ -w2 -inline-level=2 -O3 -ip -pthread -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_STATIC_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_TIMER_STATIC_LINK=1 -DNDEBUG -I".." -c -o "/boosttest/develop/results/boost/bin.v2/libs/test/build/intel-linux/release/link-static/threading-multi/test_tools.o" "../libs/test/src/test_tools.cpp" In file included from ../boost/test/impl/test_tools.ipp(19), from ../libs/test/src/test_tools.cpp(16): ../boost/test/unit_test_log.hpp(88): warning #654: overloaded virtual function "boost::unit_test::test_observer::test_unit_skipped" is only partially overridden in class "boost::unit_test::unit_test_log_t" class BOOST_TEST_DECL unit_test_log_t : public test_observer, public singleton<unit_test_log_t> { ^ remark #11074: Inlining inhibited by limit max-size remark #11074: Inlining inhibited by limit max-total-size remark #11076: To get full report use -qopt-report=4 -qopt-report-phase ipo Vicente

1 0

boost_1_59_0 build failures
by Karen Shaeffer 24 Sep '15

24 Sep '15

Hello, I downloaded boost_1_59_0 and built the whole set of libraries. gcc --version gcc (Ubuntu 4.8.4-2ubuntu1~14.04) 4.8.4 ./b2 install warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Performing configuration checks - 32-bit : no (cached) - 64-bit : yes (cached) - arm : no (cached) - mips1 : no (cached) - power : no (cached) - sparc : no (cached) - x86 : yes (cached) - symlinks supported : yes (cached) - lockfree boost::atomic_flag : yes (cached) - has_icu builds : yes (cached) warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam - zlib : yes (cached) - iconv (libc) : yes (cached) - icu : yes (cached) - compiler-supports-visibility : yes (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. - zlib : yes (cached) Component configuration: - atomic : building - chrono : building - container : building - context : building - coroutine : building - coroutine2 : 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 - system : building - test : building - thread : building - timer : building - wave : building ...patience... ...patience... ...patience... ...patience... ...patience... ...patience... ...found 34509 targets... ...updating 8 targets... gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi/bzip2.o libs/iostreams/src/bzip2.cpp:20:56: fatal error: bzlib.h: No such file or directory #include "bzlib.h" // Julian Seward's "bzip.h" header. ^ compilation terminated. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi/bzip2.o" "libs/iostreams/src/bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi>libboost_iostreams.a(clean) for lack of <pbin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi>bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi>libboost_iostreams.a for lack of <pbin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi>bzip2.o... ...skipped <p/usr/local/lib>libboost_iostreams.a for lack of <pbin.v2/libs/iostreams/build/gcc-4.8/release/link-static/threading-multi>libboost_iostreams.a... gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi/bzip2.o libs/iostreams/src/bzip2.cpp:20:56: fatal error: bzlib.h: No such file or directory #include "bzlib.h" // Julian Seward's "bzip.h" header. ^ compilation terminated. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_DYN_LINK=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi/bzip2.o" "libs/iostreams/src/bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi>libboost_iostreams.so.1.59.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi>bzip2.o... ...skipped <p/usr/local/lib>libboost_iostreams.so.1.59.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.8/release/threading-multi>libboost_iostreams.so.1.59.0... ...skipped <p/usr/local/lib>libboost_iostreams.so for lack of <p/usr/local/lib>libboost_iostreams.so.1.59.0... ...failed updating 2 targets... ...skipped 6 targets... Is that expected? thanks, Karen -- Karen Shaeffer Be aware: If you see an obstacle in your path, Neuralscape Services that obstacle is your path. Zen proverb

2 1

Fwd: [sort][container] Challenge for sorting experts, an improved stable sort
by Francisco José Tapia 23 Sep '15

23 Sep '15

Hi Jon, If the elements in the flat associative container are sorted, you need only to sort the elements to insert and after do a fusion of the two parts. If your container admit repeated elements, you can use the std::sort, if not, you must use an stable sort , and delete the repeated. You have several algorithms for to do a stable sort. In the library we are developing (https://github.com/fjtapia/sort_parallel ) you have a smart_merge_sort, which is a very fast stable sort and use only one half of the memory used by the data, is exception safe and use the move semantics I didn't see any implementation of the stable sort algorithms without additional memory, in any library GCC, TBB, IPP … I suppose because they are slow. If you have 100 elements and want to insert 30 elements, need to resize the vector to 130 elements, the last 30 are empty. If you have other vector with the data to insert, you can use smart_merge_sort, and use as auxiliary memory the last 15 elements of the main vector. After sort, delete the repeated elements. And with the two vectors you must do a half_merge fusion , and all is done. With this method you need only the vector for to sort the elements to insert. If you want I can write a small program doing this, using the code of the library.

2 2

[sort][container] Challenge for sorting experts, an improved stable sort
by Ion Gaztañaga 23 Sep '15

23 Sep '15

Hi, I'm trying to improve insertion times for flat associative containers. In range insertions one optimization is to insert the whole range in the end of the container and sort the whole vector instead of trying a loop. An additional optimization proposed in the mailing list is to have an option to create externally the internal vector type of the flat map/set, fill it and then try to move it into the flat container. That requires sorting the moved vector (and removing duplicates if needed). I could try to use std::sort/std::stable_sort but there are some problems: -> Non-portable for C++03 compilers and Boost.Move, and Boost.Container fully supports those platforms. -> Additional O(N) temporary memory for stable sorting. Usually this means a temporary N element array, although there are algorithm to use only N/2 temporary elements. With big containers, this is a lot of memory. So I started analyzing several papers and implementations to see if a custom implementation was possible, but I felt Boost.Sort could be a good place to have that implementation and the Boost community a good place to discuss design alternatives. My initial requirements: 1) Stable sort. A non-stable sort is faster and useful for unique keys containers, but stable sort can be used initially in all flat containers until the non-stable version is implemented. 2) Externally supplied auxiliary memory with optionally no auxiliary memory at all. It seems that there are newer algorithms like Grailsort (https://github.com/Mrrl/GrailSort) or WikiSort (https://github.com/BonzaiThePenguin/WikiSort) that claim O(1) memory, even no auxiliary buffer, and key comparison and data exchanges with complexity O(n*log(n)). However I don't think those implementation correctly handle the basic exception guarantee or non-trivially copyable types. Reason: I want to avoid allocating short-lived temporary memory: if it's available I want to pass the extra capacity that flat containers' internal vector holds for future insertions. 3) Customization points (without ADL, which IMHO is not customizable enough). The sort algorithm should use a SortTraits template parameter for basic operations like "move", "swap", "initialized_move". E.g: template<class T> struct sort_traits { static? void move(T &from, T &to); static? void swap(T &l, T &r); static? void uninitialized_move(T &from, void *to); static? void destroy(T &from, void *to); }; I don't know if this trait should be stateful or not (static members). I could imagine the usefulness of a stateful implementation of sort_traits that could store a reference to an allocator so that some special "construct" version is used in some operations. Or just a version that counts the number of each operation to ease debugging. In any case, a stateless version would be enough for most cases. Reason: In Boost.Container, the idea is to use boost::move + boost::adl_move_swap in the initial implementation, maybe some destructive move implementation in a second iteration if Boost.Move implements it. In any case those operations should be customizable by the user, independently from the type to be sorted. This also avoids unnecessary dependencies in Boost.Sort. -> Dependencies: the implementation should only rely on Boost.Core, Boost.Config, maybe Boost.TypeTraits and no heavy STL dependencies (optionally). Currently Boost.Sort depends on Serialization for BOOST_STATIC_WARNING, but I think this is easily solvable, maybe this static assert utility should go to the core/utility library. Reason: Sort is a low-level algorithm that should avoid pulling unneeded dependencies to other boost libraries. * * * I don't know if other Boost libraries could benefit from this new stable_sort implementation. Maybe it's too special and I should try to write it myself in Boost.Container. I would love to hear comments and suggestions from sort experts, this might be a common need that could enrich the Boost.Sort library. Best, Ion

4 9

[regression] Tests for 'develop' not showing
by Edward Diener 23 Sep '15

23 Sep '15

Trying http://www.boost.org/development/tests/develop/developer/summary.html I get: "Error extracting file: The specified zipfile was not found."

4 4