lud_operations.c

一个快速

#include"LUD_Operations.h"


//rb_red_blk_node* newNode;
rb_red_blk_tree* tree;

void IntDest(void* a) {
	free((int*)a);
}

int IntComp(const void* a,const void* b) {
	if(wcscmp(*(wchar_t**)a, *(wchar_t**)b) > 0) return (1);
	if(wcscmp(*(wchar_t**)a, *(wchar_t**)b) < 0) return (-1);
	return(0);
}

void IntPrint(const void* a) {
	printf("%s",*(wchar_t**)a);
}

void InfoPrint(void* a) {
	;
}

void InfoDest(void *a){
	;
}

void InitTree(){
	tree=RBTreeCreate(IntComp,IntDest,InfoDest,IntPrint,InfoPrint);
}

void InsertTree(wchar_t* key, wchar_t* info){
	rb_red_blk_node* newNode;
	wchar_t** new_key;
	wchar_t** new_info;
	new_key = (wchar_t**)malloc(sizeof(wchar_t*));
	*new_key = (wchar_t*)malloc(sizeof(wchar_t) * MAX_BUF);
	new_info = (wchar_t**)malloc(sizeof(wchar_t*));
	*new_info = (wchar_t*)malloc(sizeof(wchar_t) * MAX_BUF);
	wcscpy_s(*new_key, MAX_BUF, key);
	wcscpy_s(*new_info, MAX_BUF, info);
	RBTreeInsert(tree, new_key, new_info);
}

wchar_t* QueryFromTree(wchar_t* key){
	rb_red_blk_node* newNode;
	wchar_t* result;
	result = (wchar_t*)malloc(sizeof(wchar_t) * MAX_BUF);

	if ( ( newNode = RBExactQuery(tree, &key) ) ) {/*assignment*/
		 wcscpy_s(result, MAX_BUF, *(char**)newNode->info);
		 return result;
	} else {
		printf("data not in tree\n");
		return NULL;
	}

}

void InsertTreeFromFile(){
	FILE* fp;
	wchar_t buf[MAX_BUF];
	wchar_t word[MAX_WORD_LENGTH];
	wchar_t pinyin[MAX_PINYIN_LENGTH];
	int i, j;
	int len;
	_wfopen_s(&fp, DIC_FILENAME, L"r, ccs=UTF-8");
	assert(fp != NULL);
	while(GetLineFromAFile(fp, buf) != EOF){
		len = wcslen(buf);
		for(i = 0; i < len, buf[i] != L' '; i++){
			word[i] = buf[i];
		}
		word[i++] = L'\0';
		for(j = 0 ; buf[i] != L'\0'; i++, j++){
			pinyin[j] = buf[i];
		}
		pinyin[j++] = L'\0';
		InsertTree(word, pinyin);
	}

}