[Papero]

Hi,
Is there a way to do this:

Player A is near to Player B > Do somethink
Player A is no longer near to Player B > Do somethink

[Mitchell]

You could do a multidimensional array:
bool plyNearAnother[MAXPLAYERS+1][MAXPLAYERS+1];
Then OnPlayerRunCmd store the m_vecOrigin of the client
then loop through the rest of the clients and compare the positions together using GetVectorDistance to get their distance.
If plyNearAnother[client][other] == true && distance > MaxDistance: // Player left the distance of the other.
If plyNearAnother[client][other] == false && distance <= MaxDistance: // Player is now close to the other player.

[starsfan]

Originally Posted by Papero Hi, Is there a way to do this: Player A is near to Player B > Do somethink Player A is no longer near to Player B > Do somethink

Do you still need help with this?

[Papero]

Maybe but i saw that you are banned then...
I wasn't working on that project xD

[fakuivan]

Originally Posted by Mitchell You could do a multidimensional array: bool plyNearAnother[MAXPLAYERS+1][MAXPLAYERS+1]; Then OnPlayerRunCmd store the m_vecOrigin of the client then loop through the rest of the clients and compare the positions together using GetVectorDistance to get their distance. If plyNearAnother[client][other] == true && distance > MaxDistance: // Player left the distance of the other. If plyNearAnother[client][other] == false && distance <= MaxDistance: // Player is now close to the other player.

You might want to compare the distance as a power of 2, to avoid potentially doing (MAXPLAYERS+1)*(MAXPLAYERS+1)*10 square roots a second.

[SHUFEN]

Originally Posted by fakuivan You might want to compare the distance as a power of 2, to avoid potentially doing (MAXPLAYERS+1)*(MAXPLAYERS+1)*10 square roots a second.

We don't need to care load of computations if set false to param3 of GetVectorDistance, i think.

[fakuivan]

GetVectorDistance' third parameter is ``squared``, if you set it to false, you'll need to square the number that you are comparing against (just once tho). This effectively cuts the number of square roots calculated to 0. That's exactly what I said on the previous post.

[Mitchell]

Originally Posted by fakuivan You might want to compare the distance as a power of 2, to avoid potentially doing (MAXPLAYERS+1)*(MAXPLAYERS+1)*10 square roots a second.

I never actually gave an code example of GetVectorDistance.