~Foo() { std::cout << "~Foo()" << std::endl; } }; int main() { Foo a; { Foo b; } } 1 2 3 4 5 6 7 8 9 10 11 21 Constructors & Destructorshttps://godbolt.org/z/ffzG8hPT8 struct Foo { Foo() { std::cout ~Foo() { std::cout << "~Foo()" << std::endl; } }; int main() { Foo a; { Foo b; } } 1 2 3 4 5 6 7 8 9 10 11 22 Constructors & Destructorshttps://godbolt.org/z/ffzG8hPT8 struct Foo { Foo() { std::cout std::cout << "~Foo()" << std::endl; } }; int main() { Foo a; // Foo() { Foo b; } } 1 2 3 4 5 6 7 8 9 10 11 23 Constructors & Destructorshttps://godbolt.org/z/ffzG8hPT8 struct Foo { Foo() { std::cout

U T I N G 6 CppCon 2020 - Adventures in SIMD Thinking Function load_from() KEWB_FORCE_INLINE rf_512 load_from(float const* psrc) { return _mm512_loadu_ps(psrc); } m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 m10 m11 m12 m13 m14 m15 m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 m11 m12 m13 m14 m15 psrcCopyright © 2020 Bob Steagall K E W B C O M P U T I N G 7 CppCon 2020 - Adventures in SIMD Thinking Function masked_load_from() _mm512_mask_loadu_ps(_mm512_set1_ps(fill), (__mmask16) mask, psrc); } m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 m11 m12 m13 m14 m15 f f m2 m3 f f m6 m7 f f f f m12 m13 m14 m15 f 0 0 1 1 0 0 1 1 0 0 0 0 1 1 1 1 fill mask

perception systems 4About Me Other interests: Game engines Meta-programming 5Robot path planning 6Robot path planning Path planning 7Path planning How an (autonomous) agent figures out how to get return prev[] # return predecessors to recover path 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 66Dijkstra's algorithm (early stopping) function Dijkstras(Graph return prev[] # return predecessors to recover path 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 function Dijkstras(Graph, source, target): 1 2 for

cap-sense channels 1 ADC 2 DAC 4Interruptstime EXTI2 5Interrupts main priority 4 priority 0 time 6Producer ID 1 1. Think of a colour 2. Spell the colour name to Ben backwards one character at a time | async::continue_on(s2) | async::then([] (int i) { return std::to_string(i); }) ; 1 2 3 4 5 6 7 8 auto r = comp | async::sync_wait(); 9 auto [str] = r.value_or(std::make_tuple(""_s)); 10 23Composition | async::continue_on(s2) | async::then([] (int i) { return std::to_string(i); }) ; 1 2 3 4 5 6 7 8 auto r = comp | async::sync_wait(); 9 auto [str] = r.value_or(std::make_tuple(""_s)); 10 auto

transform(c, 3 [](widget const& w) { return w.bounding_box(); } 4 )); 5 // Magic happens 6 tc::for_each(tc::zip(c, rects), 7 [&](widget& w, rect r) { 8 widget.place(r); 9 } 10 11 transform(c, 3 [](widget const& w) { return w.bounding_box(); } 4 )); 5 // Magic happens 6 tc::for_each(tc::zip(c, rects), 7 [&](widget& w, rect r) { 8 widget.place(r); 9 } 10 11 com/think-cell/think-cell-library 1 2 void vertical_center(WidgetContainer const& c) { 3 4 5 // Magic happens 6 tc::for_each(tc::zip(c, rects), 7 [&](widget& w, rect r) { 8 widget.place(r); 9 } 10

ABOUT ALL OF THE CODE 3 . 5SOMETIMES JIT IS MORE PRODUCTIVE SOMETIMES JIT IS MORE PRODUCTIVE 3 . 6SOMETIMES JIT IS MORE PRODUCTIVE SOMETIMES JIT IS MORE PRODUCTIVE I CAN TRADE AOT-COMPILATION TIME (DEVELOPER AOT-COMPILATION TIME (DEVELOPER TIME) AGAINST JIT- COMPILATION TIME (USER TIME) COMPILATION TIME (USER TIME) 3 . 6SOMETIMES JIT IS MORE PRODUCTIVE SOMETIMES JIT IS MORE PRODUCTIVE I CAN TRADE AOT-COMPILATION TIME (DEVELOPER COMPILE JUST WHAT IS NEEDED RATHER THAN ACCOUNTING FOR ALL POSSIBLE USE CASES ALL POSSIBLE USE CASES 3 . 6JIT ALLOWS DIFFERENT USE CASES JIT ALLOWS DIFFERENT USE CASES 3 . 7JIT ALLOWS DIFFERENT USE CASES JIT

PSL value is less than the element’s, swap. 6. Probe to the next bucket and increment the PSL value of the swapped element. 7. Repeat steps 5 and 6 until an empty bucket( bucket with default PSL PSL value is less than the element’s, swap. 6. Probe to the next bucket and increment the PSL value of the swapped element. 7. Repeat steps 5 and 6 until an empty bucket( bucket with default PSL PSL value is less than the element’s, swap. 6. Probe to the next bucket and increment the PSL value of the swapped element. 7. Repeat steps 5 and 6 until an empty bucket( bucket with default PSL

30 40 50 60 70 10 20 pos begin() end() c v i d e e ++ C++98/C++11 arr: ©2023 by josuttis.com 6 C++ Iterators: Generalization of Pointers that Iterate • Iterate like a pointer over elements – From << lst[3]; // expensive C++20 size: 10 capa: 6 data: 2 3 47 1 42 11 6 0 8 15 lst: begin() end() begin() += 3 begin() ++ ++ ++ size: beg: 6 0 8 15 47 11 42 begin() end() vec: for (int << *pos << '\n'; } C++11 ++ pos begin() end() 1 3 2 4 6 5 ++ end() begin() pos begin() end() ++ pos 1 2 4 5 7 8 9 6 3 end() begin() pos ©2023 by josuttis.com 12 C++ Iterating

utilities general math support constexpr all the things concurrency simd linear algebra and mdspan 6Language and Library 7Debugging 8pass a string to static_assert build-time diagnostics P2741 User-generated template A factory(const T&&) = delete("Using rvalue may result in dangling reference"); 1 2 3 4 5 6 7 8 9 https://quuxplusone.github.io/blog/2021/10/17/equals-delete-means/ 10relevant blog post P2573 2 3 4 5 6 7 8 9 void newapi(); void oldapi() = delete("oldapi() is outdated and been removed - newapi()."); 1 2 3 template 4 struct A {/* ... */}; 5 template 6 A factory(const