Thread: Dont go near.[pi]

Or you could just do this...

Originally Posted by Stewie1million

Or you could just do this...

I would like my idea better

Why would you ever need this.

Originally Posted by Magermen10

Why would you ever need this.

make it to me / help me create it and ill show you?



Maybe i make quest of it aswell, im creative

bump

bump

Originally Posted by L__A

Code:

Player.java

	public int blockedDistance;

	public void checkWithinBlockedLocation(Client o) {
		int distance = o.blockedDistance;
		if (c.absX > (o.absX - distance)) {
			c.absX = (o.absX - distance);
			return;
		}
		if (c.absX < (o.absX + distance)) {
			c.absX = (o.absX + distance);
			return;
		}
		if (c.absY > (o.absY - distance)) {
			c.absY = (o.absY - distance);
			return;
		}
		if (c.absY < (o.absY + distance)) {
			c.absY = (o.absY + distance);
			return;
		}
	}
	
Walking.java

	for (int i = 0; i < Server.playerHandler.players.length; i++) {
		Client o = (Client) Server.playerHandler.players[i];
		checkWithinBlockedLocation(o);
	}
	
Commands.java

	if (playerCommand.equalsIgnoreCase("setblocked")) {
		String[] args = playerCommand.split(" ");
		int distance = Integer.parseInt(args[1]);
		c.blockedDistance = distance;
	}

Not tested, should work, though.

but not rly suggesting adding that... because it will loops every time while a player walks... = lagg..