I'm not sure if this ever going to get updated.
![Undecided :-\](https://www.omnimaga.org/Smileys/classic/undecided.gif)
Now that Axe has peephole optimizations, counting the speed and size of code is more complex and requires knowledge of assembly to take advantage of the peephole optimizations. But a big reason for creating this guide was so you didn't need knowledge of assembly to know how fast/large code will be.
Not counting peephole optimizations, most figures in the latest version of this guide (0.5.3) are still pretty accurate. If you have any questions about the speed/size of specific routines or blocks of code, feel free to ask.
EDIT: Maybe I should make a general Axe optimization help thread...