This is the catchphrase associated with the presentation given by Andrei Alexandrescu during boostcon 2009. I heard about that blasphemy a while ago, but I had neither the time, nor the interest to read it back then.
I finally read it today. You see, I was implementing an incidence graph (as defined by Boost Graph Library) yesterday; to do that one has to write an iterator that, for a given vertex, traverses a sequence of its outgoing edges. Since the graph was potentially very huge, it wasn’t represented explicitly. Instead, the set of adjacent vertices was calculated on-the-fly.