remembering the sequence of operations it was made from 2 template class shaper { 3 // Types 4 public: 5 using type = shaper ; 6 using index_sequence = std:: index_sequence_for sequence of operations it was made from 2 template class shaper { 3 // ... 4 // Operators const noexcept { 24 return to_array( index_sequence (), x...); 25 } 26 template constexpr auto to_array(std :: index_sequence , X... x) const noexcept { 27 return

0 0 0 0 0 0 0 0 PSL PSL - Probe Sequence Length X X X X X X X X Core algorithm, 1. Every bucket contains metadata about it’s probe sequence length, PSL and is defaulted to some value 0 0 0 0 0 0 0 0 PSL PSL - Probe Sequence Length X X X X X X X X Core algorithm, 1. Every bucket contains metadata about it’s probe sequence length, PSL and is defaulted to some value 0 0 0 0 0 0 0 0 PSL PSL - Probe Sequence Length X X X X X X X X Core algorithm, 1. Every bucket contains metadata about it’s probe sequence length, PSL and is defaulted to some value

when size(sequence) == 1 size(sequence) == 1, answer is , answer is value + 1 value + 1 17 . 1"SOLUTION" FIRST CUT "SOLUTION" FIRST CUT Assuming a sorted sequence. Assuming a sorted sequence. unsigned . 1ACTUAL SOLUTION, FIRST CUT ACTUAL SOLUTION, FIRST CUT Not assuming a sorted sequence. Not assuming a sorted sequence. unsigned find_missing_element(unsigned* first, unsigned* last, unsigned value) are some test cases we'd want to write? What are some test cases we'd want to write? zero-length sequence 22 . 1TESTING TESTING Now that we have a first draft working algorithm, let's talk about testing

REVISITED ITERATION OPERATIONS WITH FLUX ▸ flux�::first(seq) returns a cursor, which represents a sequence position ▸ For contiguous sequences, this is just an integer index ▸ flux�::is_last(seq, cur) operations models the sequence concept ▸ Sequences are single-pass by default ▸ Multipass sequences are those which allow simultaneous iteration by independent cursors ▸ A sequence whose cursor is a Contiguous sequences are random-access, backed by an in-memory array 28ITERATION REVISITED FLUX SEQUENCE ALGORITHMS ▸ As of October 2023 29 all any compare contains count count_eq count_if contains

containers are implemented using a variety of basic data structures • Each STL container represents a sequence of elements • Containers have an internal structure and ordering • We can observe this ordering 20CppCon 2021 – Back to Basics: Classic STL Copyright © 2021 Bob Steagall Containers Overview • Sequence containers • vector • deque • list • array (C++11) • forward_list (C++11) • Associative containers • Pointers to elements can be dereferenced more than once, with the same result each time • The sequence can be iterated over (traversed) more than once • What about sequences that can be traversed only

senders. auto sndr = sched.schedule(); 1 20continue_on start_on let_value let_error let_stopped then sequence upon_error upon_stopped repeat repeat_n repeat_until retry retry_until split when_any when_all EENSD_6senderIXtlS9_tlSA_tlSB_Lc108ELc97ELc115ELc116E Lc45ELc116ELc104ELc101ELc110EEEEESF_NSC_9_sequence6senderIXtlNS3_ILm4EEEtlNS6_IcLm4EEEtlA4_cLc1 15ELc101ELc113EEEEENSM_IXtlNS3_ILm15EEEtlNS6_IcLm1 (char)116, (char)45, (char)116, (char)104, (char)101, (char)110}}}, async::set_value_t, async::_sequence::sender{std::__1::array{char [4]{(char)115, (char)101, (char)113}}}

Ts> auto type_find_if() { [&](std::index_sequence){ std::cout << sizeof...(Is) << std::endl; }(std::index_sequence_for()); } int main() { type_find_if(); typename F> auto type_find_if(F fun) { [&](std::index_sequence){ fun(sizeof...(Is)); }(std::index_sequence_for()); } int main() { type_find_if([](auto typename F> auto type_find_if(F fun) { [&](std::index_sequence){ (fun(Is), ...); }(std::index_sequence_for()); } int main() { type_find_if([](auto

2023-10-03 22Parser generates a sequence of events { object_begin, Jonathan Müller — @foonathan Express your expectations CppCon 2023-10-03 23Parser generates a sequence of events { "id": object_begin generates a sequence of events { "id": 42, object_begin, key("id"), number(42), Jonathan Müller — @foonathan Express your expectations CppCon 2023-10-03 23Parser generates a sequence of events { Jonathan Müller — @foonathan Express your expectations CppCon 2023-10-03 23Parser generates a sequence of events { "id": 42, "name": "Jonathan Müller", "speaker": true, object_begin, key("id")

desired types const auto invoker = // helper lambda [&](std::index_sequence) { /// we need to unpack the parameter types and the indices together func(std::any_cast(params[Index])...); }; return invoker(std::make_index_sequence()); } ); } https://godbolt.org/z/Y74jse1WvCopyright Jason Turner @le�icus return [&](std::index_sequence) { return func(std::any_cast(params[Index])...); }(std::make_index_sequence()); /// IILE },

certain logic.Sequence ● Tick children from left to right, as long as they return SUCCESS ● If all children are successful, Sequence returns SUCCESS ● Stop if a child return FAILURE; Sequence returns tickWhileRunning(); <Sequence> Sequence> Dataflow between Nodes ● We <Sequence> Sequence>