Well I found that an extension named "Array" is efficent and it can hold a table greater than 2000x2000. The only problem is that, when I try to make such array, it takes some minutes to fill it.
I made it this way:
Code:
Start of frame:
-> (General) Start loop "x" 2000 times
On loop "x":
-> (General) Start loop "y" 2000 times
On loop "y":
-> (Array) Write Value 1 to (LoopIndex("x"), LoopIndex("y"))
Upon pressing "Enter":
-> (Counter) Set Counter to ValueAtXY("Array", 1990, 1822)
I was testing in C/C++ (compiling under linux gcc) how much time will get filling greater table:
Code:
#include <cstdlib>
#include <iostream>
#include <stdint.h>
int main ( int argc, char** argv )
{
int32_t wynMax = 11145;
int64_t** tabeleczka = new int64_t*[wynMax];
for(int32_t x = 0; x < wynMax; x++)
{
tabeleczka[x] = new int64_t[wynMax];
for(int32_t y = 0; y < wynMax; y++)
tabeleczka[x][y] = 1;
}
std::cout << "Got it: " << tabeleczka[wynMax / 2][wynMax / 2] << std::endl;
for(int32_t x = 0; x < wynMax; x++)
delete[] tabeleczka[x];
delete[] tabeleczka;
return 0;
}
MMF2 was lagging some minutes with loop in loop x2000. C/C++ was lagging few seconds with loop in loop x11145. This is a few strange... :P
Is it possible that virtualization, I mean virtualbox will make it some laggy? There is no way I can use MMF2 different way than under virtualized windows.
I noticed also the fast loop object got a little more laggy that mmf's fast loop. The assarray object was VERY laggy, a lot of more than array.
However, is there anyone who could help me with topic question?