>>9538246Well, the best example I can think of is a new lock free data structure or a new way to ensure perfect reclaiming of memory in such a data structure!
I've got an idea that if we implement it by handing back proxy iterators that the container itself controls, you can check them to ensure none point to the item that needs to be reclaimed.
And of course, given lock free data structures are so valuable, even taking a new approach on say, a skip list or perhaps some cache friendly trie, will guarantee you a PHD with favorable remarks!
