📄 russian_stemming.dct
字号:
/* * Autogenerated file * * Variant of the Lovin's stemmer which uses a longest match algorithm. * Endings are stored in a suffix tree. */#ifdef DICT_BODYtypedef struct { uint8 val; uint8 flag; uint8 right; uint16 child;} ru_RUKOI8R_NODE;/* is exists left tree ? */#define L 0x01/* finish word flag */#define F 0x02#define ISLEFT(x) (((ru_RUKOI8R_NODE*)x)->flag & L)#define ISFINISH(x) (((ru_RUKOI8R_NODE*)x)->flag & F)#define MINLENREST 3static ru_RUKOI8R_NODE ru_RUKOI8R_endstree[]={ {'
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -