1Reflection based libraries to look forward to Saksham Sharma CppCon 2024 2Director, Quant Research Tech at Tower Research Capital High frequency trading firm based out of NYC Develop low latency

intent Because it carried the highest risk: Would the committee & community accept that huge a leap forward in compile-time programming? Would a full reflection implementation actually work and not hit language/compiler

references preserve the value category of a function argument, making it possible to forward it by means of std::forward. CppCon 2023 | Forwarding References Perfect Forwarding 33Forwarding references references preserve the value category of a function argument, making it possible to forward it by means of std::forward. void f(int&) { std::cout << "lvalue\n"; } void f(const int&) { std::cout << "const references preserve the value category of a function argument, making it possible to forward it by means of std::forward. void f(int&) { std::cout << "lvalue\n"; } void f(const int&) { std::cout

istream_view{ words }; 2224template requires std::ranges::forward_range class all_pairs_view : public std::ranges::view_interface> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 25template requires std::ranges::forward_range class all_pairs_view : public std::ranges::view_interface> requires requires std::ranges::forward_range std::ranges::forward_range class class all_pairs_view all_pairs_view : : public public

typename... Ts> constexpr auto type_find_if(C, auto&& fun) { return type_find_if(CPP2_FORWARD(fun)); } template class C> concept spec_of_template = requires polymorphic X > auto as( X&& x ) -> decltype(auto) { return dynamic_cast &>( std::forward(x) ); } Derived d; Base1 const& b1 = d; Base2 const& b2 = d; as(b1).const_non_virtual(); constexpr (requires{ \ std::forward(obj).FUNCNAME(std::forward(params)...); \ }) { \ return std::forward(obj).FUNCNAME(std::forward(params)

Args...>) { return std::invoke(std::forward(f), std::forward(args)...); } else { return [f = std::forward(f), ...args = std::forward(args)] decltype(auto) { return curry(std::forward_like(f), std::forward_like(args)..., std::forward(as)...); }; } } 40PARTIAL APPLICATION std::optionalforward(f), *std::forward(opt)))> { if (opt) { return curry(std::forward(f), *std::forward(opt)); } return {};

Steagall Containers Overview • Sequence containers • vector • deque • list • array (C++11) • forward_list (C++11) • Associative containers • map • set • multimap • multiset 21 • Unordered associative categories • Output • Input • Forward • Bidirectional • Random-access • Arranged in a hierarchy of requirements • Not public inheritance 23 Output Input Forward Bidirectional Random-accessCppCon Let's try a generic programming exercise and develop iterators from scratch 26 Output Input Forward Bidirectional Random-accessCppCon 2021 – Back to Basics: Classic STL Copyright © 2021 Bob Steagall

expensive algorithms 。Forexample, robot path planning with RRT depends on nearest neighborlookup and forward kinematics, and collision detection Motivation Motions in Microseconds via Vectorized Sampling-Based PROCESs forward_kinematics) (forward_kinematics_test forwardkinematicsTest.cpp) {URDF_FILE (ROOT (TIP URDF_FILE} sfROOT} sfTIP)) fast_forward kinematics_ Library) add_executabte(forward kinematics_test cpp) {URDF_FILE (ROOT (TIP (S{URDF_FILE} sfROOT) sfTIP)) target_Link_Libraries(forward kinematics_test PUBLIC fast_forward kinematics_ Library) URDF_FILE ROOT_LINK TIP_LINK) (Python Interpreter)

1ITERATOR CATEGORIES (CONCEPTS) ITERATOR CATEGORIES (CONCEPTS) input_iterator output_iterator forward_iterator bidirectional_iterator random_access_iterator contiguous_iterator C++17 iterator categories element after moving past it? 3. Do I return an element after moving past it? must be at least forward_iterator 30 . 1ITERATOR CONCEPT QUESTIONS ITERATOR CONCEPT QUESTIONS 1. Am I using any standard element after moving past it? 3. Do I return an element after moving past it? must be at least forward_iterator 4. Do I need to decrement the iterator? must be at least bidirectional_iterator 30 .

bench(std::forward(task), numThreads, numTasks); bench(std::forward(task), numThreads, numTasks); bench(std::forward(task) sk), numThreads, numTasks); bench(std::forward(task), numThreads, numTasks); } }The Benchmark: 18 template void bench(task_type bench(std::forward(task), numThreads, numTasks); bench(std::forward(task), numThreads, numTasks); bench(std::forward(task)