⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 stem_utf_8_finnish.c

📁 postgresql8.3.4源码,开源数据库
💻 C
📖 第 1 页 / 共 2 页
字号:
        case 3:            {   int ret = slice_del(z); /* delete, line 78 */                if (ret < 0) return ret;            }            break;        case 4:            if (z->c - 1 <= z->lb || z->p[z->c - 1] != 97) return 0;            if (!(find_among_b(z, a_1, 6))) return 0; /* among, line 81 */            {   int ret = slice_del(z); /* delete, line 81 */                if (ret < 0) return ret;            }            break;        case 5:            if (z->c - 2 <= z->lb || z->p[z->c - 1] != 164) return 0;            if (!(find_among_b(z, a_2, 6))) return 0; /* among, line 83 */            {   int ret = slice_del(z); /* delete, line 84 */                if (ret < 0) return ret;            }            break;        case 6:            if (z->c - 2 <= z->lb || z->p[z->c - 1] != 101) return 0;            if (!(find_among_b(z, a_3, 2))) return 0; /* among, line 86 */            {   int ret = slice_del(z); /* delete, line 86 */                if (ret < 0) return ret;            }            break;    }    return 1;}static int r_LONG(struct SN_env * z) {    if (!(find_among_b(z, a_5, 7))) return 0; /* among, line 91 */    return 1;}static int r_VI(struct SN_env * z) {    if (!(eq_s_b(z, 1, s_3))) return 0;    if (in_grouping_b_U(z, g_V2, 97, 246, 0)) return 0;    return 1;}static int r_case_ending(struct SN_env * z) {    int among_var;    {   int mlimit; /* setlimit, line 96 */        int m1 = z->l - z->c; (void)m1;        if (z->c < z->I[0]) return 0;        z->c = z->I[0]; /* tomark, line 96 */        mlimit = z->lb; z->lb = z->c;        z->c = z->l - m1;        z->ket = z->c; /* [, line 96 */        among_var = find_among_b(z, a_6, 30); /* substring, line 96 */        if (!(among_var)) { z->lb = mlimit; return 0; }        z->bra = z->c; /* ], line 96 */        z->lb = mlimit;    }    switch(among_var) {        case 0: return 0;        case 1:            if (!(eq_s_b(z, 1, s_4))) return 0;            break;        case 2:            if (!(eq_s_b(z, 1, s_5))) return 0;            break;        case 3:            if (!(eq_s_b(z, 1, s_6))) return 0;            break;        case 4:            if (!(eq_s_b(z, 1, s_7))) return 0;            break;        case 5:            if (!(eq_s_b(z, 2, s_8))) return 0;            break;        case 6:            if (!(eq_s_b(z, 2, s_9))) return 0;            break;        case 7:            {   int m_keep = z->l - z->c;/* (void) m_keep;*/ /* try, line 111 */                {   int m2 = z->l - z->c; (void)m2; /* and, line 113 */                    {   int m3 = z->l - z->c; (void)m3; /* or, line 112 */                        {   int ret = r_LONG(z);                            if (ret == 0) goto lab2; /* call LONG, line 111 */                            if (ret < 0) return ret;                        }                        goto lab1;                    lab2:                        z->c = z->l - m3;                        if (!(eq_s_b(z, 2, s_10))) { z->c = z->l - m_keep; goto lab0; }                    }                lab1:                    z->c = z->l - m2;                    {   int ret = skip_utf8(z->p, z->c, z->lb, 0, -1);                        if (ret < 0) { z->c = z->l - m_keep; goto lab0; }                        z->c = ret; /* next, line 113 */                    }                }                z->bra = z->c; /* ], line 113 */            lab0:                ;            }            break;        case 8:            if (in_grouping_b_U(z, g_V1, 97, 246, 0)) return 0;            if (out_grouping_b_U(z, g_V1, 97, 246, 0)) return 0;            break;        case 9:            if (!(eq_s_b(z, 1, s_11))) return 0;            break;    }    {   int ret = slice_del(z); /* delete, line 138 */        if (ret < 0) return ret;    }    z->B[0] = 1; /* set ending_removed, line 139 */    return 1;}static int r_other_endings(struct SN_env * z) {    int among_var;    {   int mlimit; /* setlimit, line 142 */        int m1 = z->l - z->c; (void)m1;        if (z->c < z->I[1]) return 0;        z->c = z->I[1]; /* tomark, line 142 */        mlimit = z->lb; z->lb = z->c;        z->c = z->l - m1;        z->ket = z->c; /* [, line 142 */        among_var = find_among_b(z, a_7, 14); /* substring, line 142 */        if (!(among_var)) { z->lb = mlimit; return 0; }        z->bra = z->c; /* ], line 142 */        z->lb = mlimit;    }    switch(among_var) {        case 0: return 0;        case 1:            {   int m2 = z->l - z->c; (void)m2; /* not, line 146 */                if (!(eq_s_b(z, 2, s_12))) goto lab0;                return 0;            lab0:                z->c = z->l - m2;            }            break;    }    {   int ret = slice_del(z); /* delete, line 151 */        if (ret < 0) return ret;    }    return 1;}static int r_i_plural(struct SN_env * z) {    {   int mlimit; /* setlimit, line 154 */        int m1 = z->l - z->c; (void)m1;        if (z->c < z->I[0]) return 0;        z->c = z->I[0]; /* tomark, line 154 */        mlimit = z->lb; z->lb = z->c;        z->c = z->l - m1;        z->ket = z->c; /* [, line 154 */        if (z->c <= z->lb || (z->p[z->c - 1] != 105 && z->p[z->c - 1] != 106)) { z->lb = mlimit; return 0; }        if (!(find_among_b(z, a_8, 2))) { z->lb = mlimit; return 0; } /* substring, line 154 */        z->bra = z->c; /* ], line 154 */        z->lb = mlimit;    }    {   int ret = slice_del(z); /* delete, line 158 */        if (ret < 0) return ret;    }    return 1;}static int r_t_plural(struct SN_env * z) {    int among_var;    {   int mlimit; /* setlimit, line 161 */        int m1 = z->l - z->c; (void)m1;        if (z->c < z->I[0]) return 0;        z->c = z->I[0]; /* tomark, line 161 */        mlimit = z->lb; z->lb = z->c;        z->c = z->l - m1;        z->ket = z->c; /* [, line 162 */        if (!(eq_s_b(z, 1, s_13))) { z->lb = mlimit; return 0; }        z->bra = z->c; /* ], line 162 */        {   int m_test = z->l - z->c; /* test, line 162 */            if (in_grouping_b_U(z, g_V1, 97, 246, 0)) { z->lb = mlimit; return 0; }            z->c = z->l - m_test;        }        {   int ret = slice_del(z); /* delete, line 163 */            if (ret < 0) return ret;        }        z->lb = mlimit;    }    {   int mlimit; /* setlimit, line 165 */        int m2 = z->l - z->c; (void)m2;        if (z->c < z->I[1]) return 0;        z->c = z->I[1]; /* tomark, line 165 */        mlimit = z->lb; z->lb = z->c;        z->c = z->l - m2;        z->ket = z->c; /* [, line 165 */        if (z->c - 2 <= z->lb || z->p[z->c - 1] != 97) { z->lb = mlimit; return 0; }        among_var = find_among_b(z, a_9, 2); /* substring, line 165 */        if (!(among_var)) { z->lb = mlimit; return 0; }        z->bra = z->c; /* ], line 165 */        z->lb = mlimit;    }    switch(among_var) {        case 0: return 0;        case 1:            {   int m3 = z->l - z->c; (void)m3; /* not, line 167 */                if (!(eq_s_b(z, 2, s_14))) goto lab0;                return 0;            lab0:                z->c = z->l - m3;            }            break;    }    {   int ret = slice_del(z); /* delete, line 170 */        if (ret < 0) return ret;    }    return 1;}static int r_tidy(struct SN_env * z) {    {   int mlimit; /* setlimit, line 173 */        int m1 = z->l - z->c; (void)m1;        if (z->c < z->I[0]) return 0;        z->c = z->I[0]; /* tomark, line 173 */        mlimit = z->lb; z->lb = z->c;        z->c = z->l - m1;        {   int m2 = z->l - z->c; (void)m2; /* do, line 174 */            {   int m3 = z->l - z->c; (void)m3; /* and, line 174 */                {   int ret = r_LONG(z);                    if (ret == 0) goto lab0; /* call LONG, line 174 */                    if (ret < 0) return ret;                }                z->c = z->l - m3;                z->ket = z->c; /* [, line 174 */                {   int ret = skip_utf8(z->p, z->c, z->lb, 0, -1);                    if (ret < 0) goto lab0;                    z->c = ret; /* next, line 174 */                }                z->bra = z->c; /* ], line 174 */                {   int ret = slice_del(z); /* delete, line 174 */                    if (ret < 0) return ret;                }            }        lab0:            z->c = z->l - m2;        }        {   int m4 = z->l - z->c; (void)m4; /* do, line 175 */            z->ket = z->c; /* [, line 175 */            if (in_grouping_b_U(z, g_AEI, 97, 228, 0)) goto lab1;            z->bra = z->c; /* ], line 175 */            if (out_grouping_b_U(z, g_V1, 97, 246, 0)) goto lab1;            {   int ret = slice_del(z); /* delete, line 175 */                if (ret < 0) return ret;            }        lab1:            z->c = z->l - m4;        }        {   int m5 = z->l - z->c; (void)m5; /* do, line 176 */            z->ket = z->c; /* [, line 176 */            if (!(eq_s_b(z, 1, s_15))) goto lab2;            z->bra = z->c; /* ], line 176 */            {   int m6 = z->l - z->c; (void)m6; /* or, line 176 */                if (!(eq_s_b(z, 1, s_16))) goto lab4;                goto lab3;            lab4:                z->c = z->l - m6;                if (!(eq_s_b(z, 1, s_17))) goto lab2;            }        lab3:            {   int ret = slice_del(z); /* delete, line 176 */                if (ret < 0) return ret;            }        lab2:            z->c = z->l - m5;        }        {   int m7 = z->l - z->c; (void)m7; /* do, line 177 */            z->ket = z->c; /* [, line 177 */            if (!(eq_s_b(z, 1, s_18))) goto lab5;            z->bra = z->c; /* ], line 177 */            if (!(eq_s_b(z, 1, s_19))) goto lab5;            {   int ret = slice_del(z); /* delete, line 177 */                if (ret < 0) return ret;            }        lab5:            z->c = z->l - m7;        }        z->lb = mlimit;    }    if (in_grouping_b_U(z, g_V1, 97, 246, 1) < 0) return 0; /* goto */ /* non V1, line 179 */    z->ket = z->c; /* [, line 179 */    {   int ret = skip_utf8(z->p, z->c, z->lb, 0, -1);        if (ret < 0) return 0;        z->c = ret; /* next, line 179 */    }    z->bra = z->c; /* ], line 179 */    z->S[0] = slice_to(z, z->S[0]); /* -> x, line 179 */    if (z->S[0] == 0) return -1; /* -> x, line 179 */    if (!(eq_v_b(z, z->S[0]))) return 0; /* name x, line 179 */    {   int ret = slice_del(z); /* delete, line 179 */        if (ret < 0) return ret;    }    return 1;}extern int finnish_UTF_8_stem(struct SN_env * z) {    {   int c1 = z->c; /* do, line 185 */        {   int ret = r_mark_regions(z);            if (ret == 0) goto lab0; /* call mark_regions, line 185 */            if (ret < 0) return ret;        }    lab0:        z->c = c1;    }    z->B[0] = 0; /* unset ending_removed, line 186 */    z->lb = z->c; z->c = z->l; /* backwards, line 187 */    {   int m2 = z->l - z->c; (void)m2; /* do, line 188 */        {   int ret = r_particle_etc(z);            if (ret == 0) goto lab1; /* call particle_etc, line 188 */            if (ret < 0) return ret;        }    lab1:        z->c = z->l - m2;    }    {   int m3 = z->l - z->c; (void)m3; /* do, line 189 */        {   int ret = r_possessive(z);            if (ret == 0) goto lab2; /* call possessive, line 189 */            if (ret < 0) return ret;        }    lab2:        z->c = z->l - m3;    }    {   int m4 = z->l - z->c; (void)m4; /* do, line 190 */        {   int ret = r_case_ending(z);            if (ret == 0) goto lab3; /* call case_ending, line 190 */            if (ret < 0) return ret;        }    lab3:        z->c = z->l - m4;    }    {   int m5 = z->l - z->c; (void)m5; /* do, line 191 */        {   int ret = r_other_endings(z);            if (ret == 0) goto lab4; /* call other_endings, line 191 */            if (ret < 0) return ret;        }    lab4:        z->c = z->l - m5;    }    {   int m6 = z->l - z->c; (void)m6; /* or, line 192 */        if (!(z->B[0])) goto lab6; /* Boolean test ending_removed, line 192 */        {   int m7 = z->l - z->c; (void)m7; /* do, line 192 */            {   int ret = r_i_plural(z);                if (ret == 0) goto lab7; /* call i_plural, line 192 */                if (ret < 0) return ret;            }        lab7:            z->c = z->l - m7;        }        goto lab5;    lab6:        z->c = z->l - m6;        {   int m8 = z->l - z->c; (void)m8; /* do, line 192 */            {   int ret = r_t_plural(z);                if (ret == 0) goto lab8; /* call t_plural, line 192 */                if (ret < 0) return ret;            }        lab8:            z->c = z->l - m8;        }    }lab5:    {   int m9 = z->l - z->c; (void)m9; /* do, line 193 */        {   int ret = r_tidy(z);            if (ret == 0) goto lab9; /* call tidy, line 193 */            if (ret < 0) return ret;        }    lab9:        z->c = z->l - m9;    }    z->c = z->lb;    return 1;}extern struct SN_env * finnish_UTF_8_create_env(void) { return SN_create_env(1, 2, 1); }extern void finnish_UTF_8_close_env(struct SN_env * z) { SN_close_env(z, 1); }

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -