【C】离线英英词典
本帖最后由 usr 于 2023-1-23 02:02 编辑这是一款离线英英词典。该词典具有小内存占用和极高的查询速度。
原理很简单，搜索TXT格式的文件。把所有单词INDEX后装入内存。
源代码在这里：（注意该词典需要StoneValley库的支持）
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "StoneValley/src/svset.h"
#include "StoneValley/src/svtree.h"
typedef struct st_WORD
{
ptrdiff_t id;
char name;
size_t times;
long ltip;
} WORD, * P_WORD;
int cbfcmpid(const void * px, const void * py)
{
return (*(P_WORD)px).id - (*(P_WORD)py).id;
}
int cbfcmpchar(const void * px, const void * py)
{
return *(char *)px - *(char *)py;
}
int cbftvs_history(void * pitem, size_t param)
{
if (((P_WORD)P2P_TNODE_B(pitem)->pdata)->times)
printf("%s\t%lld\n", ((P_WORD)P2P_TNODE_B(pitem)->pdata)->name, ((P_WORD)P2P_TNODE_B(pitem)->pdata)->times);
return CBF_CONTINUE;
}
int cbftvs_alphabet(void * pitem, size_t param)
{
if (toupper(((P_WORD)P2P_TNODE_B(pitem)->pdata)->name) == param)
printf("%s\n", ((P_WORD)P2P_TNODE_B(pitem)->pdata)->name);
return CBF_CONTINUE;
}
static char sWord = { 0 };
static char * p = sWord;
static char sFileName = { 0 };
static char sPattern = { 0 };
int main(int argc, char ** argv)
{
size_t i = 1, j;
WORD w = { 0 };
FILE * fp;
P_SET_T set = setCreateT();
P_TRIE_A trie = treCreateTrieA();
size_t * result = NULL;
strcat(sFileName, ".\\dict.txt");
fp = fopen(sFileName, "rb");
printf("Dict file: %s\n", sFileName);
if (NULL != fp)
{
while (!feof(fp))
{
*p = fgetc(fp);
++p;
if ('#' == *(p - 1))
{
P_BSTNODE pnode = NULL;
*(p - 1) = '\0';
p = sWord;
strcpy(w.name, p);
w.id = i;
w.times = 0;
w.ltip = ftell(fp) + 1;
setInsertT(set, &w, sizeof w, cbfcmpid);
pnode = treBSTFindData_A(*set, &i, cbfcmpid);
treInsertTrieA(trie, p, strlen(p), sizeof(char), (size_t)(pnode->knot.pdata), cbfcmpchar);
++i;
}
if ('\n' == *(p - 1))
{
p = sWord;
}
}
printf("%lld words loaded.\n", i);
do
{
printf("? ");
fgets(sPattern, 100, stdin);
sPattern = '\0';
if ('\0' == *sPattern)
break;
printf("Searching: \"%s\"...\n", sPattern);
result = treSearchTrieA(trie, sPattern, strlen(sPattern), sizeof(char), cbfcmpchar);
if (result)
{
printf("\t%lld %s", ((P_WORD)*result)->id, ((P_WORD)*result)->name);
++((P_WORD)*result)->times;
/* Redirect to the word on the disk. */
fseek(fp, ((P_WORD)*result)->ltip, SEEK_SET);
/* Read explanations. */
p = sWord;
while ('\n' != (*p = fgetc(fp)))
{
++p;
}
*p = '\0';
p = sWord;
printf("\t%s\n", p);
}
else if ('.' == sPattern && '?' == sPattern)
{
printf("Type or to search.\n");
printf("\tFor example ? Apple ? 10536\n");
printf("Type .h to show history.\n");
printf("Type .l to show alphabet.\n");
printf("\tFor example ? .l Z.\n");
printf("Type .? to show this notice.\n");
}
else if ('.' == sPattern && 'h' == sPattern)
{
printf("History:\n");
treTraverseBIn(*set, cbftvs_history, 0);
}
else if ('.' == sPattern && 'l' == sPattern && ' ' == sPattern)
{
sPattern = toupper(sPattern);
printf("Alphabet:\n");
treTraverseBIn(*set, cbftvs_alphabet, toupper(sPattern));
}
else if (0 != (j = atoi(sPattern)))
{
P_BSTNODE pnode = treBSTFindData_A(*set, &j, cbfcmpid);
if (pnode)
{
printf("\t%lld %s", ((P_WORD)(pnode->knot.pdata))->id, ((P_WORD)(pnode->knot.pdata))->name);
++((P_WORD)(pnode->knot.pdata))->times;
/* Redirect to the word on the disk. */
fseek(fp, ((P_WORD)(pnode->knot.pdata))->ltip, SEEK_SET);
/* Read explanations. */
p = sWord;
while ('\n' != (*p = fgetc(fp)))
{
++p;
}
*p = '\0';
p = sWord;
printf("\t%s\n", p);
}
}
else
{
printf("Can not find \"%s\".\n", sPattern);
}
} while ('\0' != sPattern);
fclose(fp);
}
else
printf("Can not open file.\n");
printf("History:\n");
treTraverseBIn(*set, cbftvs_history, 0);
setDeleteT(set);
treDeleteTrieA(trie, sizeof(char));
return 0;
}
运行截图如下：
这是词典的源码：欢迎下载
具体原理是将词典中的单词放在了平衡二叉搜索树和Trie树当中以方便查询。 建议尝试脱离 StoneValley 库，看看能不能自己写出类似的算法，通过给定 index 进行快速的查询？ 0xAA55 发表于 2023-1-24 01:35
建议尝试脱离 StoneValley 库，看看能不能自己写出类似的算法，通过给定 index 进行快速的查询？ ...
好的我试试看，但是离开SV库也只是在重复造轮子啊。会又写一个差不多的搜索树。 usr 发表于 2023-1-25 14:53
好的我试试看，但是离开SV库也只是在重复造轮子啊。会又写一个差不多的搜索树。 ...
如果不是以工作用为目标，而是以学习算法和数据结构为目标，那造轮子是很好的学习方式，是一定要试试的。
页:
[1]