/
lagerhantering.c
225 lines (198 loc) · 4.73 KB
/
lagerhantering.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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
#include <stdio.h>
#include <stdbool.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include "goods.c"
//#include "add_from_stdin.c"
/*
void print_good(struct Goods *ware);
void add_string(char *text, char *info);
void add_good(struct Goods *ware);
*/
void list_goods(struct Goods *listOfGoods, int index, int page);
void create_goods(struct Goods *listOfGoods);
int choose_listedgood(struct Goods *listOfGoods, int index);
//int choose_good(struct Goods *listOfGoods, int index);
struct action
{
enum { NOTHING, ADD, REMOVE, EDIT } type;
struct Goods saved;
struct Goods *mark;
};
int main(void)
{
char input = 1;
struct Goods all_wares[100];
int index = 0;
struct action undo;
while(input != 'Q' && input != 'q')
{
puts("\n\nWelcome to Warehouse number 42\n"
"[A]dd a good\n"
"[R]emove a good\n"
"[E]dit a good\n"
"[P]rint a good\n"
"[U]ndo a bad decision\n"
"[L]ist everything\n"
"[Q]uit this amazing program\n");
input = ask_for_char("Your options: ", "AaRrEePpUuLlQq");
if (input == 'A' || input == 'a')
{
//ger oss en pekare till en bit av minne med storleken av struct goods
struct Goods *temp = malloc(sizeof(struct Goods));
//checkar så att pekaren inte är null dvs pekaren är giltig
assert(temp != NULL);
add_good(temp, index, all_wares);
bool done = false;
char choice;
while (!done)
{
print_good(temp);
choice = ask_for_char("\nSave, Discard, Edit :", "SsDdEe");
if (choice == 'S' || choice == 's')
{
undo.type = 1;
undo.mark = &all_wares[index];
all_wares[index] = *temp;
index++;
done = true;
}
else if (choice == 'D' || choice == 'd')
{
printf("Discarded\n"); //skarv
done = true;
}
else if (choice == 'E' || choice == 'e')
{
edit_good(temp, index, all_wares);
done = false;
}
else
{
printf("\nFaulty code");
}
}
assert(temp != NULL);
free(temp);
}
else if (input == 'R' || input == 'r')
{
int choosenGood = choose_listedgood(all_wares, index);
if (choosenGood >= 0)
{
undo.type = 2;
undo.mark = &all_wares[choosenGood];
undo.saved = all_wares[choosenGood];
remove_ware(&all_wares[choosenGood]);
}
}
else if (input == 'E' || input == 'e')
{
int choosenGood = choose_listedgood(all_wares, index);
if (choosenGood >= 0)
{
undo.type = 3;
undo.mark = &all_wares[choosenGood];
undo.saved = all_wares[choosenGood];
edit_good(&all_wares[choosenGood], index, all_wares);
}
}
else if (input == 'P' || input == 'p')
{
int choosenGood = choose_listedgood(all_wares, index);
if (choosenGood >= 0)
{
print_good(&all_wares[choosenGood]);
}
}
else if (input == 'U' || input == 'u')
{
if (undo.type == 0)
{
printf("\nNothing to undo");
}
// Add
else if (undo.type == 1)
{
remove_ware(undo.mark);
undo.type = 0;
index--;
}
// Remove
else if (undo.type == 2)
{
*undo.mark = undo.saved;
undo.type = 0;
}
// Edit
else if (undo.type == 3)
{
*undo.mark = undo.saved;
undo.type = 0;
}
}
else if (input == 'L' || input == 'l')
{
int page = 0;
char choice = 1;
while (choice != 'C' && choice != 'c')
{
list_goods(all_wares, index, page);
//för att se om det finns mer varor på nästa page, annars är det "end page"
if (index >((1+page)*20))
{
choice = ask_for_char("\nNext page or Cancel ", "NnCc");
}
else
{
choice = ask_for_char("\nEnd page, please Cancel", "Cc");
}
if (choice == 'N' || choice == 'n')
{
page++;
}
}
}
else
{
printf("Du are Dolig\n");
}
}
return 0;
}
int choose_listedgood(struct Goods *listOfGoods, int index)
{
int page = 0;
char choice = 1;
while (choice != 'C' && choice != 'c')
{
list_goods(listOfGoods, index, page);
if (index >((1+page)*20))
{
choice = ask_for_char("\nChoose ware, Next page or Cancel", "WwNnCc");
}
else
{
choice = ask_for_char("\nEnd page, Choose ware or Cancel", "WwCc");
}
if (choice == 'N' || choice == 'n')
{
page++;
}
else if (choice == 'W' || choice == 'w')
{
//Returna valet-1 så det blir det correcta indexet
return (ask_for_int("Choose ware: ", 20) -1);
}
}
//för att acceptera att man cancelar ifrån den här functionen utan att ange en vara.
return -1;
}
void list_goods(struct Goods *listOfGoods, int index, int page)
{
for (int i = 0; i < 20 && i < index; i++)
{
printf("\n%d. %s", (i+1), listOfGoods[i+(page*20)].name);
}
}