-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPTHash.cpp
More file actions
168 lines (129 loc) · 2.69 KB
/
Copy pathPTHash.cpp
File metadata and controls
168 lines (129 loc) · 2.69 KB
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
/*
Name: Matthew Wilson
Course: CSCE 2110.002
Date: 11/15/21
This header file defines the member functions of the PlaneType hash table
*/
#include "PThash.h"
PTHash::PTHash(string file)
{
for(int i = 0; i < size; i++)
{
HashTable[i] = new node;
}
ifstream fin(file);
string line, word, Make, Model;
int flys = 0, gros = 0, i = 0;
getline(fin, line);
while(getline(fin, line))
{
for(unsigned int i = 0; i < line.length(); i++)
{
if(line[i] == ',')
{
line[i] = ' ';
}
}
stringstream ss(line);
ss >> Make >> Model >> flys >> gros;
i = hash(Make);
if(HashTable[i]->make == " ")
{
HashTable[i]->make = Make;
HashTable[i]->model = Model;
HashTable[i]->flyspeed = flys;
HashTable[i]->groundspeed = gros;
}
else//handling collision by double hashing
{
i = (hash(Make) + hash(Model) + 1) % size;
HashTable[i]->make = Make;
HashTable[i]->model = Model;
HashTable[i]->flyspeed = flys;
HashTable[i]->groundspeed = gros;
}
}
fin.close();
}
int PTHash::hash(string key)
{
int hash = 0;
int index;
int M = 3;
for(unsigned int i = 0; i < key.length(); i++)
{
hash = (hash * M) + (int)key[i];//multiplicative hashing
}
index = hash % size;
return index;
}
void PTHash::display()
{
node* ptr;
cout << "Maker\t" << "Model\t" << "FlyingSpeed\t" << "GroundSpeed" << endl;
for(int i = 0; i < size; i++)
{
ptr = HashTable[i];
if(ptr->make != " ")
{
cout << ptr->make << "\t" << ptr->model << "\t\t";
cout << ptr->flyspeed << "\t\t" << ptr->groundspeed;
cout << endl;
}
}
cout << endl;
}
void PTHash::insert(string mk, string md, int fs, int gs)
{
int index = hash(md);
if(HashTable[index]->flyspeed != -999)
{
cout << "Error in plane type table: need unique key from make." << endl;
return;
}
HashTable[index]->make = mk;
HashTable[index]->model = md;
HashTable[index]->flyspeed = fs;
HashTable[index]->groundspeed = gs;
}
void PTHash::update(string mk, string md, int fs, int gs)
{
int in = hash(md);
if(HashTable[in]->make == " ")
{
cout << "Error in plane type table: index is empty." << endl;
return;
}
for(int i = 0; i < size; i++)
{
if(HashTable[i]->flyspeed == fs)
{
HashTable[i]->make = mk;
HashTable[i]->model = md;
HashTable[i]->flyspeed = fs;
HashTable[i]->groundspeed = gs;
}
}
}
void PTHash::select(int fs)
{
int j = -1;
int a[23];
for(int i = 0; i < size; i++)
{
if(HashTable[i]-> flyspeed == fs)
{
j++;
a[j] = i;
}
}
if(j > -1)
{
cout << "Select: Plane(s) at index: ";
for(int i = 0; i <= j; i++)
{
cout << a[i] << ", ";
}
cout << "have " << fs << " flying speed" << endl << endl;
}
}