EXECUTORS PROPOSAL The vision: “An asynchronous analog of the STL” • A full suite of standard async algorithms based on real-world requirements: E.g., then, when_all, sync_wait, repeat, stop_when, timeout etc. (not all proposed yet) • A standard set of abstractions (aka, concepts) derived from the algorithms • Efficient interoperability with coroutines • An open and extensible way to specify where, how (aka, sender) • A completion handler (aka, receiver) • A small, initial set of generic async algorithms: • E.g., then, when_all, sync_wait, let_* • Utilities for integration with C++20 coroutines5

in_range(T t) noexcept;11 constexpr Algorithms12 C++20 constexpr Everything • constexpr enables compile-time programming without arcane templates • Algorithms: • P0202R3 constexpr And And exchange() (GH-425) • P0879R0 constexpr Algorithms, Part II (GH-425, BillyONeal) • P1645R1 constexpr Algorithms (GH-399, Neargye) • More: • P0415R1 constexpr Again (GH-367, Neargye) time-efficient • Sorted arrays: binary_search, lower_bound, equal_range • Now you can use constexpr algorithms • Easy: static_assert with constexpr is_sorted • string_view is also constexpr; not limited to

the GQL standard • GQL Specific Capabilities •2019-09 – 39075 Database Language GQL project approved - this is the start •2021-11 – CD Ballot started •2022-02 – CD Ballot ended and comment resolution

requirements  Any container supporting begin()/end() is a valid range  Range-based algorithms: all Standard Library algorithms accepting ranges instead of iterator pairs  Projection: Transform elements

started hacking Rustc [100+ Prs] parser, diagnostics, ICE, Infra tools, code refactor, algorithms improvements Some PR stories • Rust cares about error messages • We are building a sufficiently

refer • V.S service in pure eBPF • Reuse the IPVS’s functionality and maturity • Many scheduling algorithms • Reuse IPVS timer to reclaim eBPF map • More efficient and secure • V.S Taobao IPVS SNAT patch

std::ranges::contains_subrange(v1, v2)); // true75 Changes to Ranges Library  Several folding algorithms: ranges::fold_left(), fold_left_first(), fold_right(), fold_right_last(), fold_left_with_iter()