programmer for over 60 years, programming in C++ since 1982. • Experienced in industry, academia, consul,ng, and research: � Founded a Computer Science Dept.; served as Professor and Dept. Head; taught and � Re?red from the Scien?fic Compu?ng Division at Fermilab, with specialty in C++ programming and in-house consul?ng. • Not dead! ☺ — s,ll doing training & consul,ng. (Email me!) 2 Copyright © 2022-2024 Irksome? • abrasive • aggrava*ng • angering • annoying • bi*ng • bothersome • bra1sh • bra2y • burdensome • carking • chafing • discomfor*ng • displeasing • disquie*ng • distrac*ve • distressing

n0 | nl | cl Vdd Vdd |GND | AC L1 Vonut ng0 n0_ | Vdd | R2 2 nl n2 | Vdd 5 已 = {(G3),(2,0)， (1 2),(5,2)， (0,5), (5, 4)， (0,1),(5,3)} 六 瑟 GND ng0 nl C1 Vdd Vdd |GND| AC no n0 | Vdd | R2 nl from vertex pairs (aka “edge”) Stored Property Graph T 瑟 1|31cl GND ng0 nl C1 Vdd vdd |GND| AC 2|0|Ac no

� New language features (e.g., C++20’s modules) introduce new rules and update details of exis`ng rules. � Proposal N1787, a major overhaul of the C++20 rules, is under review for C++23. • So this C++ names don’t exist in vacuo • Each name is declared in a context, a region of code: � In compu`ng, such a context is termed a name space. � In C++, such a context is termed a declara`ve region. � behave that way: � Why? Any name being granted friendship isn’t a member of the class that’s gran`ng the friendship. � (If it were a member, friendship would be unnecessary!) � So the name is instead

org/z/8M483Kvba https://godbolt.org/z/czhrT1hhh π https://godbolt.org/z/5aseWr7fz https://godbolt.org/z/nG88rvv5f https://godbolt.org/z/qh4zdzqG6string s3 = (stringstream{} << pi).str(); // org/z/8M483Kvba https://godbolt.org/z/czhrT1hhh π https://godbolt.org/z/5aseWr7fz https://godbolt.org/z/nG88rvv5f https://godbolt.org/z/qh4zdzqG61 2 3 Integer to string #hundreds 1 / 10 / 10

Paul Bettner: https://www.gamedeveloper.com/programming/1500-archers-on-a-28-8-network-programmi ng-in-age-of-empires-and-beyond ● Games Programming Patterns, Robert Nystrom, https://gameprogrammingpatterns

git clone https://github.com/llvm/llvm-project.git https://llvm.org/docs/GettingStarted.html#getti ng-the-source-code-and-building-llvmThe Big 3 – Compiler Toolchains Clang/LLVM Ubuntu sudo apt-get install

ti onal becomes known several cycl es l ater ● If the predi cti on was correct, nothi ng el se needs to happen ● If the predi cti on was wrong… BRANCH PREDICTION: ANTIDOTE TO BRANCHESBranchless

gle gle gle gle gle gle gle gle gle gle gle gle gle gle gle gle gle gle gle Ogle is totally disrup?ng image search.gle gle loading… Ogle is too slow!found 8,000,000 similar images This is also Luke

compile? add("print", +[](std::string input) { puts(input.c_str()); }); } https://godbolt.org/z/WbM5nG9er 19 . 2Copyright Jason Turner @le�icus emptycrate.com/idocpp Registering All The Functions 1

destructor is never reached?What if task destructor is never reached? void reportLiveness(); Task serve(tcp::socket s); Task mainTask() { Task liveness = []() -> Task { for (;;) { co_await serve(std::move(s)); } // implicit liveness.~Task() call } If this throws the exception gets reraised hereWhat if task destructor is never reached? void reportLiveness(); Task serve(tcp::socket sleepFor(1_s); } }(); for (;;) { tcp::socket = co_await accept(); co_await serve(std::move(s)); } std::unreachable(); // implicit liveness.~Task() call } If this throws