Better Enums VS compile-time-regular-expressions

I really like better_enums instead of magic_enums. There’s no limit on enum size with it: http://aantron.github.io/better-enums/

It was heavily used at a former employer of mine, so definitely a solid production-ready solution.

IIRC I then switched to another library doing the same stuff: https://github.com/aantron/better-enums It is not as magical, as it uses a special macro to define the enum, using dedicated syntax. So it only works for enums you yourself define. However, it did work a lot better for me with enums with huge values.

I can't keep up! First we have better enum, then some guy at a conference says we have to use wise enum instead, and now you speak of magic enum!

If you need a laugh today, look at Better Enums library for C++. If you thought moving from C to C++ would let you leave macros behind, think again! Enums in C++ still suck (a bit less than in C though), so someone built a library to help with that. And it's built on macros. So you can only have 64 entries per enum. And the library's code is barely readable.

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