Package org.matsim.core.utils.collections
-
Interface Summary Interface Description MapUtils.Factory<T> QuadTree.Executor<T> RouterPriorityQueue<E> An interface for classes that can be used as priority queue. -
Class Summary Class Description ArrayMap<K,V> Memory-optimized map, backed by two simple arrays, for storing a small number of entries.CollectionUtils IdentifiableArrayMap<S,T extends Identifiable<S>> Memory-optimized map, backed by a simple array, for storing small number ofIdentifiables.MapUtils Utils class for the common pattern of creating an entry in a map if nothing is associated to the requested key.MapUtils.DefaultFactory<T> Helper class, to use as a factory if objects should be instanciated using their parameter-less constructor.PseudoRemovePriorityQueue<E> A simple re-implementation of a priority queue that offers a much better performance forremoveoperations than the standardPriorityQueue, but uses more memory to manage the data.
The actual implementation is backed by a standardPriorityQueue.QuadTree<T> An implementation of a QuadTree to store data assigned to geometric points.QuadTree.Leaf<T> QuadTree.Node<T> QuadTree.Rect QuadTrees Tuple<A,B> A Tuple stores two values (a "pair") and respects their order.