-
Notifications
You must be signed in to change notification settings - Fork 0
/
Linked_List.c
124 lines (112 loc) · 3.76 KB
/
Linked_List.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
/* ======================================== */
/* Author : Mahmoud Sayed
* Date : 9 April 2023
* Description : Defining the functions
* of Linked_List header file.
* Email : Thetr619@gmail.com
*/
/* ======================================== */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "Linked_List_config.h"
#include "Linked_List.h"
/* ========== Functions declarations ========== */
void Linked_List_Init(list_t *List) {
List->first = NULL;
List->last = NULL;
}
void Linked_List_AddNode(list_t *List, DATA *NewData) {
lnode_t *ptr, *last;
if(List->first == NULL) {
List->first = (lnode_t *) malloc(sizeof(lnode_t));
List->first->dataPtr = NewData;
List->first->NextNode = NULL;
List->last = NULL;
} else {
ptr = List->first->NextNode;
last = List->first;
while(ptr != NULL) {
last = ptr;
ptr = ptr->NextNode;
}
ptr = (lnode_t *) malloc(sizeof(lnode_t));
last->NextNode = ptr;
ptr->NextNode = NULL;
ptr->dataPtr = NewData;
List->last = ptr;
}
}
int Linked_List_DeleteNode(list_t *List, char firstName[], char lastName[]) {
lnode_t *ptr, *deleteNode, *last;
DATA *deleteAccount;
int found = 0;
ptr = List->first;
if(ptr == NULL) return 0;
else {
if (ptr->NextNode == NULL) { // In case of single node list
if ((strcmp(ptr->dataPtr->FirstName, firstName) == 0) && (strcmp(ptr->dataPtr->LastName, lastName) == 0)) {
deleteAccount = ptr->dataPtr;
deleteNode = ptr;
List->first = ptr->NextNode;
free(deleteAccount);
free(deleteNode);
ptr = NULL;
found = 1;
} else {
found = 0;
}
} else { // In case of multiple nodes list
last = ptr;
while (ptr != NULL) {
if ((strcmp(ptr->dataPtr->FirstName, firstName) == 0) && (strcmp(ptr->dataPtr->LastName, lastName) == 0)) {
deleteAccount = ptr->dataPtr;
deleteNode = ptr;
if (List->first == ptr) List->first = ptr->NextNode;
if (List->last == ptr) List->last = last;
last->NextNode = ptr->NextNode;
free(deleteAccount);
free(deleteNode);
ptr = NULL;
found = 1;
} else {
found = 0;
last = ptr;
ptr = ptr->NextNode;
}
}
}
}
return found;
}
void* Linked_List_FindNode(list_t *List, char firstName[], char lastName[]) {
lnode_t *ptr;
ptr = List->first;
if(List->first == NULL) return NULL;
else {
if (ptr->NextNode == NULL) { // In case of single node list
if ((strcmp(ptr->dataPtr->FirstName, firstName) == 0) && (strcmp(ptr->dataPtr->LastName, lastName) == 0)) {
return ptr;
} else {
return NULL;
}
} else { // In case of multiple nodes list
while (ptr != NULL) {
if ((strcmp(ptr->dataPtr->FirstName, firstName) == 0) && (strcmp(ptr->dataPtr->LastName, lastName) == 0)) {
return ptr;
} else {
ptr = ptr->NextNode;
}
}
}
}
return NULL;
}
void Linked_List_ListNodes(list_t *List, void (*DisplayFormatFunction) (lnode_t*)) {
lnode_t *ptr;
ptr = List->first;
while(ptr != NULL) {
DisplayFormatFunction(ptr);
ptr = ptr->NextNode;
}
}