postgresql/contrib/tsearch2/dict.h

62 lines
1.2 KiB
C
Raw Normal View History

/* $PostgreSQL: pgsql/contrib/tsearch2/dict.h,v 1.6 2006/03/11 04:38:30 momjian Exp $ */
2003-07-21 18:27:44 +08:00
#ifndef __DICT_H__
#define __DICT_H__
#include "postgres.h"
#include "fmgr.h"
2003-08-04 08:43:34 +08:00
typedef struct
{
int len;
char **stop;
char *(*wordop) (char *);
} StopList;
void sortstoplist(StopList * s);
void freestoplist(StopList * s);
void readstoplist(text *in, StopList * s);
bool searchstoplist(StopList * s, char *key);
typedef struct
{
Oid dict_id;
FmgrInfo lexize_info;
void *dictionary;
} DictInfo;
void init_dict(Oid id, DictInfo * dict);
DictInfo *finddict(Oid id);
Oid name2id_dict(text *name);
void reset_dict(void);
2003-07-21 18:27:44 +08:00
/* simple parser of cfg string */
2003-08-04 08:43:34 +08:00
typedef struct
{
char *key;
char *value;
} Map;
2003-07-21 18:27:44 +08:00
2003-08-04 08:43:34 +08:00
void parse_cfgdict(text *in, Map ** m);
2003-07-21 18:27:44 +08:00
/* return struct for any lexize function */
2005-10-15 10:49:52 +08:00
typedef struct
{
/*
* number of variant of split word , for example Word 'fotballklubber'
* (norwegian) has two varian to split: ( fotball, klubb ) and ( fot,
* ball, klubb ). So, dictionary should return: nvariant lexeme 1
* fotball 1 klubb 2 fot 2 ball 2 klubb
*
*/
uint16 nvariant;
/* currently unused */
2005-10-15 10:49:52 +08:00
uint16 flags;
/* C-string */
2005-10-15 10:49:52 +08:00
char *lexeme;
} TSLexeme;
2003-07-21 18:27:44 +08:00
#endif