Merry christmas and Obito

muzk wrote:

Anyways, it's gonna be constant complexity, nothing to care at all

Well a genetic algorithm runs in "constant" time but it's heavy computational. Complexity is something that one needs to take carely. For instance, Isertion Sort out performs Quicksort on sizes between (0,1000) but later grows slower (that's what complexity is about; growing). Here's a research paper which shows proves this hypothesis: Link The only thing I don't like about it, is it's sources but It looks quite combincing.

muzk wrote:

Quote :

That's in theory (if this would be C, Java then it's valid), but remember that vJass is not pure and insertion costs for every node in vJass's memory allocation rutine which is a bit expensive to be honest.

Anyways, it's gonna be constant complexity, nothing to care at all

Quote :

If you want to recycle timers. Use hookers instead, it will save you the need to care for calling the recycler:

How does hook works? (generated jass code)

For every CreateTimer() you normaly make, it will replace them with CreateTimer_Hook(). So you don't have to worry about calling the recycling functions. You can also apply that library for recycling anything like Groups, Forces, etc (not sure if cJass accepts Templates though, but textmacros should do).