Homework/HW05/main.cc
void increment(HashTable &indexing, string word)
{
    //Declare a new WordCounter and set it equal to the passed in word.
    WordCounter wordc = word;

    //Attempt remove word from the table.
    if (indexing.remove(wordc, word))
        //If word was found in the table, increment its count of the word.
        wordc.increment();

    //Insert wordc into the hash table.  If it was found previously, it will have a count > 1, if
    //not, it will be inserted for the first time with a count of 1.
    indexing.insert(wordc);
}
/****************************** increment **********************************************************
Action:         Increments the indexing of the given word in the table.  This means that if the word
                can't be found in the table, then it will be inserted with a count of 1.  Otherwise
                the word will be removed from the table, the count will be incremented, and the word
                will be reinserted with the new count.

Parameters:
IN/OUT:         HashTable &indexing, holds a reference to the hash table which will be looked at to
                find the word.  Regardless of whether the word is found, the table will be updated.
IN:             string word, contains the word that will be searched for and incremented if found or
                inserted with a count of 1 if not.

Returns:        Nothing

Precondition:   None
***************************************************************************************************/
increment
Action:         Increments the indexing of the given word in the table.  This means that if the word
can't be found in the table, then it will be inserted with a count of 1.  Otherwise
the word will be removed from the table, the count will be incremented, and the word
will be reinserted with the new count.

IN/OUT:         HashTable &indexing, holds a reference to the hash table which will be looked at to
find the word.  Regardless of whether the word is found, the table will be updated.
IN:             string word, contains the word that will be searched for and incremented if found or
inserted with a count of 1 if not.

Nothing

None
increment Action : Increments the indexing of the given word in the table . This means that if the word can ' t be found in the table then it will be inserted with a count of 1 . Otherwise the word will be removed from the table the count will be incremented and the word will be reinserted with the new count . IN / OUT : HashTable &indexing holds a reference to the hash table which will be looked at to find the word . Regardless of whether the word is found the table will be updated . IN : string word contains the word that will be searched for and incremented if found or inserted with a count of 1 if not . Nothing None
void increment(HashTable &indexing, string word)
{
    WordCounter wordc = word;
    if (indexing.remove(wordc, word))
        wordc.increment();
    indexing.insert(wordc);
}
void increment ( HashTable & indexing , string word ) { WordCounter wordc = word ; if ( indexing . remove ( wordc , word ) ) wordc . increment ( ) ; indexing . insert ( wordc ) ; }
increment
Action:         Increments the indexing of the given word in the table.
increment Action : Increments the indexing of the given word in the table .
//Declare a new WordCounter and set it equal to the passed in word. //Attempt remove word from the table. //If word was found in the table, increment its count of the word. //Insert wordc into the hash table.  If it was found previously, it will have a count > 1, if //not, it will be inserted for the first time with a count of 1.