Merge branch 'master' of gitlab.cs.washington.edu:cse332-19au/p2

src/datastructures/dictionaries/ChainingHashTable.java

@@ -21,6 +21,9 @@ import cse332.interfaces.misc.Dictionary;
  * 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<K, V> extends DeletelessDictionary<K, V> {
     private Supplier<Dictionary<K, V>> newChain;  

src/datastructures/dictionaries/MoveToFrontList.java

@@ -16,7 +16,9 @@ import cse332.interfaces.misc.DeletelessDictionary;
  * 4. You need to implement an iterator. The iterator SHOULD NOT move
  *    elements to the front.  The iterator should return elements in
  *    the order they are stored in the list, starting with the first
- *    element in the list.
+ *    element in the list. When implementing your iterator, you should 
+ *    NOT copy every item to another dictionary/list and return that 
+ *    dictionary/list's iterator. 
  */
 public class MoveToFrontList<K, V> extends DeletelessDictionary<K, V> {
     @Override