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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
|
#include "MenuSearch.hh"
#include "MenuItem.hh"
#include "StringUtil.hh"
#include "Resource.hh"
namespace {
size_t search_str_nowhere(const std::string& text, const std::string& pattern) {
return std::string::npos;
}
// finds 'pattern' at beginning of 'text'
size_t search_str_textstart(const std::string& text, const std::string& pattern) {
size_t l = std::min(text.size(), pattern.size());
if (l == 0) {
return std::string::npos;
}
size_t i;
for (i = l; i > 0; i--) {
if (std::tolower(text[i-1]) != std::tolower(pattern[i-1])) {
return std::string::npos;
}
}
return i;
}
// finds 'pattern' in 'text', case insensitive.
// returns position or std::string::npos if not found.
//
// implements Boyer–Moore–Horspool
size_t search_str_bmh(const std::string& text, const std::string& pattern) {
if (pattern.empty()) {
return 0;
}
if (text.empty() || pattern.size() > text.size()) {
return std::string::npos;
}
size_t t;
size_t tlen = text.size();
// simple case, no need to be too clever
if (pattern.size() == 1) {
int b = std::tolower(pattern[0]);
for (t = 0; t < tlen; t++) {
if (b == std::tolower(text[t])) {
return t;
}
}
return std::string::npos;
}
size_t plast = pattern.size() - 1;
size_t p;
// prepare skip-table
//
size_t skip[256];
for (p = 0; p < sizeof(skip)/sizeof(skip[0]); p++) {
skip[p] = plast + 1;
}
for (p = 0; p < plast; p++) {
skip[std::tolower(pattern[p])] = plast - p;
}
// match
for (t = 0; t + plast < tlen; ) {
for (p = plast; std::tolower(text[t+p]) == std::tolower(pattern[p]); p--) {
if (p == 0) {
return t+p;
}
}
t += skip[std::tolower(text[t+p])];
}
return std::string::npos;
}
// actually search function, depends on Mode
size_t (*search_str)(const std::string&, const std::string&) = search_str_textstart;
} // anonymous
namespace FbTk {
void MenuSearch::setMode(MenuSearch::Mode m) {
if (m == NOWHERE) {
search_str = search_str_nowhere;
} else if (m == SOMEWHERE) {
search_str = search_str_bmh;
} else {
search_str = search_str_textstart;
}
}
MenuSearch::MenuSearch(const std::vector<FbTk::MenuItem*>& items) :
m_items(items) {
}
size_t MenuSearch::size() const {
return pattern.size();
}
void MenuSearch::clear() {
pattern.clear();
}
void MenuSearch::add(char c) {
pattern.push_back(c);
}
void MenuSearch::backspace() {
size_t s = pattern.size();
if (s > 0) {
pattern.erase(s - 1, 1);
}
}
// is 'pattern' matching something?
bool MenuSearch::has_match() {
size_t l = m_items.size();
size_t i;
for (i = 0; i < l; i++) {
if (!m_items[i]->isEnabled())
continue;
if (search_str(m_items[i]->iTypeString(), pattern) != std::string::npos) {
return true;
}
}
return false;
}
// would 'the_pattern' match something?
bool MenuSearch::would_match(const std::string& the_pattern) {
size_t l = m_items.size();
size_t i;
for (i = 0; i < l; i++) {
if (!m_items[i]->isEnabled())
continue;
if (search_str(m_items[i]->iTypeString(), the_pattern) != std::string::npos) {
return true;
}
}
return false;
}
size_t MenuSearch::num_matches() {
size_t l = m_items.size();
size_t i, n;
for (i = 0, n = 0; i < l; i++) {
if (!m_items[i]->isEnabled())
continue;
if (search_str(m_items[i]->iTypeString(), pattern) != std::string::npos) {
n++;
}
}
return n;
}
// returns true if m_text matches against m_items[i] and stores
// the position where it matches in the string. an empty
// 'pattern' always matches
bool MenuSearch::get_match(size_t i, size_t& idx) {
if (i > m_items.size()) {
return false;
}
if (pattern.empty())
return true;
idx = search_str(m_items[i]->iTypeString(), pattern);
return idx != std::string::npos;
}
//
// resource-implementation related
template<>
std::string FbTk::Resource<FbTk::MenuSearch::Mode>::getString() const {
switch (m_value) {
case FbTk::MenuSearch::NOWHERE:
return "nowhere";
case FbTk::MenuSearch::SOMEWHERE:
return "somewhere";
default:
return "itemstart";
};
}
template<>
void FbTk::Resource<FbTk::MenuSearch::Mode>::setFromString(const char *strval) {
std::string val = FbTk::StringUtil::toLower(strval);
if (val == "nowhere") {
m_value = FbTk::MenuSearch::NOWHERE;
} else if (val == "somewhere") {
m_value = FbTk::MenuSearch::SOMEWHERE;
} else {
setDefaultValue();
}
}
}
|
