- Boost - lists.preview.boost.org

[release] Boost 1.80.0
by Glen Fernandes 11 Aug '22

11 Aug '22

Release 1.80.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains numerous enhancements and bug fixes for existing libraries. For details, including download links, see <http://www.boost.org/users/news/version_1.80.0> You can also download directly from: <https://boostorg.jfrog.io/artifactory/main/release/1.80.0/> To install this release on your system, see <http://www.boost.org/doc/libs/release/more/getting_started/index.html> Thanks to everyone who participated in this release. -- The Boost Release Team Marshall Clow, Glen Fernandes, Michael Caisse

1 0

[release] Boost 1.80.0 Release Candidate 1 is available
by Marshall Clow 09 Aug '22

09 Aug '22

The first release candidates for the 1.80.0 release are now available at: <https://boostorg.jfrog.io/artifactory/main/release/1.80.0/source/> The SHA256 checksums are as follows: 4b2136f98bdd1f5857f1c3dea9ac2018effe65286cf251534b6ae20cc45e1847 boost_1_80_0_rc1.tar.gz 1e19565d82e43bc59209a168f5ac899d3ba471d55c7610c677d4ccf2c9c500c0 boost_1_80_0_rc1.tar.bz2 d12a2af721e22dbfb984ef061ee4c4ab2387f1904f6d65bc5acebaa34d6366ec boost_1_80_0_rc1.7z e34756f63abe8ac34b35352743f17d061fcc825969a2dd8458264edb38781782 boost_1_80_0_rc1.zip 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

3 9

[review][JSON] Review of JSON starts today: Sept 14 - Sept 23
by Pranam Lashkari 09 Aug '22

09 Aug '22

Boost formal review of Vinnie Falco and Krystian Stasiowski's library JSON starts today and will run for 10 days ending on 23 Sept 2020. Both of these authors have already developed a couple of libraries which are accepted in Boost(boost beast and Static String) This library focuses on a common and popular use-case for JSON. It provides a container to hold parsed and serialised JSON types. It provides more flexibility and better benchmark performance than its competitors. JSON highlights the following features in the documentation: - Fast compilation - Require only C++11 - Fast streaming parser and serializer - Easy and safe API with allocator support - Constant-time key lookup for objects - Options to allow non-standard JSON - Compile without Boost, define BOOST_JSON_STANDALONE - Optional header-only, without linking to a library (a point I would like to add in highlight: it has cool Jason logo 😝) To quickly understand and get the flavour of the library take a look at "Quick Look" <http://master.json.cpp.al/json/usage/quick_look.html> You can find the source code to be reviewed here: <https://github.com/CPPAlliance/json/tree/master> You can find the latest documentation here: <http://master.json.cpp.al/> Benchmarks are also given in the document which can be found here: <http://master.json.cpp.al/json/benchmarks.html> Some people have also given the early reviews, the thread can be found here: <https://lists.boost.org/Archives/boost/2020/09/249745.php> Please provide in your review information you think is valuable to understand your choice to ACCEPT or REJECT including JSON as a Boost library. Please be explicit about your decision (ACCEPT or REJECT). Some other questions you might want to consider answering: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With which compiler(s)? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? More information about the Boost Formal Review Process can be found here: <http://www.boost.org/community/reviews.html> Thank you for your effort in the Boost community. -- Thank you, Pranam Lashkari, https://lpranam.github.io/

21 73

Potentially include xproc library in boost?
by Samuel Venable 08 Aug '22

08 Aug '22

Hi, I've tried sending an email about this already and no one responded from what I can tell. I guess because I was saying way too much. I was wondering if this code of mine could potentially be added to boost. xproc/process.cpp at main · time-killer-games/xproc (github.com)<https://github.com/time-killer-games/xproc/blob/main/apiprocess/process.cpp> It lets you get process information from foreign processes on a lot of platforms. Thanks. Samuel [https://opengraph.githubassets.com/b27d922324c973dacc517314510a40f1739ffa17…]<https://github.com/time-killer-games/xproc/blob/main/apiprocess/process.cpp> xproc/process.cpp at main · time-killer-games/xproc<https://github.com/time-killer-games/xproc/blob/main/apiprocess/process.cpp> Contribute to time-killer-games/xproc development by creating an account on GitHub. github.com

