//code not completed /* insert(): inserts an item into the hash table - remove(): removes an item from the hash table by its key - merge(): merges the given hash table with the current one - count(): returns the number of elements in the hash table - getList(): returns the sorted linked list containing the elements that have the same key - find(): finds an element with a specific key */ public class Hash_List { private K[] keys; private V[] vals; private K[] newKeys; private V[] newVals; private int length = -1; private int i,j,l,m,n; private V val; //stack error causes here // private Hash_List newHash; private int size; public Hash_List(int _size) { this.keys = (K[]) new Object[_size]; this.vals = (V[]) new Object[_size]; this.length = -1; //or here //this.newHash = new Hash_List(_size); this.size = _size; } public void insert(K key,V val) { this.length++; this.keys[this.length] = key; this.vals[this.length] = val; } public int count() { return this.length; } public V find(K key) { for(j=0;j<=this.length;j++) { if(this.keys[j].equals(key)) { return this.vals[j]; } } return null; } //deprecated: causes stack overflow error public void remove(K key) { this.val = this.find(key); this.newKeys = (K[]) new Object[this.count()]; this.newVals = (V[]) new Object[this.count()]; for(m=0;m hash = new Hash_List(100); hash.insert(1,"one"); hash.insert(2,"two"); Hash_List roman = new Hash_List(100); roman.insert(3,"i") ; roman.insert(4,"ii"); hash.merge(roman); hash.printAll(); hash.remove(2); hash.printAll(); } }

HashTable java