Joaquín M López Muñoz

During Q3 2026, Joaquín worked on unordered polymorphic collections for Boost.PolyCollection, shipping in Boost 1.93, plus maintenance fixes across Boost.Container and MultiIndex, and Papergate, an AI tool that checks WG21 proposals.

boost::container::hub was accepted into Boost.Container after its April review. Joaquín also added C++20 ranges support to Boost.Unordered, fancy pointer support to Boost.MultiIndex, and fixed Boost.ICL for libc++ v22.

I gave my talk “The Mathematical Mind of a C++ Programmer” at the using std::cpp 2026 conference taking place in Madrid during March 16-19. I had a lot of fun preparing the presentation and delivering the actual talk, and some interesting discussions were had around it.

Written an article explaining the usage and implementation of the recently introduced bulk operations.

Fixed an internal compile error that manifested with newer compilers implementing P0522R0 ( PR#23 ). Reviewed PR#22 .

Added boost::hash_is_avalanching trait ( PR#40 ). This trait was originally in Boost.Unordered, but it makes sense that it be moved here because Boost.Bloom also uses it.

The library is ready for official review, which I plan to ask for in April. Chris Mazakas is helping with a very useful vcpkg registry so that future reviewers can download and install candidate Boost.Bloom and dependencies with minimal hassle via vcpkg.

Updated CI support ( PR#293 , PR#296 , PR#297 , PR#298 ). Prepared a private document for Peter Dimov and Braden Ganetsky discussing massively parallel scenarios where ParlayHash has better performance than boost::concurrent_flat_map .

Made visitation exclusive-locked within certain boost::concurrent_flat_set operations to allow for safe mutable modification of elements ( PR#265 , to be released in Boost 1.87.0). This is relevant for the work on Boost.Flyweight discussed below.

Equipped open-addressing and concurrent containers to internally calculate and provide statistical metrics affected by the quality of the hash function. ( PR#247 , to be released in Boost 1.86.0).

won’t create a temporary (0, "zero") value if the element with key 0 already exists. This is particularly relevant when dynamic memory allocation is involved (for instance, if mapped_type is std::string in the example above).

This functionality is not provided for mere syntactic convenience: Boost.Unordered speeds up the entire process by pipelining the different internal stages of each individual visitation, which results in performance improvements of 40% and more.