mysql VS frozen

Documentation: https://anarthal.github.io/mysql/index.html

For example Boost-Beast and Boost-Mysql(not officially boost) receive user provided asio::io_context and every other library in this ecosystem should be the same.

Boost.MySQL has just started review process for acceptance of boost. It's based on asio. https://github.com/anarthal/mysql

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.

I found this extension that implements "frozen" versions of some C++ containers, but I was wondering if there is a good solution available in the standard library.

A library exists that can produce constexpr hash table based containers.

I use the Frozen library for that. Since the conversions should be known at compile time you can make constexpr hash tables for lookups.

The constexpr dependency of note here is frozen.

In C++, a drop-in replacement for your DSA can provide significant improvements over the standard library. Particularly the standard unordered_map class can be improved by 50% to 100% (e.g. https://github.com/greg7mdp/parallel-hashmap, or for static maps https://github.com/serge-sans-paille/frozen). Of course, recognize that creating a DS/A from scratch is an entire project, and you shouldn't roll your own for an independent codebase.

Technologies (for curious folks): C++17, SFML, Entt, Frozen, Protobuf, spdlog, GoogleTest, GoogleBenchmark, CMake and Dear ImGui for debug purpose.

In the language, I added anonymous array literals. I did some cleanup in the compiler and updated to LLVM 12 from 10 (which was pretty trivial, surprisingly). I also added frozen, a C++ perfect-hashing library, as a dependency to speed up the lookup of keywords in my lexer. The library exploits C++’s constexpr features to generate a perfect hash at compile-time without any separate build step, which is great, and it also provides a drop-in replacement for std::unordered_map that uses the hash.

This is where I plug Frozen :-] https://github.com/serge-sans-paille/frozen

I’ve no idea how hard it is to implement, but return type polymorphism would be nice. Especially returning different things based on the constexpress of the result. And then add Frozen eqivalents of associative containers to the STL, so that, for example constexpr auto set = std::make_set(...) would be frozen::set, and auto set = std::make_set(...) would be std::set.

In which case, I believe the answer your question would be yes: the frozen map.