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

From: giridhar
by giridhar 31 Oct '14

31 Oct '14

Hi boost http://mountpleasanthomebuilder.com/brother.php?produce=z3ueg5w3x3gg giridhar Sent from my iPhone

1 0

[1.56.0] Release candidates available
by Marshall Clow 31 Oct '14

31 Oct '14

Release candidate files for 1.65.0 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_57_0_rc1.7z) = 17c98dd78d6180f553fbefe5a0f57d12 MD5 (./boost_1_57_0_rc1.tar.bz2) = 1be49befbdd9a5ce9def2983ba3e7b76 MD5 (./boost_1_57_0_rc1.tar.gz) = 25f9a8ac28beeb5ab84aa98510305299 MD5 (./boost_1_57_0_rc1.zip) = 5e040e578e3f0ba879da04a1e0cd55ff Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_57_0.html

1 0

[PropertyTree][variant] Reading JSON into a recursive variant.
by Arindam Mukherjee 31 Oct '14

31 Oct '14

I have a recursive variant definition that can handle JSON data. Is there a way to read JSON data using PropertyTree into a recursive JSON? Here is the variant defn. #define BOOST_VARIANT_NO_FULL_RECURSIVE_VARIANT_SUPPORT #include <boost/variant.hpp> JSONNullType {}; boost::variant<std::string, double, bool, JSONNullType> jsonToken; typedef boost::make_recursive_variant< std::string, double, JSONNullType, std::map<std::string, boost::recursive_variant_>, std::vector<boost::recursive_variant_> >::type JSONValue; Regards, Arindam

1 0

[Boost.Test]: How I can write custom external main ?
by NtVisigoth 29 Oct '14

29 Oct '14

Hi, Everybody! I've 2 questions about Boost.Test usage. My general cpp-source file appmain.cpp: // more lines with "#include"-constructions #define BOOST_TEST_MODULE TestMain #include <boost/test/unit_test.hpp> My suite-source file suite1.cpp: #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(FooFooSuite) BOOST_AUTO_TEST_CASE(testBarBarBar) { // more lines } BOOST_AUTO_TEST_SUITE_END() Questions #1: How can write external main in my general cpp-file appmain.cpp? I want usage exe-file like : test.exe d:\test-files\ Questions #2: I see these lines in the boost.test documentation: boost::unit_test::framework::master_test_suite().argc boost::unit_test::framework::master_test_suite().argv This args and argv global, are these ? Can I use this in different suites without save to global variable ? P.S.: I sorry for my English.

1 0

[type_traits] Check if implicit conversion from one type to another is possible
by Aaron Levy 29 Oct '14

29 Oct '14

Which is the correct type trait to use to check if an element of type T can be assigned to an element of type U. Is it any of the following: boost::is_convertible<T, U> std::is_assignable<U, T> Now boost::is_convertible<double, int>::value is true while std::is_assignable<int, double>::value is false. What does this signify? -- Aaron Levy aaron.levy(a)yandex.com

1 0

bjam hangs on select (in develop branch)
by Alain Miniussi 28 Oct '14

28 Oct '14

Hi, I am trying to test Boost.MPI with Intel's implementation and I am stuck while trying to run simple tests through bjam. Bjam is hangs on the select (not pselect ?) instruction of the unix exec_wait. As far as processes are concerned: PID USER PR NI S %CPU TIME+ PPID COMMAND ....................... 16882 alainm 20 0 S 0.0 0:01.61 6507 bjam 16899 alainm 20 0 T 0.0 0:00.00 16882 sh 16900 alainm 20 0 Z 0.0 0:00.00 16899 mpiexec.hydra <defunct> ....... bjam calls a generated shell (below) which calls a mpiexe.hydra which work perfectly fine outside bjam. The mpiexec.hydra dies the the shell refuses to let it go. the shell script, generated by bjam, is: =============================================== [alainm@gurney engine]$ more /proc/16899/cmdline /bin/sh LD_LIBRARY_PATH="/gpfs/scratch/alainm/view/boost/bin.v2/libs/mpi/build/intel-linux/debug:/gpfs/scratch/alainm/view/boost/bin.v2/libs/serialization/build/intel-linux/debug:/softs/ intel/composer_xe_2015.0.090/bin/lib:/softs/intel/composer_xe_2015.0.090/lib/intel64:$LD_LIBRARY_PATH" export LD_LIBRARY_PATH status=0 if test $status -ne 0 ; then echo Skipping test execution due to testing.execute=off exit 0 fi mpiexec.hydra -n 2 "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.test/intel-linux/debug/broadcast_stl_test-2" blob > "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.te st/intel-linux/debug/broadcast_stl_test-2-run.output" 2>&1 status=$? echo >> "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.test/intel-linux/debug/broadcast_stl_test-2-run.output" echo EXIT STATUS: $status >> "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.test/intel-linux/debug/broadcast_stl_test-2-run.output" if test $status -eq 0 ; then cp "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.test/intel-linux/debug/broadcast_stl_test-2-run.output" "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.test/intel- linux/debug/broadcast_stl_test-2-run" fi verbose=0 if test $status -ne 0 ; then verbose=1 fi if test $verbose -eq 1 ; then echo ====== BEGIN OUTPUT ====== cat "../../../bin.v2/libs/mpi/test/broadcast_stl_test-2.test/intel-linux/debug/broadcast_stl_test-2-run.output" echo ====== END OUTPUT ====== fi exit $status [alainm@gurney engine]$ ================================================= Note that select only test for the subprocess output, at the hanging point mpiexec.hydra is done with its outputs. Any idea ? Alain PS: there was a cmake based project some time ago, is it still active or is bjam here to stay ?

