-
Notifications
You must be signed in to change notification settings - Fork 0
/
dic_test.c
93 lines (82 loc) · 2.88 KB
/
dic_test.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include "dic_function.h"
int main(void){
Dictionary d;
d = create(START_SIZE);
status(d);
FILE* fp;
fp = fopen("dic_test.txt", "r");
if (fp == NULL){
printf("Error open file\n");
exit(EXIT_FAILURE);
}
char key[30];
char value[30];
/////////////////////////////////////////////////////////////
printf("Command: Insert 125 groups key-value pairs\n\n");
while ((fscanf(fp, "%s", key)==1) && (fscanf(fp, "%s", value)==1)){
insert(d, key, value);
}
printf("finish inserting\n");
status(d);
fclose(fp);
fp = NULL;
view_pairs(d);
/////////////////////////////////////////////////////////////
printf("Command: Downsize, delete 100 keys\n\n");
fp = fopen("dic_test.txt", "r");
if (fp == NULL){
printf("Error open file\n");
exit(EXIT_FAILURE);
}
int counter = 0;
while ((fscanf(fp, "%s", key)==1) && (fscanf(fp, "%s", value)==1)){
counter++;
if (counter > 100){
break;
}
delete(d, key);
}
printf("finish deleting.\n");
status(d);
fclose(fp);
//////////////////////////////////////////////////////////////
printf("Command: Check some deleted key and not-existing key\n\n");
printf("key = [a], [aaa], [able], [abuse], [xx], [night], [bad], [work]\n");
char *test_key[] = {"a", "aaa", "able", "abuse","xx", "night", "bad", "work"};
int test_key_length = 8;
for (int i = 0; i < test_key_length; i++){
char* result = search(d, test_key[i]);
if (result == NULL){
printf("Error: no key match [%s]\n", test_key[i]);
}
else{
printf("[%s]->[%s]\n", test_key[i], result);
}
}
//////////////////////////////////////////////////////////////
printf("\nCommand: Check some existing key-value pairs\n");
printf("[agencies]->[agency], [aging]->[ago], [aid]->[aids], [aims]->[air]\n");
printf("check return %s\n", search(d, "agencies"));
printf("check return %s\n", search(d, "aging"));
printf("check return %s\n", search(d, "aid"));
printf("check return %s\n", search(d, "aims"));
//////////////////////////////////////////////////////////////
printf("\nCommand: Consider [aging]->[ago], repeatedly insert different values\n");
printf("Command: insert[aging]->[hello], [gello], [yogurt], [tuna], [happy]\n");
printf("Then check the value of key [aging]\n");
insert(d, "aging", "hello");
insert(d, "aging", "gello");
insert(d, "aging", "yogurt");
insert(d, "aging", "tuna");
insert(d, "aging", "happy");
printf("check return %s\n", search(d, "aging"));
//////////////////////////////////////////////////////////////
printf(("\nFinish test, deleting...\nThank you.\n"));
destroy(d);
d = NULL;
return 0;
}