Ivan Čukić DESIGN IDIOMS FROM AN ALTERNATE UNIVERSE INTRODUCTION DATA FUNCTIONS AND DATA ABSTRACTIONS FUNCTIONS Ivan Čukić KDAB CppCon 2021 INTRODUCTION DATA FUNCTIONS AND DATA ABSTRACTIONS FUNCTIONS ABOUT Ivan Čukić KDAB CppCon 2021 INTRODUCTION DATA FUNCTIONS AND DATA ABSTRACTIONS FUNCTIONS COMPOSITION Doug McIlroy and Dennis Ritchie Ivan Čukić KDAB CppCon 2021 INTRODUCTION DATA FUNCTIONS AND DATA ABSTRACTIONS A-Za-z ’\n’ | tr A-Z a-z | sort | uniq -c | sort -rn | sed ${1}q Ivan Čukić KDAB CppCon 2021 INTRODUCTION DATA FUNCTIONS AND DATA ABSTRACTIONS FUNCTIONS Doug McIlroy, Bell System Technical Journal, 1978:

Introduction Standardization Design EDSL Extents Going beyond Conclusion The Shapes of Multi-Dimensional Arrays Vincent Reverdy September 17th, 2020 CppCon - Vincent Reverdy - September 17th, 2020 CC0 1.0 Universal - Public Domain Dedication 1Introduction Standardization Design EDSL Extents Going beyond Conclusion Table of contents 1 Introduction 2 Standardization 3 Design 4 EDSL 5 Extents Online CC0 1.0 Universal - Public Domain Dedication 2Introduction Standardization Design EDSL Extents Going beyond Conclusion Introduction 1 Introduction 2 Standardization 3 Design 4 EDSL 5 Extents

Introduction Persistent Hash Map Persistent Transactional Data Structures Live Demonstration ReferencesIntroduction Persistent Hash Map Persistent Transactional Data Structures Live Demonstration References References Overview Introduction Persistent Memory Use-Cases Pitfalls Persistent Hash Map Design Goals and Methodology Persistence Performance Results Persistent Transactional Data Structures Design n Persistent Hash Map Persistent Transactional Data Structures Live Demonstration References Introduction Persistent Memory ▶ Persistent Memory is positioned as a new tier in the memory hierarchy that

https://creativecommons.org/licenses/by-nc-nd/4.0/ 1 2 CONTENTS CONTENTS Contents Preface 8 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Chapter 06 Regular Expression 63 6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Ordinary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 Chapter 10 Outlook: Introduction of C++20 89 Concept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

std::vector table = /* ... */; // Put all the children to the beginning of the vector Introduction of std::iter_swap() 36 11 auto first = begin(table); auto last = end(table); // std::vector table = /* ... */; // Put all the children to the beginning of the vector Introduction of std::iter_swap() 37 11 auto first = begin(table); auto last = end(table); // std::vector table = /* ... */; // Put all the children to the beginning of the vector Introduction of std::find_if_not() 38 11 auto first = begin(table); auto last = end(table);

Introduction The lambda trick Comparison Binding Constraints Architecture Substitution Construction Conclusion Symbolic Calculus for High-Performance Computing from Scratch using C++23 Vincent Reverdy Comparison Binding Constraints Architecture Substitution Construction Conclusion Table of contents 1 Introduction 2 The lambda trick 3 Comparison 4 Binding 5 Constraints 6 Architecture 7 Substitution 8 trick Comparison Binding Constraints Architecture Substitution Construction Conclusion Introduction 1 Introduction 2 The lambda trick 3 Comparison 4 Binding 5 Constraints 6 Architecture 7 Substitution

Introduction Firsts steps Context Theoretical foundations Outline of an implementation Conclusion High-Performance Numerical Integration in the Age of C++26 Vincent Reverdy Laboratoire d’Annecy de Physique Context Theoretical foundations Outline of an implementation Conclusion Table of contents 1 Introduction 2 Firsts steps 3 Context 4 Theoretical foundations 5 Outline of an implementation 6 Conclusion Firsts steps Context Theoretical foundations Outline of an implementation Conclusion Introduction 1 Introduction 2 Firsts steps 3 Context 4 Theoretical foundations 5 Outline of an implementation

including Qt-based ones Approval Tests: claremacrae.co.uk/conferences/presentations.html3 Contents •Introduction •Qt –Setting Up Testing –Error-prone Things –Approval Tests •Extras –Tools –Summary4 About refactoring to add tests Can’t refactor without tests Topics of this talk8 Contents •Introduction •Qt –Setting Up Testing –Error-prone Things –Approval Tests •Extras –Tools –Summary910 Harder11 Give you Confidence to Start testing your Qt application Effectively12 Contents •Introduction •Qt –Setting Up Testing –Error-prone Things –Approval Tests •Extras –Tools –Summary13

• Introduction • Memory • Host vs Device Functions • Return on Investment • Concluding remarks Outline 2 |• I work the RiskLab team at CSIRO on applied mathematics for Financial Risk. • The aim of Provide some guidance to people about to embark on using CUDA to speed up existing software. Introduction 3 |void add_cpu(int n, float* x, float* y) { for (int i = 0; i < n; i++) y[i] y[i] = 2.0f; } add_cpu(N, x, y); delete[] x; delete[] y; } An Even Easier Introduction to CUDA 4 |TEST_CASE("cppcon-1", "[CUDA]") { int N = 1 << 20; float* x; float* y;