January 2016 - Boost - lists.boost.org

Interest in some Algorithms
by Dean Michael Berris 28 Jan '16

28 Jan '16

Hi Boost! It’s been a while, I hope you all have been doing well. I wanted to ask whether anybody’s interested in a couple of algorithms, to be made part of the Boost.Algorithm library. One is tentatively named ‘set_inplace_difference' which has the following synopsis: template <class I1, class I2> I1 set_inplace_difference(I1 f1, I1 f2, I2 f2, I2 l2); template <class I1, class I2, class C> I1 set_inplace_difference(I1 f1, I1 f2, I2 f2, I2 l2, C comp); It’s essentially a set_difference which re-uses the storage of the range [f1, l1). It takes elements from [f1, l1) that are in [f2, l2) and moves them to [p, l1) where p is the partition point (or the new “end”). This is best used in conjunction with “erase” on vectors and/or std::deque. These algorithms return p. Another is tentatively named ‘set_inplace_intersection’ which instead of the above which does the difference, does an intersection instead. Requirements on I1 and I2 are that they are RandomAccess iterators, and that they are sorted. I haven’t figured out whether partially-sorted is a sufficient condition. I also haven’t figured out whether it would work for weaker iterator classes, but so far my implementation relies on std::lower_bound and std::upper_bound. If there’s enough interest, I can prepare a pull request after going through my employer’s open-source patching process. Looking forward to hearing your thoughts! Cheers

4 7

C++Now 2016 Registration is Open
by Jon Kalb 28 Jan '16

28 Jan '16

Boost Developers, Registration is now open for this year¹s C++Now (put on by Boost). http://cppnow.org/2016-conference/announcements/2016/01/28/registration-is-o pen.html The conference has sold out the last three years and is expect to do say again this year. Do not put off registering. Note that session submitters should not register until they receive instructions from Marshall Clow, our conference registrar. See you in Aspen! Jon

1 0

Interest in library for nested containers?
by Alberto Marnetto 28 Jan '16

28 Jan '16

Hello, is there interest in adding a library for nested containers (including a flattening view, a function counting the scalar elements etc.) to Boost? A working version is available at https://github.com/AlbertoMarnetto/multidim . If the concept and the interface are suitable for a submission – in particular if the requirement of a C++11 compiler is acceptable and the small number of functionalities is not a problem – I can proceed to restructure the library to meet Boost's style guidelines. Regards, Alberto Marnetto

2 2

QuickBook generate table of references?
by Nat Goodspeed 27 Jan '16

27 Jan '16

I have a biggish document consisting of a number of different .qbk files -- big enough to make it unreasonable to start over with a different toolchain. I would like to mark up particular methods of particular classes in such a way that QuickBook will produce a consolidated list of links to those methods. I read a little about DocBook being able to generate tables of figures, etc., but between QuickBook syntax and the final output document, my mental model has a big "then a miracle occurs" cloud. Will someone please show me how this is achieved? Thank you!

4 8

Query regarding time complexity requirements of iterators in custom container
by Soul Studios 26 Jan '16

26 Jan '16

Hi there- currently working on Colony, last version I'm working on has achieved constant-time(amortised) time-complexity for iterator operations, except for the random-access operators (+, -, +=, -=, [], >, <, >=, <=). It's not possible to make these constant-time due to the nature of the algorithms and structure of container. Ion pointed out to me that there is an obscure C++ requirement for iterators that all operations be constant-time. Given this, is it worth keeping these in Colony before submitting to Boost, or would it be best to remove them and make the iterator bidirectional-only prior? Cheers, Matt

3 10

[serialization] Custom archive and arrays
by Bjorn Reese 22 Jan '16

22 Jan '16

