[E1_531G]

Hello.

I have 2 questions:
1. Suppose we have this code:

PHP Code:

public plugin_end()
{
   for(new i = 1; i <= MAX_PLAYERS; i++ )
       someHeavyFunc(i)
} 


The question is: Will the server wait untill all the code is executed? I mean, will the server wait all time that the code requires? (1 second, 5, 10, 10 minutes, ...)?

2. How does the nVault module look for an entry? I mean, how does it look at the keys?
The question is: Will saving using the ascending int as keys ("1", "2", ...) be more efficient than saving with keys based on players steam id?

Thank you all.

[edon1337]

1. Not sure what you meant, are you asking about whether the code that comes after the loop will execute before the loop has ended? If so, no.

PHP Code:

#include < amxmodx >

const iTo = 1000000000000000000000000000000000000000000000000000000000000000000000;

public plugin_init( )
{
    new iFrom;

    static szTime[ 10 ];
    get_time( "%r", szTime, charsmax( szTime ) );
    
    log_to_file( "Debug1.txt", "Start time: %s", szTime );

    while( iFrom >= iTo )
    {
        iFrom++;
    }

    EmptyString( szTime );
    get_time( "%r", szTime, charsmax( szTime ) );
    
    log_to_file( "Debug1.txt", "Finish time: %s", szTime );
}

EmptyString( szString[ ] )
szString[ 0 ] = EOS; 


Start time: 12:04:00 
Finish time: 12:04:04

[Ghosted]

1. Server will wait until your code will be executed fully
2. No matters there will be very tiny difference cause nVault uses string hashmap.

@edon1337, well that number is very big but it wont really execute as much, such number does not exist in system, in pawn scripting max number is C++ integer number which is 2,147,483,647 and minimum is -2,147,483,648

[edon1337]

Originally Posted by Ghosted 1. Server will wait until your code will be executed fully 2. No matters there will be very tiny difference cause nVault uses string hashmap. @edon1337, well that number is very big but it wont really execute as much, such number does not exist in system, in pawn scripting max number is C++ integer number which is 2,147,483,647 and minimum is -2,147,483,648

My point was to make it as long as I could, since I didn't know of this maximum num.

[OciXCrom]

const iTo = cellmax

[E1_531G]

2. No matters there will be very tiny difference cause nVault uses string hashmap.

So, to find the key "2" and find the key "STEAM_X:X:XXXXXX" will take the same time?

[klippy]

The difference is so tiny you can consider it being the same, yes.

[E1_531G]

Thank you all.
Solved.