Homework/HW05/HashTable.cc
void HashTable::makeEmpty()
{
    for(int i=0; i<capacity; i++)
        storage[i].clear(); // delete all the nodes in the list
    numObjects = 0;
}
// Delete all the objects without deleting the storage.
Delete all the objects without deleting the storage.
Delete all the objects without deleting the storage .
void HashTable::makeEmpty()
{
    for(int i=0; i<capacity; i++)
        storage[i].clear(); 
    numObjects = 0;
}
void HashTable :: makeEmpty ( ) { for ( int i = 0 ; i < capacity ; i ++ ) storage [ i ] . clear ( ) ; numObjects = 0 ; }
Delete all the objects without deleting the storage.
Delete all the objects without deleting the storage .
// delete all the nodes in the list