- Boost - lists.boost.org

[release] Boost 1.66.0 Beta 1 Release Candidate 2
by Daniel James 19 Nov '17

19 Nov '17

The release candidates for the 1.66.0 beta release are now available at: <https://dl.bintray.com/boostorg/beta/1.66.0.beta.1/source/> You need to scroll past the first release candidates to find the downloads. The SHA256 checksums are as follows: e7b23e638e8c3a9da1512439385b04850829cea7bd56d8398677c096857d830b boost_1_66_0_b1_rc2.7z 5d0405eb73bd609ebcd54bbc96d4f1e2d97c51b96c4703706695ddd94f942d6b boost_1_66_0_b1_rc2.tar.bz2 f0f455e39bc47b2b670a17cb221687506e9a22dc478956d3d8aabb9cb835a7dc boost_1_66_0_b1_rc2.tar.gz 694c8b9e902b7981670bce166f675f3875c19326936db51aabd98d2ddfea9b45 boost_1_66_0_b1_rc2.zip The in progress release notes are at: <http://www.boost.org/users/history/in_progress.html> And the documentation is at: <http://www.boost.org/doc/libs/1_66_0_beta1/> 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.

3 2

Re: [boost] Adding polymorphic_value to boost
by Tom 19 Nov '17

19 Nov '17

> Message: 10 > Date: Thu, 16 Nov 2017 02:14:30 -0700 > From: Jonathan Coe <jonathanbcoe(a)gmail.com> > To: boost(a)lists.boost.org > Cc: Matt Calabrese <calabrese(a)google.com> > Subject: [boost] Adding polymorphic_value to boost > Message-ID: > <CAAbBDD9Ck+LhQ4iUraBtBkxexVKDt167qxyfTpDQqYM9bcMqLQ(a)mail.gmail.com> > Content-Type: text/plain; charset="UTF-8" > > I'd like to propose adding the class-template `polymorphic_value` to boost. > > `polymorphic_value` is designed to allow the compiler to correctly generate > special member functions for classes with polymorphic components (It's > `any` with an interface). > > `polymorphic_value` has been proposed for standardisation in P0201 and has > advanced through the Library Evolution group in Albuquerque (Nov 5-10). > https://wg21.link/p0201 > > A working draft of the proposal and implementation can be found at > https://github.com/jbcoe/polymorphic_value > > I gave a presentation about polymorphic_value at C++::London here: > https://skillsmatter.com/skillscasts/9539-a-polymorphic-value-type-for-c-pl… > > Matt Calabrese has kindly offered to be review manager. > > Kind regards, > > Jon Hi, I'd be interested in such a utility. Mathias Gaunard proposed something similar on the mailing list a long while ago, I implemented a simple version myself based on that. I have a small number of questions. Given that this is a value type, does the current approach over-expose pointer (ownership) in the interface (in essence it still appears to be a glorified smart pointer) and understate its more fundamental purpose as a regular value with dynamic type? There might be other things which can usefully be added for such a value type, for example permitting direct construction of an object of specific (derived) type, by passing the type as well as the arguments for the constructor of that type (or wrapping the arguments in some kind of in-place factory with explicit type). Something like: // Simple wrapper to enable a static type to be passed through a forwarding constructor. template <typename T> struct Type {}; // Forwarding constructor - actual type is deduced from type wrapped in (unnamed) first argument's type template <typename D, typename... Args> explicit poly_obj(Type<D>, Args&&... args); // Also could have an emplace member function template <typename D, typename... Args> void emplace(Type<D>, Args&&... args); In theory you wouldn't need to expose pointers in the interface at all? In fact, should a type-erasure library be preferred (e.g., Boost.TypeErasure or Adobe.Poly) as it provides a more general solution for manipulating polymorphic value types (though typically harder to use)? Would you be considering supporting C++98 via using the boost::move library? Regards, Tom

1 0

[gil][test] HOWTO set up the Boost testing process for projects with extra prerequisites ?
by Stefan Seefeld 17 Nov '17

17 Nov '17

Hi, I just merged some work to GIL's `develop` branch. This notably involves improvements to the testing infrastructure. Testing GIL is a bit involved, as it requires various backend libraries (PNG, JPEG, TIFF, etc.) to be installed. While the stand-alone testing works fine (https://github.com/boostorg/gil/blob/develop/.travis.yml#L304-L306) the integrated testing will thus fail, until the testing logic is augmented by the necessary instructions to a) install the prerequisites and b) invoke the build system with the appropriate flags (https://github.com/boostorg/gil/blob/develop/io/test/Jamfile#L13-L22) Thus my question: do we have any documentation that explains how to do this ? What do I (as GIL maintainer) or any testers need to do for the integrated testing to work ? (I can't resist: all these libraries that have special requirements really shouldn't be built and tested in such a monolithic process. It's a burden to all tester, maintainers, and packagers. It would be far better to handle them more independently.) Stefan -- ...ich hab' noch einen Koffer in Berlin...

3 8

[density] paged memory and concurrency
by Giuseppe Campana 17 Nov '17

17 Nov '17

Hi, in the last year I’ve been experimenting concurrent data structures on density, a C++11 library focused on: - Page-based memory management. - Heterogeneous and function queues. Single-threaded, mutex-ed, lock-free and spin-locking versions are available. Lock-free and spin-locking queues support any combination of single/multiple producers/consumers. - Lifo memory management, mainly to provide a safe alternative to alloca with almost the same performances. - Parametric control of the progress guarantee in concurrent algorithms. I have to do a major update to fix the known issues, so I’d like to receive any feedback before it, especially about the design. The document http://giucamp.github.io/density/doc/html/implementation.pdf explains the implementation of almost everything, though it’s quite long. Documentation: http://giucamp.github.io/density/doc/html/index.html Repository: https://github.com/giucamp/density Is there any interest on it? Giuseppe Campana.

