Comment Re:Bad summary, refactoring not optimization (Score 1) 156
Hmm... this doesn't look at all appealing to me.
As far as I can tell, this only works if you can accurately recreate the exact circumstances for each run, because under normal usage it is quite possible that a refactoring that seems slower, is actually faster but has to process a larger workset. As a programmer I'd be pretty unhappy if my compiler decided to rebel and reverse my O(n^4) refactoring back to the O(n^y) version because I happened to have a smallish y in the first run (so it seemed like an O(n^3) algorithm). Now, for most programs it's not a big deal because you're just reading something from the database. But you better hope the database doesn't get a hiccup or your code may be re-refactored behind your back.
Basically, this looks like IBM's version of Clippy, for programmers.