双向循环链表（C语言描述）（五）

代码清单

 // dictionary.h
 #ifndef __DICTIONARY_H__
 #define __DICTIONARY_H__

 #include <assert.h>
 #include <stdio.h>
 #include <stdio_ext.h>

 #include "mystring.h"
 #include "linkedlist.h"

 void dict_init();
 void dict_show();

 #endif // __DICTIONARY_H__

 // dictionary.c
 #include "dictionary.h"
 #define PATH "dictionary.dat"

 LinkedList list;
 static void dict_load();
 static void dict_store();
 void dict_search(const char * eng);
 void dict_add(const char * eng);
 void dict_delete();
 void dict_modify();
 int dict_cmp(const void * s1, const void * s2);

 void dict_init() {
     list = linkedlist_new();

     dict_load();
     printf("Welcome.");
 }

 void dict_show() {
     while () {
         string str;
         printf("\n>");
         mygets(str);

         if (!strcmp(str, "quit;")) {
             dict_store();
             linkedlist_destory(&list);
             printf("Bye.\n");
             return;
         } else if (!strcmp(str, "delete;")) {
             dict_delete();
         } else if (!strcmp(str, "modify;")) {
             dict_modify();
         } else {
             dict_search(str);
         }
     }
 }

 static void dict_load() {
     FILE * fp;
     struct Word word;

     while (!(fp = fopen(PATH, "rb"))) {
         fp = fopen(PATH, "wb");
         fclose(fp);
     }
     assert(fp);

     fread(&word, sizeof(struct Word), , fp);
     while (!feof(fp)) {
         linkedlist_insert(list, TRAVELDIR_BACKWARD, , word);
         fread(&word, sizeof(struct Word), , fp);
     }

     fclose(fp);
 }

 static void dict_store() {
     FILE * fp;
     const int count = linkedlist_length(list);

     assert(fp = fopen(PATH, "wb"));
     for (int i = ; i < count; i++) {
         fwrite(linkedlist_get(list, TRAVELDIR_FORWARD, i + ),
                 sizeof(struct Word), , fp);
     }

     fclose(fp);
 }

 int dict_cmp(const void * s1, const void * s2) {
     return strcmp(((LinkedListData *) s1)->eng, ((LinkedListData *) s2)->eng);
 }

 void dict_search(const char * eng) {
     int location;
     struct Word word;
     strcpy(word.eng, eng);

     if ((location = linkedlist_locate(list, TRAVELDIR_FORWARD, word, dict_cmp))
             == -) {    // not found
         dict_add(eng);
     } else {            // found
         printf("%s\n", linkedlist_get(list, TRAVELDIR_FORWARD, location)->chn);
     }
 }

 void dict_add(const char * eng) {
     struct Word word;
     strcpy(word.eng, eng);

     printf("The word does not exist, add it?\ny/n>");
     if (__fpurge(stdin), getchar() == 'y') {
         printf("Ok, what does it mean?\n>");
         mygets(word.chn);

         linkedlist_insert(list, TRAVELDIR_BACKWARD, , word);
         printf("The word is existed now.\n");
     }
 }

 void dict_delete() {
     int location;
     struct Word word;

     printf("What word do you wanna delete?\n>");
     mygets(word.eng);

     if ((location = linkedlist_locate(list, TRAVELDIR_FORWARD, word, dict_cmp))
             != -) {    // found
         struct Word * pWord = linkedlist_get(list, TRAVELDIR_FORWARD, location);

         printf("Delete: %s %s\nAre you sure?\ny/n>", pWord->eng, pWord->chn);
         if (__fpurge(stdin), getchar() == 'y') {
             linkedlist_delete(list, TRAVELDIR_FORWARD, location);
             printf("The word is deleted now.\n");
         }
     } else {            // not found
         printf("The word does not exist.\n");
     }
 }

 void dict_modify() {
     int location;
     struct Word word;

     printf("What word do you wanna modify?\n>");
     mygets(word.eng);

     if ((location = linkedlist_locate(list, TRAVELDIR_FORWARD, word, dict_cmp))
             != -) {    // found
         struct Word * pWord = linkedlist_get(list, TRAVELDIR_FORWARD, location);

         printf("Ok, what does it mean?\n>");
         mygets(pWord->chn);
         printf("The word is modified now.\n");
     } else {            // not found
         printf("The word does not exist.\n");
     }
 }

 // mystring.h
 #ifndef __MYSTRING_H__
 #define __MYSTRING_H__

 #include <stdio.h>
 #include <stdio_ext.h>

 #define MAX_STR_LEN 8
 typedef char string[MAX_STR_LEN];

 void mygets(char * s);

 #endif // __MYSTRING_H__

 // mystring.c
 #include "mystring.h"

 void mygets(char * s)
 {
     __fpurge(stdin);
     fgets(s, MAX_STR_LEN, stdin);
     while (*s++) {
         *s = *s == '\n' ?  : *s;
     }
 }

 // main.c
 #include "dictionary.h"

 int main()
 {
     dict_init();
     dict_show();

     return ;
 }