CppCon 2018: Hana Dusíková “Compile Time Regular Expressions”

CppCon1 HN recommenders · 2020–2025
14K views · talk · evergreen · Uploaded 2018-10-24

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.

Pointed to as the canonical presentation of compile-time regex in C++ and its template metaprogramming, including benchmark results.

Watch on YouTube

3 comments from Hacker News

@nikki932020 · in “C++20 has been approved”

> Passing strings into a templates ... wouldn't work in C++ ... [VIDEO] Here's an example of parsing regular expressions in C++ at compile time. Code here: [LINK]

@lcvw2023 · in “Compile time regular expression in C++”

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. [VIDEO]

@canucker20162025 · in “The Impossible Optimization, and the Metaprogramming to Achieve It”

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 [VIDEO] followup CppCon 2019 video at [LINK] As the above github repo mentions, more info at [LINK]

RecommendsView on HN