Calling Functions A Tutorial Klaus Iglberger, CppCon 2020 klaus.iglberger@gmx.de2 Klaus Iglberger C++ Trainer since 2016 Author of the C++ math library (Co-)Organizer of the Munich Two-Phase Lookup Template Argument Deduction SFINAE Overload Resolution (Viable) Candidate Functions Ranking Ambiguous Function Calls Access Labels Function Template Specializations Virtual Two-Phase Lookup Template Argument Deduction SFINAE Overload Resolution (Viable) Candidate Functions Ranking Ambiguous Function Calls Access Labels Function Template Specializations Virtual

for many years -- please provide suggestions, analogies, and other useful ways to think about functions now or in the future!Please do not redistribute slides without prior permission. 4Your Tour Guide for the talk ● Located here: https://github.com/MikeShah/Talks/tree/main/2023/cppcon/functions 6Abstract Functions are one of the first things programmers learn, granting you the ultimate power to 'reuse' overview of functions from the start to the end, on the various powers that are given to us from the ground up. Consider this talk your one stop for learning all of the great things about functions! We'll

From Functions to Coroutines 40 Years Evolution Rainer Grimm Training, Coaching, and Technology Consulting www.ModernesCpp.netEvolution of Callable template T invoke(Func sequence of functions can be changed ▪ Automatically parallelizable ▪ Results can be cachedPure Functions Working with a pure function is based on discipline Use common functions, meta-functions, constexpr constexpr, or consteval functions ▪ Function int powFunc(int m, int n){ if (n == 0) return 1; return m * powFunc(m, n - 1); } ▪ Meta-Function template struct PowMeta { static int const value

Tooling @ Microsoft 🐘 @ciura_victor@hachyderm.io 🦋 @ciuravictor.bsky.social 🦀 So You Think You Can Hash CppCon September 20242024 Victor Ciura | @ciura_victor - Unleashing 🦀 The Ferris Within X experimenting with various hash algorithms. We will explore the essentials of hash functions and their properties, techniques for hashing complex user- defined types, and customizing std::hash for specialized needs with and benchmarking different hash algorithms. This will allow easy switching of hashing algorithms used by complex data structures, enabling easy comparisons. Hash algorithm designers can concentrate

virt_duration = end-start;There are interesting technical details and surprising conclusions that virtual functions can be actually faster. Since CPU architectures are mentioned, I'd expect to see deep assembly eritance-vs-other- ways-performanceDoes it even matter?Conclusions ● The notion that “virtual functions are slower” is flat out wrong. ○ Which is not to say they are faster ○ Some of the suggested

Helmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 1 / 39Helmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 2 / 39 About Myself • Professor Processing) Technical Committee 14 Entertainment ComputingHelmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 3 / 39 Creating Game Engines with C++ • Vienna Game Job System Vulkan Game Engine 2.0 https://github.com/hlavacs 20Helmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 4 / 39 The Game Loop auto prev = high_resolution_clock::now();

A read timestamp rd_tsv • A write timestamp wr_tsv • A transaction TX1 with timestamp tsv • Functions begin(), commit(), and rollback() • Facility for TX1 to "acquire" E • Function update() to update Steagall 45 CppCon 2020 - A Multi-threaded, Transaction-Based Locking Strategy for Containers Member Functions – lockable_item inline lockable_item::lockable_item() : mp_owning_tx(nullptr), m_last_tsv(0) Steagall 52 CppCon 2020 - A Multi-threaded, Transaction-Based Locking Strategy for Containers Member Functions – transaction_manager transaction_manager::transaction_manager(int log_level, FILE* fp) : m_

onTrap); setHandler(SIGALRM, onTimer); setHandler(SIGSEGV, onFault); for(Function* f: functions) { f->setTrap(); } setTimer(interval); int r = stabilizer_main(argc, argv); onTrap); setHandler(SIGALRM, onTimer); setHandler(SIGSEGV, onFault); for(Function* f: functions) { f->setTrap(); } setTimer(interval); int r = stabilizer_main(argc, argv); onTrap); setHandler(SIGALRM, onTimer); setHandler(SIGSEGV, onFault); for(Function* f: functions) { f->setTrap(); } setTimer(interval); int r = stabilizer_main(argc, argv);

containers* • Represent unsorted collections where an element's position is irrelevant • Implemented using hash tables • unordered_map, unordered_set, unordered_multimap, unordered_multiset 47CppCon 2021 – Back © 2021 Bob Steagall Common Container Interface • Every STL container provides a common set of functions 49 template< ... > class container { ... iterator begin(); iterator end(); const_iterator Common Bidirectional Container Interface • Bidirectional containers provide additional aliases and functions 50 template< ... > class bidirectional_container { ... using reverse_iterator = ... using

as per P2996 Syntax and examples Reflection libraries! Python bindings ABI hashing (boost::abi_hash?) A duck-typed std::any (boost::virtual_any?) Alternatives ways to achieve “reflection” Overview libaries! 42Now let's do some actual library design Automatic python bindings Automatic type ABI hash A better std::any with duck typing 43Python bindings 44We have a C++ class that we’d like to expose can’t be defaulted properly Return types with reference Picking overloads for functions How to name types (and member functions in case of overloads) Docstrings Python bindings with reflection 50Specifying