- Boost - lists.boost.org

[release] Boost 1.76.0 Beta 1 Release Candidate 2
by Marshall Clow 13 Mar '21

13 Mar '21

The second release candidates for the 1.76.0 beta release are now available at: <https://dl.bintray.com/boostorg/beta/1.76.0.beta1/source/> The SHA256 checksums are as follows: c32edd34f767dd4bb67b86f76ebf58cf76822a5993a9b434c028b2dd08cfeefc boost_1_76_0_b1_rc2.zip eb098d6d5352e10b17a3c49d2927ed61f09b6544f7c534627de35dfa2560fe20 boost_1_76_0_b1_rc2.tar.bz2 39eecd9672e78b95c8e3fdec1430a63788d528a66d3c8799c4639238e5d785bd boost_1_76_0_b1_rc2.7z 3ec1f92fa0a159b7073e39dd88f527a55d1f35e8986a3c560f202a75bdb8d584 boost_1_76_0_b1_rc2.tar.gz The only changes from RC1 is an update to Boost.Interprocess, which was failing to compile on Mac OS X. 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. -- The Release managers

2 2

Master branch now closed for 1.76.0 beta release
by Marshall Clow 13 Mar '21

13 Mar '21

Please do not make any commits to the master branch. — Marshall

2 2

Re: [boost] FFT proposal for gsoc 2021
by Janek Kozicki 13 Mar '21

13 Mar '21

> Strongly and beneficially Influence that. But we still need > To adhere to all formal application Steps A note regarding these formal steps: https://github.com/boostorg/wiki/wiki/Google-Summer-of-Code%3A-2021 https://lists.boost.org/Archives/boost/2021/02/250876.php https://www.boost.org/users/faq.html > On the board. I can do 1 mentor of Either quad double or FFT. Yeah, both of them are very useful for me. If we make FFT this year, we can hope for quad-double next year :-) best regards Janek Christopher Kormanyos said: (by the date of Fri, 12 Mar 2021 16:00:38 +0100) > We still need to adhere to the > Formal application process > And we should have our dialog > On the board. I can do 1 mentor of > Either quad double or FFT. > > Having your own idea and a > Working model is a tremendous > Advantage in the application > Process and is likely to very > Strongly and beneficially > Influence that. But we still need > To adhere to all formal application > Steps > > Kindest regards, Chris > > Sent from my iPhone > > > On 12. Mar 2021, at 07:26, Eduardo Quintana <eduardo.quintana(a)pm.me> wrote: > > > > Dear Christopher, > > > > I am thrilled to hear from you! Thank you for offering mentorship for this > > project. I look forward to start working on it. > > > > Best regards, > > Eduardo > > > >> On Thu, Mar 11, 2021 at 06:55:37PM +0000, Christopher Kormanyos wrote: > >> > >> <html><head></head><body><div class="ydpad5c413ayahoo-style-wrap" style="font-family:Helvetica Neue, Helvetica, Arial, sans-serif;font-size:16px;"><div></div> > >> <div dir="ltr" data-setdir="false"><div>> Hi Boost community,<br><div>> I've been working on a C++ templated library</div><div>> for Fast Fourier Transforms</div><div><br></div><div>> ...<br></div></div><div dir="ltr" data-setdir="false"><span>> Is there anyone interested in supervising this</span></div><div dir="ltr" data-setdir="false"><span>> project? Any opinions?</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Thank you for your interest and query.<br></span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Yes. I think I am interested and potentially qualified</span></div><div dir="ltr" data-setdir="false"><span>as 5 time GSoC mentor in Multiprecision and Math.</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>The plan seems good, start with header only</span></div><div dir="ltr" data-setdir="false"><span>simple implementation and increase complexity</span></div><div dir="ltr" data-setdir="false"><span>and efficiency as time allows.</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>This project would fill a present gap and wish list</span></div><div dir="ltr" data-setdir="false"><span>entry in Math/Multirpecision for those unable/unwilling</span></div><div dir="ltr" data-setdir="false"><span>to include FFTW.</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>I will write a little project description at rthe relevant</span></div><div dir="ltr" data-setdir="false"><span>page, link will follow...<br></span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Feel free to continue this thread, at the moment, i'm</span></div><div dir="ltr" data-setdir="false"><span>too busy to put down all my thoughts...<br></span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Kind regards, Christopher</span><br></div></div><div><br></div> > >> > >> </div><div id="yahoo_quoted_5520563993" class="yahoo_quoted"> > >> <div style="font-family:'Helvetica Neue', Helvetica, Arial, sans-serif;font-size:13px;color:#26282a;"> > >> > >> <div> > >> On Thursday, March 11, 2021, 10:55:29 AM GMT+1, Eduardo Quintana via Boost <boost(a)lists.boost.org> wrote: > >> </div> > >> <div><br></div> > >> <div><br></div> > >> <div>Hi Boost community,<br><br>I've been working on a C++ templated library for Fast Fourier Transforms,<br>https://github.com/Lagrang3/fftx.<br>Templated because some FFT algorithms are algebraic-field independent, eg. you<br>could FFT an array of N matrices provided a Nth matrix-root-of-unity is given.<br>As a result you could have a single algorithm for a variety of underlying, eg.<br>`std::complex<float>`, `std::complex<double>`, `std::complex<long double>`,<br>`boost::math::quaternion`, finite field types (this would yield the "Number<br>theoretic transform" <a href="https://cp-algorithms.com/algebra/fft.html#toc-tgt-6" target="_blank">https://cp-algorithms.com/algebra/fft.html#toc-tgt-6</a>).<br><br>I would like to improve this library during the GSOC 2021, as a proposal for<br>inclusion inside Boost.Math or Boost.Algorithms.<br><br>Is there anyone interested in supervising this project? Any opinions?<br><br>Best regards,<br>Eduardo Quintana<br><br>_______________________________________________<br>Unsubscribe & other changes: <a href="http://lists.boost.org/mailman/listinfo.cgi/boost" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost</a><br></div> > >> </div> > >> </div></body></html> > > <publickey - eduardo.quintana(a)pm.me - 341e5416.asc> > -- -- Janek Kozicki, PhD. DSc. Arch. Assoc. Prof. Gdańsk University of Technology Faculty of Applied Physics and Mathematics Department of Theoretical Physics and Quantum Information -- http://yade-dem.org/ http://pg.edu.pl/jkozicki (click English flag on top right)

