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:

4 Parcelables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 214 34.2.5 Sending Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215 35 Testing in Android 217 35.1 the root of your AOSP checkout. This will ensure that the Android build system sees the Android.bp files in src/android/. Ensure that adb sync works with your emulator or real device and pre-build all Android consists of a number of tools, of which the main ones are: • rustc: the Rust compiler which turns .rs files into binaries and other intermediate formats. • cargo: the Rust dependency manager and build tool

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

Contextual Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286 21.4 Working with Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286 21.5 A simple TCP example reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1114 66 Delimited Files 1139 67 Distributed Computing 1144 67.1 Cluster Manager Interface . . . . . . . . . . . . . . . Clauses In code that performs state changes or uses resources like files, there is typically clean-up work (such as closing files) that needs to be done when the code is finished. Exceptions potentially

Contextual Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286 21.4 Working with Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286 21.5 A simple TCP example reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1114 66 Delimited Files 1139 67 Distributed Computing 1144 67.1 Cluster Manager Interface . . . . . . . . . . . . . . . Clauses In code that performs state changes or uses resources like files, there is typically clean-up work (such as closing files) that needs to be done when the code is finished. Exceptions potentially

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

Contextual Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285 21.4 Working with Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285 21.5 A simple TCP example reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1113 66 Delimited Files 1138 67 Distributed Computing 1143 67.1 Cluster Manager Interface . . . . . . . . . . . . . . . Clauses In code that performs state changes or uses resources like files, there is typically clean-up work (such as closing files) that needs to be done when the code is finished. Exceptions potentially

Contextual Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285 21.4 Working with Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285 21.5 A simple TCP example reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1113 66 Delimited Files 1138 67 Distributed Computing 1143 67.1 Cluster Manager Interface . . . . . . . . . . . . . . . Clauses In code that performs state changes or uses resources like files, there is typically clean-up work (such as closing files) that needs to be done when the code is finished. Exceptions potentially

Contextual Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286 21.4 Working with Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286 21.5 A simple TCP example reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1114 66 Delimited Files 1139 67 Distributed Computing 1144 67.1 Cluster Manager Interface . . . . . . . . . . . . . . . Clauses In code that performs state changes or uses resources like files, there is typically clean-up work (such as closing files) that needs to be done when the code is finished. Exceptions potentially