-
Notifications
You must be signed in to change notification settings - Fork 0
/
HashTable.cpp
executable file
·144 lines (129 loc) · 2.64 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
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
/**********************************
* FILE NAME: HashTable.cpp
*
* DESCRIPTION: Hash Table class definition
**********************************/
#include "HashTable.h"
HashTable::HashTable() {}
HashTable::~HashTable() {}
/**
* FUNCTION NAME: create
*
* DESCRIPTION: This function inserts they (key,value) pair into the local hash table
*
* RETURNS:
* true on SUCCESS
* false in FAILURE
*/
bool HashTable::create(string key, string value) {
hashTable.emplace(key, value);
return true;
}
/**
* FUNCTION NAME: read
*
* DESCRIPTION: This function searches for the key in the hash table
*
* RETURNS:
* string value if found
* else it returns a NULL
*/
string HashTable::read(string key) {
map<string, string>::iterator search;
search = hashTable.find(key);
if ( search != hashTable.end() ) {
// Value found
return search->second;
}
else {
// Value not found
return "";
}
}
/**
* FUNCTION NAME: update
*
* DESCRIPTION: This function updates the given key with the updated value passed in
* if the key is found
*
* RETURNS:
* true on SUCCESS
* false on FAILURE
*/
bool HashTable::update(string key, string newValue) {
map<string, string>::iterator update;
if (read(key).empty()) {
// Key not found
return false;
}
// Key found
//update = hashTable.at(key) = newValue;
hashTable.at(key) = newValue;
// Update successful
return true;
}
/**
* FUNCTION NAME: deleteKey
*
* DESCRIPTION: This function deletes the given key and the corresponding value if the key is found
*
* RETURNS:
* true on SUCCESS
* false on FAILURE
*/
bool HashTable::deleteKey(string key) {
uint eraseCount = 0;
if (read(key).empty()) {
// Key not found
return false;
}
eraseCount = hashTable.erase(key);
if ( eraseCount < 1 ) {
// Could not erase
return false;
}
// Delete was successful
return true;
}
/**
* FUNCTION NAME: isEmpty
*
* DESCRIPTION: Returns if the hash table is empty
*
* RETURNS:
* true if hash table is empty
* false otherwise
*/
bool HashTable::isEmpty() {
return hashTable.empty();
}
/**
* FUNCTION NAME: currentSize
*
* DESCRIPTION: Returns the current size of the hash table
*
* RETURNS:
* size of the table as unit
*/
unsigned long HashTable::currentSize() {
return (unsigned long)hashTable.size();
}
/**
* FUNCTION NAME: clear
*
* DESCRIPTION: Clear all contents from the hash table
*/
void HashTable::clear() {
hashTable.clear();
}
/**
* FUNCTION NAME: count
*
* DESCRIPTION: Returns the count of the number of values for the passed in key
*
* RETURNS:
* unsigned long count (Should be always 1)
*/
unsigned long HashTable::count(string key) {
return (unsigned long) hashTable.count(key);
}