Tristan Brindle
where else to find them
what they talk about
all 4 in the filters
where they keep going back
- CppCon4 editions2019–2023
- C++ on Sea3 editions2023–2025
- CppNorth3 editions2022–2024
all 4 in the filters
on a stage with
never shared a talk
who talks about the same things
- Arno Schoedl7 talks
- Arno Schödl6 talks
- Jeff Garland7 talks
- Ivan Čukić13 talks
- Šimon Tóth3 talks
- Christopher Di Bella10 talks
| title | conference | date |
|---|---|---|
| Faster, Safer, Better Ranges | C++ on Sea 2025 | 2025-06-23 |
C++ ranges often lose performance and can be unsafe; this describes a concrete alternative: Flux v2 implements an internal-iteration-first model with resumable… | ||
| Practical Tips for Safer C++ | CppNorth 2024 | 2024-07-21 |
C++ currently allows undefined behavior (UB) that breaks reasoning and optimizations; signed integer overflow is UB while unsigned wraps, and compilers provide… | ||
| Practical Tips for Safer C++ | C++ on Sea 2024 | 2024-07-02 |
Shows concrete defenses: use -ftrapv / -fwrapv or -fsanitize=signed-integer-overflow,unsigned-integer-overflow to catch/define integer UB (trap in debug, wrap… | ||
| C++ Iteration Revisited 2024 | C++ on Sea 2024 | 2024-07-02 |
Argues that STL iterators cause UB (dangling, invalidation, out‑of‑bounds) and replaces pointer semantics with an index/cursor model implemented in Flux, a… | ||
| Iteration Revisited: A Safer Iteration Model for Cpp | CppCon 2023 | 2023-10-02 |
Claims a safer C++20 iteration model implemented as the Flux library on GitHub that replaces pointer-like iterators with index-like cursors and four… | ||
| Iteration Revisited: A Safer Iteration Model for C++ | CppNorth 2023 | 2023-07-17 |
Argues that pointer-style STL iterators are a UB minefield and presents Flux, a C++20 library that replaces iterators with cursor-based indices… | ||
| A Safer Iteration Model for C++ | C++ on Sea 2023 | 2023-06-28 |
Flux presents a C++20 library called Flux that replaces pointer-style iterators with index-like first/is_last/read_at/inc primitives, returning safe values… | ||
| C++20 Ranges in Practice | CppNorth 2022 | 2022-07-18 |
C++20 Ranges are shown in practical code: replacing iterator pairs with whole-range calls, automatic lifetime protection via ranges::dangling for rvalue… | ||
| Conquering C++20 Ranges | CppCon 2021 | 2021-10-24 |
C++20 Ranges get concrete: author builds a reusable fibonacci view (infinite subrange from an iterator), implements a custom drop_last_while view that caches… | ||
| An Overview of Standard Ranges | ACCU 2021 Online | 2021-03-10 |
C++20 adds concept-checked, range-based algorithms, projections (pass a member pointer like Employee::id instead of custom comparators), and lazy views… | ||
| C++20 Ranges in Practice | CppCon 2020 | 2020-09-14 |
C++20 Ranges get applied to three concrete problems: finding min (with GCC 10 support), summing squares (replacing eager transform+accumulate with a… | ||
| An Overview of Standard Ranges | CppCon 2019 | 2019-09-15 |
C++20 adds concept-constrained algorithms, range-based overloads that accept whole containers, and lazy composable adapters called views|filter|transform that… | ||
| nothing matches | ||