public class OurHashMap { int numBuckets = 100; // Initial number of buckets. OurLinkedListMap[] table; // The hashtable. int numItems; // Keep track of number of items added. // Constructor. public OurHashMap (int numBuckets) { this.numBuckets = numBuckets; table = new OurLinkedListMap [numBuckets]; numItems = 0; } public void set (KeyValuePair kvp) { if ( contains (kvp.key) ) { return; } // Compute hashcode and therefore, which table entry (list). int entry = Math.abs(kvp.key.hashCode()) % numBuckets; // If there's no list there, make one. if (table[entry] == null) { table[entry] = new OurLinkedListMap (); } // Add to list. table[entry].set (kvp); numItems ++; } public boolean contains (String key) { // Compute table entry using hash function. int entry = Math.abs(key.hashCode()) % numBuckets; if (table[entry] == null) { return false; } // Use the contains() method of the list. return table[entry].contains (key); } public KeyValuePair get (String key) { // Similar to contains. int entry = Math.abs(key.hashCode()) % numBuckets; if (table[entry] == null) { return null; } return table[entry].get (key); } public KeyValuePair[] getAllKeyValuePairs () { if (numItems == 0) { return null; } KeyValuePair[] allPairs = new KeyValuePair [numItems]; int count = 0; for (int entry=0; entry