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

[Graph] Is there an active maintainer for Boost.Graph?
by Rohan Shah 19 Sep '16

19 Sep '16

Hi all. I'm wondering whether Boost.Graph currently has an active maintainer. I only ask because there is a fairly active github repository ( https://github.com/boostorg/graph) but it seems that important commits fail to make it into the main release on the website. For example, I would consider this (https://github.com/boostorg/graph/commit/ 8ece8fac15560cf38cf3ffbb1d56708ef8e586a2) commit to be fairly critical - Without it part of depth_first_search seems to be somewhat broken, and that's a core algorithm. And that commit is from 2014! A conversation on #boost IRC suggested I mention this problem here. Note: I am not volunteering myself to help fix this - I'm simply not qualified for it. Sorry.

1 0

[boost] [bjam] combinations of options
by Lorenzo Caminiti 19 Sep '16

19 Sep '16

Hello all, When I use bjam the following will compile my code with combinations of MSVC, GCC, and CLang for both shared and static linking: $ bjam toolset=msvc,gcc,clang link=shared,static # (1) Is there a way to define a variant, target, or something else in the Jamfiles so that I can shortcut the above by typing just the variant target at the command line: $ bjam all_toolset_link_combinations # equivalent to (1) above I am asking this just for convenience because I have a feature like toolset but with 30+ values so it'd be nice to shortcut it to a single target on the bjam command line. Thank you. --Lorenzo

2 4

[test] Init framework before dataset generation
by Florian Lindner 16 Sep '16

16 Sep '16

Hello, I try to use boost test with data test cases: std::vector<float> fibonacci() { std::cout << "Data Set" << std::endl; [...] } BOOST_DATA_TEST_CASE(datatest, boost::unit_test::data::make(fibonacci()), mapping) { std::cout << "Datatype" << typeid(mapping).name() << std::endl; } The problem of that is, that fibonacci is initialized before anything else. The order of initializations is: Data Set main init_unit_test Global Fixture That works fine here, but my fibonacci uses MPI which needs to initialized by MPI_Init. I want to do that initialization in the global fixture or int main or init_unit_tests, once for the entire test runner. Is there anything I can do about that and belay initialization of Data Set after one of the others? Thanks, Florian

2 2

[release] Boost 1.62.0. Beta 2
by Rene Rivera 14 Sep '16

14 Sep '16

The packages for 1.62.0 beta 2 are now available: <https://sourceforge.net/projects/boost/files/boost/1.62.0.beta.2/> The SHA256 checksums are as follows: 95feae3620b3e604e93f14d97195fc04a4b67063692859af8df19657d41b82d5 boost_1_62_0_b2.7z 27bc9b328ff73d7dbf80cd9d4b5f79b0878221e5d8e4b6c47444b135edc1080a boost_1_62_0_b2.tar.bz2 3939d5efa683449e87b374d7e92e3eeb6490063ddb2877919f0fad26e3a0f53e boost_1_62_0_b2.tar.gz cff9ab5db0928244c4c836cf3da5140e6e93db7756e2791ba99a21104ad3aa72 boost_1_62_0_b2.zip As always, the release managers would appreciate it if you download the archive of your choice and give building and using it a try. Please report both success and failure, and anything else that is noteworthy. Thanks! -- The release managers -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

3 2

[Boost.Graph] Accessing underlying graph of a boost::reverse_graph
by Björn Pollex 13 Sep '16

13 Sep '16

Hello, I am currently trying to find out if there is a way to access the underlying graph of a boost::reverse_graph [1]. There does not seem to be support for this. I want to use this to generically define interior edge-properties for reversed graphs, if the underlying graph has them as well. Currently this does not work, because I cannot access the underlying graph object. Am I overlooking something? If not, where could I request to add this? Cheers, Björn Pollex [1]: http://www.boost.org/doc/libs/release/libs/graph/doc/reverse_graph.html

2 2

[boost][interprocess] named_mutex/named_condition using windows shared memory
by Rob Conde 12 Sep '16

12 Sep '16

For boost interprocess shared memory, I can choose to use windows specific shared memory so that no files are created to emulate the functionality. Is there any way to do this with named_mutexes and named_conditions? Thanks, Rob Conde

2 1

[release] Boost 1.62.0 Beta 1
by Rene Rivera 12 Sep '16

12 Sep '16

