Scrabble/trie.cpp at master · kivi239/Scrabble · 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
128
129
130
131
#include "trie.h"
#include <QDebug>

Trie::Trie()
{
    emptyMap.clear();
    trie.clear();
    trie.push_back(make_pair(0, emptyMap));
    sizeOfTrie = 0;
    for (int i = 0; i < sizeOfAlphabet; i++)
        stepsInSearch[i] = (char)('a' + i);
}

Trie::~Trie()
{
    for (int i = 0; i <(int)trie.size(); i++)
    {
        trie[i].second.clear();

    }
    trie.clear();
    sizeOfTrie = 0;
}

bool Trie::isGood(string &word)
{
    for (int i = 0; i < (int)word.size(); i++)
    {
        if (('a' <= word[i] && word[i] <= 'z') || (word[i] == 'X'))
            continue;
        return false;
    }
    return true;
}

void Trie::add(string &word)
{
    if (!isGood(word))
        return;
    int currentPosition = 0;
    for (int i = 0; i < (int)word.size(); i++)
    {
        int nextPosition = -1;

        if (trie[currentPosition].second.find(word[i]) == trie[currentPosition].second.end())
        {
            sizeOfTrie++;
            nextPosition = sizeOfTrie;
            trie[currentPosition].second[word[i]] = nextPosition;
            trie.push_back(make_pair(0, emptyMap));
        }
        else
            nextPosition = trie[currentPosition].second[word[i]];
        assert(nextPosition != -1);
        currentPosition = nextPosition;
    }
    trie[currentPosition].first = 1;
}

bool Trie::hasWord(string &word)
{
    int currentPosition = 0;
    for (int i = 0; i < (int)word.size(); i++)
    {
        if (trie[currentPosition].second.find(word[i]) == trie[currentPosition].second.end())
            return false;
        currentPosition = trie[currentPosition].second[word[i]];
    }
    return (trie[currentPosition].first == 1);
}

bool Trie::setWord(string &word)
{
    if (!hasWord(word))
        return false;
    int currentPosition = 0;
    for (int i = 0; i < (int)word.size(); i++)
    {
        currentPosition = trie[currentPosition].second[word[i]];
    }
    trie[currentPosition].first = 2;
    return true;
}

string Trie::getRandomWord(int lengthOfWord)
{
    vector <string> result;
    result.clear();
    random_shuffle(stepsInSearch, stepsInSearch + sizeOfAlphabet);
    findWord(0, lengthOfWord, result, "");
    random_shuffle(result.begin(), result.end());
    return result[0];
}

int Trie::nextVertex(int v, char ch)
{
    if (v < 0 || (int)trie.size() <= v)
        return -1;

    if (trie[v].second.find(ch) == trie[v].second.end())
        return -1;

    return trie[v].second[ch];
}

int Trie::getValue(int v)
{
    if (v < 0 || (int)trie.size() <= v)
        return -1;
    return trie[v].first;
}

void Trie::findWord(int currentVertex, int lengthOfWord, vector<string> &result, string tmpWord)
{
    if (lengthOfWord == 0)
    {
        if (trie[currentVertex].first == 1)
            result.push_back(tmpWord);
        return;
    }
    if ((int)(result.size()) > 40)
        return;
    for (int i = 0; i < sizeOfAlphabet; i++)
    {
        if (trie[currentVertex].second.find(stepsInSearch[i]) == trie[currentVertex].second.end())
            continue;
        findWord(trie[currentVertex].second[stepsInSearch[i]], lengthOfWord - 1, result, tmpWord + stepsInSearch[i]);
        if ((int)(result.size()) > 40)
            return;
    }
}