内存泄漏在C++

Question

以下类继承是代码片段：

​​

}

[更新]：

class Hashtable 
{ 

private : 

//counts the number of elements added into the hashtable 
unsigned int count_elements_added; 

//counts the number of elements removed from the hashtable 
unsigned int count_elements_removed; 

//counts the number of elements present in the hashtable 
unsigned int count_elements_present; 

//sets the size of the hashtable 
unsigned int hashtable_size; 

//the data structure (vector) that contains the objects 
//the position on the hastable is defined by 2 keys 
//one the position in the array of the hashtable : the start of the node is used 
//the second is the first element in the pair present in the hash table //end of the node is used 
std :: vector< std :: vector<std :: pair<int,int> > > hashtable; 

//intialize the hashtable 
void intialize_hashtable(); 

//checks whether the hashtable is corrupted or not 
//returns true,if the hashtable is corrupted 
//else returns false 
bool is_corrupt(); 

public : 

Hashtable() 
{ 
    hashtable_size = DEFAULT_HASHTABLE_SIZE; 
    hashtable.clear(); 
    intialize_hashtable(); 

    //counts the number of elements added into the hashtable 
    count_elements_added = 0; 

    //counts the number of elements removed from the hashtable 
    count_elements_removed = 0; 

    //counts the number of elements present in the hashtable 
    count_elements_present = 0; 
}; 

Hashtable(int hash_table_size) 
{ 
    hashtable.clear(); 
    hashtable_size = hash_table_size; 
    intialize_hashtable(); 

    //counts the number of elements added into the hashtable 
    count_elements_added = 0; 

    //counts the number of elements removed from the hashtable 
    count_elements_removed = 0; 

    //counts the number of elements present in the hashtable 
    count_elements_present = 0; 
}; 

//add elemnet to the hashtable 
void add_element(int key,int object_identifier,int object_info); 

//given the key and the object identifier 
//returns the object info 
int get_element(int key,int object_identifier); 

//delete the element from the hashtable 
void remove_element(int key,int object_identifier); 

//prints the contents of the hashtable 
void print(); 

~Hashtable() 
{ 
    hashtable_size = 0; 
    hashtable.clear(); 

    //counts the number of elements added into the hashtable 
    count_elements_added = 0; 

    //counts the number of elements removed from the hashtable 
    count_elements_removed = 0; 

    //counts the number of elements present in the hashtable 
    count_elements_present = 0; 

}; 
}; 

create_size_one_nodes的目的在主创建。 但是当它超出范围时，内存不会被释放。

Create_size_one_Nodes create_size_one_Nodes_object; 
create_size_one_Nodes_object.create_nodes_size_one(); 

我无法删除delete（nodes_hastable）中的内存。 valgrid指出代码中有泄漏。 的vakgrind输出为：

==16451== 27,692 (28 direct, 27,664 indirect) bytes in 1 blocks are definitely lost in loss record 7 of 7 
==16451== at 0x402A208: operator new(unsigned int, std::nothrow_t const&) (in /usr/lib/valgrind/vgpreload_memcheck-x86-linux.so) 
==16451== by 0x80E05FF: Adjacency_list::create_nodes_hashtable() (adjacency_list.cpp:75) 

请指导我如何删除此内存泄漏

Answer 1

您需要提供一些额外的信息。

什么类型是nodes_hashtable？ creat_nodes_hashtable方法。

可能有几件事情错的，但没有更多的信息，这是不可能知道：

一）nodes_hashtable确实是一个数组，并dealocate将delete[] nodes_hashtable;

B中的正确方法）create_nodes_hashtable实际上是做多我们不知道的分配，还是分配东西，而不是分配给nodes_hashtable或其他。

问候， 五SEGUI

Answer 2

• 让基类的析构函数虚拟

• 你实际上并不需要删除nodes_hashtable这里，因为它是只分配create_nodes_hashtable时（）函数被调用，即做Create_size_one_Nodes析构函数里面

  //after the adjcency list has been created //clears the contents of the adjacency list ~Adjacency_list() { /* delete here is not required as create_nodes_hashtable() is not called inside this class. Ideally whoever allocated memory should free.But No harm if you keep */ delete(nodes_hashtable);
nodes_hashtable = NULL; }