Indicate a hash table that places data for any 15 (key, value)pair.
(Use SeparationChainingHashST.java on Folder Test to resolveconflicts.)
SeparationChainingHashST.java
public class SeparateChainingHashST<Key, Value> {
private static final int INIT_CAPACITY = 4;
// largest prime <= 2^i for i = 3 to 31
// not currently used for doubling and shrinking
// private static final int[] PRIMES = {
// 7, 13, 31, 61, 127, 251, 509, 1021, 2039, 4093, 8191,16381,
// 32749, 65521, 131071, 262139, 524287, 1048573, 2097143,4194301,
// 8388593, 16777213, 33554393, 67108859, 134217689,268435399,
// 536870909, 1073741789, 2147483647
// };
private int N; // number of key-value pairs
private int M; // hash table size
private SequentialSearchST<Key, Value>[] st; // array oflinked-list symbol tables
/*
PayPal Gateway not configured
PayPal Gateway not configured