Thread: destructor for a hash Table

hi i am trying to write a destructor method for a hash table but i am having problems.My hash table contains a double linked list which i am only able to delete the linked list but not the table itself.

Code:

intHashTable::~intHashTable() {    for(int i=0;i<getSize();i++){
        delete table[i];


           }




}

Originally Posted by Elysia

You really have to show how your class actually looks like and explain why you must delete in the first place.
Dynamic arrays can be acquired with std::vector. Linked lists can be acquired with std::list.

i would like to delete my hash table thats what i am trying to do

Well if each element or bucket contains a doubly linked list then I suspect you have more issues than cleaning up. This is a hash table so if bucket 0 has a link to an object at bucket[10] when you clean up bucket 0 depending on your impl the pointer in bucket[10] could get cleaned up as well. This means that one of the links in bucket[10] is now pointing to invalid memory or 0xFEEEFEEE in MSVS and if you attempt to delete bucket[10] the program will crash. If you set the pointers to null after you delete it will fix the crash but it will not fix the potential memory leaks.

I've never heard of mixing a doubly linked list and a hash table and all I can say is it sounds like trouble.

As Elysia has mentioned we need to see more code to understand what you are trying to do and how we can further assist you.