The set of code that is simple, easy, and natural to write is forever evolving. Back in the days of C, writing a container for your struct meant sacrificing either performance or maintainability, then we got std::vector in C++. Today languages are tearing down more of these barriers, these choices between performance and maintainability. By electing new primitive work units and making bold changes to our compilers, languages like D can vastly improve the expressiveness of your code while at the same time sending your runtime or memory footprint down to O(1). We'll examine an enlarged lifecycle for these modern trends: both the environment in which they were conceived and experimented upon in the D programming language and also how they are reaching more mature languages like C++, where these new features are popping up left and right in language proposals.
Topics will include:
Power to weight ratio
Ranges as a primitive
Frictionless compile-time function evaluation
The fastest regex implementation in the world No prior experience with D or C++ necessary.