## webpack THE PAST THE PRESENT THE FUTURE TOBIAS KOPPERS GITHUB @SOKRA TWITTER: @WSOKRA ## THE PAST PROBLEMS BUNDLER SOLVE A SHORT WEBPACK HISTORY LESSON ## PROBLEMS BUNDLERS SOLVE • SCRIPT TAGS ts/f/4/a/a/f4aa343a5d22a3384a13c94a17baf10c/p23_2.jpg) Runtime Modules for runtime code ## THE FUTURE WHERE IS WEBPACK HEADING TO? WEBPACK SHOULD BE ![Image](/uploads/documents/f/4/a/a/f4aa343a5d2

## +24 ## Limitations and Problems in std::function and Similar Mitigations and Alternatives ## AMANDEEP CHAWLA ## Limitations and Problems in std::function and similar constructs Amandeep Chawla | notifyTQ, std::function)> callback ); ## Lambdas // print all the elements of vector of int. std::for_each(c.begin(), c.end(), [(int i) { std::cout std::cout << i << ' "; }); // Sort the vector using a lambda function std::sort(v.begin(), v.end(), [](int a, int b) { return a < b; }); // find the object with id "c"

## +24 ## spanny 2: Rise of std::mdspan ## GRISWALD BROOKS ## 20 24 September 15 - 20 ##### DISCLAIMER: C++23... ish  understanding of std::mdspan layouts and accessors • how to write custom layouts and accessors • dispel common misconceptions about both ## how • motivations for std::mdspan - review std::mdspan declaration memory accessor improving memory access using asynchronicity ## how • motivations for std::mdspan - review std::mdspan declaration • layouts and their requirements • occupancy grids and default layouts

### GitOps 2.0 THE FUTURE OF DEVOPS ## Table of Contents 1. The Pains of GitOps 1.0 1.1. GitOps tools 1.2. Splitting CI and CD 1.3. Promotion of releases between environments 1.4. Modeling multi-environment

## A Long Journey of Changing std::sort Implementation at Scale ## DANILA KUTENIN ## WHO AM I? • Senior Software Engineer at Google • DC efficiency ## AGENDA FOR TODAY • History of sorting • Why have ordering of elements • std::sort, std::stable_sort, ranges::sort, etc std::sort(begin, end); std::ranges::sort(cont); ## REMINDERS • Sorting is the ordering of elements • std::sort, std::stable_sort, ranges::sort ranges::sort, etc std::sort(begin, end, comp); std::ranges::sort(cont, comp); ## QUICKSORT ## QUICKSORT • Quick sort ## QUICKSORT • Quick sort • Take any element ## QUICKSORT • Quick sort • Take any

[Image](/uploads/documents/7/8/e/d/78edb81a9976122a3d4c851701bf9145/p1_2.jpg) ## OAM, dapr, and rudr The future of cloud native applications Mark Russinovich CTO, Microsoft Azure @markrussinovich BRK3098

## 20 23 October 01 - 06 ## +23 ## Lifetime Safety in C++: Past, Present and Future #### GABOR HORVATH Gabor.Horvath@microsoft.com ## Welcome to CppCon 2023! Come by our booth and join #visual_studio & Security: The Future of C++ JF Bastien  ## All the Safeties 2023 Safety & Security: The Future JF Bastien 2023 ments/9/d/0/5/9d05b80becbd0a2aac297caf075ed3c2/p8_1.jpg) ## 2023 ## Safety & Security The Future  JF Bastien National

## +21 ## Bringing Existing Code to CUDA Using constexpr and std::pmr BOWIE OWENS 20 21 October 24-29 ## Outline • Introduction • Memory • Host vs Device Functions • Return on Investment • Concluding Allocation // cpu std::vector x(N); // ???? std::vector y(N); // ... ## std::pmr • Added in C++17: • std::pmr::memory_resource • std::pmr::polymorphic_allocator • std::pmr::vector std::pmr::vector • std::pmr::monotonic_buffer_resource // ... ## Memory Allocation // gpu unified_memory_resource mem; std::pmr::vector x(N, &mem); std::pmr::vector y(N, &mem);

+23 ## File I/O for Game Developers: Past, Present, and Future ## GUY DAVIDSON ## 20 23 October 01 - 06 # FILE I/O: PAST, PRESENT AND FUTURE CPPCON OCTOBER 3 $ ^{RD} $ 2023 GUY DAVIDSON @HATCAT01 buffered file IO? • How do we optimise unbuffered file IO? • How might the standard help us in future? ## AGENDA Sub-megabyte days • More RAM, more disk capacity • Moving data into and out of RAM size_t fwrite(void* buffer, size_t size, size_t count, FILE* stream); ## MORE RAM, MORE DISK CAPACITY std::filesystem • Directories, links, block files, character files, sockets... • Special names Paths

## +23 ## I s std::mdspan a Zero-overhead Abstraction? ## OLEKSANDR BACHERIKOV ## I s std::mdspan a Zero-overhead Abstraction? Oleksandr Bacherikov Snap Inc ## What is std::mdspan? It's a view to C++ If the matrices are contiguous in memory, then we can treat them as ranges and simply use std::transform $$ \{-5,\quad5,\quad-3,\quad1,\quad4,\quad0\} $$ $$ \{3,2,1,3,-5,4\} $$ $$ \{-2 4*r8], xmm0 ## V ectorization is great for performance, not great for slideware #### clang16.0.4 -01 -std=c++20

push	rbx	je	.LBB0_6
test	rdi 0 码力 | 75 页 | 1.04 MB | 1 年前 3 共 1000 条 1 2 3 4 5 6 100 前往 页 相关搜索词 Webpack过去现在未来问题std::functionMitigationsAlternativesPerformanceOptimizationstd::mdspanlayoutaccessorasynchronouspolicyGitOps 2.0CodefreshArgoCD多环境配置自动回滚std::sortC++标准库排序算法严格弱序调试模式Open Application Model (OAM)DaprRudrKubernetesMicroservices ArchitectureLifetime SafetyC++CrubitCore GuidelinesP2771constexprstd::pmrCUDA性能优化内存管理File I/Obuffered file IOunbuffered file IODirectStoragezero-overhead abstractionmulti-dimensional arraysChandler CarruthC++ Conference