Pawn compiler
#10

Quote:
Originally Posted by ******
Посмотреть сообщение
No, memory is not limitless, but we're not talking about ALL memory, we're only talking about stack and heap memory. This is allocated when a function begins and destroyed when a function ends, as long as you know what functions are called and what variables are in functions, you should never run out of memory because it is constantly being freed and there is a static upper bound. The issue here is that the upper bound is higher than the default, but can be very easilly reduced by, as I say, using smaller arrays and fixing recursion (which is not an issue here).
But what about global variables?
Reply


Messages In This Thread
Pawn compiler - by gaby_creed - 18.05.2012, 08:27
Re: Pawn compiler - by Shadow_ - 18.05.2012, 08:41
Re: Pawn compiler - by gaby_creed - 18.05.2012, 08:46
Re: Pawn compiler - by Vince - 18.05.2012, 09:26
Re: Pawn compiler - by MP2 - 18.05.2012, 09:31
Re: Pawn compiler - by MP2 - 18.05.2012, 09:57
Re: Pawn compiler - by gaby_creed - 18.05.2012, 11:24
Re: Pawn compiler - by TheArcher - 18.05.2012, 11:49
Re: Pawn compiler - by gaby_creed - 18.05.2012, 12:34
Re: Pawn compiler - by MP2 - 18.05.2012, 21:52

Forum Jump:


Users browsing this thread: 4 Guest(s)