3D Graphics for Dummies Significant content “borrowed” from Dan Chang @ Nintendo NTD “with permission” Chris Ryan CppCon 2021 github.com/ChrisR98008/CppCon20213 3D Graphics for Dummies4 3D Graphics Dummies5 3D Graphics for Dummies6 3D Graphics for Dummies7 3D Graphics for Dummies8 3D Graphics for Dummies9 3D Graphics for Dummies10 3D Graphics for Dummies11 3D Graphics for Dummies12 3D Graphics Graphics for Dummies13 3D Graphics for Dummies14 3D Graphics for Dummies15 3D Graphics for Dummies Winding / Right Hand Rule Fingers curled in the order of the points, thumb points up Counter clockwise

issues with colliding built-in literals • for example: F (farad), J (joule), W (watt), K (kelvin), d (day), l or L (litre), erg, ergps – not collide with std::chrono::literals CppCon 2020 | A Physical issues with colliding built-in literals • for example: F (farad), J (joule), W (watt), K (kelvin), d (day), l or L (litre), erg, ergps – not collide with std::chrono::literals CppCon 2020 | A Physical average speed /// /// @param d distance in metres /// @param t time in seconds /// @return speed in metres per second /// constexpr double avg_speed(double d, double t) { return d / t; } CppCon 2020 | A

a + b; co_return result; } task sum4(int a, int b, int c, int d) { int ab = co_await sum(a, b); int cd = co_await sum(c, d); int result = co_await sum(ab, cd); co_return result; } Okay, time fancier function.. That adds four numbers together. And as we all know, if we want to add a, b, c, d together, we need to add ab together, add cd together and add their sums together. 67 void __sum_resume(void* a + b; co_return result; } task sum4(int a, int b, int c, int d) { int ab = co_await sum(a, b); int cd = co_await sum(c, d); int result = co_await sum(ab, cd); co_return result; } Customization

Code A B C D 5• TGPS encapsulates function calls and their dependencies in a top-down task graph What is Task Graph-based Programming System (TGPS) Code A B C D B A C D 6• TGPS encapsulates in a top-down task graph What is Task Graph-based Programming System (TGPS) Code A B C D B A C D Scheduler 7Why TGPS 1 Scheduler sched; 2 task_a = sched.emplace([](&){ 3 // Code block block C; 10 }); 11 task_d = sched.emplace([](&){ 12 // Code block D; 13 }); 14 15 task_a.precede(task_b); 16 task_a.precede(task_c); 17 task_b.precede(task_d); 18 task_c.precede(task_d); 19 20 sched.schedule();

telling it to do so.Implicit Type Conversion Assignment Value* float f = -42.1234; -42.1234016 double d = f; -42.123401641845703 int i = f; -42 size_t s = f; 18446744073709551574 char c = f; Ö struct *64-bit MSVC v142Implicit Type Conversion Assignment Value* float f = -42.1234; -42.1234016 double d = f; -42.123401641845703 int i = f; -42 size_t s = f; 18446744073709551574 char c = f; Ö struct *64-bit MSVC v142Implicit Type Conversion Assignment Value* float f = -42.1234; -42.1234016 double d = f; -42.123401641845703 int i = f; -42 size_t s = f; 18446744073709551574 char c = f; Ö struct

the universe is eventually exhausted.🙂 I don’t know any reason beyond the cosmos. 🙂 Perhaps you’d like to be more specific? 😈 Will this loop end for some non-cosmological reason?🙂 That is very specific 1 + 1 + 1; + 1 template < char d1, char d0 > constexpr int operator""() interface { implementation; // … claim result == 10 * operator""<d1>() + operator""<d0>(); // … } 🤖 The interface for 1 + 1 + 1; + 1 template < char d1, char d0 > constexpr int operator""() interface { implementation; // … claim result == 10 * operator""<d1>() + operator""<d0>(); // … } ✅ ❌ 🤖 ✅ ❌ 🤖🤖 ✅

den); // r1 = 1/60  It‘s all compile-time constants: intmax_t n { 1 }; intmax_t d { 60 }; using r1 = ratiod>; // Error7 Compile-Time Rational Numbers  Arithmetic with ratio_add, ratio_subtract duration> d1; duration d1;  Duration with ticks of 1 minute: duration> d2;  Duration with ticks of a sixtieth of a second: duration> d3;  Use of predefined duration d4;12 Durations – Operations  Working with durations // Define 2 durations: // one expressed as minutes, the other as seconds. duration> d3 { 10 }; // = 10 minutes

class C { public: // access specifier int a; int b; private: // access specifier int c; int d; public: // access specifier int e; private: // access specifier int f; }; 13 Copyright © In practice, compilers did not (or very rarely) reorder member layout. 14 a b c d f e a b c d f e a b c d f e Copyright © 2020 by Stephen C. Dewhurst and Daniel Saks Non-Static Data Member These are legal. I saw this once… 15 a b c d f e a b c d f e a b d f c e c d f a b e Copyright © 2020 by Stephen C. Dewhurst and Daniel Saks 14 15Class

%hi(0x9ABCDC00), %o0 or %g1, 0x278, %g1 or %o0, 0x2F0, %o0 sllx %g1, 32, %g1 add %g1, %o0, %o0 15 8d 04 03 37 af 26 11 78 62 10 82 f0 22 12 90 20 70 28 83 08 40 00 90Code density uint64_t v = 0x123456789abcdef0; 9b d2 80 57 b3 f2 00 cf ca f2 80 46 e2 f2 SPARC sethi %hi(0x12345400), %g1 sethi %hi(0x9ABCDC00), %o0 or %g1, 0x278, %g1 or %o0, 0x2F0, %o0 sllx %g1, 32, %g1 add %g1, %o0, %o0 15 8d 04 03 mov x0, 0xdef0 movk x0, 0x9abc, lsl 16 movk x0, 0x5678, lsl 32 movk x0, 0x1234, lsl 48 00 de 9b d2 80 57 b3 f2 00 cf ca f2 80 46 e2 f2 • Implementation may detect a sequence of instructions as a