public class CS301LinearProbingHashST {

private static final int INIT_CAPACITY = 4;

private int N; // number of key-value pairs in the symbol table

private int M; // size of linear probing table

private K[] keys; // the keys

private V[] vals; // the values

private int putCount; // for experimental data collection

private int getCount; //

// create an empty hash table - use 16 as default size

public CS301LinearProbingHashST() {

this(INIT_CAPACITY);

}