/* * This program is free software: you can redistribute it and/or modify it under * the terms of the GNU General Public License as published by the Free Software * Foundation, either version 3 of the License, or (at your option) any later * version. * * This program is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more * details. * * You should have received a copy of the GNU General Public License along with * this program. If not, see . */ package com.l2jserver.gameserver.pathfinding; public abstract class AbstractNode { private AbstractNodeLoc _loc; private AbstractNode _parent; public AbstractNode(AbstractNodeLoc loc) { _loc = loc; } public void setParent(AbstractNode p) { _parent = p; } public AbstractNode getParent() { return _parent; } public AbstractNodeLoc getLoc() { return _loc; } public void setLoc(AbstractNodeLoc l) { _loc = l; } /** * @see java.lang.Object#hashCode() */ @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((_loc == null) ? 0 : _loc.hashCode()); return result; } /** * @see java.lang.Object#equals(java.lang.Object) */ @Override public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (!(obj instanceof AbstractNode)) return false; final AbstractNode other = (AbstractNode) obj; if (_loc == null) { if (other._loc != null) return false; } else if (!_loc.equals(other._loc)) return false; return true; } }