1 0

Re: [boost] [Boost-users] Could guys help me on a boost MPI link error
by degski 16 Nov '17

16 Nov '17

On 16 November 2017 at 07:33, Renfan Luo <Renfan.Luo(a)perpetuum.com> wrote: > Thanks a lot! After changing X64 to X86 on the top of drop-down window > of IDE, the problem has been fixed. > You're welcome, degski

1 0

bjam boost build on windows - changing the path strategy (stage)
by James E. King, III 16 Nov '17

16 Nov '17

I would like to build boost into a prefix directory (.\b2.exe --prefix=C:\prefix) containing "C:\prefix\include\boost\..." and "C:\prefix\lib", just like the linux build does. On Windows it builds into ""C:\prefix\include\boost-1_66\boost\..." instead - is there a bjam control to get rid of the version in the prefix include path for header copies? - Jim

5 5

[release] 1.66.0 fully closed for beta
by Daniel James 15 Nov '17

15 Nov '17

I've stopped updating the master branch of the super project, and will try to get the beta release out tomorrow, so there's only a little delay. You can still add your release notes at: <https://github.com/boostorg/website/blob/master/feed/history/boost_1_66_0.q…> Thanks, -- The Boost Release Team

1 1

Re: [boost] seeking endorsement for histogram library
by Hans Dembinski 15 Nov '17

15 Nov '17

Dear Fabian, I am CCing boost, because maybe some others want to read this as well and/or correct me. > On 15. Nov 2017, at 14:21, Fabian Bösch <boeschf(a)student.ethz.ch> wrote: > > Thanks for clarifying. While it is true that Boost.Accumulators does > this, it is for the uni-variate case only, afaik. Please correct me, if > I'm wrong. I believe you can compute a multi-dimensional mean, if you feed an appropriate Boost.Accumulator with std::valarrays. Maybe there is an easier way. > Now you have multi-variate histograms for which one would probably also > like to know the Covariance (rank-2 tensor), for example. Maybe this is > out of scope but a general solution for this would be nice. But perhaps > this would rather be addressed in another generalized accumulator > library. What do you think? I think you are right. You can compute the covariance of two variables with Boost.Accumulators: http://www.boost.org/doc/libs/1_65_0/doc/html/accumulators/user_s_guide.htm… but it does not give you a full matrix for N covariates. Maybe you could contact the maintainer of Accumulators, Eric Niebler. It is a reasonable request that would fit better into Accumulators than in Histogram. Best regards, Hans

1 0

Re: [boost] seeking endorsement for histogram library
by Hans Dembinski 15 Nov '17

15 Nov '17

Dear Francesco, > On 13. Nov 2017, at 19:09, Francesco Guerrieri <f.guerrieri(a)gmail.com> wrote: > > Hi this proposal is of great interest to me, thanks for sharing your work with us. Which compilers/OSs are supported? I tested the code on OSX with Apple clang, and via TravisCI on several versions of gcc on Linux. The CMake build works on both OSX and Linux. I wanted to also test Windows via Appveyor, but couldn't get my CMake build script to work with msvc. I am passing compiler flags directly, which works for clang and gcc, but naturally not for msvc. Debugging this non-interactively, by committing a change to github, letting Appveyor run, seeing it breaking again..., was a pain and I stopped at some point. If an expert for Windows had a look at my CMakeLists.txt, it is probably something that could be easily fixed. Best regards, Hans

2 2

seeking endorsement for histogram library
by Hans Dembinski 14 Nov '17

14 Nov '17

Dear Boost developers, I believe the histogram library is now ready to be presented here and I am looking for endorsement. Histogram is a C++11 header-only library that provides a safe, convenient, and fast multi-dimensional histogram for statistical analysis and visualisation. The library has a unique feature set, among it a safety guarantee that the counts in the histogram cannot overflow. It is easily customisable for power users, while providing defaults that just work for the occasional user. Meta-programming is used to provide an especially fast histogram implementation that can be used when the histogram configuration is known at compile-time. A dynamic implementation is also provided for the other case when the configuration is only known at run-time. The two implementations share a common interface, so it is easy to switch between them. Python bindings are included for the dynamic implementation. The Python interface supports Numpy arrays to greatly speed up the exchange of data between the Python and C++ side. I tested the performance of the library in benchmarks against other libraries, which have fewer features, and this library beats them in almost all cases. I am stealing the style of the rest of the email from Antony Polukhin. Library: https://github.com/HDembinski/histogram <https://github.com/HDembinski/histogram> Docs: https://htmlpreview.github.io/?https://raw.githubusercontent.com/HDembinski… <https://htmlpreview.github.io/?https://raw.githubusercontent.com/HDembinski…> Boost Library Incubator: http://blincubator.com/bi_library/histogram-2/?gform_post_id=1582 <http://blincubator.com/bi_library/histogram-2/?gform_post_id=1582> Library changes since last mail: * Support for efficient adding of multiple histograms and scaling * Support for reduce transformation * Re-design of category axis as a general mapping between unique values and bins * Re-design of the bin description an axis returns upon element access * Regular axis can accepted bijective (user-provided) transformations * Interface cleanup, refactoring, and simplification * Finished documentation Best regards, Hans

3 4