overview of what the poster reports on. Title: Pipeline architectures in C++: overloaded pipe operator | std::expected and its monadic operations Brief overview: Functional programming in C++ the overloaded pipe operator. In this poster I show how to implement a custom pipeline framework that employs std::expected, available since C++23. An overloaded custom pipe operator | will be presented of my book about C++ [1][3]. One of the topics was to describe the behavior of the overloaded pipe operator | in std::ranges. I came across Ankur's Satle lecture [4] and decided to expand on this topic

Evolution API Design Metaprogramming TricksAbout the talk • Expressiveness in C++ • Parsers • Operator overloading • Domain specific languages • Open source compile-time libraries • API • Design • = {1,2,3,4}; vector v(arr, arr + sizeof(arr) / sizeof(arr[0])); vector v = {1,2,3,4};Operator Overloading Use operators to call custom functions for specific types. std::filesystem::path p auto result = func(cats);Example – Compile Time Parsers template constexpr auto operator""_FROM() { constexpr auto parser = create_parser(); return parser(str); } /*...*/ std::vector

current_outer); [[nodiscard]] reference operator*() const; inner_iterator& operator++(); [[nodiscard]] inner_iterator operator++(int) [[nodiscard]] bool operator==(inner_iterator const& rhs) const; current_outer); [[nodiscard]] reference operator*() const; inner_iterator& operator++(); [[nodiscard]] inner_iterator operator++(int) [[nodiscard]] bool operator==(inner_iterator const& rhs) const; [[nodiscard]] reference operator*() const; 16 inner_iterator& operator++(); 17 [[nodiscard]] inner_iterator operator++(int) 18 [[nodiscard]] bool operator==(inner_iterator const& rhs)

f(2) f(3) f(4) f(5) f(6) f(3) f(6) false false true! false false true! operator* operator++ operator* Initialisation9 inputs ranges::view::transform(f) ranges::view::filter(p) PULL PULL return i % 3 == 0; }) >>= pipes::push_back(results); Why operator>>= ? 1 2 3 4 5 614 push_back = results >> Why operator>>= ? Also, because it is right associative.15 Also, because it is OF THE TALK What gets in a pipeline ranges STL algorithms Multiple inputs The pipes Inside a pipe Branching out pipes The output of a pipeline Simple container adapters Complex container adapters

elements) is cheap • size() (ask for the number of elements) is cheap or not provided: forward_list<> • operator[] (jump to a specific elements) is cheap or not provided: only for random-access containers (vector 3 4 1 6 5 size capacity size: 6 begin: end: 2 5 1 4 3 6 vector<>: list<>: C++98 no operator [] Nico Josuttis C++ Filter View @cppcon 2024-09-17 13©2024 by josuttis.com 27 C++ How Expensive be expensive (iterate to the first match) • size() is expensive (iterate over all elements) • operator[] is expensive (iterate over all elements) ©2024 by josuttis.com 30 C++ Performance of Filtering

ranges transform Range to View - with custom behaviors adaptors support the piping operator pipe syntax allows for 'unix pipe/powershell' type composition range adaptors are declared in namespace std::ranges::views

C++23 Core Language  Explicit Object Parameters  if consteval  Multidimensional Subscript Operator  Attributes on Lambda-Expressions  Literal Suffix for size_t  auto(x): decay-copy in The Language C++23 Core Language  Explicit Object Parameters  if consteval  Multidimensional Subscript Operator  Attributes on Lambda-Expressions  Literal Suffix for size_t  auto(x): decay-copy in The Language C++23 Core Language  Explicit Object Parameters  if consteval  Multidimensional Subscript Operator  Attributes on Lambda-Expressions  Literal Suffix for size_t  auto(x): decay-copy in The Language

does not compile (yet) 22.1COMPILER ERROR 23COMPILER ERROR sample.h:18:27: error: no match for 'operator|' (operand types are 'std::ranges::owning_view >' and 14 sample_view(sample_view&&) = default; 15 sample_view& operator=(const sample_view&) = delete; 16 sample_view& operator=(sample_view&&) = default; 17 18 auto begin() { return iterator{this}; 14 sample_view(sample_view&&) = default; 15 sample_view& operator=(const sample_view&) = delete; 16 sample_view& operator=(sample_view&&) = default; 17 18 auto begin() { return iterator{this};

proposes these concepts and algorithms, among others.8 EXAMPLE: LAUNCHING CONCURRENT WORK Use pipe syntax if you want to. namespace ex = std::execution; int compute_intensive(int); int main() { the // stop_when() algorithm requests stop of its stop // source. struct cancel_keyclick { void operator()() const noexcept { auto* current = pending_completion_.exchange(nullptr); if (current

pipes with CreatePipe ○ 0x5000 x pipe pairs ○ 0x4000 x pipe pairs 3. Write to those pipes with the array created earlier 4. Now free pipes of size 0x90 of those 0x5000 pipe pairs 5. Finally open the spray CLFS_METADATA_BLOCK array rgBlocks. These 0x90 blocks will occupy in gaps where the pipes were released Released Pipe Memory (Spray)*(UINT64*)0x5000040 = 0x5000000; *(UINT64*)0x5000000 = 0x5001000; *(UINT64*)0x5001000 System token Using the NtFsControlFile function that will read the pipes attributes. Using that pipe address + eprocess address to system + addr of the tokenCVE-2023-28252 Exploitation What is going