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
| #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
enum {
MAXPOINT = 20
};
struct route {
char pointA[MAXPOINT];
char pointB[MAXPOINT];
int num;
};
struct route *EnterRoutes(void);
char *EnterPoint(void);
struct route **SearchRoutes(struct route *, const char *);
void PrintRoutes(struct route **);
int main(void) /* ANSI C89 */
{
struct route *prt;
char *ppt;
struct route **ppfrt;
prt = EnterRoutes();
if (prt == NULL)
assert(0 && "enter routes");
ppt = EnterPoint();
if (ppt == NULL)
assert(0 && "enter point");
ppfrt = SearchRoutes(prt, ppt);
if (ppfrt == NULL)
assert(0 && "search routes");
free(ppt);
PrintRoutes(ppfrt);
free(ppfrt);
free(prt);
exit(EXIT_SUCCESS);
}
struct route *EnterRoutes(void)
{
struct route *pr;
const int nr = 8;
pr = (struct route *) malloc(nr*sizeof(struct route));
if (pr == NULL)
assert(0 && "enter routes allocation");
strcpy((pr+0)->pointA, "one");
strcpy((pr+0)->pointB, "onewhere");
(pr+0)->num = 1;
strcpy((pr+1)->pointA, "two");
strcpy((pr+1)->pointB, "twowhere");
(pr+1)->num = 2;
/* ... */
return pr;
}
char *EnterPoint(void)
{
char *p;
p = (char *) malloc(MAXPOINT);
if (p == NULL)
assert(0 && "enter point allocation");
strcpy(p, "one");
return p;
}
struct route **SearchRoutes(
struct route *prt, const char *p)
{
struct route **pprt;
const int nr = 8;
int i, n;
pprt = (struct route **) malloc(
(nr+1)*sizeof(struct route *)
);
if (pprt == NULL)
assert(0 && "search routes allocation");
n = 0;
for (i = 0; i < nr; i++)
if
(
strcmp((prt+i)->pointA, p) == 0 ||
strcmp((prt+i)->pointB, p) == 0
) {
pprt[n] = prt+i;
n++;
}
pprt[n] = NULL;
n++;
if (n < nr+1) {
struct route **pp;
pp = (struct route **) realloc(
pprt, n*sizeof(struct route *)
);
if (pp == NULL)
assert(0 && "search routes reallocation");
pprt = pp;
}
return pprt;
}
void PrintRoutes(struct route **ppfrt)
{
if (*ppfrt == NULL) {
printf("there is no any route found" "\n");
return;
}
while (*ppfrt != NULL) {
printf("%3d: %s, %s" "\n",
(*ppfrt)->num, (*ppfrt)->pointA,
(*ppfrt)->pointB);
ppfrt++;
}
} |
