forked from MostafaTwfiq/C-DataStructures-And-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList.c
1054 lines (833 loc) · 29.4 KB
/
LinkedList.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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "../Headers/LinkedList.h"
#include "../../../System/Utils.h"
#include "../../../Unit Test/CuTest/CuTest.h"
typedef struct Node {
void *item; //void pointer so the node be generic.
struct Node *next; // a pointer to the next node.
} Node;
/** This function will allocate a new linked list in the memory, setup it's fields and return it.
*
* @param freeFun the free function address that will be called to free the items in the linked list
* @param comparator the comparator function address, that will be called to compare two items
*/
LinkedList *linkedListInitialization(void (*freeFun)(void *), int (*comparator)(const void *, const void *)) {
if (freeFun == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return NULL;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "free function pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
}
LinkedList *linkedList = (LinkedList *) malloc(sizeof(LinkedList));
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = FAILED_ALLOCATION;
return NULL;
#else
fprintf(stderr, FAILED_ALLOCATION_MESSAGE, "linked list", "linked list data structure");
exit(FAILED_ALLOCATION);
#endif
}
linkedList->head = linkedList->tail = NULL;
linkedList->length = 0;
linkedList->freeFun = freeFun;
linkedList->comparator = comparator;
return linkedList;
}
/** This function will take the linked list address, and the item address as a parameters,
* then it will add the item in the start of the linked list.
*
* @param linkedList the linked list address
* @param item the new item address
* */
void linkedListAddFirst(LinkedList *linkedList, void *item) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (item == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
}
Node *newNode = (Node *) malloc(sizeof(Node));
if (newNode == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = FAILED_ALLOCATION;
return;
#else
fprintf(stderr, FAILED_ALLOCATION_MESSAGE, "new node", "linked list data structure");
exit(FAILED_ALLOCATION);
#endif
}
newNode->item = item;
newNode->next = linkedList->head;
if (linkedListIsEmpty(linkedList))
linkedList->tail = newNode;
linkedList->head = newNode;
linkedList->length++;
}
/** This function will take the linked list address, and the item address as a parameters,
* then it will add the item in the end of the linked list.
*
* @param linkedList the linked list address
* @param item the new item address
*/
void linkedListAddLast(LinkedList *linkedList, void *item) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (item == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
}
Node *newNode = (Node *) malloc(sizeof(Node));
if (newNode == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = FAILED_ALLOCATION;
return;
#else
fprintf(stderr, FAILED_ALLOCATION_MESSAGE, "new node", "linked list data structure");
exit(FAILED_ALLOCATION);
#endif
}
newNode->item = item;
newNode->next = NULL;
if (linkedListIsEmpty(linkedList))
linkedList->head = newNode;
else
linkedList->tail->next = newNode;
linkedList->tail = newNode;
linkedList->length++;
}
/** This function will take the linked list address, item index, and the item address as a parameters,
* then it will add the item in the passed index.
*
* @param linkedList the linked list address
* @param index the index that the new item will be inserted in
* @param item the new item address
*/
void linkedListAddAtIndex(LinkedList *linkedList, int index, void *item) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (item == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
} else if (index < 0 || index >= linkedListGetLength(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = OUT_OF_RANGE;
return;
#else
fprintf(stderr, OUT_OF_RANGE_MESSAGE, "linked list data structure");
exit(OUT_OF_RANGE);
#endif
}
Node *newNode = (Node *) malloc(sizeof(Node));
if (newNode == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = FAILED_ALLOCATION;
return;
#else
fprintf(stderr, FAILED_ALLOCATION_MESSAGE, "new node", "linked list data structure");
exit(FAILED_ALLOCATION);
#endif
}
newNode->item = item;
Node *currentNode = linkedList->head;
Node *prevNode = NULL;
while (index-- != 0) {
prevNode = currentNode;
currentNode = currentNode->next;
}
if (prevNode == NULL) {
newNode->next = currentNode;
linkedList->head = newNode;
} else {
prevNode->next = newNode;
newNode->next = currentNode;
}
linkedList->length++;
}
/** This function will take the linked list address, items array, and the length of the array as parameters,
* then it will copy the array item if the linked list in a new items addresses.
*
* Note: this function will add all the new items in the end of the linked list.
*
* @param linkedList the linked list address
* @param items the items array represented as a double pointer array
* @param itemsLength the length of the items array
*/
void linkedListAddAll(LinkedList *linkedList, void **items, int itemsLength) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (items == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "items array pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
}
for (int i = 0; i < itemsLength; i++)
linkedListAddLast(linkedList, items[i]);
}
/** This function will take the linked list address as a parameter,
* then it will delete and free the first element from the linked list.
*
* @param linkedList the linked list pointer
*/
void linkedListDeleteFirst(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
}
Node *nodeToFree = linkedList->head;
if (linkedList->head == linkedList->tail) {
linkedList->tail = NULL;
}
linkedList->head = linkedList->head->next;
linkedList->length--;
linkedList->freeFun(nodeToFree->item);
free(nodeToFree);
}
/** This function will take the linked list address as a parameter,
* then it will delete and free only the node without the item of the first element from the linked list.
*
* @param linkedList the linked list pointer
* @return it will return the deleted item pointer
*/
void *linkedListDeleteFirstWtoFr(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return NULL;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
}
Node *nodeToFree = linkedList->head;
if (linkedList->head == linkedList->tail) {
linkedList->tail = NULL;
}
linkedList->head = linkedList->head->next;
linkedList->length--;
void *returnItem = nodeToFree->item;
free(nodeToFree);
return returnItem;
}
/** This function will take the linked list address as a parameter,
* then it will delete and free the last element from the linked list.
*
* @param linkedList the linked list pointer
*/
void linkedListDeleteLast(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
}
Node *currentNode = linkedList->head;
Node *prevNode = NULL;
while (currentNode->next != NULL) {
prevNode = currentNode;
currentNode = currentNode->next;
}
if (prevNode == NULL)
linkedList->head = NULL;
else
prevNode->next = NULL;
linkedList->tail = prevNode;
linkedList->length--;
linkedList->freeFun(currentNode->item);
free(currentNode);
}
/** This function will take the linked list address as a parameter,
* then it will delete and free only the node without the item of the last element from the linked list.
*
* @param linkedList the linked list pointer
* @return it will return the deleted item pointer
*/
void *linkedListDeleteLastWtoFr(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return NULL;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
}
Node *currentNode = linkedList->head;
Node *prevNode = NULL;
while (currentNode->next != NULL) {
prevNode = currentNode;
currentNode = currentNode->next;
}
if (prevNode == NULL)
linkedList->head = NULL;
else
prevNode->next = NULL;
linkedList->tail = prevNode;
linkedList->length--;
void *returnItem = currentNode->item;
free(currentNode);
return returnItem;
}
/** This function will take the linked list address, and the index as parameters,
* then it will delete the item in this index.
*
* Note: if the index is out of the linked list rang then the program will be terminated.
*
* @param linkedList the linked list pointer
* @param index the index of the item, that will be deleted
*/
void linkedListDeleteAtIndex(LinkedList *linkedList, int index) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
} else if (index < 0 || index >= linkedListGetLength(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = OUT_OF_RANGE;
return;
#else
fprintf(stderr, OUT_OF_RANGE_MESSAGE, "linked list data structure");
exit(OUT_OF_RANGE);
#endif
}
Node *currentNode = linkedList->head;
Node *prevNode = NULL;
for (int i = 0; i < index; i++) {
prevNode = currentNode;
currentNode = currentNode->next;
}
if (currentNode == linkedList->head)
linkedListDeleteFirst(linkedList);
else if (currentNode == linkedList->tail)
linkedListDeleteLast(linkedList);
else {
prevNode->next = currentNode->next;
linkedList->length--;
linkedList->freeFun(currentNode->item);
free(currentNode);
}
}
/** This function will take the linked list address, and the index as parameters,
* then it will delete and free only the node without the item of the item in this index.
*
* If the index is out of the linked list rang then the program will be terminated.
*
* @param linkedList the linked list pointer
* @param index the index of the item, that will be deleted
* @return it will return the deleted item pointer
*/
void *linkedListDeleteAtIndexWtoFr(LinkedList *linkedList, int index) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return NULL;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
} else if (index < 0 || index >= linkedListGetLength(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = OUT_OF_RANGE;
return NULL;
#else
fprintf(stderr, OUT_OF_RANGE_MESSAGE, "linked list data structure");
exit(OUT_OF_RANGE);
#endif
}
Node *currentNode = linkedList->head;
Node *prevNode = NULL;
for (int i = 0; i < index; i++) {
prevNode = currentNode;
currentNode = currentNode->next;
}
if (currentNode == linkedList->head)
return linkedListDeleteFirstWtoFr(linkedList);
else if (currentNode == linkedList->tail)
return linkedListDeleteLastWtoFr(linkedList);
else {
prevNode->next = currentNode->next;
linkedList->length--;
void *returnItem = currentNode->item;
free(currentNode);
return returnItem;
}
}
/** This function will take the linked list address, and the item address as parameters, then
* then it will return 1 if the item is in the list other wise it will return zero (0).
*
* Note: the function will use the comparator function to know if the two items are equivalent or not.
*
* @param linkedList the linked list pointer
* @param item the item pointer
* @return it will return 1 if the item exist in the linked list, other wise it will return 0
*/
int linkedListContains(LinkedList *linkedList, void *item) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return -1;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (item == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return -1;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
} else if (linkedList->comparator == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return -1;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "comparator function", "linked list data structure");
exit(NULL_POINTER);
#endif
}
Node *currentNode = linkedList->head;
while (currentNode != NULL) {
// if the comparator function returned zero then the two items are equal.
if (linkedList->comparator(item, currentNode->item) == 0)
return 1;
currentNode = currentNode->next;
}
return 0;
}
/** This function will take the linked list address, and the item address as a parameters,
* then it will return the index of the given item, other wise it will return minus one (-1).
*
* Note: the function will use the comparator function to know if the two items are equivalent or not.
*
* @param linkedList the linked list pointer
* @param item the item pointer
* @return it will return the the index of the item if found, other wise it will return -1
*/
int linkedListGetIndex(LinkedList *linkedList, void *item) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return -1;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (item == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return -1;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
} else if (linkedList->comparator == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return -1;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "comparator function", "linked list data structure");
exit(NULL_POINTER);
#endif
}
Node *currentNode = linkedList->head;
for (int index = 0; currentNode != NULL; currentNode = currentNode->next, index++) {
// if the comparator function returned zero then the two items are equal.
if (linkedList->comparator(item, currentNode->item) == 0)
return index;
}
return -1;
}
/** This function will take the linked list address as a parameter,
* then it will return the first item in the list.
*
* Note: if the linked list is empty the function will terminate the program.
*
* @param linkedList the linked list pointer
* @return it will return the first item in the linked list
*/
void *linkedListGetFirst(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return NULL;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
}
return linkedList->head->item;
}
/** This function will take the linked list address as a parameter,
* then it will return the last item in the list.
*
* Note: if the linked list is empty the function will terminate the program.
*
* @param linkedList the linked list pointer
* @return it will return the last item in the linked list
*/
void *linkedListGetLast(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return NULL;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
}
return linkedList->tail->item;
}
/** This function will take the linked list address, and the item address as a parameters,
* then it will return the item from the list if found, other wise it will return NULL.
*
* Note: the function will use the comparator function to know if the two items are equivalent or not.
*
* @param linkedList the linked list pointer
* @param item the item pointer
* @return it will return the item pointer if found, other wise it will return NULL
*/
void *linkedListGetItem(LinkedList *linkedList, void *item) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (item == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return NULL;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
} else if (linkedList->comparator == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "comparator function", "linked list data structure");
exit(NULL_POINTER);
#endif
}
Node *currentNode = linkedList->head;
while (currentNode != NULL) {
// if the comparator function returned zero then the two items are equal.
if (linkedList->comparator(item, currentNode->item) == 0)
return currentNode->item;
currentNode = currentNode->next;
}
return NULL;
}
/** This function will take the linked list address, and the index as parameters,
* then it will return the item in the given index.
*
* Note: if the index is out of the linked list range the program will terminate.
*
* Note: if the linked list is empty the program will terminate.
*
* @param linkedList the linked list pointer
* @param index the index of the item
* @return it will return the item in the provided index
*/
void *linkedListGet(LinkedList *linkedList, int index) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (linkedListIsEmpty(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = EMPTY_DATA_STRUCTURE;
return NULL;
#else
fprintf(stderr, EMPTY_DATA_STRUCTURE_MESSAGE, "linked list data structure");
exit(EMPTY_DATA_STRUCTURE);
#endif
} else if (index < 0 || index >= linkedListGetLength(linkedList)) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = OUT_OF_RANGE;
return NULL;
#else
fprintf(stderr, OUT_OF_RANGE_MESSAGE, "linked list data structure");
exit(OUT_OF_RANGE);
#endif
}
Node *currentNode = linkedList->head;
for (int i = 0; i < index; i++)
currentNode = currentNode->next;
return currentNode->item;
}
/** This function will take the linked list address as a parameter,
* then it will return a void pointer to an array consist of the items in the linked list.
*
* Note: the items in the array doesn't share the same address in the linked list items.
*
* @param linkedList the linked list pointer
* @return it will return a double void array, that contains the linked list items.
*/
void **linkedListToArray(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return NULL;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
}
void **array = (void **) malloc(sizeof(void *) * linkedListGetLength(linkedList));
if (array == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = FAILED_ALLOCATION;
return NULL;
#else
fprintf(stderr, FAILED_ALLOCATION_MESSAGE, "to array", "linked list data structure");
exit(FAILED_ALLOCATION);
#endif
}
Node *currentNode = linkedList->head;
for (int i = 0; i < linkedListGetLength(linkedList); i++) {
array[i] = currentNode->item;
currentNode = currentNode->next;
}
return array;
}
/** This function will take the linked list address as a parameter,
* the it will return the number of items in the linked list.
*
* @param linkedList the linked list pointer
* @return it will return the linked list length
*/
int linkedListGetLength(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return -1;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
}
return linkedList->length;
}
/** This function will take the linked list address as a parameter,
* then it will return one (1) if the linked list is empty, other wise it will return 0.
*
* @param linkedList the linked list pointer
* @return it will return 1 if the linked list is empty, other wise it will return 0
*/
int linkedListIsEmpty(LinkedList *linkedList) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return -1;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
}
return linkedList->head == NULL && linkedList->tail == NULL;
}
/** This method will take the linked list address, and the print function address, as a parameter,
* then it will call thr print function and pass to it an item pointer to be printed.
*
* @param linkedList the linked list pointer
* @param printFun the printing function pointer, that will be called to print the item
*/
void printLinkedList(LinkedList *linkedList, void (*printFun)(const void *)) {
if (linkedList == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = NULL_POINTER;
return;
#else
fprintf(stderr, NULL_POINTER_MESSAGE, "linked list pointer", "linked list data structure");
exit(NULL_POINTER);
#endif
} else if (printFun == NULL) {
#ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
ERROR_TEST->errorCode = INVALID_ARG;
return;
#else
fprintf(stderr, INVALID_ARG_MESSAGE, "print function pointer", "linked list data structure");
exit(INVALID_ARG);
#endif
}
Node *currentNode = linkedList->head;
while (currentNode != NULL) {
printFun(currentNode->item);
currentNode = currentNode->next;
}
}
/** This function will take the linked list address as a parameter,
* then it will delete and free all the items from the linked list.
*
* @param linkedList the linked list pointer
*/