import java.util.Iterator; import java.util.function.Supplier; /** * 1. help to implement a generic chaining hashtable. You may not * restrict the size of the input domain (i.e., it must accept * any key) or the number of inputs (i.e., it must grow as necessary). * 3. Your HashTable should rehash as appropriate (use load factor as * shown in class!). * 5. HashTable should be able to resize its capacity to prime numbers for more * than 200,000 elements. After more than 200,000 elements, it should * continue to resize using some other mechanism. * 6. We suggest you hard code some prime numbers. You can use this * list: http://primes.utm.edu/lists/small/100000.txt * NOTE: Do NOT copy the whole list! * 7. When implementing your iterator, you should NOT copy every item to another * dictionary/list and return that dictionary/list's iterator. */ public class ChainingHashTable extends DeletelessDictionary { private Supplier> newChain; public ChainingHashTable(Supplier> newChain) { this.newChain = newChain; } @Override public V insert(K key, V value) { throw new NotYetImplementedException(); } @Override public V find(K key) { throw new NotYetImplementedException(); } @Override public Iterator> iterator() { throw new NotYetImplementedException(); } }