I was reading through parts of my blog looking for one specific post and came across one of my favourite posts on my website. I'm referring to this one here. This post discussed a form of code optimisation that can be carried out before compilation in some languages including ZPE/YASS.
Specifically, this post discussed performance differences between using variables where a length value (in this case the number of items in a list) is stored in a variable versus inline function calls to check the size of that list each iteration of the loop. It is understandable that the former would have lower latency and indeed lower memory consumption.
After reading the post again, I thought I'd try it with the newest version of ZPE. At first, my thoughts were it was going to be slower because of the compilation time being increased to allow for compiler optimisation that the new ZPE offers. I was wrong.
ZPE 1.8.5 is considerably faster on both for loops provided in the example, performing only slightly better in the user optimised version.
Results for the first for loop in ZPE 1.8.5 were:
real 0m0.454s
user 0m1.016s
sys 0m0.118s
Compared with 2016's 1.4.2E, which got:
real 0m2.071s
user 0m2.914s
sys 0m0.455s