3 3

Upcoming Boost.URL review
by Klemens Morgenstern 06 Aug '22

06 Aug '22

This is a reminder that the boost.url review will start in a week on the 13th. The source code can be found here https://github.com/CPPAlliance/url and the documentation here https://master.url.cpp.al/ . I am looking forward to plenty of reviews.

4 3

Boost 1.80.0 closed for all changes
by Glen Fernandes 04 Aug '22

04 Aug '22

The master branch is closed for all changes. Release expected on 2022-08-10. - Release Managers

1 0

Boost 1.80.0 master open for bug fixes
by Glen Fernandes 03 Aug '22

03 Aug '22

Now open for bug fixes and documentation changes. Other changes by release manager permission. The next deadline: On August 3rd, master closes for all changes. Glen

6 10

Binary Serialization
by Benedict Bede McNamara 02 Aug '22

02 Aug '22

It appears that the main fact determining collection build speed is the heap you use. I++ now uses its own binary heap to perform allocations for the collection forward_list (which is what oarchive uses). So binary serialization goes even faster now. Here are some figures for collections with a million elements: stl list build time is: 0:0:0:0:27 stl list sort time is: 0:0:0:0:21 stl forward_list build time is: 0:0:0:0:20 stl forward_list sort time is: 0:0:0:0:20 stl set build time is: 0:0:0:0:111 I++ set build time is: 0:0:0:0:61 stl unordered_set build time is: 0:0:0:0:149 stl map build time is: 0:0:0:0:118 I++ dictionary build time is: 0:0:0:0:60 Linked list build time is: 0:0:0:0:23 Linked list sort time is: 0:0:0:0:23 Forward list build time is: 0:0:0:0:16 Forward list sort time is: 0:0:0:0:17 I++ serialization/deserialization time is: 0:0:0:0:150 list build time is: 0:0:0:0:74 stl vector build time is: 0:0:0:0:5 Vector sort time is: 0:0:0:0:12 Quick Sort time is: 0:0:0:0:10 heap allocations: 12000007 heap allocations: 0 >From this we see that in general binary serialization/deserialization takes a bit longer than collection allocation. For example the serialization/deserialization time is 150 milliseconds for a million elements whereas forward_list only takes 16 milliseconds to build. I would be interested to see what the equivalent figures are for Boosts text based serialization. Yours Sincerely, Benedict Bede McNamara P.S. The program that produced these figures is attached. Sent from Mail for Windows

1 0

Why was the boostorg/sort master branch deleted
by Glen Fernandes 02 Aug '22

02 Aug '22

Why was the boostorg/sort master branch deleted? The repository has only a develop branch now. I'm going to recreate the master branch and reset its head to before the recent commits, but - I'd like to know why the branch was removed. Glen

3 2

Re: [boost] Boost Digest, Vol 6764, Issue 1
by Benedict Bede McNamara 29 Jul '22

29 Jul '22

