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
|
/*======================================================================*/
/*= CHANGES AND UPDATES =*/
/*======================================================================*/
/*= date person file subject =*/
/*=--------------------------------------------------------------------=*/
/*= =*/
/*= 270694 hua list.hc created =*/
/*= =*/
/*======================================================================*/
#include "list.h"
#include "errorhandling.h"
list list (int e)
{return (empty_list () + e);
}
list empty_list ()
{list l;
l.num = 0;
l.is_universal = false;
return l;
}
list universal_list ()
{list l;
l.num = 0;
l.is_universal = true;
return l;
}
void copy (list &l, list r)
{l.num = r.num;
l.is_universal = r.is_universal;
for (int i = 0; i < r.num; i++)
l.elem [i] = r.elem [i];
}
void print (list l)
{if (l.is_universal)
print_universal_list
else print_elem_list;
. print_universal_list
{printf ("\\ universal \\");
}.
. print_elem_list
{printf ("//");
for (int i = 0; i < l.num; i++)
print_elem;
printf ("//");
}.
. print_elem
{perhaps_seperator;
printf ("%d", l.elem [i]);
}.
. perhaps_seperator
{if (i != 0)
printf (",");
}.
}
list operator + (list l, int e)
{list r;
r = empty_list ();
for (int i = 0; i < l.num; i++)
{add_elem;
};
add_e;
return r;
. add_elem
{if (l.elem [i] != e)
perform_add;
}.
. perform_add
{r.elem [r.num++] = l.elem [i];
}.
. add_e
{r.elem [r.num++] = e;
}.
}
list operator - (list l, int e)
{list r;
r = empty_list ();
for (int i = 0; i < l.num; i++)
{add_elem;
};
return r;
. add_elem
{if (l.elem [i] != e)
perform_add;
}.
. perform_add
{r.elem [r.num++] = l.elem [i];
}.
}
bool operator % (int e, list l)
{if (l.is_universal)
return true;
else search_e;
. search_e
{for (int i = 0; i < l.num; i++)
if (l.elem [i] == e)
return true;
return false;
}.
}
|
