Fred Tingaud
where else to find them
no profile links on file
what they talk about
all 5 in the filters
where they keep going back
- CppCon3 editions2017–2019
all 4 in the filters
on a stage with
never shared a talk
who talks about the same things
- Andrei Alexandrescu27 talks
- Danila Kutenin2 talks
- Tina Ulbrich14 talks
- Daisy Hollman10 talks
- Arne Mertz17 talks
- Vincent Reverdy9 talks
| title | conference | date |
|---|---|---|
| Scripting and Automation: This Manual Task Could Have Been a Script | ACCU 2024 | 2024-04-17 |
Argues that small scripts can save hours but also spawn more automation and maintenance, showing concrete examples: The Decorator IDE plugin that grew into… | ||
| How to Refactor Millions of Line of Code Without Alienating your Colleagues | C++ on Sea 2020 | 2020-07-15 |
Claims that clang-tidy extension API plus custom clang tooling can automatically rewrite APIs across millions of lines of C++ code, turning months of manual… | ||
| How to Refactor Millions of Line of Code Without Alienating Colleagues | CppCon 2019 | 2019-09-15 |
Shows how to use Clang-Tidy extension API to write custom AST matchers and automated fix‑its, with concrete wins and limits: removing a dead parameter across… | ||
| A little order | Meeting C++ 2018 | 2018-11-15 |
Benchmarks on http://quick-bench.com/ using Google Benchmark compare std::sort, std::partial_sort, nth_element and custom approaches; claim: for median-like… | ||
| “A Little Order: Delving into the STL sorting algorithms” | CppCon 2018 | 2018-09-23 |
Benchmarks on Quick‑Bench and local compilers show finding the median of a 1,000,000 element vector with std::nth_element plus std::sort is three times faster… | ||
| quick-bench.com | CppCon 2017 | 2017-09-24 |
A live micro‑benchmarking site quick-bench.com runs Google Benchmark suites in the browser and shows bar charts; it generates one million random numbers with… | ||
| nothing matches | ||