range-v3 VS compile-time-regular-expressions

std::ranges is in c++20, but you can pull in the library it was based on if you use 17 (https://github.com/ericniebler/range-v3)

What you are describing seems to be std::ranges. If you’re interested in understanding how to implement it, I recommend checking out the original reference implementation, rangev3. Trying to implement your own ranges framework is really good practice for learning how to do efficient, advanced generic programming in C++. I highly recommend it as a hobby learning project. But it’s also really, really hard to do correctly, so please just use the stdlib and/or rangev3 in any real project.

In C++23, there will be std::views::cartesian_product. It is already available in the range-v3 library, the one that the standard is based on.

/** * @brief Forwards value equivalent to the std::forward. * * Using cast instead of std::forward to avoid template instantiation. Used by * Eric Niebler in range library. * * @see https://github.com/ericniebler/range-v3 */

It uses a custom zip_iterator (which isn't very good, and you should really use the one from boost or from range-v3).

It contains very little functionality compared to the Eric Niebler’s reference implementation for my liking. Especially views. This will undoubtedly change in the future. But the point is moot, because they are not really supported the is no other option for now other than https://github.com/ericniebler/range-v3.

range-v3 is a great library allowing you to bridge the gap: https://github.com/ericniebler/range-v3

[range-v3](https://github.com/ericniebler/range-v3) which std::ranges was based on has the `to>()` which as far as I know is expected to get into c++23 :)

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