#define TABLE_SIZE 100489 // must be a power of 2
typedef map<string,int> MAP_TYPE;
typedef pair<string, int> PAIR_TYPE;
class HashTable
{
public: //public functions
HashTable();
~HashTable();
int find(string);
bool insert(string, int);
private:
int hash(const char*);
vector<MAP_TYPE> v;
};
//HashTable constructor
HashTable::HashTable()
{
vector<MAP_TYPE> v; //initialize vector of maps
v.reserve(TABLE_SIZE); //reserve table size
MAP_TYPE m;
for (int i = 0; i < TABLE_SIZE; ++i) //fill vector with empty maps
v.push_back(m);
cout << v.size();
}
int HashTable::find(string key)
{
cout << "in find" << '\n';
//String to const char* for hash function
const char *c = key.c_str();
//find bucket where key is located
int hashValue = HashTable::hash(c);
cout << hashValue << '\n';
string s = key;
cout << v.size(); //Prints 0 but should be TABLE_SIZE
//look for key in map in bucket
MAP_TYPE::const_iterator iter = v[hashValue].find(s);
if (iter != v[hashValue].end()) //check if find exists
return iter->second; //return value of key
else
return -1; //arbitrary value signifying failure to find key
}
int main()
{
HashTable my_hash;
string s = "hi";
int z = my_hash.find(s);
cout << z; //should return -1
return 0;
}
我測試了查找函數我的哈希表,但它返回一個分段錯誤。即使我在查找函數中構建了具有正確大小的向量v,大小現在爲0?我不認爲它正在訪問相同的變量。散列函數很好。怎麼了?分段錯誤訪問私有類變量
100489 = 2的冪 – Mysticial
@Mysticial,這就是爲什麼評論做出不好的斷言陳述。 –
eeep!是的,但這應該不重要...哈希在矢量的大小範圍內。 v.size()在find中不應該給我0兩種方式? – Benjamin