查字典项目的源代码.docVIP

#include stdio.h #include string.h #include stdlib.h #define BUF_SIZE 4096 typedef struct { char *key; int num; char **trans; }word_t; void sys_err(const char *msg) { perror(msg); exit(1); } int word_num(const char *filename) { FILE *fp; char buf[BUF_SIZE]; int total = 0; fp = fopen(filename, r); if(fp == NULL) sys_err(open file\n); while((fgets(buf, BUF_SIZE, fp)) != NULL) { if(buf[0] == #) total++; } fclose(fp); return total; } int nword(const char *filename) { FILE *fp; char buf[BUF_SIZE]; int total = 0; fp = fopen(filename, r+); if(fp == NULL) sys_err(open file\n); while((fgets(buf, BUF_SIZE, fp)) != NULL) { if(buf[0] == #) total++; } fclose(fp); return total; } word_t *init_word(int total, const char *filename)//将文本写入缓存中 { FILE *fp; char buf[BUF_SIZE]; int i, j; fp = fopen(filename, r); if(fp == NULL) sys_err(open file\n); word_t *dict = (word_t *)malloc(total * sizeof(word_t)); while((fgets(buf, BUF_SIZE, fp)) != NULL) { if(buf[0] == #) { dict-key = malloc(strlen(buf) - 1); buf[strlen(buf) - 1] = \0; strcpy(dict-key, buf+1); } else{ dict-num = 0; buf[strlen(buf)-1] = @; for(i = 0; i strlen(buf); i++) if(buf[i] == @) dict-num++; dict-trans = (char **)malloc(sizeof(char *) * dict-num); int pos = -1; char *p = buf + 6; for(j = 6; buf[j] != \0; j++) { if(buf[j] == @) { pos++; buf[j] = \0; dict-trans[pos] = (char *)malloc(sizeof(char) * (strlen(p) + 1)); strcpy(dict-trans[pos], p); p = buf+ j + 1; } } dict++; } } fclose(fp); dict = dict-total; return dict; } int partition(word_t *dict,int start, int end)//排序 { int i, last = start; word_t tmp, *pivot; pivot = dict+start; for(i = start+1; i = end; i++) { if(strcmp((dict+i)-key, pivot-key) 0) { last++; tmp = *(dict+i); *(dict + i) = *(dict+last); *(dict+last) = tmp; } } tmp = *(dict +last); *(dict+last) = *(dict+start); *(dict+start) = tmp; r