package edu.berkeley.sbp.util;
import java.util.*;
// 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 */
package edu.berkeley.sbp.util;
import java.util.*;
// 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 Iterable<V> values() { return hm.values(); }
public int size() { return hm.size(); }
public void toArray(V[] v) { hm.values().toArray(v); }
public Iterable<V> values() { return hm.values(); }
public int size() { return hm.size(); }
public void toArray(V[] v) { hm.values().toArray(v); }