diff --git a/src/main/java/datastructures/dictionaries/ChainingHashTable.java b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
index 1e82af3748be4f8acbc8c397a3240bb3b664d837..f3ae0a116d2715c0955e6673f46d052e01accc1d 100644
--- a/src/main/java/datastructures/dictionaries/ChainingHashTable.java
+++ b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
@@ -13,11 +13,11 @@ import java.util.function.Supplier;
  *   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
+ * - ChainingHashTable should rehash as appropriate (use load factor as
  *   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.
+ * - ChainingHashTable must resize its capacity into prime numbers via given PRIME_SIZES list.
+ *   Past this, it should continue to resize using some other mechanism (primes not necessary).
  *
  * - When implementing your iterator, you should NOT copy every item to another
  *   dictionary/list and return that dictionary/list's iterator.