- Boost - lists.boost.org

[tools/GSoC] static code analysis?
by Oliver Kowalke 30 Jan '16

30 Jan '16

Hi, would it be possible to provide a boost-tool or maybe a boost-GSoc project that enables static code analysis for boost developers? clang-tidy ( http://clang.llvm.org/extra/clang-tidy/) could be used for this purpose. Oliver

4 6

Re: [boost] [coroutine] x86 msvc11 stack corruption
by AVZ 29 Jan '16

29 Jan '16

Just want to share workaround which work for our company. (Fiber fix was not acceptable for that application) Debugging differences in make_fcontext between 1.53 vs 1.57, I found that in 1.53 context area is cleanned with 0, but not in 1.57. So we added explicit clear after line 100 in make_x86_64_ms_pe_masm.asm: sub rax, 0128h * ; memset context area pxor xmm0, xmm0 movaps [rax+008h], xmm0 movaps [rax+018h], xmm0 movaps [rax+028h], xmm0 movaps [rax+038h], xmm0 movaps [rax+048h], xmm0 movaps [rax+058h], xmm0 movaps [rax+068h], xmm0 movaps [rax+078h], xmm0 movaps [rax+088h], xmm0 movaps [rax+098h], xmm0 movaps [rax+0a8h], xmm0 movaps [rax+0b8h], xmm0 movaps [rax+0c8h], xmm0 movaps [rax+0d8h], xmm0 movaps [rax+0e8h], xmm0 movaps [rax+0f8h], xmm0 movaps [rax+108h], xmm0 movaps [rax+118h], xmm0 * ; third arg of make_fcontext() == address of context-function mov [rax+0118h], r8 With that we are getting same behavior as 1.53 - no crash on DLL load. Thanks, AZ -- View this message in context: http://boost.2283326.n4.nabble.com/coroutine-x86-msvc11-stack-corruption-tp… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[Iterator] [PR] Fix for documentation #8010
by Nathan Wilson 29 Jan '16

29 Jan '16

Hi, As a followup to my inquiry about maintaining the Iterator Library about a month back, I wanted to create PR for a simple documentation fix. So, here it is: https://github.com/boostorg/iterator/pull/21 Please let me know if there are any thoughts and/or if I'm doing something incorrectly. Thanks! Nate

2 2

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

29 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 23 Jan '16

23 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