"C++20 Ranges" by Filip Brcic
Slides: https://cxx20ranges.brcha.com
Source-code of slides: https://github.com/brcha/cxx20ranges/
Talk description: C++20 Ranges could easily be described as an upgrade of STL. They live in a new sub-namespace, wrap around existing containers and reimplement (most) algorithms in a novel way. By using ranges, the syntax becomes clearer and chaining of algorithms becomes possible. The truly novel feature are infinite, lazy-evaluated "containers". On top of that, all the existing code is already compatible with ranges. This talk will give a brief introduction to ranges, explain how the algorithms have been changed and improved, look into current implementation status and alternatives available for older compilers.
Speaker bio: Filip got involved with programming in the early '90s on his dad's 80286. Since the only game on it was Prince of Persia, and all newer games were for the 16bit 386, learning how to develop games in Borland's Turbo C++ was a logical choice. Thirty years later, he is still interested in C++ (a slightly more modern version), as well as Haskell, Python, GNU/Linux, deep-learning and algorithms. For the past ten years he's been working as a freelance developer, currently mostly in the deep-learning field. Filip received a BSc in control systems and automation at the University of Belgrade. Feel free to contact him at [email protected].