• PlantUML • open source tool that converts simple textual descriptions to UML diagrams • Not only UML diagrams - Earth diagram, UI wireframes and more.. • Textual descriptions could be separately Javascript based diagramming and charting tool. • Mermaid can render: • Flowcharts • Sequence / class diagrams • Gantt diagram • Git graph and more https://mermaid-js.github.io/mermaid/#/Finally comes

Arthur O’Dwyer 2020-09-16Outline ● Why the name “algebraic data types”? [3–18] ○ Memory layout diagrams. Why not std::any? ● Quick motivation for each type [19–27] ● Shared terminology [28–41] compares less-than any value from T’s domain. ● variant can be thought of as an ordered sequence {index(), value}, compared lexicographically. ○ Or, equivalently, variant can be thought

format has different iteration patterns - Inefficient to enforce a particular iteration order * Diagrams by Matt Eding at https://matteding.github.io/2019/04/25/sparse-matrices/[DISTRIBUTION STATEMENT format has different iteration patterns - Inefficient to enforce a particular iteration order * Diagrams by Matt Eding at https://matteding.github.io/2019/04/25/sparse-matrices/[DISTRIBUTION STATEMENT format has different iteration patterns - Inefficient to enforce a particular iteration order * Diagrams by Matt Eding at https://matteding.github.io/2019/04/25/sparse-matrices/[DISTRIBUTION STATEMENT

in-the-room, not YouTube) Code color theme: modus-operandi-tinted (WCAG AAA) [ thanks Prot ] SVG diagrams for resolution-independence 4What this talk is about The workings of a message-handling library

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}}}