diff --git a/src/main/java/datastructures/dictionaries/ChainingHashTable.java b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
index aa068edeff0bd7e6dc318f52210b1dca42894d9e..1e82af3748be4f8acbc8c397a3240bb3b664d837 100644
--- a/src/main/java/datastructures/dictionaries/ChainingHashTable.java
+++ b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
@@ -10,17 +10,17 @@ import java.util.function.Supplier;
 
 /**
  * - You must 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).
+ *   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).
+ *
  * - Your HashTable should rehash as appropriate (use load factor as
- * shown in class!).
- * - 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.
- * - You should use the prime numbers in the given PRIME_SIZES list to resize
- * your HashTable with prime numbers.
+ *   shown in class!).
+ *
+ * - HashTable must resize its capacity into prime numbers via given PRIME_SIZES list.
+ *   Past this, it should continue to resize using some other mechanism.
+ *
  * - When implementing your iterator, you should NOT copy every item to another
- * dictionary/list and return that dictionary/list's iterator.
+ *   dictionary/list and return that dictionary/list's iterator.
  */
 public class ChainingHashTable<K, V> extends DeletelessDictionary<K, V> {
     private Supplier<Dictionary<K, V>> newChain;