-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpassenger.cpp
More file actions
81 lines (65 loc) · 1.38 KB
/
Copy pathpassenger.cpp
File metadata and controls
81 lines (65 loc) · 1.38 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
#include "passenger.h"
passengerNode::passengerNode()
{
ID = "";
name = "";
phone = "";
}
passengerNode::passengerNode(const string& input)
{
char * cstr = new char [input.length()+1];
strcpy (cstr, input.c_str());
// cstr now contains a c-string copy of str
char cID[32], cName[32], cPhone[32];
ID = strcpy(cID, strtok(cstr , ","));
name = strcpy(cName, strtok(NULL, ","));
phone = strcpy(cPhone , strtok(NULL, ","));
}
void passengerNode::setID(string id)
{
ID = id;
}
void passengerNode::setName(string passName)
{
name = passName;
}
void passengerNode::setPhone(string passPhone)
{
phone = passPhone;
}
string passengerNode::getID()
{
return ID;
}
string passengerNode::getName()
{
return name;
}
string passengerNode::getPhone()
{
return phone;
}
void passengerNode::print()
{
cout << ID << " " << name << " " << phone << endl;
}
passengerHash::passengerHash(int bucket) {
this->buckets = bucket;
table = new list<int>[buckets];
}
void passengerHash::insert(vector<passengerNode> data) {
for(int i = 1; i < data.size(); i++){
int key = std::stoi(data[i].getID());
int index = hashingFunction(key);
table[index].push_back(key);
}
}
void passengerHash::output(vector<passengerNode> data) {
cout << "ID\t" << "Name\t" << "Phone" << endl;
for(int i = 0; i < buckets; i++) {
for(auto x : table[i]) {
data[i].print();
}
cout << endl;
}
}