Скачать или смотреть Using The C++ `unordered_map` In Spiral

To be specific we're talking about using the C++ `unordered_map` when doing compilation using the native Cuda backend in Spiral. The main reason why you'd want to use an unordered map in Spiral is that it can automatically generate the hashing and the equality functions for tuples, records and union types.

C++ doesn't have record types, but could the C++ compiler generate hashing and equality for it's own standard library tuples and variants? We asked Perplexity and it affirmed that `std::tuple` and `std::variant` have equality, but the user is required to provide the hashing implementations.

That's a point in favor of using Spiral

In the next video we'll begin work on implementing enumerative CFR using the dictionary data structure from this video.

---

#spiral #functionalprogramming #machinelearning #reinforcementlearning #programming #cpp #programminglanguage #compiler #parallelprogramming #cuda #gpu

Playlist(HD-CFR):    • Hopfield Dictionary CFR  
Playlist(Staged FP in Spiral):    • Staged Functional Programming In Spiral  
Spiral: https://github.com/mrakgr/The-Spiral-...
Spiral's ML Library: https://github.com/mrakgr/Spiral-s-ML...
Github: https://github.com/mrakgr/

If you have interesting work opportunities and require an expert functional programmer, don't hesitate to get in touch. My email is on my Github profile. Put "Work" as the subject in order to avoid the spam filters.

00:00:00 - Start
00:00:03 - Implementing automatic hashing and equality for the C++ `unordered_map` in Spiral
00:40:34 - Implementing the rest of standard library funcitonality