blob: 5e5d0c37a527e8d5cd4163320c6a0afed92d5c13 (
plain)
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
//***********************************************************
// Copyright © 2008 Valentin Pavlyuchenko
//
// This file is part of Boltun.
//
// Boltun is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 2 of the License, or
// (at your option) any later version.
//
// Boltun is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Boltun. If not, see <http://www.gnu.org/licenses/>.
//
//***********************************************************
#include "WordsList.h"
using namespace std;
WordsList::WordsList(const tstring &data/*, bool allowUnstrict*/)
{
Parse(data/*, allowUnstrict*/);
}
WordsList::operator tstring() const
{
tstring res;
//if (unstrict)
// res = _T("~");
set<tstring>::const_iterator it = words.begin();
if (!words.empty())
while (true)
{
res += *it;
it++;
if (it != words.end())
res += _T(" ");
else
break;
}
res += isQuestion ? _T("?") : _T(".");
return res;
}
WordsList& WordsList::operator= (const tstring& s)
{
Parse(s);
return *this;
};
void WordsList::Parse(tstring s/*, bool allowUnstrict*/)
{
isQuestion = false;
/*if (allowUnstrict && s.length() && s[0] == _T('~'))
{
s = s.substr(1, s.npos);
unstrict = true;
}
else
unstrict = false;*/
int len = s.length() - 1;
while (len != -1 && _istspace(s[len]))
len--;
if (len < 0)
return;
if (s[len] == '?')
isQuestion = true;
else
if (s[len] != '.')
return;
s.resize(len);
int it = 0;
while (it != len)
{
while (it != len && _istspace(s[it]))
it++;
if (it == len)
break;
int start = it;
while (it != len && !_istspace(s[it]))
it++;
words.insert(s.substr(start, it - start));
}
}
bool WordsList::MatchesAll(const vector<tstring>& s/*, bool& WasStrict*/, float& priority) const
{
std::set<tstring> temp;
//WasStrict = true;
for (vector<tstring>::const_iterator it = s.begin(); it != s.end(); it++)
{
/* if (words.find(*it) == words.end())
if (unstrict)
{
WasStrict = false;
continue;
}
else
return false;
temp.insert((*it));*/
if (words.find(*it) != words.end())
temp.insert((*it));
}
if (temp.size() != words.size())
return false;
priority = words.size() * words.size() / (float)s.size();
return temp.size() == words.size();
}
bool WordsList::MatchesAny(const vector<tstring>& s) const
{
for (vector<tstring>::const_iterator it = s.begin(); it != s.end(); it++)
if (words.find(*it) != words.end())
return true;
return false;
}
vector<tstring> WordsList::ConsistsOf(const set<tstring>& list) const
{
vector<tstring> res;
for (set<tstring>::const_iterator it = words.begin(); it != words.end(); it++)
if (list.find(*it) == list.end())
res.push_back(*it);
return res;
}
vector<tstring> WordsList::DoesntIncludeAny(const set<tstring>& list) const
{
vector<tstring> res;
for (set<tstring>::const_iterator it = words.begin(); it != words.end(); it++)
if (list.find(*it) != list.end())
res.push_back(*it);
return res;
}
bool WordsList::operator<(const WordsList& value) const
{
return (tstring)*this < (tstring)value;
}
bool WordsList::operator!=(const WordsList& value) const
{
return (tstring)*this != (tstring)value;
}
bool WordsList::operator==(const WordsList& value) const
{
return (tstring)*this == (tstring)value;
}
size_t WordsList::Size() const
{
return words.size();
}
bool WordsList::IsQuestion() const
{
return isQuestion;
}
bool WordsList::IsEmpty() const
{
return words.size() == 0;
}
|
