meson-vcpkg VS compile-time-regular-expressions

Technically there is a better way (https://github.com/Neumann-A/meson-vcpkg) but since I prefer the "global" mode of vcpkg for my personal projects I prefer this hack. I never need different versions of the same library for different projects (everything just gets the latest) so manifest mode would just waste disk space and install time. Same reason why I have not yet bothered to check out Conan since that is always in manifest mode. It does have Meson integration though and people are using those together so that's an option too, I just have no personal experience with that.

CTRE (https://github.com/hanickadot/compile-time-regular-expressions) ranges::views (filter, transform, etc.) (C++20) str.find() + str.substr() freopen to stdin + cin >> extraction Parser libraries

There are suggestions that should be replaced by the high performance ctre implementation: https://github.com/hanickadot/compile-time-regular-expressions

operator"" can be used in a similar way to expression templates (DSLs), where the type of the resulting expression is dependent on the string contents. For example ctre makes use of this to build efficient regular expression parsers, and kumi uses this in conjunction with operator[] to make tuple indexing quite elegant

Check out https://github.com/hanickadot/compile-time-regular-expressions anything is possible 😂

Yes to regex, no to std::regex. Better to use CTRE. Something like "^Hello [0-9]+ how are you" should allow checking if there's a match

You could compare your implementation with https://github.com/hanickadot/compile-time-regular-expressions and see if there are any ideas you can copy.

std::compile_time_regex would be a nice addition. Something similar to ctre https://github.com/hanickadot/compile-time-regular-expressions Simply letting the compiler generate all the regex parsing machinery at compile time.... And benefitting from compiler optimizations, vectorization, etc...

ctre