2 18

[Boost.Polygon] Union filling holes
by Julien Nicoulaud 27 Oct '14

27 Oct '14

Hi all, I am using boost/polygon to do unions of multiple polygons, and I lose holes that were in the input after the assign() operation. Here is code that demonstrates the issue: // Create outer contour Point outer[] = {gtl::construct<Point>(0, 0), gtl::construct<Point>(0, 10), gtl::construct<Point>(10, 10), gtl::construct<Point>(10, 0)}; // Create inner contour Point inner[] = {gtl::construct<Point>(2, 2), gtl::construct<Point>(8, 2), gtl::construct<Point>(8, 8), gtl::construct<Point>(2, 8)}; // Define inner contour as a polygon polygon_with_holes_data<long> input_poly_inner; gtl::set_points(input_poly_inner, inner, inner+4); // Put inner polygon in a list vector<polygon_with_holes_data<long> > inners; inners.push_back(input_poly_inner); // Create input polygon as outer contour + inner polygon list polygon_with_holes_data<long> input_poly; gtl::set_points(input_poly, outer, outer+4); gtl::set_holes(input_poly, inners.begin(), inners.end()); // Create input polygon set, insert input polygon polygon_set_data<long> input_poly_set; input_poly_set.insert(input_poly); // Create output polygon set, assign input polygon set vector<polygon_with_holes_data<long> > output_poly_set; assign(output_poly_set, input_poly_set); // Print result std::cout << output_poly_set.size() << " polys" << std::endl; std::cout << output_poly_set[0].size_holes() << " holes" << std::endl; This prints: 1 polys 0 holes Any idea what I am doing wrong ? Kind regards, Julien Nicoulaud

2 2

1.57.0 beta 1 is in a new location
by Marshall Clow 27 Oct '14

27 Oct '14

Tom Kent pointed out that I put the beta 1 files in a folder that we traditionally use for Windows binaries, so I have moved the beta files to https://sourceforge.net/projects/boost/files/boost/1.57.0.beta.1/ These are the same files as last Monday - merely in a new location. If you have already downloaded and tested the beta, thanks! - no need to do it again. — Marshall

1 0

[Geometry] Packing algorithm for r-tree?
by Jeremy Murphy 27 Oct '14

27 Oct '14

I see that a fourth node splitting algorithm for bulk loading is documented in the Introduction to spatial indexes but not listed elsewhere (such as Creation and Modification). Is it hiding in the library somewhere or is the introduction just a tantalizing sneak preview? Thanks, cheers. Jeremy

2 5

BGL, cut set
by Mads Jensen 27 Oct '14

27 Oct '14

Hi, I'm looking into how you can quickly find the cut set of a graph without having to loop over the colormap as a vector. I'm using the http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/edmonds_karp_max_flow.h… (the example provided does mostly what I want, except that it uses a vector, and not a regular map). Boykov Kolmogorov also has the colormap parameter. It seems that associative_property_map could be used, but I don't really see how? Hints on how to do this will be appreciated. A lot of the examples of the Boost graph library use the preprocessor with a check similar to: #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 What's so special about this? Thank you, -- Med Venlig Hilsen / Kind regards, Mads Jensen

1 0