process of translating a data structure or object state into a format that can be stored (e.g. files in secondary storage devices, data buffers in primary storage devices) or transmitted (e.g. data process of translating a data structure or object state into a format that can be stored (e.g. files in secondary storage devices, data buffers in primary storage devices) or transmitted (e.g. data What & Why We Want to Do • Our primary goal is to establish equivalence between memory data structures and data buffers. This equivalence would bring several significant advantages: • For Serialization:

Compare needs a stronger constraint Strict weak ordering = Partial ordering + Transitivity of Equivalence 🔥 (a.x < b.x) && (a.y < b.y)2023 Victor Ciura | @ciura_victor - Regular, Revisited 58 Slide Compare needs a stronger constraint Strict weak ordering = Partial ordering + Transitivity of Equivalence where: equiv(a,b) : comp(a,b)==false && comp(b,a)==false 🔥 (a.x < b.x) && (a.y < b.y)2023 Transitivity ∀ a, b, c, if comp(a,b)==true and comp(b,c)==true => comp(a,c)==true Transitivity of equivalence ∀ a, b, c, if equiv(a,b)==true and equiv(b,c)==true => equiv(a,c)==true Strict weak ordering

Conversion Decision Coverage Dependency Destructive Domain Dynamic End-to-end Endurance Equivalence Partitioning Error-Handling Exploratory Fault injection Formal verification Functional Fuzz your other unit tests ‣ You have to do special things to your environment (such as editing config files) to run it Michael Feathers - A Set of Unit Testing Rules “ ”What is a Test? 21 Unit Michael

forward iterators • Implemented as a hash table – Hash helps determine ordering, Pred tests Key equivalence 60CppCon 2021 – Back to Basics: Classic STL Copyright © 2021 Bob Steagall Unordered Associative forward iterators • Implemented as a hash table – Hash helps determine ordering, Pred tests Key equivalence 61CppCon 2021 – Back to Basics: Classic STL Copyright © 2021 Bob Steagall Unordered Associative forward iterators • Implemented as a hash table – Hash helps determine ordering, Pred tests Key equivalence • Can be used as an associative array 62CppCon 2021 – Back to Basics: Classic STL Copyright

623 a ≈ 0.616 t ≈ 7.75 Gyr CMB z ≈ 1090.48 a ≈ 9.16 × 10−4 t ≈ 3.70 × 10−4 Gyr Matter-Λ equivalence z ≈ 0.289 a ≈ 0.776 t ≈ 10.4 Gyr Reionization z ≈ 11.37 a ≈ 8.08 × 10−2 t ≈ 3.94 × 10−1 Gyr foundations Outline of an implementation Conclusion Definite integrals and differential equations An equivalence � f (x) dx ⇔ dy dx = f (x) Finding antiderivatives ⇔ solving an ODE Algorithms for definite

do that, we can show how to implement the one in terms of the other. 66INTERLUDE: EQUIVALENCE INTERLUDE: EQUIVALENCE Implementing Implementing ap ap with variadic with variadic fmap fmap is quite

semiregular • regular Callable concepts: • invocable • regular_invocable • predicate • relation • equivalence_relation Concepts: • totally_ordered • strict_weak_orderint main() { foo(); // works

intuition for why false ⇒ X 96Matcher ordering We can also now define a partial order and an equivalence between matchers. 1: template 2: constexpr auto operator<=>(L const &lhs

} 1 2 3 4 5 6 7 8 abs(INT_MIN) is now defined behavior Now, the error case is a valid equivalence class we should test. Part 1: Testing Precision Completeness 39CHECK_THROWS_AS( abs(INT_MIN)

cryptographic hash function. • Simple bitwise operations – many of them. • Instruction set equivalence may not be assumed. • Vertical vs horizontal data layout. 105 Latency Throughput Scalar