To everyone in CS 362 ...

For the words assignment, you are not writing a hash table.
You are not implementing hash sets. You are using the hash set
container that is in an extension to the STL - Standard Template
Library. If you follow the example (very good idea to do so),
you will declare a hash set using the short name stringSet.

Look at the hashFcnStr.cpp example that I handed out March 31.
It shows:
- #include <ext/hash_set>
- using namespace __gnu_cxx;
- the stringHashFcns class object that has
     - a hash function that calls the hash function built into the
       library that contains the hash set
     - an equality operator for the strings
- a typedef that wraps this all in a neat package and lets us
  refer to the hash_set as stringSet

When I was writing this project, I copied my example code at
   http://cs.millersville.edu/~katz/cs362/examples/march31/hashFcnStr.cpp
from the 'using namespace std' line down to the 'int main' line and
pasted it into my growing program. I then trimmed out the 
printContainer code.

To declare a hash set of strings, write
   stringSet wordSet;

To declare a vector to hold the 20 hash sets of strings you will
fill with good words, use
   vector < stringSet > good(20);

To insert a word into the 3-letter good word hash set, write
   good[3].insert(word);

In case you missed class on Friday, you might want to know that
the words assignment is now due Thursday, April 14th at 11pm.
You might also want to look up what a heap is and how we store
a complete binary tree in an array/vector since I'm not going to
repeat Friday's lecture.

Ms. Katz