Hashtables

Create your labA directory, and copy the files below to it from the
class directory ~hardnett/pub/cis213/labA

Hashtable.h
Hashtable.cpp
Ulist.cpp
Ulist.h
namesets.cc
makefile 

Read the makefile and see how it works.  Rename the files appropriately.

Read over the Ulist.{h,cpp} files.  Notice the slight changes from our
previous code for unsorted lists.  These functions should be very familiar 
to you by now.

Read the existing code in Hashtable.{h,cpp}.  Notice how we are defining a 
class to represent a set.  We will use member functions rather than free
functions to define the operations.  Thus, instead of producing new lists, 
we are modifying an existing object.

Study the code for insert, remove and such.

**** Implement functions to do Intersection and Difference.****

You might use the "print_details" member function in your debugging, or
use it just for fun.

Fill in the missing code.  Hint: the code for unsorted lists will be
useful.  Your finished program should run like the example, "namesets."

submit your working code using the following:

% turnin cis213 labA