1 0

[GIL] 2D Convolution/Correlation Proposal for gsoc 2021
by Gaurav kumar 12 Mar '21

12 Mar '21

Hi, I am Gaurav Kumar; I have been working on the Boost.GIL library for the past month. I would like to work on the 2D convolution/Correlation project. The ideas for the project are as follows: 1. Separable Kernels <http://www.dspguide.com/ch24/3.htm>: Most of the standard kernels (e.g. Gaussian, Sobel) can be separated into 2 or more 1D filters. For a N x N kernel, separating it into two 1D filters, the number of computations required would now be proportional to 2*N instead of N*N for the naive implementation. This implementation would also favor code reusability as this would only require a kernel separating function and driver code for a group of 1D filters. 2. Generic Implementation for 2D convolution: There are more generic kernels that are non-separable (e.g. Laplacian operator). In this case, the naive approach has already been implemented. The main task would be to provide the same set of functions as in the 1D convolution/correlation implementation. One potential idea for optimization of 2D convolution is to use the Im2col <https://www.programmersought.com/article/6306124604/> operation, in which the input image is converted into a row of column vectors, where each column vector represents an image block for which convolution/correlation operation is to be performed. The kernel can also be flattened out in a similar manner, resulting in a 1D array. This results in the convolution operation being reduced to matrix multiplication, which can be handled efficiently by BLAS libraries <https://en.wikipedia.org/wiki/Basic_Linear_Algebra_Subprograms> ( Boost.uBLAS ). Please share any suggestions you would have, related to the ideas presented above, or regarding 2D convolutions in general. I am looking for a mentor to guide me through this project. Best Regards, Gaurav Kumar Github handle: https://github.com/gkumar28

2 1

[release] Boost 1.76.0 Beta 1 Release Candidate 1
by Marshall Clow 12 Mar '21

12 Mar '21

