Hashtable-Dictionary/main.cpp at main · thinhmountain/Hashtable-Dictionary · 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
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <sstream>
#include <queue>
#include <map>

using namespace std;
#define M 101

struct Word
{
    string def;
    string type;
    string word;
};

struct DictNode
{
    Word word;
    DictNode *next;
};

void init(DictNode *heads[])
{
    for (int i = 0; i < M; i++)
        heads[i] = nullptr;
}

int hash_function(Word w)
{
    int h = 0;
    for (int i = 0; i < w.word.length(); i++)
    {
        h += (int)tolower(w.word[i]) * i + 1;
    }
    return h % M;
}

DictNode *CreateWord(Word w)
{
    DictNode *p = new DictNode();
    p->word = w;
    p->next = nullptr;
    return p;
}

// luu y
void add(DictNode *heads[], Word w)
{
    int h = hash_function(w);
    DictNode *p = CreateWord(w);
    DictNode *r = heads[h];
    if (r == nullptr) // add dau
        heads[h] = p;
    else // add cuoi
    {
        int t = hash_function(r->word);
        while (r->next != NULL)
        {
            t = hash_function(r->word);
            if (t == h)
                break;
            else
                r = r->next;
        }
        if (t != h)
            r->next = p;
    }
}


void update(DictNode *heads[], Word w)
{
    int h = hash_function(w);
    DictNode *r = heads[h];
    if (r != nullptr)
    {
    }
}

// luu y
void display(DictNode *heads[])
{
    for (int i = 0; i < M; i++)
    {
        if (heads[i] != nullptr)
        {
            cout << "--------------Index " << i << "-----------------" << endl;
            DictNode *p = heads[i];
            while (p != nullptr)
            {
                cout << p->word.word << "-" << p->word.type << "-" << p->word.def << endl;
                p = p->next;
            }
        }
    }
}

int main()
{
    Word w1, w2, w3;
    w1.word = "Hello";
    w1.type = "Verb";
    w1.def = "Xin chao";
    w2.word = "Hi";
    w2.type = "Verb";
    w2.def = "Xin chao";
    w3.word = "hello";
    w3.type = "Verb";
    w3.def = "chao";
    DictNode *dict[M];
    init(dict);
    add(dict, w1);
    add(dict, w2);
    add(dict, w3);
    display(dict);
    return 0;
}