An overview of several new techniques, most of which are old ideas but with unique spins on them.
All techniques involved are performance-oriented, ie. do not attend this talk if you expect elegance, complexity and language-oriented talk. Some of the topics:
* methods for faster erasure from vectors/deques/static_vectors where order is unimportant
* cache-friendlier linked lists
* creating random-access containers with O(1)  operators out of multiple memory blocks, but with a growth factor
Hopefully there should be something for both newcomers to the language and for 'old dogs' who can learn a few new tricks.