001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
package algs34;
import stdlib.*;
import algs13.Queue;
import algs31.SequentialSearchST;
/* ***********************************************************************
 *  Compilation:  javac SeparateChainingHashST.java
 *  Execution:    java SeparateChainingHashST
 *
 *  A symbol table implemented with a separate-chaining hash table.
 *
 *  % java SeparateChainingHashST
 *
 *************************************************************************/

public class SeparateChainingHashST<K, V> {
  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<K, V>[] st;  // array of linked-list symbol tables


  // create separate chaining hash table
  public SeparateChainingHashST() {
    this(INIT_CAPACITY);
  }

  // create separate chaining hash table with M lists
  @SuppressWarnings("unchecked")
  public SeparateChainingHashST(int M) {
    this.M = M;
    st = new SequentialSearchST[M];
    for (int i = 0; i < M; i++)
      st[i] = new SequentialSearchST<>();
  }

  // resize the hash table to have the given number of chains b rehashing all of the keys
  private void resize(int chains) {
    SeparateChainingHashST<K, V> temp = new SeparateChainingHashST<>(chains);
    for (int i = 0; i < M; i++) {
      for (K key : st[i].keys()) {
        temp.put(key, st[i].get(key));
      }
    }
    this.M  = temp.M;
    this.N  = temp.N;
    this.st = temp.st;
  }

  // hash value between 0 and M-1
  private int hash(K key) {
    return (key.hashCode() & 0x7fffffff) % M;
  }

  // return number of key-value pairs in symbol table
  public int size() {
    return N;
  }

  // is the symbol table empty?
  public boolean isEmpty() { return size() == 0; }

  // is the key in the symbol table?
  public boolean contains(K key) { return get(key) != null; }

  // return value associated with key, null if no such key
  public V get(K key) {
    int i = hash(key);
    return st[i].get(key);
  }

  // insert key-value pair into the table
  public void put(K key, V val) {
    if (val == null) { delete(key); return; }

    // double table size if average length of list >= 10
    if (N >= 10*M) resize(2*M);

    int i = hash(key);
    if (!st[i].contains(key)) N++;
    st[i].put(key, val);
  }

  // delete key (and associated value) if key is in the table
  public void delete(K key) {
    int i = hash(key);
    if (st[i].contains(key)) N--;
    st[i].delete(key);

    // halve table size if average length of list <= 1
    if (M > INIT_CAPACITY && N <= 2*M) resize(M/2);
  }

  // return keys in symbol table as an Iterable
  public Iterable<K> keys() {
    Queue<K> queue = new Queue<>();
    for (int i = 0; i < M; i++) {
      for (K key : st[i].keys())
        queue.enqueue(key);
    }
    return queue;
  }


  /* *********************************************************************
   *  Unit test client.
   ***********************************************************************/
  public static void main(String[] args) {
    SeparateChainingHashST<String, Integer> st = new SeparateChainingHashST<>();
    for (int i = 0; !StdIn.isEmpty(); i++) {
      String key = StdIn.readString();
      st.put(key, i);
    }

    // print keys
    for (String s : st.keys())
      StdOut.println(s + " " + st.get(s));

  }

}