-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlistManip.c
116 lines (86 loc) · 1.81 KB
/
listManip.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
#include "listManip.h"
void listaVegFuz(listaElem** eleje, Kiadas* kiadas)
{
listaElem* uj;
uj = (listaElem*) malloc(sizeof(listaElem));
if (uj == NULL)
{
printf("Nem sikerult a memoriaban helyet foglalni\n");
return;
}
uj->kiadas = kiadas;
uj->kov = NULL;
if (*eleje == NULL)
{
*eleje = uj;
}
else
{
listaElem* mozgo = *eleje;
while (mozgo->kov != NULL)
{
mozgo = mozgo->kov;
}
mozgo->kov = uj;
}
}
void listaFelszabadit(listaElem* eleje)
{
listaElem* head = eleje;
while (head != NULL)
{
listaElem* temp = head->kov;
free(head->kiadas);
free(head);
head = temp;
}
}
bool listaTartalmaz(countOfElem* eleje, char* nev){
countOfElem* head = eleje;
while (head != NULL)
{
if (strcmp(head->nev,nev) == 0)
{
head->count += 1; // itt noveljuk
return true;
}
head = head->kov;
}
return false;
}
void statListaVegFuz(countOfElem** eleje, char* nev)
{
countOfElem* uj;
uj = (countOfElem*) malloc(sizeof(countOfElem));
if(uj == NULL)
{
printf("Nem sikerult a memoriaban helyet foglalni.\n");
return;
}
strcpy(uj->nev, nev);
uj->count = 1;
uj->kov = NULL;
if (*eleje == NULL)
{
*eleje = uj;
}
else
{
countOfElem* mozgo = *eleje;
while (mozgo->kov != NULL)
{
mozgo = mozgo->kov;
}
mozgo->kov = uj;
}
}
void statListaFelszabadit(countOfElem* eleje)
{
countOfElem* head = eleje;
while (head != NULL)
{
countOfElem* temp = head->kov;
free(head);
head = temp;
}
}