Is there a canonical way to reserve memory for a dynamic array?

When there are several slowly growing dynamical arrays I encountered severe 
performance drop (probably, they tried to overlap each other many times).

Setting estimated length and navigating with extra counter inside each of them 
(and growing by 10%+100 elements if needed) completely solved the problem.

This issue does not seem to be resolvable without manual memory preserving, is 
it possible to do it so that range checking will work and extra counters won't 
be needed?
_______________________________________________
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal

Reply via email to