I++ Binary Serialization I++ binary serialization just got twice as fast by using linked lists rather than binary trees as before. Sent from Mail for Windows From: boost-request(a)lists.boost.org Sent: Friday, 29 July 2022 10:00 PM To: boost(a)lists.boost.org Subject: Boost Digest, Vol 6764, Issue 1 Send Boost mailing list submissions to boost(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit https://lists.boost.org/mailman/listinfo.cgi/boost or, via email, send a message with subject or body 'help' to boost-request(a)lists.boost.org You can reach the person managing the list at boost-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost digest..." The boost archives may be found at: http://lists.boost.org/Archives/boost/ Today's Topics: 1. Re: Questions about incorporating my library into a new library within Boost (Phil Endecott) 2. Re: Questions about incorporating my library into a new library within Boost (Jooseong Lee) ---------------------------------------------------------------------- Message: 1 Date: Thu, 28 Jul 2022 13:57:50 +0100 From: "Phil Endecott" <spam_from_boost_dev(a)chezphil.org> To: <boost(a)lists.boost.org> Subject: Re: [boost] Questions about incorporating my library into a new library within Boost Message-ID: <1659013070554(a)dmwebmail.dmwebmail.chezphil.org> Content-Type: text/plain; format="flowed"; charset="UTF-8" Jooseong Lee wrote: >> What is not stored contiguously is child, this is stored in >> std::vector<std::unique_ptr>. >> But when N keys are erased, the number of children erased is not O(N), >> because a node can have #(fanout) keys. > > I have to correct this sentence, the number of children erased is O(N). > But the coefficient is small, because practically B-Trees use large fanouts. > > Most technically, a call for erase_range(a, b) would be O(log N) + O(K) > where N is the number of whole keys and K is the number of keys being > erased. > I've updated the repo description, thanks for the catch. Good, I'm glad I don't have to give the CS101 complexity lecture :-) One other comment - how do you deal with strings? To get the locality benefits of the B-Tree you can't store variable-size data totally out-of-band. Regarding the general "how do I get this in Boost?" question, I encourage you to look back through the mailing list archive at the last few "Is Boost interested in my XYZ libary?" threads. Some people post useful replies about what to do next which. Cynically, what happens most often is that there are one or two emails and then the library author and any replies disappear. Some persistence is required to make anything happen. One hint: put something more descriptive (i.e. "B-Tree") in your subject line! Regards, Phil. ------------------------------ Message: 2 Date: Thu, 28 Jul 2022 22:18:33 +0900 From: Jooseong Lee <frozenca91(a)gmail.com> To: boost(a)lists.boost.org Subject: Re: [boost] Questions about incorporating my library into a new library within Boost Message-ID: <CAPPJyCuKa8mRMzhKhwaVWXbyuECQDVjXCs_m8kcM_EtDz8dZvg(a)mail.gmail.com> Content-Type: text/plain; charset="UTF-8" > One other comment - how do you deal with strings? To get the locality > benefits of the B-Tree you can't store variable-size data totally out-of-band. For std::string and its friends (i.e. not trivially copyable types) it is stored as something like std::vector<std::string>, so it is not *that* good (but still better than std::set<std::string>). Google Abseil's B-Tree implementation use similar approach. When I personally use my B-Tree for strings, I use raw char arrays like std::array<char, 16> > Regarding the general "how do I get this in Boost?" question, I > encourage you to look back through the mailing list archive at the > last few "Is Boost interested in my XYZ libary?" threads. Thanks, I'll have a look. Best, Jooseong On Thu, Jul 28, 2022, 9:58 PM Phil Endecott via Boost <boost(a)lists.boost.org> wrote: > Jooseong Lee wrote: > >> What is not stored contiguously is child, this is stored in > >> std::vector<std::unique_ptr>. > >> But when N keys are erased, the number of children erased is not O(N), > >> because a node can have #(fanout) keys. > > > > I have to correct this sentence, the number of children erased is O(N). > > But the coefficient is small, because practically B-Trees use large > fanouts. > > > > Most technically, a call for erase_range(a, b) would be O(log N) + O(K) > > where N is the number of whole keys and K is the number of keys being > > erased. > > I've updated the repo description, thanks for the catch. > > Good, I'm glad I don't have to give the CS101 complexity lecture :-) > > One other comment - how do you deal with strings? To get the locality > benefits of the B-Tree you can't store variable-size data totally > out-of-band. > > Regarding the general "how do I get this in Boost?" question, I > encourage you to look back through the mailing list archive at the > last few "Is Boost interested in my XYZ libary?" threads. Some people > post useful replies about what to do next which. Cynically, what > happens most often is that there are one or two emails and then > the library author and any replies disappear. Some persistence is > required to make anything happen. One hint: put something more > descriptive (i.e. "B-Tree") in your subject line! > > > Regards, Phil. > > > > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > ------------------------------ Subject: Digest Footer _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost ------------------------------ End of Boost Digest, Vol 6764, Issue 1 **************************************

1 0