- Boost - lists.preview.boost.org

Re: [boost] Boost XML Serialization Stability across library versions
by Adlai Shawareb 01 Feb '17

01 Feb '17

Thanks Robert, Regarding your suggestion to use text serialization. Since, over time, we will be adding and deleting data from the data set that we serialize, would the following be the right approach to managing the changes in the data that is de/serialized. I'm thinking that we would set the BOOST_CLASS_VERSION before de/serializing. { ar & mInt; If(version >= 2) ar & mFloat; If(version >= 3) ar & mInt2; ar & mFloat2; } Regards, Adlai On 1/25/17 12:04:00, Robert Ramey wrote: > Right. No one as under taken that task. Should be fairly straight > forward using spirit v3. > Robert Ramey

2 3

[container] ::flat_map function force_copy break strict-aliasing on gcc < 4.4
by Владислав Щапов 31 Jan '17

31 Jan '17

Hello! On function: template<class D, class S> BOOST_CONTAINER_FORCEINLINE static D force_copy(S s) { D *vp = reinterpret_cast<D *>(&s); return D(*vp); } gcc 4.3.4 (SLE 11) produced wrong code. It seems that the compiler does not create a copy of an object "s" and returns an object of D(). If I change the signature of function on "BOOST_CONTAINER_FORCEINLINE static D force_copy(const S& s)" the code works and the tests pass. But then does not create a copy of an object "s" in a function call. I'm not sure that this change is correct. Is there any other workaround for this problem with a compiler gcc 4.3 or better disable strict-aliasing? -- Best regards, Vladislav

2 2

C++Now 2017 Registration is Open
by Jon Kalb 31 Jan '17

31 Jan '17

Boost Devs, Registration for C++Now 2017 is now open: http://bit.ly/CppNow2017IsOpen The conference will be in Aspen, Colorado from May 15th to 20th. The deadline for submissions is this Friday: http://cppnow.org/2017-conference/announcements/2017/01/06/call-for-submiss… Jon

1 0

[CallableTraits] Still seeking Review Manager
by Barrett Adair 31 Jan '17

31 Jan '17

Hi, I'm still seeking a review manager for my CallableTraits library. I have spent hundreds of hours on this library, most of which went toward documentation and cross-platform testing. I think a small subset of the features in CallableTraits belong in the C++ standard. Occasionally at work, I have wished this were in Boost already. In short, this library eliminates the need to specialize templates for function signatures, and accounts for the *many* corner cases and cross-platform quirks that most users never care to do thoroughly themselves. I have 9 issues remaining on the GitHub page that would be resolved before an eventual acceptance, and I'd like to write some additional tests and documentation, but I think this library is ready for a review manager. Would anyone like to volunteer? https://github.com/badair/callable_traits Thanks, Barrett

1 0

[regression] Are tests not running?
by Andrey Semashev 31 Jan '17

31 Jan '17

Hi, Looking at the regression tests table, it looks like the latest regression tests were run last Saturday, November 26th. It seems inlikely that all testers decided to stop running 4 days ago or are running tests for that long. Is there some problem with the regression infrastructure?

6 16

Re: [boost] [sort] pdqsort
by Orson Peters 30 Jan '17

30 Jan '17

Hi, Orson here, I'm the original author of pdqsort. As discussed in this long github issue ( https://github.com/boostorg/sort/issues/11) I have full copyright on the pdqsort implementation (which is freely available under the zlib license on https://github.com/orlp/pdqsort) and am willing to provide it to Boost free of charge under the Boost license. @Marc Glisse, since your 2015 experiment the code has changed, and pdqsort now uses a technique called block quicksort. It's substantially faster for branchless comparisons (50-80%), but it seems that on some systems it also give significant (5-15%) slowdowns for branchful code. I will revert pdqsort's default implementation to the old version, except when the passed in type is built-in, and the comparison operator is std::less / std::greater, then I will use the branchless code. I will provide the branchless code explicitly as well, under a different function name, for experienced users that know their comparison function is branchless. The old implementation was never slower than std::sort in my experiments, for the record. If any of you have further questions, please do let me know.

2 1

[rational] Compilation issues on VS2013+
by Raffi Enficiaud 30 Jan '17

30 Jan '17

