The Big Programming Thread - Page 1011

public class SeparateChainingHashTable implements HashTable{

    /* ****************************************************************** */
    /* ***** PRIVATE FIELDS / METHODS PROVIDED TO YOU: DO NOT EDIT! ***** */
    /* ****************************************************************** */

    private KVPairList[] table;
    private int count;
    private PrimeGenerator primeGenerator;

    // We mask the top bit of the default hashCode() to filter away negative values.
    // Have to copy over the implementation from OpenAddressingHashTable; no biggie.
    private int hash(String key){
        return (key.hashCode() & 0x7fffffff) % table.length;
    }

    /* **************************************** */
    /*  IMPLEMENT THE FOLLOWING PUBLIC METHODS:  */
    /* **************************************** */
    /**
     *  Default constructor. Initializes the internal storage with a size equal to the default of {@link PrimeGenerator}.
     */
    public SeparateChainingHashTable(){
      /*We have to implement this constructor.  How do I instantiate table?  And what is it?
    }

public class KVPairList implements Iterable<KVPair>{

    private class Node {
        KVPair pair;
        Node next;

        Node(String key, String value, Node next){
            pair = new KVPair(key, value);
            this.next = next;
        }

        Node(String key, String value){
            this(key, value, null);
        }

    }

    private Node head, tail;
    private int count;

    /**
     * Default constructor. Initializes an empty {@link KVPairList}.
     */
    public KVPairList(){
        head = tail = null;
        count = 0;
    }

...
...
...