mirror/postgresql
2
0
Fork 0
mirror of https://git.postgresql.org/git/postgresql.git synced 2024-12-15 08:20:16 +08:00
Code Issues Packages Projects Releases Wiki Activity
37885a4d4b
postgresql/contrib/tsearch2/dict_thesaurus.c

919 lines
18 KiB
C
Raw Normal View History

pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
/* $PostgreSQL: pgsql/contrib/tsearch2/dict_thesaurus.c,v 1.6 2006/10/04 00:29:46 momjian Exp $ */
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
/*
* thesaurus
* Teodor Sigaev <teodor@sigaev.ru>
*/
#include "postgres.h"
#include "executor/spi.h"
#include <ctype.h>
#include "dict.h"
#include "common.h"
#include "ts_locale.h"
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
/*
* Temporay we use TSLexeme.flags for inner use...
*/
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
#define DT_USEASIS 0x1000
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
typedef struct LexemeInfo
{
uint16 idsubst; /* entry's number in DictThesaurus->subst */
uint16 posinsubst; /* pos info in entry */
uint16 tnvariant; /* total num lexemes in one variant */
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
struct LexemeInfo *nextentry;
struct LexemeInfo *nextvariant;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
} LexemeInfo;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
typedef struct
{
char *lexeme;
LexemeInfo *entries;
} TheLexeme;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
typedef struct
{
uint16 lastlexeme; /* number lexemes to substitute */
uint16 reslen;
TSLexeme *res; /* prepared substituted result */
} TheSubstitute;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
typedef struct
{
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
/* subdictionary to normalize lexemes */
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
DictInfo subdict;
/* Array to search lexeme by exact match */
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
TheLexeme *wrds;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
int nwrds;
int ntwrds;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
/*
* Storage of substituted result, n-th element is for n-th expression
*/
TheSubstitute *subst;
int nsubst;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
} DictThesaurus;
PG_FUNCTION_INFO_V1(thesaurus_init);
Datum thesaurus_init(PG_FUNCTION_ARGS);
PG_FUNCTION_INFO_V1(thesaurus_lexize);
Datum thesaurus_lexize(PG_FUNCTION_ARGS);
static void
freeDictThesaurus(DictThesaurus * d)
{
free(d);
}
static void
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newLexeme(DictThesaurus * d, char *b, char *e, uint16 idsubst, uint16 posinsubst)
{
TheLexeme *ptr;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (d->nwrds >= d->ntwrds)
{
if (d->ntwrds == 0)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->ntwrds = 16;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
d->wrds = (TheLexeme *) malloc(sizeof(TheLexeme) * d->ntwrds);
}
else
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->ntwrds *= 2;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
d->wrds = (TheLexeme *) realloc(d->wrds, sizeof(TheLexeme) * d->ntwrds);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
if (!d->wrds)
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
ptr = d->wrds + d->nwrds;
d->nwrds++;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if ((ptr->lexeme = malloc(e - b + 1)) == NULL)
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
memcpy(ptr->lexeme, b, e - b);
ptr->lexeme[e - b] = '\0';
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if ((ptr->entries = (LexemeInfo *) malloc(sizeof(LexemeInfo))) == NULL)
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->entries->nextentry = NULL;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr->entries->idsubst = idsubst;
ptr->entries->posinsubst = posinsubst;
}
static void
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
addWrd(DictThesaurus * d, char *b, char *e, uint16 idsubst, uint16 nwrd, uint16 posinsubst, bool useasis)
{
static int nres = 0;
static int ntres = 0;
TheSubstitute *ptr;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (nwrd == 0)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
nres = ntres = 0;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (idsubst <= d->nsubst)
{
if (d->nsubst == 0)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->nsubst = 16;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
d->subst = (TheSubstitute *) malloc(sizeof(TheSubstitute) * d->nsubst);
}
else
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->nsubst *= 2;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
d->subst = (TheSubstitute *) realloc(d->subst, sizeof(TheSubstitute) * d->nsubst);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
if (!d->subst)
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
}
ptr = d->subst + idsubst;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->lastlexeme = posinsubst - 1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (nres + 1 >= ntres)
{
if (ntres == 0)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ntres = 2;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->res = (TSLexeme *) malloc(sizeof(TSLexeme) * ntres);
}
else
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ntres *= 2;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->res = (TSLexeme *) realloc(ptr->res, sizeof(TSLexeme) * ntres);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (!ptr->res)
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if ((ptr->res[nres].lexeme = malloc(e - b + 1)) == 0)
elog(ERROR, "Out of memory");
memcpy(ptr->res[nres].lexeme, b, e - b);
ptr->res[nres].lexeme[e - b] = '\0';
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->res[nres].nvariant = nwrd;
if (useasis)
ptr->res[nres].flags = DT_USEASIS;
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
else
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->res[nres].flags = 0;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
ptr->res[++nres].lexeme = NULL;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
#define TR_WAITLEX 1
#define TR_INLEX 2
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
#define TR_WAITSUBS 3
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
#define TR_INSUBS 4
static void
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
thesaurusRead(char *filename, DictThesaurus * d)
{
FILE *fh;
char str[BUFSIZ];
int lineno = 0;
uint16 idsubst = 0;
bool useasis = false;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
fh = fopen(to_absfilename(filename), "r");
if (!fh)
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
elog(ERROR, "Thesaurus: can't open '%s' file", filename);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (fgets(str, sizeof(str), fh))
{
char *ptr = str;
int state = TR_WAITLEX;
char *beginwrd = NULL;
uint16 posinsubst = 0;
uint16 nwrd = 0;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
lineno++;
/* is it comment ? */
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (t_isspace(ptr))
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr += pg_mblen(ptr);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (t_iseq(str, '#') || *str == '\0' || t_iseq(str, '\n') || t_iseq(str, '\r'))
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
continue;
pg_verifymbstr(ptr, strlen(ptr), false);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (*ptr)
{
if (state == TR_WAITLEX)
{
if (t_iseq(ptr, ':'))
{
if (posinsubst == 0)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
fclose(fh);
elog(ERROR, "Thesaurus: Unexpected delimiter at %d line", lineno);
}
state = TR_WAITSUBS;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (!t_isspace(ptr))
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
beginwrd = ptr;
state = TR_INLEX;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (state == TR_INLEX)
{
if (t_iseq(ptr, ':'))
{
newLexeme(d, beginwrd, ptr, idsubst, posinsubst++);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
state = TR_WAITSUBS;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (t_isspace(ptr))
{
newLexeme(d, beginwrd, ptr, idsubst, posinsubst++);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
state = TR_WAITLEX;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (state == TR_WAITSUBS)
{
if (t_iseq(ptr, '*'))
{
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
useasis = true;
state = TR_INSUBS;
beginwrd = ptr + pg_mblen(ptr);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (t_iseq(ptr, '\\'))
{
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
useasis = false;
state = TR_INSUBS;
beginwrd = ptr + pg_mblen(ptr);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (!t_isspace(ptr))
{
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
useasis = false;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
beginwrd = ptr;
state = TR_INSUBS;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (state == TR_INSUBS)
{
if (t_isspace(ptr))
{
if (ptr == beginwrd)
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
elog(ERROR, "Thesaurus: Unexpected end of line or lexeme at %d line", lineno);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
addWrd(d, beginwrd, ptr, idsubst, nwrd++, posinsubst, useasis);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
state = TR_WAITSUBS;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else
elog(ERROR, "Thesaurus: Unknown state: %d", state);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr += pg_mblen(ptr);
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (state == TR_INSUBS)
{
if (ptr == beginwrd)
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
elog(ERROR, "Thesaurus: Unexpected end of line or lexeme at %d line", lineno);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
addWrd(d, beginwrd, ptr, idsubst, nwrd++, posinsubst, useasis);
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
}
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
idsubst++;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (!(nwrd && posinsubst))
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
fclose(fh);
elog(ERROR, "Thesaurus: Unexpected end of line at %d line", lineno);
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
d->nsubst = idsubst;
fclose(fh);
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
static TheLexeme *
addCompiledLexeme(TheLexeme * newwrds, int *nnw, int *tnm, TSLexeme * lexeme, LexemeInfo * src, uint16 tnvariant)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (*nnw >= *tnm)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
*tnm *= 2;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newwrds = (TheLexeme *) realloc(newwrds, sizeof(TheLexeme) * *tnm);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
if (!newwrds)
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newwrds[*nnw].entries = (LexemeInfo *) malloc(sizeof(LexemeInfo));
if (!newwrds[*nnw].entries)
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (lexeme && lexeme->lexeme)
{
newwrds[*nnw].lexeme = strdup(lexeme->lexeme);
if (!newwrds[*nnw].lexeme)
elog(ERROR, "Out of memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newwrds[*nnw].entries->tnvariant = tnvariant;
}
else
{
newwrds[*nnw].lexeme = NULL;
newwrds[*nnw].entries->tnvariant = 1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newwrds[*nnw].entries->idsubst = src->idsubst;
newwrds[*nnw].entries->posinsubst = src->posinsubst;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newwrds[*nnw].entries->nextentry = NULL;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
(*nnw)++;
return newwrds;
}
static int
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
cmpLexemeInfo(LexemeInfo * a, LexemeInfo * b)
{
if (a == NULL || b == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return 0;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (a->idsubst == b->idsubst)
{
if (a->posinsubst == b->posinsubst)
{
if (a->tnvariant == b->tnvariant)
return 0;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
return (a->tnvariant > b->tnvariant) ? 1 : -1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
return (a->posinsubst > b->posinsubst) ? 1 : -1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
return (a->idsubst > b->idsubst) ? 1 : -1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
static int
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
cmpLexeme(TheLexeme * a, TheLexeme * b)
{
if (a->lexeme == NULL)
{
if (b->lexeme == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return 0;
else
return 1;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (b->lexeme == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return -1;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
return strcmp(a->lexeme, b->lexeme);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
static int
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
cmpLexemeQ(const void *a, const void *b)
{
return cmpLexeme((TheLexeme *) a, (TheLexeme *) b);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
static int
cmpTheLexeme(const void *a, const void *b)
{
TheLexeme *la = (TheLexeme *) a;
TheLexeme *lb = (TheLexeme *) b;
int res;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if ((res = cmpLexeme(la, lb)) != 0)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return res;
return -cmpLexemeInfo(la->entries, lb->entries);
}
static void
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
compileTheLexeme(DictThesaurus * d)
{
int i,
nnw = 0,
tnm = 16;
TheLexeme *newwrds = (TheLexeme *) malloc(sizeof(TheLexeme) * tnm),
*ptrwrds;
if (!newwrds)
elog(ERROR, "Out of memory");
for (i = 0; i < d->nwrds; i++)
{
TSLexeme *ptr;
ptr = (TSLexeme *) DatumGetPointer(
FunctionCall4(
&(d->subdict.lexize_info),
PointerGetDatum(d->subdict.dictionary),
PointerGetDatum(d->wrds[i].lexeme),
Int32GetDatum(strlen(d->wrds[i].lexeme)),
PointerGetDatum(NULL)
)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (!(ptr && ptr->lexeme))
{
if (!ptr)
elog(ERROR, "Thesaurus: word-sample '%s' isn't recognized by subdictionary (rule %d)",
d->wrds[i].lexeme, d->wrds[i].entries->idsubst + 1);
Add more strict check of stop and non-recognized words, allow only recognized words in thezaurus configuration file.
2006-06-02 23:35:42 +08:00
else
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
elog(NOTICE, "Thesaurus: word-sample '%s' is recognized as stop-word, assign any stop-word (rule %d)",
d->wrds[i].lexeme, d->wrds[i].entries->idsubst + 1);
Add more strict check of stop and non-recognized words, allow only recognized words in thezaurus configuration file.
2006-06-02 23:35:42 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
newwrds = addCompiledLexeme(newwrds, &nnw, &tnm, NULL, d->wrds[i].entries, 0);
}
else
{
while (ptr->lexeme)
{
TSLexeme *remptr = ptr + 1;
int tnvar = 1;
int curvar = ptr->nvariant;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
/* compute n words in one variant */
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (remptr->lexeme)
{
if (remptr->nvariant != (remptr - 1)->nvariant)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
break;
tnvar++;
remptr++;
}
remptr = ptr;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (remptr->lexeme && remptr->nvariant == curvar)
{
newwrds = addCompiledLexeme(newwrds, &nnw, &tnm, remptr, d->wrds[i].entries, tnvar);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
remptr++;
}
ptr = remptr;
}
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
free(d->wrds[i].lexeme);
free(d->wrds[i].entries);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
free(d->wrds);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->wrds = newwrds;
d->nwrds = nnw;
d->ntwrds = tnm;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (d->nwrds > 1)
{
qsort(d->wrds, d->nwrds, sizeof(TheLexeme), cmpTheLexeme);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
/* uniq */
newwrds = d->wrds;
ptrwrds = d->wrds + 1;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (ptrwrds - d->wrds < d->nwrds)
{
if (cmpLexeme(ptrwrds, newwrds) == 0)
{
if (cmpLexemeInfo(ptrwrds->entries, newwrds->entries))
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptrwrds->entries->nextentry = newwrds->entries;
newwrds->entries = ptrwrds->entries;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else
free(ptrwrds->entries);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (ptrwrds->lexeme)
free(ptrwrds->lexeme);
}
else
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
newwrds++;
*newwrds = *ptrwrds;
}
ptrwrds++;
}
d->nwrds = newwrds - d->wrds + 1;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
d->wrds = (TheLexeme *) realloc(d->wrds, sizeof(TheLexeme) * d->nwrds);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
}
static void
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
compileTheSubstitute(DictThesaurus * d)
{
int i;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
for (i = 0; i < d->nsubst; i++)
{
TSLexeme *rem = d->subst[i].res,
*outptr,
*inptr;
int n = 2;
outptr = d->subst[i].res = (TSLexeme *) malloc(sizeof(TSLexeme) * n);
if (d->subst[i].res == NULL)
elog(ERROR, "Out of Memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
outptr->lexeme = NULL;
inptr = rem;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (inptr && inptr->lexeme)
{
TSLexeme *lexized,
tmplex[2];
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (inptr->flags & DT_USEASIS)
{ /* do not lexize */
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
tmplex[0] = *inptr;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
tmplex[0].flags = 0;
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
tmplex[1].lexeme = NULL;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
lexized = tmplex;
}
else
{
lexized = (TSLexeme *) DatumGetPointer(
FunctionCall4(
&(d->subdict.lexize_info),
PointerGetDatum(d->subdict.dictionary),
PointerGetDatum(inptr->lexeme),
Int32GetDatum(strlen(inptr->lexeme)),
PointerGetDatum(NULL)
)
);
Allow do not lexize words in substitution. Docs will be submitted some later, now it's at http://www.sai.msu.su/~megera/oddmuse/index.cgi/Thesaurus_dictionary
2006-06-07 00:25:55 +08:00
}
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (lexized && lexized->lexeme)
{
int toset = (lexized->lexeme && outptr != d->subst[i].res) ? (outptr - d->subst[i].res) : -1;
while (lexized->lexeme)
{
if (outptr - d->subst[i].res + 1 >= n)
{
int diff = outptr - d->subst[i].res;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
n *= 2;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
d->subst[i].res = (TSLexeme *) realloc(d->subst[i].res, sizeof(TSLexeme) * n);
if (d->subst[i].res == NULL)
elog(ERROR, "Out of Memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
outptr = d->subst[i].res + diff;
}
*outptr = *lexized;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if ((outptr->lexeme = strdup(lexized->lexeme)) == NULL)
elog(ERROR, "Out of Memory");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
outptr++;
lexized++;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (toset > 0)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->subst[i].res[toset].flags |= TSL_ADDPOS;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else if (lexized)
{
elog(NOTICE, "Thesaurus: word '%s' in substition is a stop-word, ignored (rule %d)", inptr->lexeme, i + 1);
}
else
{
elog(ERROR, "Thesaurus: word '%s' in substition isn't recognized (rule %d)", inptr->lexeme, i + 1);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (inptr->lexeme)
free(inptr->lexeme);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
inptr++;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (outptr == d->subst[i].res)
elog(ERROR, "Thesaurus: all words in subsitution are stop word (rule %d)", i + 1);
Add more strict check of stop and non-recognized words, allow only recognized words in thezaurus configuration file.
2006-06-02 23:35:42 +08:00
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
d->subst[i].reslen = outptr - d->subst[i].res;
free(rem);
}
}
Datum
thesaurus_init(PG_FUNCTION_ARGS)
{
DictThesaurus *d;
Map *cfg,
*pcfg;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
text *in,
*subdictname = NULL;
bool fileloaded = false;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
if (PG_ARGISNULL(0) || PG_GETARG_POINTER(0) == NULL)
ereport(ERROR,
(errcode(ERRCODE_CONFIG_FILE_ERROR),
errmsg("Thesaurus confguration error")));
d = (DictThesaurus *) malloc(sizeof(DictThesaurus));
if (!d)
ereport(ERROR,
(errcode(ERRCODE_OUT_OF_MEMORY),
errmsg("out of memory")));
memset(d, 0, sizeof(DictThesaurus));
in = PG_GETARG_TEXT_P(0);
parse_cfgdict(in, &cfg);
PG_FREE_IF_COPY(in, 0);
pcfg = cfg;
while (pcfg->key)
{
if (pg_strcasecmp("DictFile", pcfg->key) == 0)
{
if (fileloaded)
{
freeDictThesaurus(d);
ereport(ERROR,
(errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
errmsg("Thesaurus file is already loaded")));
}
fileloaded = true;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
thesaurusRead(pcfg->value, d);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
else if (pg_strcasecmp("Dictionary", pcfg->key) == 0)
{
if (subdictname)
{
freeDictThesaurus(d);
ereport(ERROR,
(errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
errmsg("Thesaurus: SubDictionary is already defined")));
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
subdictname = char2text(pcfg->value);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
else
{
freeDictThesaurus(d);
ereport(ERROR,
(errcode(ERRCODE_SYNTAX_ERROR),
errmsg("unrecognized option: %s => %s",
pcfg->key, pcfg->value)));
}
pfree(pcfg->key);
pfree(pcfg->value);
pcfg++;
}
pfree(cfg);
if (!fileloaded)
ereport(ERROR,
(errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
errmsg("Thesaurus file isn't defined")));
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (subdictname)
{
DictInfo *subdictptr;
/*
* we already in SPI, but name2id_dict()/finddict() invoke
* SPI_connect()
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
*/
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
SPI_push();
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
subdictptr = finddict(name2id_dict(subdictname));
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
SPI_pop();
d->subdict = *subdictptr;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
}
else
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ereport(ERROR,
(errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
errmsg("Thesaurus: SubDictionary isn't defined")));
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
compileTheLexeme(d);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
compileTheSubstitute(d);
PG_RETURN_POINTER(d);
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
static LexemeInfo *
findTheLexeme(DictThesaurus * d, char *lexeme)
{
TheLexeme key = {lexeme, NULL}, *res;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (d->nwrds == 0)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return NULL;
res = bsearch(&key, d->wrds, d->nwrds, sizeof(TheLexeme), cmpLexemeQ);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (res == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return NULL;
return res->entries;
}
static bool
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
matchIdSubst(LexemeInfo * stored, uint16 idsubst)
{
bool res = true;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (stored)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
res = false;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
for (; stored; stored = stored->nextvariant)
if (stored->idsubst == idsubst)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
res = true;
break;
}
}
return res;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
static LexemeInfo *
findVariant(LexemeInfo * in, LexemeInfo * stored, uint16 curpos, LexemeInfo ** newin, int newn)
{
for (;;)
{
int i;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
LexemeInfo *ptr = newin[0];
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
for (i = 0; i < newn; i++)
{
while (newin[i] && newin[i]->idsubst < ptr->idsubst)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
newin[i] = newin[i]->nextentry;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (newin[i] == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return in;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (newin[i]->idsubst > ptr->idsubst)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr = newin[i];
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
i = -1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
continue;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (newin[i]->idsubst == ptr->idsubst)
{
if (newin[i]->posinsubst == curpos && newin[i]->tnvariant == newn)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr = newin[i];
break;
}
newin[i] = newin[i]->nextentry;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (newin[i] == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
return in;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (newin[i]->idsubst != ptr->idsubst)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr = newin[i];
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
i = -1;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
continue;
}
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (i == newn && matchIdSubst(stored, ptr->idsubst) && (in == NULL || !matchIdSubst(in, ptr->idsubst)))
{ /* found */
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
ptr->nextvariant = in;
in = ptr;
}
/* step forward */
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
for (i = 0; i < newn; i++)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
newin[i] = newin[i]->nextentry;
}
return NULL;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
static TSLexeme *
copyTSLexeme(TheSubstitute * ts)
{
TSLexeme *res;
uint16 i;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
res = (TSLexeme *) palloc(sizeof(TSLexeme) * (ts->reslen + 1));
for (i = 0; i < ts->reslen; i++)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
res[i] = ts->res[i];
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
res[i].lexeme = pstrdup(ts->res[i].lexeme);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
res[ts->reslen].lexeme = NULL;
return res;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
static TSLexeme *
checkMatch(DictThesaurus * d, LexemeInfo * info, uint16 curpos, bool *moreres)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
*moreres = false;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (info)
{
Assert(info->idsubst < d->nsubst);
if (info->nextvariant)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
*moreres = true;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (d->subst[info->idsubst].lastlexeme == curpos)
return copyTSLexeme(d->subst + info->idsubst);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
info = info->nextvariant;
}
return NULL;
}
Datum
thesaurus_lexize(PG_FUNCTION_ARGS)
{
DictThesaurus *d = (DictThesaurus *) PG_GETARG_POINTER(0);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
DictSubState *dstate = (DictSubState *) PG_GETARG_POINTER(3);
TSLexeme *res = NULL;
LexemeInfo *stored,
*info = NULL;
uint16 curpos = 0;
bool moreres = false;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (dstate == NULL || PG_NARGS() < 4)
elog(ERROR, "Forbidden call of thesaurus or nested call");
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (dstate->isend)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
PG_RETURN_POINTER(NULL);
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
stored = (LexemeInfo *) dstate->private;
if (stored)
curpos = stored->posinsubst + 1;
res = (TSLexeme *) DatumGetPointer(
FunctionCall4(
&(d->subdict.lexize_info),
PointerGetDatum(d->subdict.dictionary),
PG_GETARG_DATUM(1),
PG_GETARG_INT32(2),
PointerGetDatum(NULL)
)
);
if (res && res->lexeme)
{
TSLexeme *ptr = res,
*basevar;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (ptr->lexeme)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
uint16 nv = ptr->nvariant;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
uint16 i,
nlex = 0;
LexemeInfo **infos;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
basevar = ptr;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
while (ptr->lexeme && nv == ptr->nvariant)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
nlex++;
ptr++;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
infos = (LexemeInfo **) palloc(sizeof(LexemeInfo *) * nlex);
for (i = 0; i < nlex; i++)
if ((infos[i] = findTheLexeme(d, basevar[i].lexeme)) == NULL)
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
break;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (i < nlex)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
/* no chance to find */
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
pfree(infos);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
continue;
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
info = findVariant(info, stored, curpos, infos, nlex);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
else if (res)
{ /* stop-word */
LexemeInfo *infos = findTheLexeme(d, NULL);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
info = findVariant(NULL, stored, curpos, &infos, 1);
}
else
{
info = NULL; /* word isn't recognized */
}
dstate->private = (void *) info;
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if (!info)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
dstate->getnext = false;
PG_RETURN_POINTER(NULL);
}
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
if ((res = checkMatch(d, info, curpos, &moreres)) != NULL)
{
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
dstate->getnext = moreres;
PG_RETURN_POINTER(res);
}
dstate->getnext = true;
pgindent run for 8.2.
2006-10-04 08:30:14 +08:00
PG_RETURN_POINTER(NULL);
Add thesaurus dictionary which can replace N>0 lexemes by M>0 lexemes. It required some changes in lexize algorithm, but interface with dictionaries stays compatible with old dictionaries. Funded by Georgia Public Library Service and LibLime, Inc.
2006-05-31 22:05:31 +08:00
}
Reference in New Issue Copy Permalink