Storage mechanism using double-hashed keys.
More...
#include <iostream>
#include <memory>
#include <vector>
|
using | double_hashing::Entry = struct Entry |
|
|
int | double_hashing::notPresent |
|
std::vector< Entry > | double_hashing::table |
|
int | double_hashing::totalSize |
|
int | double_hashing::tomb = -1 |
|
int | double_hashing::size |
|
bool | double_hashing::rehashing |
|
Storage mechanism using double-hashed keys.
- Author
- achance6
-
Krishna Vedala
- Note
- The implementation can be optimized by using OOP style.
◆ main()
Main program
- Returns
- 0 on success
251 int cmd = 0, hash = 0, key = 0;
252 std::cout <<
"Enter the initial size of Hash Table. = ";
281 if (entry.
key == double_hashing::notPresent) {
287 std::cout <<
"Enter element to generate hash = ";