14K views · Oct 24, 2018 · 54:48 · 1 HN recommender · 3 mentions · discussed 2020–2025
Hana Dusikova's CppCon 2018 talk presenting a C++ library that builds regular expressions from compile-time strings, using a C++20 feature. It avoids runtime parsing cost and covers implementation details, problems she hit, and benchmarks.
Why Hacker News points people here: Pointed to as the canonical presentation of compile-time regex in C++ and its template metaprogramming, including benchmark results.
“A 54:47 presentation at CppCon 2018 is worth more than a thousand words”HN comment, 2025
“A 54:47 presentation at CppCon 2018 is worth more than a thousand words”
Presentation on compile-time regex class in C++ templates
FYI: This is a C++ template version of compile time regex class. A 54:47 presentation at CppCon 2018 is worth more than a thousand words... see this video followup CppCon 2019 video at link As the above github repo mentions, more info at link
“Here's an example of parsing regular expressions in C++ at compile time.”
Example of parsing regular expressions at compile time in C++
> Passing strings into a templates ... wouldn't work in C++ ... this video Here's an example of parsing regular expressions in C++ at compile time. Code here: link
“at 39 minutes she shares the benchmarks.”
Contains benchmarks of the compile-time regex library
One of the stated benefits is that the compiler optimizer can optimize the regex state machine that gets created, resulting in significantly faster match times at runtime. There are some benchmarks if you look up her cppcon talk about the library iirc. Edit: here is her talk, at 39 minutes she shares the benchmarks. this video
