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

📄 stem_iso_8859_1_hungarian.c

📁 firtext搜索引擎源码
💻 C
📖 第 1 页 / 共 3 页
字号:
            {   int ret;                ret = slice_del(z); /* delete, line 161 */                if (ret < 0) return ret;            }            break;        case 8:            {   int ret;                ret = slice_from_s(z, 1, s_13); /* <-, line 162 */                if (ret < 0) return ret;            }            break;        case 9:            {   int ret;                ret = slice_del(z); /* delete, line 163 */                if (ret < 0) return ret;            }            break;    }    return 1;}static int r_sing_owner(struct SN_env * z) {    int among_var;    z->ket = z->c; /* [, line 168 */    among_var = find_among_b(z, a_10, 31); /* substring, line 168 */    if (!(among_var)) return 0;    z->bra = z->c; /* ], line 168 */    {   int ret = r_R1(z);        if (ret == 0) return 0; /* call R1, line 168 */        if (ret < 0) return ret;    }    switch(among_var) {        case 0: return 0;        case 1:            {   int ret;                ret = slice_del(z); /* delete, line 169 */                if (ret < 0) return ret;            }            break;        case 2:            {   int ret;                ret = slice_from_s(z, 1, s_14); /* <-, line 170 */                if (ret < 0) return ret;            }            break;        case 3:            {   int ret;                ret = slice_from_s(z, 1, s_15); /* <-, line 171 */                if (ret < 0) return ret;            }            break;        case 4:            {   int ret;                ret = slice_del(z); /* delete, line 172 */                if (ret < 0) return ret;            }            break;        case 5:            {   int ret;                ret = slice_from_s(z, 1, s_16); /* <-, line 173 */                if (ret < 0) return ret;            }            break;        case 6:            {   int ret;                ret = slice_from_s(z, 1, s_17); /* <-, line 174 */                if (ret < 0) return ret;            }            break;        case 7:            {   int ret;                ret = slice_del(z); /* delete, line 175 */                if (ret < 0) return ret;            }            break;        case 8:            {   int ret;                ret = slice_del(z); /* delete, line 176 */                if (ret < 0) return ret;            }            break;        case 9:            {   int ret;                ret = slice_del(z); /* delete, line 177 */                if (ret < 0) return ret;            }            break;        case 10:            {   int ret;                ret = slice_from_s(z, 1, s_18); /* <-, line 178 */                if (ret < 0) return ret;            }            break;        case 11:            {   int ret;                ret = slice_from_s(z, 1, s_19); /* <-, line 179 */                if (ret < 0) return ret;            }            break;        case 12:            {   int ret;                ret = slice_del(z); /* delete, line 180 */                if (ret < 0) return ret;            }            break;        case 13:            {   int ret;                ret = slice_del(z); /* delete, line 181 */                if (ret < 0) return ret;            }            break;        case 14:            {   int ret;                ret = slice_from_s(z, 1, s_20); /* <-, line 182 */                if (ret < 0) return ret;            }            break;        case 15:            {   int ret;                ret = slice_from_s(z, 1, s_21); /* <-, line 183 */                if (ret < 0) return ret;            }            break;        case 16:            {   int ret;                ret = slice_del(z); /* delete, line 184 */                if (ret < 0) return ret;            }            break;        case 17:            {   int ret;                ret = slice_del(z); /* delete, line 185 */                if (ret < 0) return ret;            }            break;        case 18:            {   int ret;                ret = slice_del(z); /* delete, line 186 */                if (ret < 0) return ret;            }            break;        case 19:            {   int ret;                ret = slice_from_s(z, 1, s_22); /* <-, line 187 */                if (ret < 0) return ret;            }            break;        case 20:            {   int ret;                ret = slice_from_s(z, 1, s_23); /* <-, line 188 */                if (ret < 0) return ret;            }            break;    }    return 1;}static int r_plur_owner(struct SN_env * z) {    int among_var;    z->ket = z->c; /* [, line 193 */    if (z->c <= z->lb || z->p[z->c - 1] >> 5 != 3 || !((10768 >> (z->p[z->c - 1] & 0x1f)) & 1)) return 0;    among_var = find_among_b(z, a_11, 42); /* substring, line 193 */    if (!(among_var)) return 0;    z->bra = z->c; /* ], line 193 */    {   int ret = r_R1(z);        if (ret == 0) return 0; /* call R1, line 193 */        if (ret < 0) return ret;    }    switch(among_var) {        case 0: return 0;        case 1:            {   int ret;                ret = slice_del(z); /* delete, line 194 */                if (ret < 0) return ret;            }            break;        case 2:            {   int ret;                ret = slice_from_s(z, 1, s_24); /* <-, line 195 */                if (ret < 0) return ret;            }            break;        case 3:            {   int ret;                ret = slice_from_s(z, 1, s_25); /* <-, line 196 */                if (ret < 0) return ret;            }            break;        case 4:            {   int ret;                ret = slice_del(z); /* delete, line 197 */                if (ret < 0) return ret;            }            break;        case 5:            {   int ret;                ret = slice_del(z); /* delete, line 198 */                if (ret < 0) return ret;            }            break;        case 6:            {   int ret;                ret = slice_del(z); /* delete, line 199 */                if (ret < 0) return ret;            }            break;        case 7:            {   int ret;                ret = slice_from_s(z, 1, s_26); /* <-, line 200 */                if (ret < 0) return ret;            }            break;        case 8:            {   int ret;                ret = slice_from_s(z, 1, s_27); /* <-, line 201 */                if (ret < 0) return ret;            }            break;        case 9:            {   int ret;                ret = slice_del(z); /* delete, line 202 */                if (ret < 0) return ret;            }            break;        case 10:            {   int ret;                ret = slice_del(z); /* delete, line 203 */                if (ret < 0) return ret;            }            break;        case 11:            {   int ret;                ret = slice_del(z); /* delete, line 204 */                if (ret < 0) return ret;            }            break;        case 12:            {   int ret;                ret = slice_from_s(z, 1, s_28); /* <-, line 205 */                if (ret < 0) return ret;            }            break;        case 13:            {   int ret;                ret = slice_from_s(z, 1, s_29); /* <-, line 206 */                if (ret < 0) return ret;            }            break;        case 14:            {   int ret;                ret = slice_del(z); /* delete, line 207 */                if (ret < 0) return ret;            }            break;        case 15:            {   int ret;                ret = slice_del(z); /* delete, line 208 */                if (ret < 0) return ret;            }            break;        case 16:            {   int ret;                ret = slice_del(z); /* delete, line 209 */                if (ret < 0) return ret;            }            break;        case 17:            {   int ret;                ret = slice_del(z); /* delete, line 210 */                if (ret < 0) return ret;            }            break;        case 18:            {   int ret;                ret = slice_from_s(z, 1, s_30); /* <-, line 211 */                if (ret < 0) return ret;            }            break;        case 19:            {   int ret;                ret = slice_from_s(z, 1, s_31); /* <-, line 212 */                if (ret < 0) return ret;            }            break;        case 20:            {   int ret;                ret = slice_del(z); /* delete, line 214 */                if (ret < 0) return ret;            }            break;        case 21:            {   int ret;                ret = slice_del(z); /* delete, line 215 */                if (ret < 0) return ret;            }            break;        case 22:            {   int ret;                ret = slice_from_s(z, 1, s_32); /* <-, line 216 */                if (ret < 0) return ret;            }            break;        case 23:            {   int ret;                ret = slice_from_s(z, 1, s_33); /* <-, line 217 */                if (ret < 0) return ret;            }            break;        case 24:            {   int ret;                ret = slice_del(z); /* delete, line 218 */                if (ret < 0) return ret;            }            break;        case 25:            {   int ret;                ret = slice_del(z); /* delete, line 219 */                if (ret < 0) return ret;            }            break;        case 26:            {   int ret;                ret = slice_del(z); /* delete, line 220 */                if (ret < 0) return ret;            }            break;        case 27:            {   int ret;                ret = slice_from_s(z, 1, s_34); /* <-, line 221 */                if (ret < 0) return ret;            }            break;        case 28:            {   int ret;                ret = slice_from_s(z, 1, s_35); /* <-, line 222 */                if (ret < 0) return ret;            }            break;        case 29:            {   int ret;                ret = slice_del(z); /* delete, line 223 */                if (ret < 0) return ret;            }            break;    }    return 1;}extern int hungarian_ISO_8859_1_stem(struct SN_env * z) {    {   int c = z->c; /* do, line 229 */        {   int ret = r_mark_regions(z);            if (ret == 0) goto lab0; /* call mark_regions, line 229 */            if (ret < 0) return ret;        }    lab0:        z->c = c;    }    z->lb = z->c; z->c = z->l; /* backwards, line 230 */    {   int m = z->l - z->c; (void) m; /* do, line 231 */        {   int ret = r_instrum(z);            if (ret == 0) goto lab1; /* call instrum, line 231 */            if (ret < 0) return ret;        }    lab1:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 232 */        {   int ret = r_case(z);            if (ret == 0) goto lab2; /* call case, line 232 */            if (ret < 0) return ret;        }    lab2:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 233 */        {   int ret = r_case_special(z);            if (ret == 0) goto lab3; /* call case_special, line 233 */            if (ret < 0) return ret;        }    lab3:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 234 */        {   int ret = r_case_other(z);            if (ret == 0) goto lab4; /* call case_other, line 234 */            if (ret < 0) return ret;        }    lab4:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 235 */        {   int ret = r_factive(z);            if (ret == 0) goto lab5; /* call factive, line 235 */            if (ret < 0) return ret;        }    lab5:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 236 */        {   int ret = r_owned(z);            if (ret == 0) goto lab6; /* call owned, line 236 */            if (ret < 0) return ret;        }    lab6:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 237 */        {   int ret = r_sing_owner(z);            if (ret == 0) goto lab7; /* call sing_owner, line 237 */            if (ret < 0) return ret;        }    lab7:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 238 */        {   int ret = r_plur_owner(z);            if (ret == 0) goto lab8; /* call plur_owner, line 238 */            if (ret < 0) return ret;        }    lab8:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 239 */        {   int ret = r_plural(z);            if (ret == 0) goto lab9; /* call plural, line 239 */            if (ret < 0) return ret;        }    lab9:        z->c = z->l - m;    }    z->c = z->lb;    return 1;}extern struct SN_env * hungarian_ISO_8859_1_create_env(void) { return SN_create_env(0, 1, 0); }extern void hungarian_ISO_8859_1_close_env(struct SN_env * z) { SN_close_env(z, 0); }

⌨️ 快捷键说明

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