PMHashTable/test.cc at main · LikoJ/PMHashTable · GitHub

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
#include <iostream>
#include <string>
#include "hashtable.h"
#define KEY_NUM 50
int main() {
    pmhashtable::Options opt;
    pmhashtable::HashTable *ht = new pmhashtable::HashTable(opt);
    std::string key, value;

    std::cout << "--------Insert--------" << std::endl;
    for (int i = 0; i < KEY_NUM; i++, i++) {
        key = "k";
        key += std::to_string(i);
        value = "v";
        value += std::to_string(i);
        ht->Write(key, value);
        std::cout << key << ": " << value << std::endl;
    }

    std::cout << "---------Read---------" << std::endl;
    for (int i = 0; i < KEY_NUM; i++, i++) {
        key = "k";
        key += std::to_string(i);
        if (ht->Read(key, &value)) {
            std::cout << key << ": " << value << std::endl;
        } else {
            std::cout << key << ": not found!" << std::endl;
        }
    }

    std::cout << "--------Insert--------" << std::endl;
    for (int i = 1; i < KEY_NUM; i++, i++) {
        key = "k";
        key += std::to_string(i);
        value = "v";
        value += std::to_string(i);
        ht->Write(key, value);
        std::cout << key << ": " << value << std::endl;
    }

    std::cout << "---------Read---------" << std::endl;
    for (int i = 0; i < KEY_NUM; i++) {
        key = "k";
        key += std::to_string(i);
        if (ht->Read(key, &value)) {
            std::cout << key << ": " << value << std::endl;
        } else {
            std::cout << key << ": not found!" << std::endl;
        }
    }

    // not found
    key = "k";
    if (ht->Read(key, &value)) {
        std::cout << key << ": " << value << std::endl;
    } else {
        std::cout << key << ": not found!" << std::endl;
    }

    std::cout << "--------Update--------" << std::endl;
    for (int i = 0; i < KEY_NUM; i += 3) {
        key = "k";
        key += std::to_string(i);
        value = "u";
        value += std::to_string(i);
        ht->Write(key, value);
        std::cout << key << ": " << value << std::endl;
    }

    std::cout << "---------Read---------" << std::endl;
    for (int i = 0; i < KEY_NUM; i++) {
        key = "k";
        key += std::to_string(i);
        if (ht->Read(key, &value)) {
            std::cout << key << ": " << value << std::endl;
        } else {
            std::cout << key << ": not found!" << std::endl;
        }
    }


    std::cout << "-Scan-from-k1-total-10-" << std::endl;
    key = "k";
    key += std::to_string(1);
    ht->Scan(key, 10);
    while (ht->Valid()){
        key = ht->Key();
        value = ht->Value();
        std::cout << key << ": " << value << std::endl;
        ht->Next();
    }

    std::cout << "-Delete-from-k0-to-k5-" << std::endl;
    for (int i = 0; i < 6; i++) {
        key = "k";
        key += std::to_string(i);
        ht->Delete(key);
        std::cout << key << ": " << "delete" << std::endl;
    }

    std::cout << "---------Read---------" << std::endl;
    for (int i = 0; i < KEY_NUM; i++) {
        key = "k";
        key += std::to_string(i);
        if (ht->Read(key, &value)) {
            std::cout << key << ": " << value << std::endl;
        } else {
            std::cout << key << ": not found!" << std::endl;
        }
    }

    std::cout << "--------Reopen--------" << std::endl;
    delete ht;
    ht = new pmhashtable::HashTable(opt);
    std::cout << "---------Read---------" << std::endl;
    for (int i = 0; i < KEY_NUM; i++) {
        key = "k";
        key += std::to_string(i);
        if (ht->Read(key, &value)) {
            std::cout << key << ": " << value << std::endl;
        } else {
            std::cout << key << ": not found!" << std::endl;
        }
    }
    delete ht;
    return 0;
}