better idea! Ankur Satle CppCon 2021 https://ankursatle.wordpress.com ## Like Code Reviews? Try Pair Programming, You’ll love it! Ankur Satle CppCon 2021 https://ankursatle.wordpress.com ## Why Code Can we do better? ## Pair Programming ## Pair Programming ## 大讲堂 Coming together is beginning, keeping together is progress, and working together is success. Henry Ford ## Pair Programming → Collaborative [Image](/uploads/documents/2/8/1/9/281980909c667b145ef5e6833c8fceaa/p23_1.jpg) ## Pair Programming $ \rightarrow $ Collaborative PAIR PROGRAMMING ![Image](/uploads/documents/2/8/1/9/281980909c667b145ef5e6833c8fceaa/p24_1

Questions? • More about variant [50–56] Questions? • More about pair and tuple [57–69] Questions? ## What do I mean by algebraic types? pair C++98. The original algebraic data type. tuple C++11. optional values (true and false)| |pair<char,bool>|256 $ \\times $ 2 = 512 possible values| |tuple<char,char,bool>|256 $ \\times $ 256 $ \\times $ 2 = 131072 possible values| ## Pair and tuple are product types To find the size of the domain of a pair or tuple type, we take the product of the sizes of its element types. |A|A possible values| |---|---| |pair<A,B>|A×B possible values| |tuple<A

封装成一个类 Pair，以表示键值对。 /// == File: array_hash_map.dart === /* 键值对 */ class Pair { int key; String val; Pair(this.key, this.val); } /* 基于数组实现的哈希表 */ class ArrayHashMap { late List<pair>？_ buckets; final int index = _hashFunc(key); final Pair? pair = _ buckets[index]; if (pair == null) { return null; } return pair.val; } /* 添加操作 */ void put(int put(int key, String val) { final Pair pair = Pair(key, val); final int index = _hashFunc(key); _ buckets[index] = pair; } /* 删除操作 */ void remove(int key) { final int

封装成一个类 Pair，以表示键值对。 /// == File: array_hash_map.dart === /* 键值对 */ class Pair { int key; String val; Pair(this.key, this.val); } /* 基于数组实现的哈希表 */ class ArrayHashMap { late List<pair>？_ buckets; final int index = _hashFunc(key); final Pair? pair = _ buckets[index]; if (pair == null) { return null; } return pair.val; } /* 添加操作 */ void put(int put(int key, String val) { final Pair pair = Pair(key, val); final int index = _hashFunc(key); _ buckets[index] = pair; } /* 删除操作 */ void remove(int key) { final int

封装成一个类 Pair，以表示键值对。 /// == File: array_hash_map.dart === /* 键值对 */ class Pair { int key; String val; Pair(this.key, this.val); } /* 基于数组实现的哈希表 */ class ArrayHashMap { late List<pair>？_ buckets; final int index = _hashFunc(key); final Pair? pair = _ buckets[index]; if (pair == null) { return null; } return pair.val; } /* 添加操作 */ void put(int put(int key, String val) { final Pair pair = Pair(key, val); final int index = _hashFunc(key); _ buckets[index] = pair; } /* 删除操作 */ void remove(int key) { final int

weakest postconditions • But keep the contract simple ## zip_vector | push_back void push_back(const pair& e) post [old_size = size()] { size() == old_size + 1 } post { back() == e } post [old push_back(e.first); _second.push_back(e.second); } ## zip_vector | push_back void push_back(const pair& e) post [old_size = size()] { size() == old_size + 1 } post { back() == e } post [old push_back(e.first); _second.push_back(e.second); } ## zip_vector | push_back void push_back(const pair& e) post [old_size = size()] { size() == old_size + 1 } post { back() == e } post

Class Template Definition template class pair { T m0; U m1; public: pair() {} pair(T v0, U v1) : m0(v0), m1(v1) {} T first() const { return m0; Class Template Definition template class pair { T m0; U m1; public: pair() {} pair(T v0, U v1) : m0(v0), m1(v1) {} T first() const { return m0; Class Template Definition template class pair { T m0; U m1; public: pair() {} pair(T v0, U v1) : m0(v0), m1(v1) {} T first() const { return m0;

each net class. Every class has values for copper clearance, track width, via sizes, and differential pair sizes. These values will be used when creating tracks and vias unless a more specific rule overrides to footprint pads when the footprint is dragged - Allows tuning of track lengths and differential pair skew (phase) by inserting serpentine tuning shapes for designs with tight timing requirements By functions: Route Single Track, Route Differential Pair, Tune length of a single track, Tune length of a differential pair, and Tune skew of a differential pair. All of these are present in both the Route menu

modes of operation (push-and-shove, walkaround, highlight collisions) and support for differential pair routing as well as length and skew tuning Export of fabrication and plot files in many formats (Gerber parameters for each type of length-tuning pattern (single-track length, differential-pair length, and differential-pair skew). These defaults can be overridden in the properties of each tuning pattern added layer) also has Track Width and Unit Delay values, and differential pairs additionally have a Diff Pair Gap value. You can enter width, gap, and delay values manually (after calculating them with an external

modes of operation (push-and-shove, walkaround, highlight collisions) and support for differential pair routing as well as length and skew tuning Export of fabrication and plot files in many formats (Gerber parameters for each type of length-tuning pattern (single-track length, differential-pair length, and differential-pair skew). These defaults can be overridden in the properties of each tuning pattern added each net class. Every class has values for copper clearance, track width, via sizes, and differential pair sizes. These values will be used when creating tracks and vias unless a more specific rule overrides