The first beta packages for 1.62.0 beta 1 are now available: <https://sourceforge.net/projects/boost/files/boost/1.61.0.beta.1/> The SHA256 checksums are as follows: f7cc83e6a3b03cd7aa8822992aa3e36422cc2214644d69277ef55a4db51f44bd boost_1_62_0_b1.7z 4057993811e40b1fd4719675e44c2550b6c2379546192da2299c17fec9a3dddf boost_1_62_0_b1.tar.bz2 fb0c10b625c5ec47cc837b54740540e400c59571b2eabf427c00f32bffc6ca70 boost_1_62_0_b1.tar.gz b38ef21c43c5ff814a2144bc23871c134164e7f51c71672d0f49a44636fb50b5 boost_1_62_0_b1.zip As always, the release managers would appreciate it if you download the archive of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. Thanks! -- The release managers -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

9 20

"Re: [boost] Boost-1.62: How to get list of all dirs under 'run-tests libs:' target from status/Jamfile?"
by Sergey Sprogis 09 Sep '16

09 Sep '16

This is nice idea, but unfortunately does not work for my purpose of calculatingpass rates for every test suite of regression testing. It would fit perfectly if instead of ---dumptest b2 will also have another option, something like: --dumptestdirs. I mean, the option which generates the whole list of dirs containing all jamfiles executed for full regression testing. Actually, I spent some time trying to generate such list of dirs based on the output produced by 'b2 -n -a -d0 --dump-tests', but was not able to find general algorithm [ wout using specific library names and whout parsing the content of jamfiles ] which transforms list of tests into the list of test dirs from which they are launched [ assuming that each test should be executed only once ]. Here just couple of examples which demonstarte those difficulties: 1. In 'wave' its 'test' subdir does not contain jamfile like many other libsdo, but rather wave's jamfile is located inside internal 'build' subdirectory, and it launches testslocated from 'testlexers' 'testwave' subdirs which are located on the same level as 'build' itself. When my script sees those wave tests from --dumptest output, how should it figure out that jamfile which launches them is located inside 'build' dir? 2. Inside 'unordered' library there are two subdirs with jamfiles: test/exception and test/unordered. All tests for 'unordered' may be run in two similar ways: either by executing both those jamfiles, or by executing jamfile which is located on higher level inside 'test' subdir. But to run every test once the script should choose one or another way. Now, in a similar situation for 'core' library, in order to run all its tests one time my script should run both jamfiles: internal one located inside core/test, and also another one located in core/test/swap. How the script should resolve such ambiguity for 'unordered' and core' libraries? So, I think that list of test dirs which was present in status/Jamfile.v2 in boost-1.61.0 was really useful to me. But, of course if it was created manually, and there is no easy way to do it automatically, then probably, I should also create it manually for Boost-1.62 and all later versions. Sergey > 2016-09-04 11:45:41 Rene Rivera (/grafikrobot_at_[hidden]/) > wrote: > You can get a list of all the tests that get, or will get, run from b2 with the following: > % cd boost-root/status > % b2 -n -a -d0 --dump-tests > That will produce, interspersed with other output, lines like the following: > boost-test(RUN) "accumulators/count" : "libs/accumulators/test/count.cpp" > One of those for each test that is tested. The format is: > boost-test(<TYPE>) "<LIBRARY>/<TEST>" : "<SOURCE>" > Where LIBRARY can be of the form "<library>" or "<library>/<sublibrary>". > That should be sufficient to produce the results you want. And if you use > just the above list of tests it's likely to be more accurate than your > previous method. As the tests runs from the "boost-root/status" dir are not > alway the same as those run from the corresponding library dirs. > -- >-- Rene Rivera >>On Sat, Sep 3, 2016 at 5:09 PM, Sergey Sprogis <sergey.sprogis_at_[hidden]> >> wrote: >> I use latest Boost versions to test new C++ compiler in development stage. >> >> It's important for me to know what would be "pass rate" for every library >> which Boost.org reports on its Regression Testing website. >> To calculate all those pass rates I created script which goes inside every >> library's 'test', 'example' or whatever subdirectory and launches bjam from >> there. >> It creates a separate logfile(s) for every library which I then analyze to >> calculate "pass rate". >> >> But before launching my script I need to know the whole list of dirs which >> Boost.org uses for its Regression testing. >> In the previous Boost-1.61.0 version I was able to easily produce such >> list by extracting it from 'status/Jamfile.v2'. It looked like this: >> >> run-tests libs : >> accumulators/test # test-suite accumulators >> algorithm/test # test-suite algorithm >> algorithm/minmax/test # test-suite algorith/minmax >> ... >> concept_check # test-suite concept_check >> config/test # test-suite config >> container/bench # test-suite container benchmarks >> container/example # test-suite container_example >> ..... >> >> As you may see this list contains not only 'test' subdirs, but also some >> others: 'example', 'bench', etc. >> But now the problem is that in Boost-1.62.0 'status/Jamfile.v2' does not >> have such full list anymore. >> >> Could anyone suggest me some hack how to produce the full list of tested >> libraries for Boost-1.62.0, similar to one which Boost-1.61.0 has? >> >> It would be nice if bjam will eventually have a special option which will >> allow to produce such list, but for now I'd appreciate just a hack which >> will help me to solve this issue. >>