The first release candidates for the 1.76.0 beta release are now available at: <https://dl.bintray.com/boostorg/beta/1.76.0.beta1/source/> The SHA256 checksums are as follows: a222d325cd3c9f66951ec9026eca6ff6f48dd563c9a025911d598d2aca8770ce boost_1_76_0_b1_rc1.tar.bz2 6b90b510a3de38fc30a071ac798da37545fb60a1d6b21aed1130b47c9c598977 boost_1_76_0_b1_rc1.zip b01627bd9ce934b092037da81696bb4482a44e6a31c8791dbed82eafe04b69fa boost_1_76_0_b1_rc1.tar.gz dbef57adbab1d4395d14000f0a2420fc82f87476e10d48359ceff7125a74b77a boost_1_76_0_b1_rc1.7z 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. -- The Release managers

7 10

Endorsement, review manager sought for Boost.Mysql
by Ruben Perez 12 Mar '21

12 Mar '21

Hi all, I would like to propose a MySQL client library for Boost (under the original name of Boost.Mysql). It is a full implementation of the MySQL client protocol, based on Boost.Asio. It requires C++11. The library is at https://github.com/anarthal/mysql and the documentation is at https://anarthal.github.io/mysql/. Examples under https://anarthal.github.io/mysql/mysql/examples.html. The purpose of this library is to provide a low-level building block for applications or other libraries to interact with MySQL, in the same way Boost.Beast provides a way to interact with HTTP. It complies with Boost.Asio universal asynchronous model, and provides the usual sync and async overloads for every network operation. Some notes: - The scope of this library is limited to MySQL. Its value proposition is implementing the client protocol in an Asio-compliant way. Supporting any database other than MySQL is not in scope of this library. - This library does NOT make use of MySQL libmysqlclient C API. It provides a from-the-ground-up implementation of the MySQL client protocol. Features: - Text queries and server-side prepared statements. - Sync and async functions, following Boost.Asio's universal async model. You may use callbacks, Boost coroutines, futures, C++20 coroutines, or any completion handler that Asio adds support for. - Can be used with any Stream including TCP sockets, UNIX sockets and Boost.Beast TCP streams. - Supports MySQL 5.x, MySQL 8.x and MariaDB.

10 17

[Boost][Describe] Has been ACCEPTED into Boost
by Richard Hodges 12 Mar '21

12 Mar '21

Dear all, I am pleased to announce that we have received 13 high quality reviews. There has been no dissent, with every reviewer recommending that Describe be accepted. Reviews that were sent to me privately have been forward to Peter for consideration. If you have submitted a review and I have not responded privately to thank you, then please accept my apology for this oversight. Thank you everyone for taking some of your valuable time to contribute. -- Richard Hodges hodges.r(a)gmail.com office: +442032898513 home: +376841522 mobile: +376380212

3 2

[interprocess][managed_shared_memory] Memory allocation of managed shared memories
by Grimm, Matthias 12 Mar '21

12 Mar '21

Hi, I have a question regarding the interprocess library and the use of shared memories. When creating a boost::interprocess::managed_shared_memory it seems to be necessary to take some additional space into account. In my case the following approach works well: managed_shm = new ip::managed_shared_memory(ip::create_only, "shm_id", (vec_elems + 110) * (number_of_samples + 1)); Following this it seems to be necessary to always have one additional element. If I remove the additional element (vec_elems + 110) * (number_of_samples) an exception is thrown: boost::interprocess::bad_alloc. This is also the case if I change to (vec_elems) * (number_of_samples + 1) Does anybody know why it is necessary to have this additional space allocated? What is the exact minimum size to avoid the exception? The additional memory may become a problem if the size of the vector elements is large. Attached you'll find some example code. Any help on this topic would be appreciated.

1 0

GSoC'21
by Manan Sharma 12 Mar '21

12 Mar '21

Hey, My name is Manan Sharma, I went through the project ideas for the GSoC'21 and the Multiprecision project really caught my eye. So I would like to contribute to this project but do not know where to start. I have basic knowledge of C++ like Template Programming. So I would appreciate it if anyone could tell me how to get started. Looking forward to contributing to the project. Yours sincerely, Manan Sharma Phone No.: +91 9711306818 Email Id.: manan180796(a)gmail.com

2 1

Queries regarding Contributing to boost open source library
by Tirtharaj Sen 12 Mar '21

12 Mar '21

Hello, I'm Tirtharaj Sen I wanted to know that I will start to contribute to boost open source library from today , so will can I make proposals for GSOC 2021 to the organisation or am I a bit late to start to contribute. I would also like to mention that I want to be associated with the organisation even after the GSOC is over. So does it require a 3 months of contribution history? Will be obliged if I get help from yours's side Thank you

2 1