1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162 |
- /*
- * 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 <http://www.gnu.org/licenses/>.
- */
- package com.l2jserver.gameserver.pathfinding.utils;
- import java.util.ArrayList;
- import java.util.Map;
- import com.l2jserver.gameserver.pathfinding.Node;
- import javolution.util.FastMap;
- /**
- *
- * @author Sami
- */
- public class CellNodeMap
- {
- private Map<Integer, ArrayList<Node>> _cellIndex;
-
- public CellNodeMap()
- {
- _cellIndex = new FastMap<Integer, ArrayList<Node>>();
- }
-
- public void add(Node n)
- {
- if (_cellIndex.containsKey(n.getLoc().getY()))
- {
- _cellIndex.get(n.getLoc().getY()).add(n);
- }
- else
- {
- ArrayList<Node> array = new ArrayList<Node>(5);
- array.add(n);
- _cellIndex.put(n.getLoc().getY(), array);
- }
- }
- public boolean contains(Node n)
- {
- ArrayList<Node> array = _cellIndex.get(n.getLoc().getY());
- if (array == null)
- {
- return false;
- }
- for (Node node : array)
- if(node.equals(n))
- return true;
- return false;
- }
- }
|