@@ -0,0 +1,1247 @@
+/*%0AJeff Weeks%0ACSC 172%0ALab Section: M,W 6:15-7:30pm%0ALab TA: Ciaran Downey%0AAssignment: Project 3 (Word Search)%0A3/31/14 %0A*/%0A%0Apublic class HashChain implements MyLinkedList%7B%0A%0A%09private HashNode first;%0A%09%09%0A%09%09@Override%0A%09%09public void insert( Object x ) %7B // Runtime: O(1)%0A%09%09%09HashNode newNode = new HashNode();%0A%09%09%09newNode.data = x;%0A%09%09%09newNode.next = first;%0A%09%09%09first = newNode;%0A%09%09%7D%0A%0A%09%09@Override%0A%09%09public boolean lookup( Object x ) %7B // Runtime: O(n)%0A%09%09%09if ( isEmpty() ) return false;%0A%09%09%09HashNode current = first;%0A%09%09%09while ( current != null )%7B%0A%09%09%09%09if ( current.data.equals( x ) )%0A%09%09%09%09%09return true;%0A%09%09%09%09current = current.next;%0A%09%09%09%7D%0A%09%09%09return false;%0A%09%09%7D%0A%0A%09%09@Override%0A%09%09public boolean isEmpty() %7B // Runtime: O(1)%0A%09%09%09return first == null;%0A%09%09%7D%0A%0A%09%09@Override%0A%09%09public void printList() %7B // Runtime: O(n)%0A%09%09%09if ( isEmpty() ) return;%0A%09%09%09HashNode temp = first;%0A%09%09%09while ( temp != null )%7B%0A%09%09%09%09System.out.println( temp.data.toString() );%0A%09%09%09%09temp = temp.next;%0A%09%09%09%7D%0A%09%09%7D%0A%09%09%0A%09%09public int countList() %7B // Runtime: O(n)%0A%09%09%09int count = 0;%0A%09%09%09if ( isEmpty() ) return 0;%0A%09%09%09HashNode temp = first;%0A%09%09%09while ( temp != null )%7B%0A%09%09%09%09count++;%0A%09%09%09%09temp = temp.next;%0A%09%09%09%7D%0A%09%09%09return count;%0A%09%09%7D%0A%0A%09%09@Override%0A%09%09public void delete( Object x ) %7B%0A%09%09%09// TODO Auto-generated method stub%0A%09%09%7D%0A%7D%0A

Create HashChain.java