04.03.2013, 01:58
Hi, since pawn does not have dynamic arrays or matrices I need a clue on how to do this (what title says), can you help me?
What I need to do is read something from a SQL database (actually I know how to do this) and then store it in a [n][m] matrix, where n is the index of the row and m are the number of data fields, 'n' and 'm' are not constant values (and there is my problem, the size values for a array or a n-dimensional array are always constant values in pawn), specially n.
The fact is avoid any kind of memory waste or unnecesary memory usage, because the only solution I've thought and makes sense to me is making sufficiently big arrays to ensure there always be enough space to store data from an always-changing database data.
Thanks in advance for read and if you have any kind of solution for my problem please reply this topic.
What I need to do is read something from a SQL database (actually I know how to do this) and then store it in a [n][m] matrix, where n is the index of the row and m are the number of data fields, 'n' and 'm' are not constant values (and there is my problem, the size values for a array or a n-dimensional array are always constant values in pawn), specially n.
The fact is avoid any kind of memory waste or unnecesary memory usage, because the only solution I've thought and makes sense to me is making sufficiently big arrays to ensure there always be enough space to store data from an always-changing database data.
Thanks in advance for read and if you have any kind of solution for my problem please reply this topic.