Advertisement
Guest User

Untitled

a guest
Jul 22nd, 2017
57
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.90 KB | None | 0 0
  1. package com.rs2hd.packethandler;
  2.  
  3. import org.apache.mina.common.IoSession;
  4.  
  5. import com.rs2hd.event.Event;
  6. import com.rs2hd.model.Player;
  7. import com.rs2hd.model.World;
  8. import com.rs2hd.net.Packet;
  9. //import com.rs2hd.util.pathfinding.*;
  10. /**
  11. * Handles walking packets.
  12. * @author Graham for his 508 walk packethanlder and dragonkk for add routefind for 562
  13. *
  14. */
  15. public class WalkPacketHandler implements PacketHandler {
  16. @Override
  17. public void handlePacket(final Player player, Packet packet) {
  18. try {
  19. player.getActionSender().sendCloseChatboxInterface();
  20. player.getActionSender().sendCloseInventoryInterface();
  21. player.getActionSender().sendCloseInterface();
  22. player.homeTele = 0;
  23. player.DungeonShop = 0;
  24. player.getWalkingQueue().reset();
  25. player.resetSkills();
  26. player.IsFollowing = false;
  27. if(player.frozen > 0) {
  28. player.getActionSender().sendMessage("You are frozen!");
  29. player.getWalkingQueue().reset();
  30. return;
  31. }
  32. if(player.resting == true) {
  33. player.resting = false;
  34. player.animate(5748);
  35. }
  36. if (player.cantWalk == true)
  37. return;
  38. if(player.takingitem > 0) {
  39. return;
  40. }
  41. if(player.isBusy()) {
  42. return;
  43. }
  44. int size = packet.getLength();
  45. if(packet.getId() == 163) {
  46. size -= 14;
  47. }
  48. int steps = (size - 5) / 2;
  49. final int firstY = packet.readLEShort() - (player.getLocation().getRegionY() - 6) * 8;
  50. boolean runSteps = packet.readByteS() == 1;
  51. final int firstX = packet.readShort() - (player.getLocation().getRegionX() - 6) * 8;
  52. player.getWalkingQueue().setIsRunning(runSteps);
  53. player.getWalkingQueue().addToWalkingQueue(firstX, firstY);
  54. for(int i = 0; i < steps; i++) {
  55. player.getWalkingQueue().addToWalkingQueue(packet.readByte()+firstX, packet.readByteS()+firstY);
  56. }
  57. } catch(Exception e) {
  58. }
  59. }
  60.  
  61. private int[][] findRoute(Player p, int toX, int toY) {
  62. return new int[][] { new int[] { toX, toY } };
  63. }
  64. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement