i have no idea

benaich · benaich · commit af2f539798c1 · 2015-01-04T18:27:14.000Z
diff --git a/HashTable/LinearProbing/LPHashTable.java b/HashTable/LinearProbing/LPHashTable.java
@@ -3,7 +3,7 @@
 import HashTable.HashTableInterface;
 import java.util.function.Function;
 
-public class HashTableLP<K, V> implements HashTableInterface<K, V> {
+public class LPHashTable<K, V> implements HashTableInterface<K, V> {
 
     private Node[] array;
     private Function<K, Integer> foh;
@@ -12,12 +12,12 @@ public class HashTableLP<K, V> implements HashTableInterface<K, V> {
     private int numCollisions = 0;
     private int numResizes = 0;
 
-    public HashTableLP() {
+    public LPHashTable() {
         array = new Node[INITIAL_TABLE_SIZE];
         foh = getHashingFunction();
     }
 
-    public HashTableLP(Function<K, Integer> f) {
+    public LPHashTable(Function<K, Integer> f) {
         array = new Node[INITIAL_TABLE_SIZE];
         foh = f;
     }
@@ -135,7 +135,7 @@ public void printGraph() {
 
     public static void main(String[] args) {
 
-        HashTableLP<String, String> ht = new HashTableLP<>();
+        LPHashTable<String, String> ht = new LPHashTable<>();
         ht.put("banana", "yellow");
         ht.put("apple", "green");
         ht.put("android", "green");
@@ -159,7 +159,7 @@ public static void main(String[] args) {
         ht.printStatus();
 
         // Testing
-        HashTableLP<String, String> table = new HashTableLP<>();
+        LPHashTable<String, String> table = new LPHashTable<>();
         for (int i = 0; i < 100000; i++) {
             table.put(HashTableInterface.randomString(), HashTableInterface.randomString());
         }
diff --git a/HashTable/SeparateChaining/SCHashTable.java b/HashTable/SeparateChaining/SCHashTable.java
@@ -3,7 +3,7 @@
 import HashTable.HashTableInterface;
 import java.util.function.Function;
 
-public class HashTableSC<K, V> implements HashTableInterface<K, V> {
+public class SCHashTable<K, V> implements HashTableInterface<K, V> {
 
     private Node[] array;
     private Function<K, Integer> foh;
@@ -12,12 +12,12 @@ public class HashTableSC<K, V> implements HashTableInterface<K, V> {
     private int numCollisions = 0;
     private int numResizes = 0;
 
-    public HashTableSC() {
+    public SCHashTable() {
         array = new Node[tableSize];
         foh = getHashingFunction();
     }
 
-    public HashTableSC(Function<K, Integer> f) {
+    public SCHashTable(Function<K, Integer> f) {
         array = new Node[tableSize];
         foh = f;
     }
@@ -164,7 +164,7 @@ public void printGraph() {
 
     public static void main(String[] args) {
 
-        HashTableSC<String, String> ht = new HashTableSC<>();
+        SCHashTable<String, String> ht = new SCHashTable<>();
         ht.put("banana", "yellow");
         ht.put("apple", "green");
         ht.put("android", "green");
@@ -189,7 +189,7 @@ public static void main(String[] args) {
         ht.printStatus();
         
         // Testing
-        HashTableSC<String, String> table = new HashTableSC<>();
+        SCHashTable<String, String> table = new SCHashTable<>();
         for (int i = 0; i < 100000; i++) {
             table.put(HashTableInterface.randomString(), HashTableInterface.randomString());
         }
