xapian-core  1.4.20
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  if (out_grouping_U(g_V1, 97, 246, 1) < 0) return 0;
379  {
380  int ret = in_grouping_U(g_V1, 97, 246, 1);
381  if (ret < 0) return 0;
382  c += ret;
383  }
384  I_p1 = c;
385  if (out_grouping_U(g_V1, 97, 246, 1) < 0) return 0;
386  {
387  int ret = in_grouping_U(g_V1, 97, 246, 1);
388  if (ret < 0) return 0;
389  c += ret;
390  }
391  I_p2 = c;
392  return 1;
393 }
394 
396  if (!(I_p2 <= c)) return 0;
397  return 1;
398 }
399 
401  int among_var;
402 
403  { int mlimit1;
404  if (c < I_p1) return 0;
405  mlimit1 = lb; lb = I_p1;
406  ket = c;
407  among_var = find_among_b(s_pool, a_0, 10, 0, 0);
408  if (!(among_var)) { lb = mlimit1; return 0; }
409  bra = c;
410  lb = mlimit1;
411  }
412  switch (among_var) {
413  case 1:
414  if (in_grouping_b_U(g_particle_end, 97, 246, 0)) return 0;
415  break;
416  case 2:
417  { int ret = r_R2();
418  if (ret <= 0) return ret;
419  }
420  break;
421  }
422  { int ret = slice_del();
423  if (ret < 0) return ret;
424  }
425  return 1;
426 }
427 
429  int among_var;
430 
431  { int mlimit1;
432  if (c < I_p1) return 0;
433  mlimit1 = lb; lb = I_p1;
434  ket = c;
435  among_var = find_among_b(s_pool, a_4, 9, 0, 0);
436  if (!(among_var)) { lb = mlimit1; return 0; }
437  bra = c;
438  lb = mlimit1;
439  }
440  switch (among_var) {
441  case 1:
442  { int m2 = l - c; (void)m2;
443  if (c <= lb || p[c - 1] != 'k') goto lab0;
444  c--;
445  return 0;
446  lab0:
447  c = l - m2;
448  }
449  { int ret = slice_del();
450  if (ret < 0) return ret;
451  }
452  break;
453  case 2:
454  { int ret = slice_del();
455  if (ret < 0) return ret;
456  }
457  ket = c;
458  if (!(eq_s_b(3, s_0))) return 0;
459  bra = c;
460  { int ret = slice_from_s(3, s_1);
461  if (ret < 0) return ret;
462  }
463  break;
464  case 3:
465  { int ret = slice_del();
466  if (ret < 0) return ret;
467  }
468  break;
469  case 4:
470  if (c - 1 <= lb || p[c - 1] != 97) return 0;
471  if (!(find_among_b(s_pool, a_1, 6, 0, 0))) return 0;
472  { int ret = slice_del();
473  if (ret < 0) return ret;
474  }
475  break;
476  case 5:
477  if (c - 2 <= lb || p[c - 1] != 164) return 0;
478  if (!(find_among_b(s_pool, a_2, 6, 0, 0))) return 0;
479  { int ret = slice_del();
480  if (ret < 0) return ret;
481  }
482  break;
483  case 6:
484  if (c - 2 <= lb || p[c - 1] != 101) return 0;
485  if (!(find_among_b(s_pool, a_3, 2, 0, 0))) return 0;
486  { int ret = slice_del();
487  if (ret < 0) return ret;
488  }
489  break;
490  }
491  return 1;
492 }
493 
495  if (!(find_among_b(s_pool, a_5, 7, 0, 0))) return 0;
496  return 1;
497 }
498 
500  if (c <= lb || p[c - 1] != 'i') return 0;
501  c--;
502  if (in_grouping_b_U(g_V2, 97, 246, 0)) return 0;
503  return 1;
504 }
505 
507  int among_var;
508 
509  { int mlimit1;
510  if (c < I_p1) return 0;
511  mlimit1 = lb; lb = I_p1;
512  ket = c;
513  among_var = find_among_b(s_pool, a_6, 30, af_6, af);
514  if (!(among_var)) { lb = mlimit1; return 0; }
515  bra = c;
516  lb = mlimit1;
517  }
518  switch (among_var) {
519  case 1:
520  if (c <= lb || p[c - 1] != 'a') return 0;
521  c--;
522  break;
523  case 2:
524  if (c <= lb || p[c - 1] != 'e') return 0;
525  c--;
526  break;
527  case 3:
528  if (c <= lb || p[c - 1] != 'i') return 0;
529  c--;
530  break;
531  case 4:
532  if (c <= lb || p[c - 1] != 'o') return 0;
533  c--;
534  break;
535  case 5:
536  if (!(eq_s_b(2, s_2))) return 0;
537  break;
538  case 6:
539  if (!(eq_s_b(2, s_3))) return 0;
540  break;
541  case 7:
542  { int m2 = l - c; (void)m2;
543  { int m3 = l - c; (void)m3;
544  { int m4 = l - c; (void)m4;
545  { int ret = r_LONG();
546  if (ret == 0) goto lab2;
547  if (ret < 0) return ret;
548  }
549  goto lab1;
550  lab2:
551  c = l - m4;
552  if (!(eq_s_b(2, s_4))) { c = l - m2; goto lab0; }
553  }
554  lab1:
555  c = l - m3;
556  { int ret = skip_utf8(p, c, lb, 0, -1);
557  if (ret < 0) { c = l - m2; goto lab0; }
558  c = ret;
559  }
560  }
561  bra = c;
562  lab0:
563  ;
564  }
565  break;
566  case 8:
567  if (in_grouping_b_U(g_V1, 97, 246, 0)) return 0;
568  if (out_grouping_b_U(g_V1, 97, 246, 0)) return 0;
569  break;
570  }
571  { int ret = slice_del();
572  if (ret < 0) return ret;
573  }
574  I_ending_removed = 1;
575  return 1;
576 }
577 
579  int among_var;
580 
581  { int mlimit1;
582  if (c < I_p2) return 0;
583  mlimit1 = lb; lb = I_p2;
584  ket = c;
585  among_var = find_among_b(s_pool, a_7, 14, 0, 0);
586  if (!(among_var)) { lb = mlimit1; return 0; }
587  bra = c;
588  lb = mlimit1;
589  }
590  switch (among_var) {
591  case 1:
592  { int m2 = l - c; (void)m2;
593  if (!(eq_s_b(2, s_5))) goto lab0;
594  return 0;
595  lab0:
596  c = l - m2;
597  }
598  break;
599  }
600  { int ret = slice_del();
601  if (ret < 0) return ret;
602  }
603  return 1;
604 }
605 
607 
608  { int mlimit1;
609  if (c < I_p1) return 0;
610  mlimit1 = lb; lb = I_p1;
611  ket = c;
612  if (c <= lb || (p[c - 1] != 105 && p[c - 1] != 106)) { lb = mlimit1; return 0; }
613  if (!(find_among_b(s_pool, a_8, 2, 0, 0))) { lb = mlimit1; return 0; }
614  bra = c;
615  lb = mlimit1;
616  }
617  { int ret = slice_del();
618  if (ret < 0) return ret;
619  }
620  return 1;
621 }
622 
624  int among_var;
625 
626  { int mlimit1;
627  if (c < I_p1) return 0;
628  mlimit1 = lb; lb = I_p1;
629  ket = c;
630  if (c <= lb || p[c - 1] != 't') { lb = mlimit1; return 0; }
631  c--;
632  bra = c;
633  { int m_test2 = l - c;
634  if (in_grouping_b_U(g_V1, 97, 246, 0)) { lb = mlimit1; return 0; }
635  c = l - m_test2;
636  }
637  { int ret = slice_del();
638  if (ret < 0) return ret;
639  }
640  lb = mlimit1;
641  }
642 
643  { int mlimit3;
644  if (c < I_p2) return 0;
645  mlimit3 = lb; lb = I_p2;
646  ket = c;
647  if (c - 2 <= lb || p[c - 1] != 97) { lb = mlimit3; return 0; }
648  among_var = find_among_b(s_pool, a_9, 2, 0, 0);
649  if (!(among_var)) { lb = mlimit3; return 0; }
650  bra = c;
651  lb = mlimit3;
652  }
653  switch (among_var) {
654  case 1:
655  { int m4 = l - c; (void)m4;
656  if (!(eq_s_b(2, s_6))) goto lab0;
657  return 0;
658  lab0:
659  c = l - m4;
660  }
661  break;
662  }
663  { int ret = slice_del();
664  if (ret < 0) return ret;
665  }
666  return 1;
667 }
668 
670 
671  { int mlimit1;
672  if (c < I_p1) return 0;
673  mlimit1 = lb; lb = I_p1;
674  { int m2 = l - c; (void)m2;
675  { int m3 = l - c; (void)m3;
676  { int ret = r_LONG();
677  if (ret == 0) goto lab0;
678  if (ret < 0) return ret;
679  }
680  c = l - m3;
681  ket = c;
682  { int ret = skip_utf8(p, c, lb, 0, -1);
683  if (ret < 0) goto lab0;
684  c = ret;
685  }
686  bra = c;
687  { int ret = slice_del();
688  if (ret < 0) return ret;
689  }
690  }
691  lab0:
692  c = l - m2;
693  }
694  { int m4 = l - c; (void)m4;
695  ket = c;
696  if (in_grouping_b_U(g_AEI, 97, 228, 0)) goto lab1;
697  bra = c;
698  if (out_grouping_b_U(g_V1, 97, 246, 0)) goto lab1;
699  { int ret = slice_del();
700  if (ret < 0) return ret;
701  }
702  lab1:
703  c = l - m4;
704  }
705  { int m5 = l - c; (void)m5;
706  ket = c;
707  if (c <= lb || p[c - 1] != 'j') goto lab2;
708  c--;
709  bra = c;
710  { int m6 = l - c; (void)m6;
711  if (c <= lb || p[c - 1] != 'o') goto lab4;
712  c--;
713  goto lab3;
714  lab4:
715  c = l - m6;
716  if (c <= lb || p[c - 1] != 'u') goto lab2;
717  c--;
718  }
719  lab3:
720  { int ret = slice_del();
721  if (ret < 0) return ret;
722  }
723  lab2:
724  c = l - m5;
725  }
726  { int m7 = l - c; (void)m7;
727  ket = c;
728  if (c <= lb || p[c - 1] != 'o') goto lab5;
729  c--;
730  bra = c;
731  if (c <= lb || p[c - 1] != 'j') goto lab5;
732  c--;
733  { int ret = slice_del();
734  if (ret < 0) return ret;
735  }
736  lab5:
737  c = l - m7;
738  }
739  lb = mlimit1;
740  }
741  if (in_grouping_b_U(g_V1, 97, 246, 1) < 0) return 0;
742  ket = c;
743  { int ret = skip_utf8(p, c, lb, 0, -1);
744  if (ret < 0) return 0;
745  c = ret;
746  }
747  bra = c;
748  { symbol * ret = slice_to(S_x);
749  if (ret == 0) return -1;
750  S_x = ret;
751  }
752  if (!(eq_v_b(S_x))) return 0;
753  { int ret = slice_del();
754  if (ret < 0) return ret;
755  }
756  return 1;
757 }
758 
760  { int c1 = c;
761  { int ret = r_mark_regions();
762  if (ret < 0) return ret;
763  }
764  c = c1;
765  }
766  I_ending_removed = 0;
767  lb = c; c = l;
768 
769  { int m2 = l - c; (void)m2;
770  { int ret = r_particle_etc();
771  if (ret < 0) return ret;
772  }
773  c = l - m2;
774  }
775  { int m3 = l - c; (void)m3;
776  { int ret = r_possessive();
777  if (ret < 0) return ret;
778  }
779  c = l - m3;
780  }
781  { int m4 = l - c; (void)m4;
782  { int ret = r_case_ending();
783  if (ret < 0) return ret;
784  }
785  c = l - m4;
786  }
787  { int m5 = l - c; (void)m5;
788  { int ret = r_other_endings();
789  if (ret < 0) return ret;
790  }
791  c = l - m5;
792  }
793 
794  if (!(I_ending_removed)) goto lab1;
795  { int m6 = l - c; (void)m6;
796  { int ret = r_i_plural();
797  if (ret < 0) return ret;
798  }
799  c = l - m6;
800  }
801  goto lab0;
802 lab1:
803  { int m7 = l - c; (void)m7;
804  { int ret = r_t_plural();
805  if (ret < 0) return ret;
806  }
807  c = l - m7;
808  }
809 lab0:
810  { int m8 = l - c; (void)m8;
811  { int ret = r_tidy();
812  if (ret < 0) return ret;
813  }
814  c = l - m8;
815  }
816  c = lb;
817  return 1;
818 }
819 
821  : I_ending_removed(0), S_x(0), I_p2(0), I_p1(0)
822 {
823  S_x = create_s();
824 }
825 
827 {
828  lose_s(S_x);
829 }
830 
831 std::string
833 {
834  return "finnish";
835 }
#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:832
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:759
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