non-type template parameter74 Conclusions Zero-cost abstractions Encapsulation Inheritance Dynamic Polymorphism Static Polymorphism Negative-cost abstractions More C++ for the embedded world! Architecture

and units library Why Columbus thought that he reached India? 55// length of degree of latitude estimation by medieval Persian geographer // Abu al Abbas Ahmad ibn Muhammad ibn Kathir al-Farghani (a.k.a he reached India? ROMAN FOOT (PES) ROMAN PACE ROMAN MILE 59// length of degree of latitude estimation by medieval Persian geographer // Abu al Abbas Ahmad ibn Muhammad ibn Kathir al-Farghani (a.k.a and units library Why Columbus thought that he reached India? 60// length of degree of latitude estimation by medieval Persian geographer // Abu al Abbas Ahmad ibn Muhammad ibn Kathir al-Farghani (a.k.a

256 ∗ 1036 = 2.56 ∗ 103814/15 Relative error of the estimation The relative error of 210 ≈ 1000 is 2.34%.14/15 Relative error of the estimation The relative error of 210 ≈ 1000 is 2.34%. The relative 250 11.18% 2110 22.96% 2170 33.18% 260 13.26% 2120 24.77% 2180 34.75%14/15 Relative error of the estimation The relative error of 210 ≈ 1000 is 2.34%. The relative error only increases on the ten steps:

PATTERN struct SMatcher { using cost = int; constexpr static cost initial = 0; cost accumulate_cost(cost prev, int i, int j, match m); bool better(cost lhs, cost rhs) { return lhs < rhs; } }; enum PATTERN struct SMatcher { using cost = int; constexpr static cost initial = 0; cost accumulate_cost(cost prev, int i, int j, match m); bool better(cost lhs, cost rhs) { return lhs < rhs; } }; enum struct SMatcher { 3 using cost = int; 4 constexpr static cost initial = 0; 5 6 cost accumulate_cost(cost prev, int i, int j, match m); 7 bool better(cost lhs, cost rhs) { return lhs < rhs; }

reserve (4);8/32 Cost of vector::push back v.push_back (1);9/32 Cost of vector::push back v.push_back (2);10/32 Cost of vector::push back v.push_back (3); No room!10/32 Cost of vector::push back v.push_back (3);10/32 Cost of vector::push back v.push_back (3);10/32 Cost of vector::push back v.push_back (3);10/32 Cost of vector::push back v.push_back (3);10/32 Cost of vector::push back v v.push_back (3);10/32 Cost of vector::push back v.push_back (3);11/32 Worst case complexity?11/32 Worst case complexity? O(n) n: Number of elements in the vector12/32 push back with an O(n) budget

computation to successfully calculate the factorial of `n` without causing an assertion error. (Total cost: approximately $0.03 USD.) Starting program: /media/psf/Home/git/ChatDBG/ a.out [Thread debugging computation to successfully calculate the factorial of `n` without causing an assertion error. (Total cost: approximately $0.03 USD.) Starting program: /media/psf/Home/git/ChatDBG/ a.out [Thread debugging computation to successfully calculate the factorial of `n` without causing an assertion error. (Total cost: approximately $0.03 USD.) Starting program: /media/psf/Home/git/ChatDBG/ a.out [Thread debugging

and false positives 3. Cost 4. Disabling each tool 5. Using each tool outside of LLVM ContrastAgenda 1. Run time vs compile time 2. False negatives and false positives 3. Cost 4. Disabling each tool and false positives 3. Cost 4. Disabling each tool 5. Using each tool outside of LLVM ContrastAgenda 1. Run time vs compile time 2. False negatives and false positives 3. Cost 4. Disabling each tool and false positives 3. Cost 4. Disabling each tool 5. Using each tool outside of LLVM ContrastAgenda 1. Run time vs compile time 2. False negatives and false positives 3. Cost 4. Disabling each tool

binaries smaller."My Hypothesis ● Cost of using result types: S(N) = aN ○ a = average cost of a check per call ○ N = number of checked function calls 86My Hypothesis ● Cost of using result types: S(N) = = aN ○ a = average cost of a check per call ○ N = number of checked function calls ● Cost of using exception: S(M) = bM + E ○ b = average cost of exception metadata ○ M = number of non-leaf functions functions ○ E = cost of exception machinery (libunwind, etc) ○ NOTE: this is grossly simplified 87My Hypothesis ● Cost of using result types: S(N) = aN ○ a = average cost of a check per call ○ N = number

get it in your project? 2. What does it cost, in terms of developer experience? 16.2Framework for Choosing 1. Can you get it in your project? 2. What does it cost, in terms of developer experience? 3. 1. Can you get it? 2. What does it cost? 17.2Full comparison https://aurora-opensource.github.io/au/main/alternatives/ 1. Can you get it? 2. What does it cost? 3. “Units library speci�c” features: unos 21.52. DevEx cost? a) Compile times2. DevEx cost? a) Compile times2. DevEx cost? a) Compile times2. DevEx cost? a) Compile times2. DevEx cost? b) Compiler errors2. DevEx cost? b) Compiler errors

to make the most of the computing resources available • To have All of the Above at a COMFORTABLE COST Developing • The process of “Growing Closer To” / “Moving Towards” an envisioned, state that is come at quite a significant cost, Meaning that Newer Computer Hardware Costs More, out of Reach for many people. • However, This Technological Improvement, does push down the cost for the “Previous Generations” hardware, energy and connectivity, access to computing must come at a lower cost. Access To Computer Hardware At Lower Cost • One way is that computers come in a differant form, namely budget mobile