scnlib VS compile-time-regular-expressions

scnlib (https://github.com/eliaskosunen/scnlib) scanf

include(FetchContent) FetchContent_Declare( Catch2 GIT_REPOSITORY https://github.com/catchorg/Catch2.git GIT_TAG v3.0.0-preview4 ) FetchContent_Declare( fmt GIT_REPOSITORY https://github.com/fmtlib/fmt.git GIT_TAG 9.1.0 ) FetchContent_Declare( scnlib GIT_REPOSITORY https://github.com/eliaskosunen/scnlib.git GIT_TAG v1.1.2 ) FetchContent_MakeAvailable(Catch2 fmt scnlib)

Yeah, but parsing format strings in runtime induces an overhead, and doing it in compile time is not trivial, and I’m not sure ClearIO is worth the trouble, since it turns out scnlib exists.

The code is rather nice (in my biased opinion) and makes heavy use of a couple of libraries like scnlib and [Eigen](eigen.tuxfamily.org/). Some things could probably be more optimized but I mainly focused on conciseness. I hope this is useful and I can explain my thought process further if you have any questions.

I've found https://github.com/eliaskosunen/scnlib but haven't tested it. Maybe that suits your needs for 2.

I had a user enum like enum class Color {Red, Green, Blue}; that I wanted to add serialization support for. Following the docs (https://scnlib.readthedocs.io/), after some tweaks I arrived at the following:

Thanks for the comment, I made an issue tracking this: https://github.com/eliaskosunen/scnlib/issues/51

I am using some modern libraries: scnlib fmtlib Eigen and usually abuse lambdas :)

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