In your workspace, make sure you have the latest homework files from
the base repository. This will create a hw11 directory in which you
will do your work.
Copy these files from hw10 to the hw11 directory: Word.java,
WordNode.java, WordList.java, Driver.java.
Spend some time looking at this discussion of ways to properly
override .equals() for a Java object:
Now that you have a way to test two Word objects for
equality we will go ahead and implement search and remove. Start with
by uncommenting the search method in WordList.java.
Modify the search routine so that it returns a reference to a
found Word object (rather than to a WordNode). Also,
make use of your .equals() method.
Test the search() method by making appropriate adjustments
in the driver. Once you are convinced it works: document and commit.
Now turn your attention to the remove() method and go through
similar steps to get it working.
Test, document, commit, push.
Now that you have a fully working WordList class we will
inherit from it to create a specialized list that we will use to
investigate the prevalence of anagrams in a dictionary file.
Use the remainder of lab time to read the homework and begin
work on the described LinkedDictionary class.