I am currently adding support of C++ arrays to a custom oarchive. My archive inherits from boost::archive::detail::common_oarchive and implements save_override(), which will pass any unknown type to boost::archive::save(). This enables me to implement non-intrusive serialization. When I pass an array to boost::archive::save(), it detects that this is an array and then calls detail::save_array_type. This is where my problem starts, as the function is hardcoded to always store a prefixed array count, which is illegal in the format that my custom archive uses. Would it be possible to lift this restriction? My current workaround is to add an overload for arrays to my custom archive, i.e. template <typename T, std::size_t N> void save_override(const T (&data)[N]);

3 5

[type_traits] Tests for implicit convertibility?
by John Maddock 22 Jan '16

22 Jan '16

Folks, I suspect we may have unintentionally backed ourselves into a corner with is_convertible/is_constructible. While trying to fix https://svn.boost.org/trac/boost/ticket/11922 I found I needed to SFINAE-out some conversion operators when the conversion already exists (as an implicit constructor in the target type). So far so easy, but consider: class Int { public: Int(const int& i) {}; Int(const Int& i) = delete; }; static_assert(is_convertible<int, Int>::value, "Ooops"); Now you would think this would pass right? But it doesn't (at least on GCC and clang), and this is true for both boost:: and std:: type_traits and appears to be an unintended side effect of the way is_convertible is defined, that a valid copy constructor is required on the target type. Of course: is_constructible<Int, int>::value is true, but that also catches explicit constructors. So... have we backed ourselves into a corner or do we still have a way to test for implicit-constructibilty that doesn't also require copy-constructibility on the target type? Thanks, John.

2 2

test matrix messages
by Robert Ramey 21 Jan '16

21 Jan '16

I have a certain number of failures for the tests of the serialization library on the test matrix. If I go to get the messages associated with the failure, I rarely get any helpful information. Here are a couple of common cases: http://www.boost.org/development/tests/develop/developer/output/teeks99-08c… http://www.boost.org/development/tests/develop/developer/output/igaztanaga-… Can anything be done about this? Robert Ramey

1 0

[gsoc16] Attn: We need 2016 mentors and project ideas for Boost!
by Niall Douglas 21 Jan '16

21 Jan '16

Dear Boost community, We are now within one month of the beginning of Google Summer of Code 2016! Last year's GSoC was a particularly momentus one as we witnessed the approval by the community for Boost.Hana to enter Boost - congratulations to Louis and his mentor Joel for bringing to Boost a very exciting new C++ library which pushes C++ compilers to their limits. We have also seen greatly improved retention of GSoC students in the community thanks to the improved student selection procedures introduced last year, and the fresh blood brought into Boost has been very evident on the mailing list this year. As part of filling in our application for 2016, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2016 in order to be approved as an organisation this year. Therefore a lengthy page of awesome project ideas at https://svn.boost.org/trac/boost/wiki/SoC2016 before *February 8th* would be an enormous help to getting us approved again this year and bringing to Boost another US$35,000 of Google funding. If you think yourself able to mentor a student doing some work on Boost this summer, *please* consider adding a description of the proposed work item and your name to the list. Last year we had more slots awarded to us by Google than we had good combinations of student and mentor, so we had to return slots which I believe has not happened here at Boost GSoC in at least a decade. That means that your project ideas have a better chance than ever of receiving funding if you can find a good student, and that is best done by getting project ideas floated *early*. If you want to know more about mentoring a Google Summer of Code funded student work before you nominate yourself, please feel free to ask on the main Boost developers mailing list boost(a)lists.boost.org or via gsoc-admin(a)boost.org. Thank you in advance for your time. --- Boost C++ Libraries Google Summer of Code 2016 admin https://svn.boost.org/trac/boost/wiki/SoC2016

3 2

please add safe numerics to the review queue
by Robert Ramey 20 Jan '16

20 Jan '16

Any chance I could get safe numerics added to the Boost Review queue? THe link to the incubator is here: http://rrsd.com/blincubator.com/bi_library/safe-numerics/?gform_post_id=426 documention here: http://htmlpreview.github.io/?https://github.com/robertramey/safe_numerics/… and github repo here: https://github.com/robertramey/safe_numerics Robert Ramey

1 0