Background

• Notice that in the sample output shown on pp. 214-215 of the text, some of the page listings contains duplicate entries. A page number should only appear once in the page list for a given word.
• In the implementation shown in the text, the only words that will appear in LeaveOut are those that occur too often. Modify the Index() function so that it accepts an input file containing a list of words. The words in this file should be added to LeaveOut prior to processing the input document. The name of this file will be passed as a command line argument.
• Modify the Index() function so that it writes Master to a disk file rather than to the screen. The name of the output file will be passed as a command line argument.
• For simplicity, the implementation in the text considers only the first five characters in a word. You are to remove this limitation, so that all unique words are indexed.
• The text imposes a 40-character limit on the length of words. You are to remove this restriction, so that words of any length can be indexed.

Description

• The classes should conform to the course requirements on style, naming conventions, and documentation.
• The Bnode class should be in files Bnode.H and Bnode.C. The BinaryTree class should be in files BinaryTree.H and BinaryTree.C. The BST class should be in files BST.H and BST.C.
• Eliminate the use of typedef's.
• Only accessors and mutators should be inline.
• No implementation in the header file, with the exception of inline functions.
• There are two minor problems in the Predecessor() function:
  • There is a variable called found. It should be changed to success.
  • There is an extraneous semicolon at the end of the second line of the function body.
• Remove the restriction that the elements manipulated by BST objects are objects with integer key values. This eliminates the need for a Key() function and requires changing some of the function declarations:
  • T& Search (const T& elm, bool& success);
  • bool Delete (const T& elm);
  • T& Predecessor (const T& elm, bool& success);
  • T& Successor (const T& elm, bool& success);
  These are the only functions whose declarations will change, but other functions may also require changes to their implementation. In general, be sure that all comparisons are done on the tree elements directly rather than through an integer key.
• Currently, the code for printing a binary tree displays the elements inside of a set of parentheses, with commas separating the elements. Change the appropriate functions so that the elements are printed one per line, no commas and no parentheses. For example, a tree with three integer elements would display as: 17 23 36 instead of ( 17, 23, 36, )
• Test all changes to these classes before proceeding.

Create files WordRecord.H and WordRecord.C for the WordRecord class shown on page 211. Adapt the WordRecord class as follows:

• Use ArrayList (from the last project) rather than DynList.
• Eliminate the fixed-size character array used to store the word, and replace it with a char pointer (to dynamically allocated memory). This means you should also add a destructor, copy constructor, and overloaded assignment operator.
• Eliminate the Key() and MakeKey() functions and the associated data member.
• Add overloadings for the operators ==, !=, <, and >. All comparisons should be case insensitive.
• Modify the UpdatePages() function to eliminate duplicate entries from the page list for a word.
• Data members can be added to the private section of the class if needed.

In a file called Proj3_aux.C, write the Index() and ReadWord() functions. Modify the Index() function so that it has four parameters as follows:

• istream& input_file - input stream associated with the original text document
• istream& skip_file - input stream associated with the file containing list of words to ignore
• ostream& output_file - output stream associated with the output file
• int threshold - this parameter replaces the value that is currently a hard-coded constant

In a file called Proj3.C write a short main() that gets three file names and an integer from the command line, specified in the following order:

• The input document (plain ASCII text file with page breaks specified by the word PgBk; see p. 214 for an example)
• The file containing a list of words to ignore (assume one word per line)
• The output file
• The threshold value

The format of the output file should be one word per line, with each word followed by its list of page numbers on the same line. Words and page numbers should be separated by one or more spaces. See Sample Output below.

Summary of Tasks

1. Make sure your ArrayList class works and that it has an << operator defined.
2. Revise and test the Bnode, BinaryTree, and BST classes. Don't forget to add documentation.
3. Adapt the WordRecord class shown on page 211.
4. Write the Index() and other auxilliary functions in Proj3_aux.C.
5. In Proj3.C, write a main() that processes the command line arguments and calls Index().
6. Test, test, test! Be sure that you have successfully implemented all of the enhancements described in the Background section above.
7. The name of your executable should be Proj3.

Grading

Academic Integrity

Sample Output