xapian-core  1.4.29
finnish.cc
Go to the documentation of this file.
1 /* Generated by Snowball 2.0.0 - https://snowballstem.org/ */
2 
3 
4 #include <config.h>
5 #include <limits.h>
6 #include "finnish.h"
7 
8 static int tr_VI(Xapian::StemImplementation * this_ptr) {
9  return (static_cast<Xapian::InternalStemFinnish *>(this_ptr))->r_VI();
10 }
11 
12 static int tr_LONG(Xapian::StemImplementation * this_ptr) {
13  return (static_cast<Xapian::InternalStemFinnish *>(this_ptr))->r_LONG();
14 }
15 
16 static const among_function af[2] =
17 {
18 /* 1 */ tr_VI,
19 /* 2 */ tr_LONG
20 };
21 
22 static const symbol s_pool[] = {
23 #define s_0_0 0
24 'p', 'a',
25 #define s_0_1 2
26 's', 't', 'i',
27 #define s_0_2 5
28 'k', 'a', 'a', 'n',
29 #define s_0_3 9
30 'h', 'a', 'n',
31 #define s_0_4 12
32 'k', 'i', 'n',
33 #define s_0_5 15
34 'h', 0xC3, 0xA4, 'n',
35 #define s_0_6 19
36 'k', 0xC3, 0xA4, 0xC3, 0xA4, 'n',
37 #define s_0_7 25
38 'k', 'o',
39 #define s_0_8 27
40 'p', 0xC3, 0xA4,
41 #define s_0_9 30
42 'k', 0xC3, 0xB6,
43 #define s_1_0 33
44 'l', 'l', 'a',
45 #define s_1_1 36
46 'n', 'a',
47 #define s_1_2 38
48 's', 's', 'a',
49 #define s_1_3 (s_1_4 + 1)
50 #define s_1_4 41
51 'l', 't', 'a',
52 #define s_1_5 44
53 's', 't', 'a',
54 #define s_2_0 47
55 'l', 'l', 0xC3, 0xA4,
56 #define s_2_1 51
57 'n', 0xC3, 0xA4,
58 #define s_2_2 54
59 's', 's', 0xC3, 0xA4,
60 #define s_2_3 (s_2_4 + 1)
61 #define s_2_4 58
62 'l', 't', 0xC3, 0xA4,
63 #define s_2_5 62
64 's', 't', 0xC3, 0xA4,
65 #define s_3_0 66
66 'l', 'l', 'e',
67 #define s_3_1 69
68 'i', 'n', 'e',
69 #define s_4_0 72
70 'n', 's', 'a',
71 #define s_4_1 75
72 'm', 'm', 'e',
73 #define s_4_2 78
74 'n', 'n', 'e',
75 #define s_4_3 81
76 'n', 'i',
77 #define s_4_4 83
78 's', 'i',
79 #define s_4_5 85
80 'a', 'n',
81 #define s_4_6 87
82 'e', 'n',
83 #define s_4_7 89
84 0xC3, 0xA4, 'n',
85 #define s_4_8 92
86 'n', 's', 0xC3, 0xA4,
87 #define s_5_0 96
88 'a', 'a',
89 #define s_5_1 98
90 'e', 'e',
91 #define s_5_2 100
92 'i', 'i',
93 #define s_5_3 102
94 'o', 'o',
95 #define s_5_4 104
96 'u', 'u',
97 #define s_5_5 106
98 0xC3, 0xA4, 0xC3, 0xA4,
99 #define s_5_6 110
100 0xC3, 0xB6, 0xC3, 0xB6,
101 #define s_6_0 (s_6_1 + 2)
102 #define s_6_1 114
103 'l', 'l', 'a',
104 #define s_6_2 117
105 'n', 'a',
106 #define s_6_3 119
107 's', 's', 'a',
108 #define s_6_4 (s_6_5 + 1)
109 #define s_6_5 122
110 'l', 't', 'a',
111 #define s_6_6 125
112 's', 't', 'a',
113 #define s_6_7 128
114 't', 't', 'a',
115 #define s_6_8 131
116 'l', 'l', 'e',
117 #define s_6_9 134
118 'i', 'n', 'e',
119 #define s_6_10 137
120 'k', 's', 'i',
121 #define s_6_11 s_6_2
122 #define s_6_12 140
123 'h', 'a', 'n',
124 #define s_6_13 143
125 'd', 'e', 'n',
126 #define s_6_14 146
127 's', 'e', 'e', 'n',
128 #define s_6_15 150
129 'h', 'e', 'n',
130 #define s_6_16 153
131 't', 't', 'e', 'n',
132 #define s_6_17 157
133 'h', 'i', 'n',
134 #define s_6_18 160
135 's', 'i', 'i', 'n',
136 #define s_6_19 164
137 'h', 'o', 'n',
138 #define s_6_20 167
139 'h', 0xC3, 0xA4, 'n',
140 #define s_6_21 171
141 'h', 0xC3, 0xB6, 'n',
142 #define s_6_22 (s_6_20 + 1)
143 #define s_6_23 175
144 'l', 'l', 0xC3, 0xA4,
145 #define s_6_24 179
146 'n', 0xC3, 0xA4,
147 #define s_6_25 182
148 's', 's', 0xC3, 0xA4,
149 #define s_6_26 (s_6_27 + 1)
150 #define s_6_27 186
151 'l', 't', 0xC3, 0xA4,
152 #define s_6_28 190
153 's', 't', 0xC3, 0xA4,
154 #define s_6_29 194
155 't', 't', 0xC3, 0xA4,
156 #define s_7_0 198
157 'e', 'j', 'a',
158 #define s_7_1 (s_7_2 + 1)
159 #define s_7_2 201
160 'i', 'm', 'm', 'a',
161 #define s_7_3 (s_7_4 + 1)
162 #define s_7_4 205
163 'i', 'm', 'p', 'a',
164 #define s_7_5 (s_7_6 + 1)
165 #define s_7_6 209
166 'i', 'm', 'm', 'i',
167 #define s_7_7 (s_7_8 + 1)
168 #define s_7_8 213
169 'i', 'm', 'p', 'i',
170 #define s_7_9 217
171 'e', 'j', 0xC3, 0xA4,
172 #define s_7_10 (s_7_11 + 1)
173 #define s_7_11 221
174 'i', 'm', 'm', 0xC3, 0xA4,
175 #define s_7_12 (s_7_13 + 1)
176 #define s_7_13 226
177 'i', 'm', 'p', 0xC3, 0xA4,
178 #define s_8_0 231
179 'i',
180 #define s_8_1 232
181 'j',
182 #define s_9_0 (s_9_1 + 1)
183 #define s_9_1 233
184 'i', 'm', 'm', 'a',
185 };
186 
187 
188 static const struct among a_0[10] =
189 {
190 /* 0 */ { 2, s_0_0, -1, 1},
191 /* 1 */ { 3, s_0_1, -1, 2},
192 /* 2 */ { 4, s_0_2, -1, 1},
193 /* 3 */ { 3, s_0_3, -1, 1},
194 /* 4 */ { 3, s_0_4, -1, 1},
195 /* 5 */ { 4, s_0_5, -1, 1},
196 /* 6 */ { 6, s_0_6, -1, 1},
197 /* 7 */ { 2, s_0_7, -1, 1},
198 /* 8 */ { 3, s_0_8, -1, 1},
199 /* 9 */ { 3, s_0_9, -1, 1}
200 };
201 
202 
203 static const struct among a_1[6] =
204 {
205 /* 0 */ { 3, s_1_0, -1, -1},
206 /* 1 */ { 2, s_1_1, -1, -1},
207 /* 2 */ { 3, s_1_2, -1, -1},
208 /* 3 */ { 2, s_1_3, -1, -1},
209 /* 4 */ { 3, s_1_4, 3, -1},
210 /* 5 */ { 3, s_1_5, 3, -1}
211 };
212 
213 
214 static const struct among a_2[6] =
215 {
216 /* 0 */ { 4, s_2_0, -1, -1},
217 /* 1 */ { 3, s_2_1, -1, -1},
218 /* 2 */ { 4, s_2_2, -1, -1},
219 /* 3 */ { 3, s_2_3, -1, -1},
220 /* 4 */ { 4, s_2_4, 3, -1},
221 /* 5 */ { 4, s_2_5, 3, -1}
222 };
223 
224 
225 static const struct among a_3[2] =
226 {
227 /* 0 */ { 3, s_3_0, -1, -1},
228 /* 1 */ { 3, s_3_1, -1, -1}
229 };
230 
231 
232 static const struct among a_4[9] =
233 {
234 /* 0 */ { 3, s_4_0, -1, 3},
235 /* 1 */ { 3, s_4_1, -1, 3},
236 /* 2 */ { 3, s_4_2, -1, 3},
237 /* 3 */ { 2, s_4_3, -1, 2},
238 /* 4 */ { 2, s_4_4, -1, 1},
239 /* 5 */ { 2, s_4_5, -1, 4},
240 /* 6 */ { 2, s_4_6, -1, 6},
241 /* 7 */ { 3, s_4_7, -1, 5},
242 /* 8 */ { 4, s_4_8, -1, 3}
243 };
244 
245 
246 static const struct among a_5[7] =
247 {
248 /* 0 */ { 2, s_5_0, -1, -1},
249 /* 1 */ { 2, s_5_1, -1, -1},
250 /* 2 */ { 2, s_5_2, -1, -1},
251 /* 3 */ { 2, s_5_3, -1, -1},
252 /* 4 */ { 2, s_5_4, -1, -1},
253 /* 5 */ { 4, s_5_5, -1, -1},
254 /* 6 */ { 4, s_5_6, -1, -1}
255 };
256 
257 
258 static const struct among a_6[30] =
259 {
260 /* 0 */ { 1, s_6_0, -1, 8},
261 /* 1 */ { 3, s_6_1, 0, -1},
262 /* 2 */ { 2, s_6_2, 0, -1},
263 /* 3 */ { 3, s_6_3, 0, -1},
264 /* 4 */ { 2, s_6_4, 0, -1},
265 /* 5 */ { 3, s_6_5, 4, -1},
266 /* 6 */ { 3, s_6_6, 4, -1},
267 /* 7 */ { 3, s_6_7, 4, 2},
268 /* 8 */ { 3, s_6_8, -1, -1},
269 /* 9 */ { 3, s_6_9, -1, -1},
270 /* 10 */ { 3, s_6_10, -1, -1},
271 /* 11 */ { 1, s_6_11, -1, 7},
272 /* 12 */ { 3, s_6_12, 11, 1},
273 /* 13 */ { 3, s_6_13, 11, -1},
274 /* 14 */ { 4, s_6_14, 11, -1},
275 /* 15 */ { 3, s_6_15, 11, 2},
276 /* 16 */ { 4, s_6_16, 11, -1},
277 /* 17 */ { 3, s_6_17, 11, 3},
278 /* 18 */ { 4, s_6_18, 11, -1},
279 /* 19 */ { 3, s_6_19, 11, 4},
280 /* 20 */ { 4, s_6_20, 11, 5},
281 /* 21 */ { 4, s_6_21, 11, 6},
282 /* 22 */ { 2, s_6_22, -1, 8},
283 /* 23 */ { 4, s_6_23, 22, -1},
284 /* 24 */ { 3, s_6_24, 22, -1},
285 /* 25 */ { 4, s_6_25, 22, -1},
286 /* 26 */ { 3, s_6_26, 22, -1},
287 /* 27 */ { 4, s_6_27, 26, -1},
288 /* 28 */ { 4, s_6_28, 26, -1},
289 /* 29 */ { 4, s_6_29, 26, 2}
290 };
291 
292 static const unsigned char af_6[30] =
293 {
294 /* 0 */ 0,
295 /* 1 */ 0,
296 /* 2 */ 0,
297 /* 3 */ 0,
298 /* 4 */ 0,
299 /* 5 */ 0,
300 /* 6 */ 0,
301 /* 7 */ 0,
302 /* 8 */ 0,
303 /* 9 */ 0,
304 /* 10 */ 0,
305 /* 11 */ 0,
306 /* 12 */ 0,
307 /* 13 */ 1 /* tr_VI */,
308 /* 14 */ 2 /* tr_LONG */,
309 /* 15 */ 0,
310 /* 16 */ 1 /* tr_VI */,
311 /* 17 */ 0,
312 /* 18 */ 1 /* tr_VI */,
313 /* 19 */ 0,
314 /* 20 */ 0,
315 /* 21 */ 0,
316 /* 22 */ 0,
317 /* 23 */ 0,
318 /* 24 */ 0,
319 /* 25 */ 0,
320 /* 26 */ 0,
321 /* 27 */ 0,
322 /* 28 */ 0,
323 /* 29 */ 0
324 };
325 
326 
327 static const struct among a_7[14] =
328 {
329 /* 0 */ { 3, s_7_0, -1, -1},
330 /* 1 */ { 3, s_7_1, -1, 1},
331 /* 2 */ { 4, s_7_2, 1, -1},
332 /* 3 */ { 3, s_7_3, -1, 1},
333 /* 4 */ { 4, s_7_4, 3, -1},
334 /* 5 */ { 3, s_7_5, -1, 1},
335 /* 6 */ { 4, s_7_6, 5, -1},
336 /* 7 */ { 3, s_7_7, -1, 1},
337 /* 8 */ { 4, s_7_8, 7, -1},
338 /* 9 */ { 4, s_7_9, -1, -1},
339 /* 10 */ { 4, s_7_10, -1, 1},
340 /* 11 */ { 5, s_7_11, 10, -1},
341 /* 12 */ { 4, s_7_12, -1, 1},
342 /* 13 */ { 5, s_7_13, 12, -1}
343 };
344 
345 
346 static const struct among a_8[2] =
347 {
348 /* 0 */ { 1, s_8_0, -1, -1},
349 /* 1 */ { 1, s_8_1, -1, -1}
350 };
351 
352 
353 static const struct among a_9[2] =
354 {
355 /* 0 */ { 3, s_9_0, -1, 1},
356 /* 1 */ { 4, s_9_1, 0, -1}
357 };
358 
359 static const unsigned char g_AEI[] = { 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8 };
360 
361 static const unsigned char g_V1[] = { 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
362 
363 static const unsigned char g_V2[] = { 17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
364 
365 static const unsigned char g_particle_end[] = { 17, 97, 24, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 32 };
366 
367 static const symbol s_0[] = { 'k', 's', 'e' };
368 static const symbol s_1[] = { 'k', 's', 'i' };
369 static const symbol s_2[] = { 0xC3, 0xA4 };
370 static const symbol s_3[] = { 0xC3, 0xB6 };
371 static const symbol s_4[] = { 'i', 'e' };
372 static const symbol s_5[] = { 'p', 'o' };
373 static const symbol s_6[] = { 'p', 'o' };
374 
376  I_p1 = l;
377  I_p2 = l;
378  {
379  int ret = out_grouping_U(g_V1, 97, 246, 1);
380  if (ret < 0) return 0;
381  c += ret;
382  }
383  {
384  int ret = in_grouping_U(g_V1, 97, 246, 1);
385  if (ret < 0) return 0;
386  c += ret;
387  }
388  I_p1 = c;
389  {
390  int ret = out_grouping_U(g_V1, 97, 246, 1);
391  if (ret < 0) return 0;
392  c += ret;
393  }
394  {
395  int ret = in_grouping_U(g_V1, 97, 246, 1);
396  if (ret < 0) return 0;
397  c += ret;
398  }
399  I_p2 = c;
400  return 1;
401 }
402 
404  if (!(I_p2 <= c)) return 0;
405  return 1;
406 }
407 
409  int among_var;
410 
411  { int mlimit1;
412  if (c < I_p1) return 0;
413  mlimit1 = lb; lb = I_p1;
414  ket = c;
415  among_var = find_among_b(s_pool, a_0, 10, 0, 0);
416  if (!(among_var)) { lb = mlimit1; return 0; }
417  bra = c;
418  lb = mlimit1;
419  }
420  switch (among_var) {
421  case 1:
422  if (in_grouping_b_U(g_particle_end, 97, 246, 0)) return 0;
423  break;
424  case 2:
425  { int ret = r_R2();
426  if (ret <= 0) return ret;
427  }
428  break;
429  }
430  { int ret = slice_del();
431  if (ret < 0) return ret;
432  }
433  return 1;
434 }
435 
437  int among_var;
438 
439  { int mlimit1;
440  if (c < I_p1) return 0;
441  mlimit1 = lb; lb = I_p1;
442  ket = c;
443  among_var = find_among_b(s_pool, a_4, 9, 0, 0);
444  if (!(among_var)) { lb = mlimit1; return 0; }
445  bra = c;
446  lb = mlimit1;
447  }
448  switch (among_var) {
449  case 1:
450  { int m2 = l - c; (void)m2;
451  if (c <= lb || p[c - 1] != 'k') goto lab0;
452  c--;
453  return 0;
454  lab0:
455  c = l - m2;
456  }
457  { int ret = slice_del();
458  if (ret < 0) return ret;
459  }
460  break;
461  case 2:
462  { int ret = slice_del();
463  if (ret < 0) return ret;
464  }
465  ket = c;
466  if (!(eq_s_b(3, s_0))) return 0;
467  bra = c;
468  { int ret = slice_from_s(3, s_1);
469  if (ret < 0) return ret;
470  }
471  break;
472  case 3:
473  { int ret = slice_del();
474  if (ret < 0) return ret;
475  }
476  break;
477  case 4:
478  if (c - 1 <= lb || p[c - 1] != 97) return 0;
479  if (!(find_among_b(s_pool, a_1, 6, 0, 0))) return 0;
480  { int ret = slice_del();
481  if (ret < 0) return ret;
482  }
483  break;
484  case 5:
485  if (c - 2 <= lb || p[c - 1] != 164) return 0;
486  if (!(find_among_b(s_pool, a_2, 6, 0, 0))) return 0;
487  { int ret = slice_del();
488  if (ret < 0) return ret;
489  }
490  break;
491  case 6:
492  if (c - 2 <= lb || p[c - 1] != 101) return 0;
493  if (!(find_among_b(s_pool, a_3, 2, 0, 0))) return 0;
494  { int ret = slice_del();
495  if (ret < 0) return ret;
496  }
497  break;
498  }
499  return 1;
500 }
501 
503  if (!(find_among_b(s_pool, a_5, 7, 0, 0))) return 0;
504  return 1;
505 }
506 
508  if (c <= lb || p[c - 1] != 'i') return 0;
509  c--;
510  if (in_grouping_b_U(g_V2, 97, 246, 0)) return 0;
511  return 1;
512 }
513 
515  int among_var;
516 
517  { int mlimit1;
518  if (c < I_p1) return 0;
519  mlimit1 = lb; lb = I_p1;
520  ket = c;
521  among_var = find_among_b(s_pool, a_6, 30, af_6, af);
522  if (!(among_var)) { lb = mlimit1; return 0; }
523  bra = c;
524  lb = mlimit1;
525  }
526  switch (among_var) {
527  case 1:
528  if (c <= lb || p[c - 1] != 'a') return 0;
529  c--;
530  break;
531  case 2:
532  if (c <= lb || p[c - 1] != 'e') return 0;
533  c--;
534  break;
535  case 3:
536  if (c <= lb || p[c - 1] != 'i') return 0;
537  c--;
538  break;
539  case 4:
540  if (c <= lb || p[c - 1] != 'o') return 0;
541  c--;
542  break;
543  case 5:
544  if (!(eq_s_b(2, s_2))) return 0;
545  break;
546  case 6:
547  if (!(eq_s_b(2, s_3))) return 0;
548  break;
549  case 7:
550  { int m2 = l - c; (void)m2;
551  { int m3 = l - c; (void)m3;
552  { int m4 = l - c; (void)m4;
553  { int ret = r_LONG();
554  if (ret == 0) goto lab2;
555  if (ret < 0) return ret;
556  }
557  goto lab1;
558  lab2:
559  c = l - m4;
560  if (!(eq_s_b(2, s_4))) { c = l - m2; goto lab0; }
561  }
562  lab1:
563  c = l - m3;
564  { int ret = skip_utf8(p, c, lb, 0, -1);
565  if (ret < 0) { c = l - m2; goto lab0; }
566  c = ret;
567  }
568  }
569  bra = c;
570  lab0:
571  ;
572  }
573  break;
574  case 8:
575  if (in_grouping_b_U(g_V1, 97, 246, 0)) return 0;
576  if (out_grouping_b_U(g_V1, 97, 246, 0)) return 0;
577  break;
578  }
579  { int ret = slice_del();
580  if (ret < 0) return ret;
581  }
582  I_ending_removed = 1;
583  return 1;
584 }
585 
587  int among_var;
588 
589  { int mlimit1;
590  if (c < I_p2) return 0;
591  mlimit1 = lb; lb = I_p2;
592  ket = c;
593  among_var = find_among_b(s_pool, a_7, 14, 0, 0);
594  if (!(among_var)) { lb = mlimit1; return 0; }
595  bra = c;
596  lb = mlimit1;
597  }
598  switch (among_var) {
599  case 1:
600  { int m2 = l - c; (void)m2;
601  if (!(eq_s_b(2, s_5))) goto lab0;
602  return 0;
603  lab0:
604  c = l - m2;
605  }
606  break;
607  }
608  { int ret = slice_del();
609  if (ret < 0) return ret;
610  }
611  return 1;
612 }
613 
615 
616  { int mlimit1;
617  if (c < I_p1) return 0;
618  mlimit1 = lb; lb = I_p1;
619  ket = c;
620  if (c <= lb || (p[c - 1] != 105 && p[c - 1] != 106)) { lb = mlimit1; return 0; }
621  if (!(find_among_b(s_pool, a_8, 2, 0, 0))) { lb = mlimit1; return 0; }
622  bra = c;
623  lb = mlimit1;
624  }
625  { int ret = slice_del();
626  if (ret < 0) return ret;
627  }
628  return 1;
629 }
630 
632  int among_var;
633 
634  { int mlimit1;
635  if (c < I_p1) return 0;
636  mlimit1 = lb; lb = I_p1;
637  ket = c;
638  if (c <= lb || p[c - 1] != 't') { lb = mlimit1; return 0; }
639  c--;
640  bra = c;
641  { int m_test2 = l - c;
642  if (in_grouping_b_U(g_V1, 97, 246, 0)) { lb = mlimit1; return 0; }
643  c = l - m_test2;
644  }
645  { int ret = slice_del();
646  if (ret < 0) return ret;
647  }
648  lb = mlimit1;
649  }
650 
651  { int mlimit3;
652  if (c < I_p2) return 0;
653  mlimit3 = lb; lb = I_p2;
654  ket = c;
655  if (c - 2 <= lb || p[c - 1] != 97) { lb = mlimit3; return 0; }
656  among_var = find_among_b(s_pool, a_9, 2, 0, 0);
657  if (!(among_var)) { lb = mlimit3; return 0; }
658  bra = c;
659  lb = mlimit3;
660  }
661  switch (among_var) {
662  case 1:
663  { int m4 = l - c; (void)m4;
664  if (!(eq_s_b(2, s_6))) goto lab0;
665  return 0;
666  lab0:
667  c = l - m4;
668  }
669  break;
670  }
671  { int ret = slice_del();
672  if (ret < 0) return ret;
673  }
674  return 1;
675 }
676 
678 
679  { int mlimit1;
680  if (c < I_p1) return 0;
681  mlimit1 = lb; lb = I_p1;
682  { int m2 = l - c; (void)m2;
683  { int m3 = l - c; (void)m3;
684  { int ret = r_LONG();
685  if (ret == 0) goto lab0;
686  if (ret < 0) return ret;
687  }
688  c = l - m3;
689  ket = c;
690  { int ret = skip_utf8(p, c, lb, 0, -1);
691  if (ret < 0) goto lab0;
692  c = ret;
693  }
694  bra = c;
695  { int ret = slice_del();
696  if (ret < 0) return ret;
697  }
698  }
699  lab0:
700  c = l - m2;
701  }
702  { int m4 = l - c; (void)m4;
703  ket = c;
704  if (in_grouping_b_U(g_AEI, 97, 228, 0)) goto lab1;
705  bra = c;
706  if (out_grouping_b_U(g_V1, 97, 246, 0)) goto lab1;
707  { int ret = slice_del();
708  if (ret < 0) return ret;
709  }
710  lab1:
711  c = l - m4;
712  }
713  { int m5 = l - c; (void)m5;
714  ket = c;
715  if (c <= lb || p[c - 1] != 'j') goto lab2;
716  c--;
717  bra = c;
718  { int m6 = l - c; (void)m6;
719  if (c <= lb || p[c - 1] != 'o') goto lab4;
720  c--;
721  goto lab3;
722  lab4:
723  c = l - m6;
724  if (c <= lb || p[c - 1] != 'u') goto lab2;
725  c--;
726  }
727  lab3:
728  { int ret = slice_del();
729  if (ret < 0) return ret;
730  }
731  lab2:
732  c = l - m5;
733  }
734  { int m7 = l - c; (void)m7;
735  ket = c;
736  if (c <= lb || p[c - 1] != 'o') goto lab5;
737  c--;
738  bra = c;
739  if (c <= lb || p[c - 1] != 'j') goto lab5;
740  c--;
741  { int ret = slice_del();
742  if (ret < 0) return ret;
743  }
744  lab5:
745  c = l - m7;
746  }
747  lb = mlimit1;
748  }
749  if (in_grouping_b_U(g_V1, 97, 246, 1) < 0) return 0;
750  ket = c;
751  { int ret = skip_utf8(p, c, lb, 0, -1);
752  if (ret < 0) return 0;
753  c = ret;
754  }
755  bra = c;
756  { symbol * ret = slice_to(S_x);
757  if (ret == 0) return -1;
758  S_x = ret;
759  }
760  if (!(eq_v_b(S_x))) return 0;
761  { int ret = slice_del();
762  if (ret < 0) return ret;
763  }
764  return 1;
765 }
766 
768  { int c1 = c;
769  { int ret = r_mark_regions();
770  if (ret < 0) return ret;
771  }
772  c = c1;
773  }
774  I_ending_removed = 0;
775  lb = c; c = l;
776 
777  { int m2 = l - c; (void)m2;
778  { int ret = r_particle_etc();
779  if (ret < 0) return ret;
780  }
781  c = l - m2;
782  }
783  { int m3 = l - c; (void)m3;
784  { int ret = r_possessive();
785  if (ret < 0) return ret;
786  }
787  c = l - m3;
788  }
789  { int m4 = l - c; (void)m4;
790  { int ret = r_case_ending();
791  if (ret < 0) return ret;
792  }
793  c = l - m4;
794  }
795  { int m5 = l - c; (void)m5;
796  { int ret = r_other_endings();
797  if (ret < 0) return ret;
798  }
799  c = l - m5;
800  }
801 
802  if (!(I_ending_removed)) goto lab1;
803  { int m6 = l - c; (void)m6;
804  { int ret = r_i_plural();
805  if (ret < 0) return ret;
806  }
807  c = l - m6;
808  }
809  goto lab0;
810 lab1:
811  { int m7 = l - c; (void)m7;
812  { int ret = r_t_plural();
813  if (ret < 0) return ret;
814  }
815  c = l - m7;
816  }
817 lab0:
818  { int m8 = l - c; (void)m8;
819  { int ret = r_tidy();
820  if (ret < 0) return ret;
821  }
822  c = l - m8;
823  }
824  c = lb;
825  return 1;
826 }
827 
829  : I_ending_removed(0), S_x(0), I_p2(0), I_p1(0)
830 {
831  S_x = create_s();
832 }
833 
835 {
836  lose_s(S_x);
837 }
838 
839 std::string
841 {
842  return "finnish";
843 }
#define s_7_4
#define s_6_8
#define s_6_3
static const among_function af[2]
Definition: finnish.cc:16
unsigned char I_ending_removed
Definition: finnish.h:9
#define s_6_0
#define s_6_26
#define s_6_18
#define s_6_4
#define s_2_3
#define s_9_1
#define s_2_5
int find_among_b(const symbol *pool, const struct among *v, int v_size, const unsigned char *fnum, const among_function *f)
static const struct among a_2[6]
Definition: finnish.cc:214
static const struct among a_5[7]
Definition: finnish.cc:246
#define s_5_2
#define s_6_9
#define s_4_8
#define s_4_3
#define s_6_28
#define s_0_1
#define s_7_0
static const unsigned char g_AEI[]
Definition: finnish.cc:359
#define s_0_4
int eq_s_b(int s_size, const symbol *s)
#define s_6_17
#define s_7_11
#define s_5_0
#define s_0_7
#define s_1_1
#define s_3_1
#define s_6_11
#define s_2_0
static const struct among a_9[2]
Definition: finnish.cc:353
static const symbol s_0[]
Definition: finnish.cc:367
#define s_0_5
static const symbol s_1[]
Definition: finnish.cc:368
#define s_1_0
#define s_6_19
#define s_7_12
#define s_6_24
#define s_6_23
#define s_5_3
static const struct among a_6[30]
Definition: finnish.cc:258
static const symbol s_6[]
Definition: finnish.cc:373
#define s_3_0
static const struct among a_0[10]
Definition: finnish.cc:188
#define s_7_9
int slice_from_s(int s_size, const symbol *s)
#define s_5_6
static const symbol s_pool[]
Definition: finnish.cc:22
#define s_4_0
#define s_0_3
#define s_1_3
#define s_6_13
#define s_6_12
#define s_8_0
#define s_1_4
static const unsigned char g_particle_end[]
Definition: finnish.cc:365
#define s_7_7
static const struct among a_4[9]
Definition: finnish.cc:232
unsigned short symbol
Definition: header.h:6
#define s_7_10
#define s_6_27
static const unsigned char g_V2[]
Definition: finnish.cc:363
int(* among_function)(Xapian::StemImplementation *)
Definition: steminternal.h:36
static const symbol s_5[]
Definition: finnish.cc:372
#define s_0_2
static const struct among a_1[6]
Definition: finnish.cc:203
#define s_2_1
#define s_6_21
#define s_5_4
#define s_8_1
#define s_1_2
#define s_2_2
static const struct among a_8[2]
Definition: finnish.cc:346
#define s_0_8
#define s_7_1
Class representing a stemming algorithm implementation.
Definition: stem.h:38
Definition: header.h:191
static const struct among a_3[2]
Definition: finnish.cc:225
#define s_0_9
#define s_6_25
#define s_0_0
static const struct among a_7[14]
Definition: finnish.cc:327
#define s_6_20
#define s_4_5
static int skip_utf8(const symbol *p, int c, int lb, int l, int n)
Definition: steminternal.cc:94
#define s_1_5
static const unsigned char g_V1[]
Definition: finnish.cc:361
#define s_4_2
#define s_4_7
#define s_9_0
std::string get_description() const
Return a string describing this object.
Definition: finnish.cc:840
int in_grouping_b_U(const unsigned char *s, int min, int max, int repeat)
#define s_4_1
#define s_6_15
#define s_7_8
#define s_6_10
#define s_6_2
#define s_7_13
static const symbol s_3[]
Definition: finnish.cc:370
#define s_7_2
static const unsigned char af_6[30]
Definition: finnish.cc:292
int out_grouping_b_U(const unsigned char *s, int min, int max, int repeat)
#define s_6_6
#define s_6_14
static int tr_VI(Xapian::StemImplementation *this_ptr)
Definition: finnish.cc:8
#define s_6_22
static const symbol s_4[]
Definition: finnish.cc:371
#define s_6_1
#define s_7_5
#define s_2_4
int out_grouping_U(const unsigned char *s, int min, int max, int repeat)
#define s_0_6
#define s_4_6
#define s_6_7
#define s_7_6
#define s_6_29
#define s_6_5
#define s_7_3
void lose_s(symbol *p)
Definition: steminternal.h:45
#define s_5_5
#define s_4_4
#define s_6_16
int stem()
Virtual method implemented by the subclass to actually do the work.
Definition: finnish.cc:767
int in_grouping_U(const unsigned char *s, int min, int max, int repeat)
static int tr_LONG(Xapian::StemImplementation *this_ptr)
Definition: finnish.cc:12
static const symbol s_2[]
Definition: finnish.cc:369
#define s_5_1