-
Notifications
You must be signed in to change notification settings - Fork 0
/
Filter.c
205 lines (181 loc) · 4.18 KB
/
Filter.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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
#pragma warning(disable : 6287)
#pragma warning(disable : 6031)
#include "Filter.h"
void GetFilterConditionFromConsoleInput(union FilterValue *filter_value, int *filter_type)
{
if (filter_value == NULL || filter_value == NULL)
{
#ifdef _DEBUG
DEBUG_PRINT("be careful: filter_value or filter_value is NULL.\n");
#endif
return;
}
printf("========== Conditional Filters ==========\n");
printf("1.By Name\n");
printf("2.By Phone\n");
printf("3.By Role\n");
printf("4.By Institute\n");
printf("0.Exit eilter\n\n");
while (1)
{
printf(">: ");
switch (CmdGetInt())
{
case NameFilter:
printf("Enter \"name\" for filtering: ");
scanf_s("%s", filter_value->name, 20);
*filter_type = NameFilter;
return;
case PhoneFilter:
printf("Enter \"phone\" number for filtering: ");
scanf_s("%s", filter_value->phone, 20);
*filter_type = PhoneFilter;
return;
case RoleFilter:
printf("Enter \"role\" number for filtering: ");
scanf_s("%s", filter_value->role, 50);
*filter_type = RoleFilter;
return;
case InstituteFilter:
printf("Enter \"institute\" number for filtering: ");
scanf_s("%s", filter_value->institute, 50);
*filter_type = InstituteFilter;
return;
case ExitFilter:
return;
default:
printf("Unexpected input.\n");
}
}
}
void FullFilter(struct LinkedList *list, struct Node *result_list[FILTER_RESULT_SIZE])
{
if (list == NULL || result_list == NULL)
{
#ifdef _DEBUG
DEBUG_PRINT("be carefule: list or result_list is NULL.\n");
#endif
return;
}
union FilterValue filter_value = {0};
int filter_type;
GetFilterConditionFromConsoleInput(&filter_value, &filter_type);
size_t i = 0;
struct Node *node = list->head;
while (node != NULL)
{
if (i >= FILTER_RESULT_SIZE)
{
printf("The data exceeds the maximum length of the result set.\n");
return;
}
struct NodeData *node_data = node->data;
if (node_data == NULL)
{
node = node->next;
continue;
}
switch (filter_type)
{
case NameFilter:
if (strcmp(node_data->name, filter_value.name) == 0)
result_list[i++] = node;
break;
case PhoneFilter:
if (strcmp(node_data->phone, filter_value.phone) == 0)
result_list[i++] = node;
break;
case RoleFilter:
if (strcmp(node_data->role, filter_value.role) == 0)
result_list[i++] = node;
break;
case InstituteFilter:
if (strcmp(node_data->institute, filter_value.institute) == 0)
result_list[i++] = node;
break;
default:
break;
}
node = node->next;
}
}
void IncrementalFilter(struct Node *list[FILTER_RESULT_SIZE])
{
if (list == NULL)
{
#ifdef _DEBUG
DEBUG_PRINT("be carefule: list is NULL.\n");
#endif
return;
}
union FilterValue filter_value = {0};
int filter_type = -1;
GetFilterConditionFromConsoleInput(&filter_value, &filter_type);
size_t pos = 0;
struct Node *node = NULL;
for (size_t i = 0; i < FILTER_RESULT_SIZE; ++i)
{
node = list[i];
if (node == NULL)
continue;
struct NodeData *node_data = list[i]->data;
if (node_data == NULL)
continue;
switch (filter_type)
{
case NameFilter:
if (strcmp(node_data->name, filter_value.name) == 0)
list[pos++] = node;
break;
case PhoneFilter:
if (strcmp(node_data->phone, filter_value.phone) == 0)
list[pos++] = node;
break;
case RoleFilter:
if (strcmp(node_data->role, filter_value.role) == 0)
list[pos++] = node;
break;
case InstituteFilter:
if (strcmp(node_data->institute, filter_value.institute) == 0)
list[pos++] = node;
break;
default:
break;
}
}
for (size_t i = pos; i < FILTER_RESULT_SIZE; ++i)
{
list[i] = NULL;
}
}
void PrintFilteredResultsInConsole(const char *motd, struct Node *list[FILTER_RESULT_SIZE])
{
if (motd == NULL || list == NULL)
{
#ifdef _DEBUG
DEBUG_PRINT("be careful: motd or list is NULL.\n");
#endif
return;
}
printf("%s\n", motd);
for (size_t i = 0; i < FILTER_RESULT_SIZE; ++i)
{
if (list[i] == NULL)
continue;
PrintNodeDataInConsole(list[i]->data, '\t');
}
printf("\n");
}
size_t GetFilteredResultsLength(struct Node *list[FILTER_RESULT_SIZE])
{
size_t count = FILTER_RESULT_SIZE;
for (size_t i = 0; i < FILTER_RESULT_SIZE; ++i)
{
if (list[i] == NULL)
{
count = i;
break;
}
}
return count;
}