[DanielCortez]

Quote:

Originally Posted by Incognito I've only tested integers, but here's what I got by allocating 100,000 unique elements:

Actually you can't create more than 2000 SVars.
There's no info about that on the wiki, but I've made this test:

pawn Код:

#include <a_samp>

main()
{
    static const svar_name_prefix[] = "svar";
    new svar_name[sizeof(svar_name_prefix) + 11];
    svar_name = svar_name_prefix;
    for (new i = 0; i < cellmax; ++i)
    {
        valstr(svar_name[4], i);
        new result = SetSVarInt(svar_name, i);
        printf("SVar: %s | Value: %d", svar_name, GetSVarInt(svar_name));
        if (0 == result)
        {
            printf("SVars limit: %d", i);
            break;
        }
    }
}

Output:

Код:

SVar: 0 | Value: 0
SVar: 1 | Value: 1
...
SVar: 1999 | Value: 1999
SVar: 2000 | Value: 0
SVars limit: 2000

Loop starts at 0 and at i = 2000 SetSVarInt returns 0 because it can't create more than 2000 SVars. GetSVarInt returns 0 as well because SVar "svar2000" was not created.