package edu.berkeley.sbp.util;
import java.util.*;
-/** a mapping from keys of type <tt>K</tt> to <i>sets</i> of values of type <tt>T</tt> */
-public final class IntPairMap<V> {
+// FEATURE: make this faster (plenty of ways: quadradic probing hash table is one)
+/** a sparse mapping from pairs of <tt>int</tt>'s to <tt>V</tt>'s */
+public final class IntPairMap<V> implements Iterable<V> {
private final HashMap<Long, V> hm = new HashMap<Long, V>();
public Iterable<V> values() { return hm.values(); }
public int size() { return hm.size(); }
public void toArray(V[] v) { hm.values().toArray(v); }
+ public Iterator<V> iterator() { return hm.values().iterator(); }
}