/
hashtable.cpp
64 lines (52 loc) · 1.49 KB
/
hashtable.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include "hashtable.h"
HashTable::HashTable(unsigned long long length)
{
this->length = length;//初始化哈希表的长度
}
void HashTable::InitHashTable(){
road = new Road[static_cast<unsigned long long>(this->length)];
Road temp;
for(unsigned long long i=0;i<this->length;i++){
road[i] = temp;//初始化的每个元素结点的点个数为-1
}
}
unsigned long long HashTable::Hash(int x,int y){
return (static_cast<unsigned long long>(x+y)%length);
}
unsigned long long HashTable::HashUnique(int x, int y){
if(x<y){
int temp = x;
x = y;
y=temp;
}
unsigned long long result = static_cast<unsigned long long>((x*(x+1))/2+y);
return result%length;
}
void HashTable::insertHash(Road r){
unsigned long long addr = HashUnique(r.getEndPointA(),r.getEndPointB());
while(static_cast<int>(road[addr].getPointNumber())!=-1){
addr = (addr+1)%(this->length);
}
road[addr] = r;
}
int HashTable::equal(int x, int y,Road r){
int flag = 0;
if((x==r.getEndPointA()&&y==r.getEndPointB())||(y==r.getEndPointA()&&x==r.getEndPointB()))
flag = 1;
return flag;
}
unsigned long long HashTable::getLength() const
{
return length;
}
void HashTable::setLength(unsigned long long value)
{
length = value;
}
unsigned long long HashTable::searchHash(int x,int y){
unsigned long long addr = HashUnique(x,y);
while(!equal(x,y,road[addr])){
addr = (addr+1)%(this->length);
}
return addr;
}