Hi Boost, I am having the following issues when compiling boost.test on develop: http://www.boost.org/development/tests/develop/developer/output/teeks99-09e… It seems that the problem is related to rational (worked for the 1.63 release), but I am not sure. Thanks! Raffi

1 0

[Beast] WebSocket is now feature-complete!
by Vinnie Falco 29 Jan '17

29 Jan '17

I'm pleased to announce that Beast 1.0.0-b24 has been pushed to the master branch, making Beast's WebSocket implementation feature complete with respect to RFC 6455 ("The WebSocket Protocol") and draft-ietf-hybi-permessage-compression-28 ("Compression Extensions for WebSocket). The latest version adds support for the "permessage-deflate" extension, which allows WebSocket messages to be compressed using the deflate algorithm. Beast comes with a header-only port of ZLib to modern C++11, no additional library is necessary to use the extension. The library now passes every test in the Autobahn TestSuite including compression tests. Official Repository https://github.com/vinniefalco/Beast/ Documentation http://vinniefalco.github.io/beast/index.html Autobahn TestSuite results http://vinniefalco.github.io/autobahn/index.html Thanks! -- Follow me on Github: https://github.com/vinniefalco

3 2

[Boost.Lockfree] Interest in a ringbuffer class
by Raphaël Londeix 27 Jan '17

27 Jan '17

Hi everyone, Is there any interest in having a lower level ringbuffer type in Boost.Lockfree ? The containers provided today in the library can only store homogeneous types of fixed size. At work, we have refined many implementations of ringbuffer classes that allow one to push/pop raw buffers. Before investing some time into a pull request, I wanted to know if there's some interest in such a type. The interface looks like this: template<typename Self, typename... Policies> class basic_ringbuffer { public: typedef ... buffer; public: buffer* start_write(size_t); void commit_write(size_t); void commit_write(buffer const*); buffer const* start_read(); void commit_read(size_t); void commit_read(buffer const*); public: void reader_reset(); void writer_reset(); private: buffer* _ring() { return static_cast<Self>(*this).ring(); } }; Of course, these are only the lowest level methods, one could implement push()/pop() or other higher level methods. Beyond the fact that this API provides by default zero-copy semantics, this interface is also agnostic to the actual owner of the memory, which allow users to implement custom ringbuffers easily (shared memory, mmap trick to map the beginning at the end, etc.), for example: class custom_ringbuffer : basic_ringbuffer<custom_ringbuffer, SomePolicies...> { buffer* ring() { return some_memory; } }; The usage would look like: custom_ringbuffer rb; // the write side if (auto buf = rb.start_write(100)) { memcpy(buf.data, "some data", 9); rb.commit_write(9); } // the read side if (auto buf = rb.start_read()) { std::cout << std::string_view(buf.data, buf.size) << std::endl; rb.commit_read(buf); } What do you think ? Did I miss something in boost itself ? Should I give a more complete overview of the API ? Cheers, -- Raphaël Londeix http://hotgloupi.fr

6 13

[outcome] Requesting second pre-review of Boost.Outcome tutorial
by Niall Douglas 27 Jan '17

27 Jan '17

Dear Boost, Last November you gave me some valuable feedback on rewriting the tutorial for Boost.Outcome, a C++ 14 library providing a factory and family of policy driven lightweight monadic value-or-error transports. I recently came out of employment contract and so have had the time to rewrite Outcome's Tutorial (anyone interested in employing a remote working C++ consultant please do get in contact). I'd appreciate feedback on https://ned14.github.io/boost.outcome/: 1. Is this rewritten tutorial too simple, too detailed or about right? 2. Do you feel you could use Outcome in your own code without difficulty after reading it? If not, what information is missing? 3. Are you persuaded of the merits of using Outcome after reading it? If not, what else do I need to say? The first FOUR sections at https://ned14.github.io/boost.outcome/ have been rewritten by me to hopefully reflect the feedback you gave me last November, so these have been refactored so far: * Description, Prerequisites and Support * Installing, building and testing Outcome * Quick start for the expert * Tutorial The package repo install methods haven't been implemented yet, these are marked in the docs as todo. These sections have yet to be refactored: * Frequently Asked Questions * Advanced usage: Outcome as a Monad * Outcome and the upcoming std::expected<T, E> Many thanks in advance for any feedback received. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

7 20