/* This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (props, 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 org.opentripplanner.routing.core; import java.util.Arrays; import org.opentripplanner.routing.graph.AbstractVertex; import org.opentripplanner.routing.graph.Vertex; @SuppressWarnings("unchecked") public class VertexMap<T> { private T[] map; public VertexMap(int initialCapacity) { map = (T[]) new Object[initialCapacity]; } public VertexMap() { this(AbstractVertex.getMaxIndex()); } public void set(Vertex v, T elem) { int index = v.getIndex(); while (index > map.length) map = Arrays.copyOf(map, (int) (map.length * 1.5)); // T old = map[v.index]; map[v.getIndex()] = elem; } public T get(Vertex v) { return map[v.getIndex()]; } }