-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathPfxEntry.cs
394 lines (345 loc) · 13.2 KB
/
PfxEntry.cs
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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
using System.Collections.Generic;
using System.Text;
namespace HunspellSharp
{
using static Utils;
class PfxEntry : AffEntry
{
private PfxEntry next;
private PfxEntry nexteq;
private PfxEntry nextne;
private PfxEntry flgnxt;
public string add(Hunspell pmyMgr, string word)
{
var len = word.Length;
if ((len > strip.Length || (len == 0 && pmyMgr.get_fullstrip())) &&
(len >= numconds) && test_condition(word) &&
(string.IsNullOrEmpty(strip) ||
(len >= strip.Length && string.CompareOrdinal(word, 0, strip, 0, strip.Length) == 0)))
{
/* we have a match so add prefix */
return appnd + word.Substring(strip.Length);
}
return null;
}
public bool test_condition(IEnumerable<char> s)
{
int st = 0, len = s.Length();
int pos = -1; // group with pos input position
bool neg = false; // complementer
bool ingroup = false; // character in the group
if (numconds == 0)
return true;
int p = 0;
while (true)
{
switch (conds[p])
{
case '[':
{
neg = false;
ingroup = false;
++p;
pos = st;
break;
}
case '^':
{
++p;
neg = true;
break;
}
case ']':
{
if (neg == ingroup)
return false;
pos = -1;
++p;
// skip the next character
if (!ingroup && st < len)
{
++st;
}
if (st == len && p < conds.Length)
return false; // word <= condition
break;
}
case '.':
if (pos < 0)
{ // dots are not metacharacters in groups: [.]
++p;
// skip the next character
++st;
if (st == len && p < conds.Length)
return false; // word <= condition
break;
}
goto default;
/* FALLTHROUGH */
default:
{
if (st < len && s.At(st) == conds[p])
{
++st;
p++;
if (pos >= 0)
{
ingroup = true;
while (p < conds.Length && conds[p] != ']' && ++p < conds.Length)
{
}
}
}
else if (pos >= 0)
{ // group
++p;
}
else
return false;
break;
}
}
if (p >= conds.Length)
return true;
}
}
public bool allowCross() { return (opts & ae.XPRODUCT) != 0; }
// check if this prefix entry matches
public hentry checkword(Hunspell pmyMgr,
IEnumerable<char> word,
int start,
int len,
IN_CPD in_compound,
ushort needflag = 0)
{
hentry he; // hash entry of root word or NULL
// on entry prefix is 0 length or already matches the beginning of the word.
// So if the remaining root word has positive length
// and if there are enough chars in root word and added back strip chars
// to meet the number of characters conditions, then test it
int tmpl = len - appnd.Length; // length of tmpword
if (tmpl > 0 || (tmpl == 0 && pmyMgr.get_fullstrip())) {
// generate new root word by removing prefix and adding
// back any characters that would have been stripped
var tmpword = new char[strip.Length + tmpl];
strip.CopyTo(0, tmpword, 0, strip.Length);
word.CopyTo(start + appnd.Length, tmpword, strip.Length, tmpl);
// now make sure all of the conditions on characters
// are met. Please see the appendix at the end of
// this file for more info on exactly what is being
// tested
// if all conditions are met then check if resulting
// root word in the dictionary
if (test_condition(tmpword)) {
tmpl += strip.Length;
if ((he = pmyMgr.lookup(tmpword)) != null) {
do {
if (TESTAFF(he.astr, aflag) &&
// forbid single prefixes with needaffix flag
!TESTAFF(contclass, pmyMgr.get_needaffix()) &&
// needflag
(needflag == 0 || TESTAFF(he.astr, needflag) ||
(contclass != null && TESTAFF(contclass, needflag))))
return he;
he = he.next_homonym; // check homonyms
} while (he != null);
}
// prefix matched but no root word was found
// if aeXPRODUCT is allowed, try again but now
// ross checked combined with a suffix
// if ((opts & aeXPRODUCT) && in_compound) {
if ((opts & ae.XPRODUCT) != 0) {
he = pmyMgr.suffix_check(tmpword, 0, tmpl, ae.XPRODUCT, this,
0, needflag, in_compound);
if (he != null)
return he;
}
}
}
return null;
}
// check if this prefix entry matches
public hentry check_twosfx(Hunspell pmyMgr,
IEnumerable<char> word,
int start,
int len,
IN_CPD in_compound,
ushort needflag = 0)
{
// on entry prefix is 0 length or already matches the beginning of the word.
// So if the remaining root word has positive length
// and if there are enough chars in root word and added back strip chars
// to meet the number of characters conditions, then test it
int tmpl = len - appnd.Length; // length of tmpword
if ((tmpl > 0 || (tmpl == 0 && pmyMgr.get_fullstrip())) &&
(tmpl + strip.Length >= numconds))
{
// generate new root word by removing prefix and adding
// back any characters that would have been stripped
var tmpword = new char[strip.Length + tmpl];
strip.CopyTo(0, tmpword, 0, strip.Length);
word.CopyTo(start + appnd.Length, tmpword, strip.Length, tmpl);
// now make sure all of the conditions on characters
// are met. Please see the appendix at the end of
// this file for more info on exactly what is being
// tested
// if all conditions are met then check if resulting
// root word in the dictionary
if (test_condition(tmpword))
{
tmpl += strip.Length;
// prefix matched but no root word was found
// if aeXPRODUCT is allowed, try again but now
// cross checked combined with a suffix
if ((opts & ae.XPRODUCT) != 0 && (in_compound != IN_CPD.BEGIN))
{
// hash entry of root word or NULL
hentry he = pmyMgr.suffix_check_twosfx(tmpword, 0, tmpl, ae.XPRODUCT, this,
needflag);
if (he != null)
return he;
}
}
}
return null;
}
// check if this prefix entry matches
public void check_twosfx_morph(Hunspell pmyMgr,
StringBuilder result,
string word,
int start,
int len,
IN_CPD in_compound,
ushort needflag = 0)
{
// on entry prefix is 0 length or already matches the beginning of the word.
// So if the remaining root word has positive length
// and if there are enough chars in root word and added back strip chars
// to meet the number of characters conditions, then test it
int tmpl = len - appnd.Length; // length of tmpword
if ((tmpl > 0 || (tmpl == 0 && pmyMgr.get_fullstrip())) &&
(tmpl + strip.Length >= numconds))
{
// generate new root word by removing prefix and adding
// back any characters that would have been stripped
string tmpword = strip + word.Substring(start + appnd.Length, tmpl);
// now make sure all of the conditions on characters
// are met. Please see the appendix at the end of
// this file for more info on exactly what is being
// tested
// if all conditions are met then check if resulting
// root word in the dictionary
if (test_condition(tmpword))
{
tmpl += strip.Length;
// prefix matched but no root word was found
// if aeXPRODUCT is allowed, try again but now
// ross checked combined with a suffix
if ((opts & ae.XPRODUCT) != 0 && (in_compound != IN_CPD.BEGIN))
{
pmyMgr.suffix_check_twosfx_morph(result, tmpword, 0, tmpl,
ae.XPRODUCT,
this, needflag);
return;
}
}
}
}
// check if this prefix entry matches
public void check_morph(Hunspell pmyMgr,
StringBuilder result,
string word,
int start,
int len,
IN_CPD in_compound,
ushort needflag = 0)
{
// on entry prefix is 0 length or already matches the beginning of the word.
// So if the remaining root word has positive length
// and if there are enough chars in root word and added back strip chars
// to meet the number of characters conditions, then test it
int tmpl = len - appnd.Length; // length of tmpword
if ((tmpl > 0 || (tmpl == 0 && pmyMgr.get_fullstrip())) &&
(tmpl + strip.Length >= numconds))
{
// generate new root word by removing prefix and adding
// back any characters that would have been stripped
string tmpword = strip + word.Substring(start + appnd.Length, tmpl);
// now make sure all of the conditions on characters
// are met. Please see the appendix at the end of
// this file for more info on exactly what is being
// tested
// if all conditions are met then check if resulting
// root word in the dictionary
if (test_condition(tmpword))
{
tmpl += strip.Length;
hentry he; // hash entry of root word or NULL
if ((he = pmyMgr.lookup(tmpword)) != null)
{
do
{
if (TESTAFF(he.astr, aflag) &&
// forbid single prefixes with needaffix flag
!TESTAFF(contclass, pmyMgr.get_needaffix()) &&
// needflag
(needflag == 0 || TESTAFF(he.astr, needflag) ||
(contclass != null && TESTAFF(contclass, needflag))))
{
if (morphcode != null)
{
result.Append(MSEP.FLD);
result.Append(morphcode);
}
else
result.Append(getKey());
if (!he.Contains(MORPH.STEM))
{
result.Append(MSEP.FLD);
result.Append(MORPH.STEM);
result.Append(he.word);
}
// store the pointer of the hash entry
if (he.data != null)
{
result.Append(MSEP.FLD);
result.Append(he.data);
}
else
{
// return with debug information
result.Append(MSEP.FLD);
result.Append(MORPH.FLAG);
pmyMgr.encode_flag(getFlag(), result);
}
result.Append(MSEP.REC);
}
he = he.next_homonym;
} while (he != null);
}
// prefix matched but no root word was found
// if aeXPRODUCT is allowed, try again but now
// ross checked combined with a suffix
if ((opts & ae.XPRODUCT) != 0 && (in_compound != IN_CPD.BEGIN))
{
pmyMgr.suffix_check_morph(result, tmpword, 0, tmpl, ae.XPRODUCT, this, 0, needflag);
}
}
}
}
public ushort getFlag() { return aflag; }
public string getKey() { return appnd; }
public int getKeyLen() { return appnd.Length; }
public string getMorph() { return morphcode; }
public ushort[] getCont() { return contclass; }
public int getContLen() { return contclass.Length; }
public PfxEntry getNext() { return next; }
public PfxEntry getNextNE() { return nextne; }
public PfxEntry getNextEQ() { return nexteq; }
public PfxEntry getFlgNxt() { return flgnxt; }
public void setNext(PfxEntry ptr) { next = ptr; }
public void setNextNE(PfxEntry ptr) { nextne = ptr; }
public void setNextEQ(PfxEntry ptr) { nexteq = ptr; }
public void setFlgNxt(PfxEntry ptr) { flgnxt = ptr; }
}
}