|
| 1 | +#include "./main.h" |
| 2 | + |
| 3 | +#include "../macros.h" |
| 4 | + |
| 5 | +Node* __getElementAt(List* _list, const size_t index); |
| 6 | + |
| 7 | +// Constructor |
| 8 | +void newList(List* list) { *list = NULL; } |
| 9 | + |
| 10 | +// Destroyer |
| 11 | +void destroyList(List* _list) { |
| 12 | + Node* nextNode; |
| 13 | + |
| 14 | + while ((*_list) != NULL) { |
| 15 | + nextNode = *_list; |
| 16 | + *(_list) = nextNode->__next; |
| 17 | + |
| 18 | + free(nextNode->__data); |
| 19 | + free(nextNode); |
| 20 | + } |
| 21 | +} |
| 22 | + |
| 23 | +// Getters |
| 24 | +Node* __getElementAt(List* _list, const size_t index) { |
| 25 | + size_t length = 0; |
| 26 | + |
| 27 | + while ((*_list) != NULL && length != index) { |
| 28 | + _list = &(*_list)->__next; |
| 29 | + length++; |
| 30 | + } |
| 31 | + |
| 32 | + return *_list; |
| 33 | +} |
| 34 | + |
| 35 | +unsigned char getHead(const List* _list, void* store, const size_t sizeOfStore) { |
| 36 | + if ((*_list) == NULL) return 0; |
| 37 | + |
| 38 | + memcpy(store, (*_list)->__data, MIN(sizeOfStore, (*_list)->__sizeOfData)); |
| 39 | + |
| 40 | + return 1; |
| 41 | +} |
| 42 | + |
| 43 | +unsigned char isListEmpty(List* _list) { return (*_list) == NULL; } |
| 44 | + |
| 45 | +unsigned char isListFull(List* _list, const size_t sizeOfStore) { |
| 46 | + Node* newNode; |
| 47 | + void* newNodeData; |
| 48 | + |
| 49 | + newNode = malloc(sizeof(Node)); |
| 50 | + newNodeData = malloc(sizeOfStore); |
| 51 | + |
| 52 | + free(newNode); |
| 53 | + free(newNodeData); |
| 54 | + |
| 55 | + return ((newNode == NULL) || (newNodeData == NULL)); |
| 56 | +} |
| 57 | + |
| 58 | +size_t getLength(List* _list) { |
| 59 | + size_t length = 0; |
| 60 | + |
| 61 | + while ((*_list) != NULL) { |
| 62 | + length++; |
| 63 | + _list = &(*_list)->__next; |
| 64 | + } |
| 65 | + |
| 66 | + return length; |
| 67 | +} |
| 68 | +// Methods |
| 69 | +unsigned char pushElement(List* _list, void* data, const size_t sizeOfData) { |
| 70 | + Node* newNode; |
| 71 | + |
| 72 | + while ((*_list) != NULL) { |
| 73 | + _list = &(*_list)->__next; |
| 74 | + }; |
| 75 | + |
| 76 | + if ((newNode = malloc(sizeof(Node))) == NULL || |
| 77 | + (newNode->__data = malloc(sizeOfData)) == NULL) { |
| 78 | + free(newNode); |
| 79 | + return 0; |
| 80 | + } |
| 81 | + |
| 82 | + memcpy(newNode->__data, data, sizeOfData); |
| 83 | + newNode->__sizeOfData = sizeOfData; |
| 84 | + newNode->__next = NULL; |
| 85 | + *_list = newNode; |
| 86 | + |
| 87 | + return 1; |
| 88 | +} |
| 89 | + |
| 90 | +unsigned char popElement(List* _list, void* store, const size_t sizeOfStore) { |
| 91 | + if ((*_list) == NULL) { |
| 92 | + return 0; |
| 93 | + } |
| 94 | + |
| 95 | + while ((*_list)->__next != NULL) { |
| 96 | + _list = &(*_list)->__next; |
| 97 | + } |
| 98 | + |
| 99 | + memcpy(store, (*_list)->__data, MIN(sizeOfStore, (*_list)->__sizeOfData)); |
| 100 | + free((*_list)->__data); |
| 101 | + free(*_list); |
| 102 | + *_list = NULL; |
| 103 | + |
| 104 | + return 1; |
| 105 | +} |
| 106 | + |
| 107 | +void randomSort(List* _list) { |
| 108 | + size_t length = 0; |
| 109 | + size_t index = 0; |
| 110 | + size_t rndIndex; |
| 111 | + |
| 112 | + void* auxPointer; |
| 113 | + size_t elementSize; |
| 114 | + |
| 115 | + List* head = _list; |
| 116 | + Node* helper; |
| 117 | + |
| 118 | + while ((*_list) != NULL) { |
| 119 | + length++; |
| 120 | + _list = &(*_list)->__next; |
| 121 | + } |
| 122 | + |
| 123 | + _list = head; |
| 124 | + |
| 125 | + while ((*_list) != NULL) { |
| 126 | + while ((rndIndex = (rand() % (length))) == index); |
| 127 | + helper = __getElementAt(head, rndIndex); |
| 128 | + auxPointer = (*_list)->__data; |
| 129 | + elementSize = (*_list)->__sizeOfData; |
| 130 | + |
| 131 | + (*_list)->__data = helper->__data; |
| 132 | + (*_list)->__sizeOfData = helper->__sizeOfData; |
| 133 | + |
| 134 | + helper->__data = auxPointer; |
| 135 | + helper->__sizeOfData = elementSize; |
| 136 | + |
| 137 | + _list = &(*_list)->__next; |
| 138 | + index++; |
| 139 | + } |
| 140 | +} |
0 commit comments