Our group plans on using Chris Zeiders' code it appears to be the most adaptable to the project's new features. It uses a quasi-good implementation of STL and iterators that can be further modified to include the new specifications.

To adhere to the input change, we'll need to re-work how we read in the commands from the command line. Firstly, refactor the code into a separate class. Then write code to create an object based on what's on the command line and work from there. Changing the code to sort based on a variety of characteristics should be farily straightforward--just involving more overloading of the comparitor to compar between various characteristics. A negator can be implemented to handle the reverses. Sorting based on count will need to take a little reworking because as of now the program does not keep track of the frequency of a word. Maybe we'll change the data structure to a map or perhaps add this characterstic to the strcut of words. A file excluding lists can be checked before the keywords are pushed onto the vector. For the output, we'll probably need to do a lot of reworking. We're a little unclear about HTML coding, but that shouldn't be too difficult. This can be implemented by writing an output iterator and overloading the << operation. Printing the words in context should not be too difficult, utilizing STL by writing the code in an iterator. Restricting how many times a keyword is printed might be a little tough, but that can be done by mapping the keywords printed out and verifying that the count does not exceed the limit.