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

Cleanup of test results.
by Rene Rivera 11 Feb '15

11 Feb '15

Just an FYI for testers and authors.. I implemented some changes to the report generation that: a) Expires old results to not be shown in the results. I'm considering old to be anything past two weeks of age. This applies to all branches (i.e. develop and master). b) Filtering of master, aka release, results to only include an approved list of testers. This brings in some explicit control to what is considered the release toolsets. Which is something we used to enforce, but lost after the git transition. So it's back now. Rene. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 3

[GSoC 2015] Boost Document library development
by amitoj singh 11 Feb '15

11 Feb '15

Hello, My name is Amitoj Singh. I am pursuing B.Tech form Guru Nanak Dev Engineering college. I would like to work on Boost Document library Development. Can I have a more details on this project so that I can submit my first patch. Thanks! Regards! -- "Never repeat yourself" Amitoj singh slideshare.com/amitoj95 github.com/amitojsingh amitojsworld.wordpress.com

1 0

Re: [boost] [polygon] voronoi diagram in a bounding box
by Dan Chen 10 Feb '15

10 Feb '15

Hi Andrii, I'm implementing a Lloyd's algorithm to get a centroidal Voronoi tessellation of a box. In this algorithm, I need to get the voronoi cells in the box, and find the centroids of these cells. Thanks,Dan

2 1

[gsoc15] Google Summer of Code 2015 ideas needed before 20th Feb
by Niall Douglas 10 Feb '15

10 Feb '15

Dear Boost community, The Google Summer of Code 2015 organisation application period has begun. We need project ideas for our ideas page at https://svn.boost.org/trac/boost/wiki/SoC2015, plus anyone willing to mentor. Last year we got eight slots, the previous year seven slots. Let's try to get back to ten slots for 2015! Niall & Boris --- Boost C++ Libraries Google Summer of Code 2015 admin https://svn.boost.org/trac/boost/wiki/SoC2015

1 0

Regression testing: too many runners?
by Dmitry Moskalchuk 09 Feb '15

09 Feb '15

Guys, As you may know, I'm working on automatic regression testing of Boost on Android. I spent several weeks debugging it and now it seems to be close to the finish - i.e. we'll have soon fully automatic 24x7 regression testing with uploading all results to the Boost public FTP. As you can see, some results are already uploading on a regular basis - http://www.boost.org/development/tests/master/developer/summary.html (there are results of just few libraries at the current moment since I've limited testing by only those libraries to save time needed for debugging testing scripts; as far as I finish with my debugging, I'll enable testing of all libraries). However, I've realized that for thorough testing matrix of the variants become really big. Look, right now there are nine runners for Android, and this number is in fact very limited. They differs by target ABI (three arm variants, x86 and x86_64) and version of Android (API level 19 - Android 4.4 and 21 - Android 5.0). However, it has sense to test also on Android 4.0, 4.1, 4.2 and 4.3 since theirs market share is still large (see https://developer.android.com/about/dashboards/index.html). Add to that MIPS target ABI (not yet included to the testing) and multiple by two to have tests running with both default settings and with -std=c++11 - and you'll get really big total number of runners. I'm asking for advice from community. It's not the big problem for us to run all such tests in all variants, but I'm unsure if it will be acceptable for Boost community to see such wide table of runners. I'm afraid it will look like a flood. We also publish Android-only results on https://boost.crystax.net/master/developer/summary.html and we'll definitely display all results from all runners there. Please let me know if the same approach would work for http://www.boost.org/development/tests/master/developer/summary.html or should I limit somehow runners to be uploaded to the Boost FTP. -- Dmitry Moskalchuk

4 5

[githelp] Relative submodule paths..
by Rene Rivera 09 Feb '15

09 Feb '15

I've been trying to clean out the pull requests for the boost super-project and I ran into this one <https://github.com/boostorg/boost/pull/33>. And I don't really know if it makes sense, as I have personally not done a fork of the super-project. Is it a real problem? Should we change all the sub-project references? If yes, what are the likely impacts on others and existing release processes? -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

4 5

[polygon] voronoi diagram in a bounding box
by Dan Chen 08 Feb '15

08 Feb '15

Hi all, I am not sure whether this is the right place to ask this question. Basically, I want to compute the the voronoi diagram of a set of points in a bounding box, and output the voronoi cells. My idea is, after getting the voronoi diagram vd of the point set, for each voronoi cell in vd, compute the intersection of the cell and the bounding box. I am wondering whether this can be done in a better way with the boost libraries. Thanks,Dan

2 1

[voronoi] Issue with boost::polygon::voronoi_diagram<> as class variable
by duke 08 Feb '15

08 Feb '15

For some reason when I have a voronoi_diagram as a class variable (which it needs to be in this case), I get this error on compile: Error 49 error C2248: 'boost::polygon::voronoi_diagram<T>::operator =' : cannot access private member declared in class 'boost::polygon::voronoi_diagram<T>' I'm new to C# so it may be something obvious. - George

2 1

[MPL] Advice on how to proceed with a bugfix pull request
by Bruno Dutra 08 Feb '15

08 Feb '15

Hello everyone, I've found a fix to this bug <https://svn.boost.org/trac/boost/ticket/7769#no3>, which is based on BOOST PP library and thus should be supported across the various platforms, even though I just tested for a specific set up as I mentioned on my comment there. I've added some code snippets, from which it is straightforward to develop a patch, but I guess it would be best if I just issued a pull request myself. Since this is my first time contributing to MPL and to BOOST itself for all that matters, I'd like to first hear some advice on how to do this properly. For instance, to which branch should I issue the pull request? By the way, is this indeed the best way to proceed at all? Kind regards, *Bruno C. O. Dutra*

2 2

A proposal
by Mudit Sharma 08 Feb '15

08 Feb '15

After creating QR,LU and Cholesky for Boost..can we develop algorithms for determining which of QR,LU,Cholesky..etc. should be used in solving linear equations based on analyzing the running time and numerical stability specific to the problem. Is it feasible? Thanks!

2 1