1 0

Preprocessor: Expaning empty VA_ARGS
by Florian Lindner 09 Sep '16

09 Sep '16

Hello, I have this preprocessor macros: ----------- #include <boost/preprocessor/variadic/to_seq.hpp> #include <boost/preprocessor/seq/for_each_i.hpp> #include <boost/preprocessor/stringize.hpp> #include <iostream> #define TRACE(...) \ std::cout << "foo" \ BOOST_PP_SEQ_FOR_EACH_I(LOG_ARGUMENT,, BOOST_PP_VARIADIC_TO_SEQ(__VA_ARGS__)); #define LOG_ARGUMENT(r, data, i, elem) \ << std::endl << " Argument " << i << ": " << BOOST_PP_STRINGIZE(elem) << " == " << elem int main(int argc, char *argv[]) { TRACE(); return 0; } ----------- They compile when TRACE has arguments, but not without. Problem is, that LOG_ARGUMENT is called even when no args are supplied, leading to the expansion: std::cout << "foo" << std::endl << " Argument " << 0 << ": " << "" << " == " << ;; elem is empty, therefore there is no expression after the last << expected primary-expression before »;« token How can I deal with that? Thanks, Florian

3 4

[MultIndex] Iterator/Range validity when modify entries.
by Deniz Bahadir 09 Sep '16

09 Sep '16

Hi guys, While trying to implementing a new feature, I came across a question concerning iterator/range validity of boost::multi_index. To understand the question, here is my setup: <code> // Database entry. struct Entry { int key1; int key2; }; // Access-keys. struct Index1{}; struct Index2{}; using namespace boost::multi_index; using namespace boost; // The multi_index database. using Database = multi_index_container< Entry, indexed_by< hashed_non_unique< tag<Index1>, member<Entry, int, &Entry::key1> >, hashed_non_unique< tag<Index2>, member<Entry, int, &Entry::key2> > > >; Database db; /* ... Here db is getting filled. ... */ </code> I obtain a range of entries from that database with the same value for key1 through the first index and want to modify each single entry of that range. However, I will only modify key2 (which is only used as key in the other index)! My main question is now: Does modifying an entry invalidate my range although I do not modify the member that was used as key for obtaining the range? The code in question would possibly look like this: <code> auto& index1 = db.get<Index1>(); auto range = index1.equal_range(42); for (auto it = range.first; it != range.second; ++it) { index1.modify(it, [](Entry& entry) { entry.key2 = 123; // <---- Does this invalidate my range? // entry.key1 is not getting modified! }); } </code> My follow-up question is then: If the range is indeed invalidated, what would be a working solution for that problem? Incrementing the loop-iterator by hand before modifying the entry (and not letting the loop do it)? So, would the following be a valid solution? <code> auto& index1 = db.get<Index1>(); auto range = index1.equal_range(42); if (range.first != range.second) { auto it = range.first; auto end = --range.second; do { index1.modify(it++, [](Entry& entry) { entry.key2 = 123; // <---- Does this invalidate my range? // entry.key1 is not getting modified! }); while (it != end); } </code> Of course, neither do I want to iterate over an entry twice (and thereby modify it twice) nor do I want miss an entry. And one last question: Does this problem or its solution apply to all index-types or just to hashed indexes? Thanks for the clarification. Deniz PS: Oh and by the way: Boost.MultiIndex is a really cool library. :-)

3 4