mirror of
https://github.com/infiniflow/ragflow.git
synced 2026-03-06 08:06:43 +08:00
70e9743ef1
# RAGFlow Go Implementation Plan 🚀 This repository tracks the progress of porting RAGFlow to Go. We'll implement core features and provide performance comparisons between Python and Go versions. ## Implementation Checklist - [x] User Management APIs - [x] Dataset Management Operations - [x] Retrieval Test - [x] Chat Management Operations - [x] Infinity Go SDK --------- Signed-off-by: Jin Hai <haijin.chn@gmail.com> Co-authored-by: Yingfeng Zhang <yingfeng.zhang@gmail.com>
425 lines
12 KiB
C++
425 lines
12 KiB
C++
|
|
/* This file was generated automatically by the Snowball to ANSI C compiler */
|
|
|
|
#include "header.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
extern int danish_UTF_8_stem(struct SN_env *z);
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
static int r_undouble(struct SN_env *z);
|
|
static int r_other_suffix(struct SN_env *z);
|
|
static int r_consonant_pair(struct SN_env *z);
|
|
static int r_main_suffix(struct SN_env *z);
|
|
static int r_mark_regions(struct SN_env *z);
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
extern struct SN_env *danish_UTF_8_create_env(void);
|
|
extern void danish_UTF_8_close_env(struct SN_env *z);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
static const symbol s_0_0[3] = {'h', 'e', 'd'};
|
|
static const symbol s_0_1[5] = {'e', 't', 'h', 'e', 'd'};
|
|
static const symbol s_0_2[4] = {'e', 'r', 'e', 'd'};
|
|
static const symbol s_0_3[1] = {'e'};
|
|
static const symbol s_0_4[5] = {'e', 'r', 'e', 'd', 'e'};
|
|
static const symbol s_0_5[4] = {'e', 'n', 'd', 'e'};
|
|
static const symbol s_0_6[6] = {'e', 'r', 'e', 'n', 'd', 'e'};
|
|
static const symbol s_0_7[3] = {'e', 'n', 'e'};
|
|
static const symbol s_0_8[4] = {'e', 'r', 'n', 'e'};
|
|
static const symbol s_0_9[3] = {'e', 'r', 'e'};
|
|
static const symbol s_0_10[2] = {'e', 'n'};
|
|
static const symbol s_0_11[5] = {'h', 'e', 'd', 'e', 'n'};
|
|
static const symbol s_0_12[4] = {'e', 'r', 'e', 'n'};
|
|
static const symbol s_0_13[2] = {'e', 'r'};
|
|
static const symbol s_0_14[5] = {'h', 'e', 'd', 'e', 'r'};
|
|
static const symbol s_0_15[4] = {'e', 'r', 'e', 'r'};
|
|
static const symbol s_0_16[1] = {'s'};
|
|
static const symbol s_0_17[4] = {'h', 'e', 'd', 's'};
|
|
static const symbol s_0_18[2] = {'e', 's'};
|
|
static const symbol s_0_19[5] = {'e', 'n', 'd', 'e', 's'};
|
|
static const symbol s_0_20[7] = {'e', 'r', 'e', 'n', 'd', 'e', 's'};
|
|
static const symbol s_0_21[4] = {'e', 'n', 'e', 's'};
|
|
static const symbol s_0_22[5] = {'e', 'r', 'n', 'e', 's'};
|
|
static const symbol s_0_23[4] = {'e', 'r', 'e', 's'};
|
|
static const symbol s_0_24[3] = {'e', 'n', 's'};
|
|
static const symbol s_0_25[6] = {'h', 'e', 'd', 'e', 'n', 's'};
|
|
static const symbol s_0_26[5] = {'e', 'r', 'e', 'n', 's'};
|
|
static const symbol s_0_27[3] = {'e', 'r', 's'};
|
|
static const symbol s_0_28[3] = {'e', 't', 's'};
|
|
static const symbol s_0_29[5] = {'e', 'r', 'e', 't', 's'};
|
|
static const symbol s_0_30[2] = {'e', 't'};
|
|
static const symbol s_0_31[4] = {'e', 'r', 'e', 't'};
|
|
|
|
static const struct among a_0[32] = {
|
|
/* 0 */ {3, s_0_0, -1, 1, 0},
|
|
/* 1 */ {5, s_0_1, 0, 1, 0},
|
|
/* 2 */ {4, s_0_2, -1, 1, 0},
|
|
/* 3 */ {1, s_0_3, -1, 1, 0},
|
|
/* 4 */ {5, s_0_4, 3, 1, 0},
|
|
/* 5 */ {4, s_0_5, 3, 1, 0},
|
|
/* 6 */ {6, s_0_6, 5, 1, 0},
|
|
/* 7 */ {3, s_0_7, 3, 1, 0},
|
|
/* 8 */ {4, s_0_8, 3, 1, 0},
|
|
/* 9 */ {3, s_0_9, 3, 1, 0},
|
|
/* 10 */ {2, s_0_10, -1, 1, 0},
|
|
/* 11 */ {5, s_0_11, 10, 1, 0},
|
|
/* 12 */ {4, s_0_12, 10, 1, 0},
|
|
/* 13 */ {2, s_0_13, -1, 1, 0},
|
|
/* 14 */ {5, s_0_14, 13, 1, 0},
|
|
/* 15 */ {4, s_0_15, 13, 1, 0},
|
|
/* 16 */ {1, s_0_16, -1, 2, 0},
|
|
/* 17 */ {4, s_0_17, 16, 1, 0},
|
|
/* 18 */ {2, s_0_18, 16, 1, 0},
|
|
/* 19 */ {5, s_0_19, 18, 1, 0},
|
|
/* 20 */ {7, s_0_20, 19, 1, 0},
|
|
/* 21 */ {4, s_0_21, 18, 1, 0},
|
|
/* 22 */ {5, s_0_22, 18, 1, 0},
|
|
/* 23 */ {4, s_0_23, 18, 1, 0},
|
|
/* 24 */ {3, s_0_24, 16, 1, 0},
|
|
/* 25 */ {6, s_0_25, 24, 1, 0},
|
|
/* 26 */ {5, s_0_26, 24, 1, 0},
|
|
/* 27 */ {3, s_0_27, 16, 1, 0},
|
|
/* 28 */ {3, s_0_28, 16, 1, 0},
|
|
/* 29 */ {5, s_0_29, 28, 1, 0},
|
|
/* 30 */ {2, s_0_30, -1, 1, 0},
|
|
/* 31 */ {4, s_0_31, 30, 1, 0}};
|
|
|
|
static const symbol s_1_0[2] = {'g', 'd'};
|
|
static const symbol s_1_1[2] = {'d', 't'};
|
|
static const symbol s_1_2[2] = {'g', 't'};
|
|
static const symbol s_1_3[2] = {'k', 't'};
|
|
|
|
static const struct among a_1[4] = {
|
|
/* 0 */ {2, s_1_0, -1, -1, 0},
|
|
/* 1 */ {2, s_1_1, -1, -1, 0},
|
|
/* 2 */ {2, s_1_2, -1, -1, 0},
|
|
/* 3 */ {2, s_1_3, -1, -1, 0}};
|
|
|
|
static const symbol s_2_0[2] = {'i', 'g'};
|
|
static const symbol s_2_1[3] = {'l', 'i', 'g'};
|
|
static const symbol s_2_2[4] = {'e', 'l', 'i', 'g'};
|
|
static const symbol s_2_3[3] = {'e', 'l', 's'};
|
|
static const symbol s_2_4[5] = {'l', 0xC3, 0xB8, 's', 't'};
|
|
|
|
static const struct among a_2[5] = {
|
|
/* 0 */ {2, s_2_0, -1, 1, 0},
|
|
/* 1 */ {3, s_2_1, 0, 1, 0},
|
|
/* 2 */ {4, s_2_2, 1, 1, 0},
|
|
/* 3 */ {3, s_2_3, -1, 1, 0},
|
|
/* 4 */ {5, s_2_4, -1, 2, 0}};
|
|
|
|
static const unsigned char g_v[] = {17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 128};
|
|
|
|
static const unsigned char g_s_ending[] = {239, 254, 42, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16};
|
|
|
|
static const symbol s_0[] = {'s', 't'};
|
|
static const symbol s_1[] = {'i', 'g'};
|
|
static const symbol s_2[] = {'l', 0xC3, 0xB8, 's'};
|
|
|
|
static int r_mark_regions(struct SN_env *z) {
|
|
z->I[0] = z->l;
|
|
{
|
|
int c_test = z->c; /* test, line 33 */
|
|
{
|
|
int ret = skip_utf8(z->p, z->c, 0, z->l, +3);
|
|
if (ret < 0)
|
|
return 0;
|
|
z->c = ret; /* hop, line 33 */
|
|
}
|
|
z->I[1] = z->c; /* setmark x, line 33 */
|
|
z->c = c_test;
|
|
}
|
|
if (out_grouping_U(z, g_v, 97, 248, 1) < 0)
|
|
return 0; /* goto */ /* grouping v, line 34 */
|
|
{ /* gopast */ /* non v, line 34 */
|
|
int ret = in_grouping_U(z, g_v, 97, 248, 1);
|
|
if (ret < 0)
|
|
return 0;
|
|
z->c += ret;
|
|
}
|
|
z->I[0] = z->c; /* setmark p1, line 34 */
|
|
/* try, line 35 */
|
|
if (!(z->I[0] < z->I[1]))
|
|
goto lab0;
|
|
z->I[0] = z->I[1];
|
|
lab0:
|
|
return 1;
|
|
}
|
|
|
|
static int r_main_suffix(struct SN_env *z) {
|
|
int among_var;
|
|
{
|
|
int mlimit; /* setlimit, line 41 */
|
|
int m1 = z->l - z->c;
|
|
(void)m1;
|
|
if (z->c < z->I[0])
|
|
return 0;
|
|
z->c = z->I[0]; /* tomark, line 41 */
|
|
mlimit = z->lb;
|
|
z->lb = z->c;
|
|
z->c = z->l - m1;
|
|
z->ket = z->c; /* [, line 41 */
|
|
if (z->c <= z->lb || z->p[z->c - 1] >> 5 != 3 || !((1851440 >> (z->p[z->c - 1] & 0x1f)) & 1)) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
}
|
|
among_var = find_among_b(z, a_0, 32); /* substring, line 41 */
|
|
if (!(among_var)) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
}
|
|
z->bra = z->c; /* ], line 41 */
|
|
z->lb = mlimit;
|
|
}
|
|
switch (among_var) {
|
|
case 0:
|
|
return 0;
|
|
case 1: {
|
|
int ret = slice_del(z); /* delete, line 48 */
|
|
if (ret < 0)
|
|
return ret;
|
|
} break;
|
|
case 2:
|
|
if (in_grouping_b_U(z, g_s_ending, 97, 229, 0))
|
|
return 0;
|
|
{
|
|
int ret = slice_del(z); /* delete, line 50 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
static int r_consonant_pair(struct SN_env *z) {
|
|
{
|
|
int m_test = z->l - z->c; /* test, line 55 */
|
|
{
|
|
int mlimit; /* setlimit, line 56 */
|
|
int m1 = z->l - z->c;
|
|
(void)m1;
|
|
if (z->c < z->I[0])
|
|
return 0;
|
|
z->c = z->I[0]; /* tomark, line 56 */
|
|
mlimit = z->lb;
|
|
z->lb = z->c;
|
|
z->c = z->l - m1;
|
|
z->ket = z->c; /* [, line 56 */
|
|
if (z->c - 1 <= z->lb || (z->p[z->c - 1] != 100 && z->p[z->c - 1] != 116)) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
}
|
|
if (!(find_among_b(z, a_1, 4))) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
} /* substring, line 56 */
|
|
z->bra = z->c; /* ], line 56 */
|
|
z->lb = mlimit;
|
|
}
|
|
z->c = z->l - m_test;
|
|
}
|
|
{
|
|
int ret = skip_utf8(z->p, z->c, z->lb, 0, -1);
|
|
if (ret < 0)
|
|
return 0;
|
|
z->c = ret; /* next, line 62 */
|
|
}
|
|
z->bra = z->c; /* ], line 62 */
|
|
{
|
|
int ret = slice_del(z); /* delete, line 62 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
static int r_other_suffix(struct SN_env *z) {
|
|
int among_var;
|
|
{
|
|
int m1 = z->l - z->c;
|
|
(void)m1; /* do, line 66 */
|
|
z->ket = z->c; /* [, line 66 */
|
|
if (!(eq_s_b(z, 2, s_0)))
|
|
goto lab0;
|
|
z->bra = z->c; /* ], line 66 */
|
|
if (!(eq_s_b(z, 2, s_1)))
|
|
goto lab0;
|
|
{
|
|
int ret = slice_del(z); /* delete, line 66 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab0:
|
|
z->c = z->l - m1;
|
|
}
|
|
{
|
|
int mlimit; /* setlimit, line 67 */
|
|
int m2 = z->l - z->c;
|
|
(void)m2;
|
|
if (z->c < z->I[0])
|
|
return 0;
|
|
z->c = z->I[0]; /* tomark, line 67 */
|
|
mlimit = z->lb;
|
|
z->lb = z->c;
|
|
z->c = z->l - m2;
|
|
z->ket = z->c; /* [, line 67 */
|
|
if (z->c - 1 <= z->lb || z->p[z->c - 1] >> 5 != 3 || !((1572992 >> (z->p[z->c - 1] & 0x1f)) & 1)) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
}
|
|
among_var = find_among_b(z, a_2, 5); /* substring, line 67 */
|
|
if (!(among_var)) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
}
|
|
z->bra = z->c; /* ], line 67 */
|
|
z->lb = mlimit;
|
|
}
|
|
switch (among_var) {
|
|
case 0:
|
|
return 0;
|
|
case 1: {
|
|
int ret = slice_del(z); /* delete, line 70 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
{
|
|
int m3 = z->l - z->c;
|
|
(void)m3; /* do, line 70 */
|
|
{
|
|
int ret = r_consonant_pair(z);
|
|
if (ret == 0)
|
|
goto lab1; /* call consonant_pair, line 70 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab1:
|
|
z->c = z->l - m3;
|
|
}
|
|
break;
|
|
case 2: {
|
|
int ret = slice_from_s(z, 4, s_2); /* <-, line 72 */
|
|
if (ret < 0)
|
|
return ret;
|
|
} break;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
static int r_undouble(struct SN_env *z) {
|
|
{
|
|
int mlimit; /* setlimit, line 76 */
|
|
int m1 = z->l - z->c;
|
|
(void)m1;
|
|
if (z->c < z->I[0])
|
|
return 0;
|
|
z->c = z->I[0]; /* tomark, line 76 */
|
|
mlimit = z->lb;
|
|
z->lb = z->c;
|
|
z->c = z->l - m1;
|
|
z->ket = z->c; /* [, line 76 */
|
|
if (out_grouping_b_U(z, g_v, 97, 248, 0)) {
|
|
z->lb = mlimit;
|
|
return 0;
|
|
}
|
|
z->bra = z->c; /* ], line 76 */
|
|
z->S[0] = slice_to(z, z->S[0]); /* -> ch, line 76 */
|
|
if (z->S[0] == 0)
|
|
return -1; /* -> ch, line 76 */
|
|
z->lb = mlimit;
|
|
}
|
|
if (!(eq_v_b(z, z->S[0])))
|
|
return 0; /* name ch, line 77 */
|
|
{
|
|
int ret = slice_del(z); /* delete, line 78 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
extern int danish_UTF_8_stem(struct SN_env *z) {
|
|
{
|
|
int c1 = z->c; /* do, line 84 */
|
|
{
|
|
int ret = r_mark_regions(z);
|
|
if (ret == 0)
|
|
goto lab0; /* call mark_regions, line 84 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab0:
|
|
z->c = c1;
|
|
}
|
|
z->lb = z->c;
|
|
z->c = z->l; /* backwards, line 85 */
|
|
|
|
{
|
|
int m2 = z->l - z->c;
|
|
(void)m2; /* do, line 86 */
|
|
{
|
|
int ret = r_main_suffix(z);
|
|
if (ret == 0)
|
|
goto lab1; /* call main_suffix, line 86 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab1:
|
|
z->c = z->l - m2;
|
|
}
|
|
{
|
|
int m3 = z->l - z->c;
|
|
(void)m3; /* do, line 87 */
|
|
{
|
|
int ret = r_consonant_pair(z);
|
|
if (ret == 0)
|
|
goto lab2; /* call consonant_pair, line 87 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab2:
|
|
z->c = z->l - m3;
|
|
}
|
|
{
|
|
int m4 = z->l - z->c;
|
|
(void)m4; /* do, line 88 */
|
|
{
|
|
int ret = r_other_suffix(z);
|
|
if (ret == 0)
|
|
goto lab3; /* call other_suffix, line 88 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab3:
|
|
z->c = z->l - m4;
|
|
}
|
|
{
|
|
int m5 = z->l - z->c;
|
|
(void)m5; /* do, line 89 */
|
|
{
|
|
int ret = r_undouble(z);
|
|
if (ret == 0)
|
|
goto lab4; /* call undouble, line 89 */
|
|
if (ret < 0)
|
|
return ret;
|
|
}
|
|
lab4:
|
|
z->c = z->l - m5;
|
|
}
|
|
z->c = z->lb;
|
|
return 1;
|
|
}
|
|
|
|
extern struct SN_env *danish_UTF_8_create_env(void) { return SN_create_env(1, 2, 0); }
|
|
|
|
extern void danish_UTF_8_close_env(struct SN_env *z) { SN_close_env(z, 1); }
|