hammy
/
C-Dynamic-List
mirror of https://github.com/sgoudham/C-Dynamic-List.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Upload Current Work So Far

Browse Source
main
sgoudham 3 years ago
parent a61b8bfab9
commit 14b2c10a2e
2 changed files with 308 additions and 0 deletions
Show Stats Download Patch File Download Diff File

227
src/list.c
Unescape Escape View File

@ -0,0 +1,227 @@
#include "list.h"
#include "pthread.h"
/*
* -- ERROR CODES --
*
* [ERRNO 2147483646] -> Cannot Allocate Memory To Backing Array
* [ERRNO 2167483645] -> Cannot Reallocate Memory To Backing Array
* [ERRNO 2147483644] -> Index Out Of Bounds For Retrieving Element
* [ERRNO 2147483643] -> Values 2147483646 -> 2147483642 Cannot Be Inserted Into List
* [ERRNO 2147483642] -> Element Does Not Exist Within List
*/
List *List_createList(int maxSize, int currentSize);
int List_merge(List *list, int start_index, int mid_index, int end_index);
int List_mergeSort(List *list, int start_index, int end_index);
typedef struct list {
int *_array;
int _currentSize;
int _maxSize;
} List;
int errorCodes[ERRNO_SIZE] = {
ERRNO_001,
ERRNO_002,
ERRNO_003,
ERRNO_004,
ERRNO_005
};
List *newList() {
return List_createList(10, -1);
}
int List_get(List *list, int index) {
if (index < 0 || index > list->_currentSize) {
return ERRNO_003;
}
return list->_array[index];
}
int List_append(List *list, int element) {
for (int i = 0; i < ERRNO_SIZE; i++) {
if (element == errorCodes[i]) {
return ERRNO_004;
}
}
if (list->_currentSize + 1 == list->_maxSize) {
list->_maxSize *= 2;
int *temp = realloc(list->_array, list->_maxSize * sizeof(int));
if (!temp) {
return ERRNO_002;
}
list->_array = temp;
}
list->_array[++list->_currentSize] = element;
return 0;
}
int List_insert(List *list, int index, int element) {
if (index < 0 || index > list->_currentSize) {
return ERRNO_003;
}
int previous_element = list->_array[index];
list->_array[index] = element;
return previous_element;
}
int List_remove(List *list, int element) {
int positionToDelete = -1;
for (int i = 0; i < list->_currentSize + 1; i++) {
if (list->_array[i] == element) {
positionToDelete = i;
}
}
if (positionToDelete == -1) {
return ERRNO_005;
}
for (int i = positionToDelete; i < list->_currentSize + 1; i++) {
list->_array[i] = list->_array[i + 1];
}
list->_currentSize--;
return 0;
}
int List_merge(List *list, int start_index, int mid_index, int end_index) {
List *left = List_slice(list, start_index, mid_index + 1);
if (!left) {
return 1;
}
List *right = List_slice(list, mid_index + 1, end_index + 1);
if (!right) {
return 1;
}
int leftSuccessCode = List_append(left, INT_MAX);
if (leftSuccessCode != 0) {
return 1;
}
int rightSuccessCode = List_append(right, INT_MAX);
if (rightSuccessCode != 0) {
return 1;
}
int left_index = 0;
int right_index = 0;
for (int i = start_index; i < end_index + 1; i++) {
if (left->_array[left_index] < right->_array[right_index]) {
list->_array[i] = left->_array[left_index];
left_index++;
} else {
list->_array[i] = right->_array[right_index];
right_index++;
}
}
List_destroy(&left);
List_destroy(&right);
return 0;
}
int List_mergeSort(List *list, int start_index, int end_index) {
if (start_index < end_index) {
int mid_index = (start_index + end_index) / 2;
if (List_mergeSort(list, start_index, mid_index) != 0) {
return 1;
}
if (List_mergeSort(list, mid_index + 1, end_index) != 0) {
return 1;
}
if (List_merge(list, start_index, mid_index, end_index) != 0) {
return 1;
}
}
return 0;
}
int List_sort(List *list) {
return List_mergeSort(list, 0, list->_currentSize);
}
List *List_copy(List *list) {
List *listCopy = List_createList(list->_maxSize, list->_currentSize);
if (!listCopy) {
return NULL;
}
for (int i = 0; i < list->_currentSize + 1; i++) {
listCopy->_array[i] = list->_array[i];
}
return listCopy;
}
List *List_slice(List *list, int start_index, int end_index) {
if (start_index >= end_index) {
return NULL;
}
int slicedCurrentSize = end_index - start_index;
int slicedMaxSize = slicedCurrentSize * 2;
List *slicedList = List_createList(slicedMaxSize, slicedCurrentSize - 1);
if (!slicedList) {
return NULL;
}
int i = 0;
for (int j = start_index; j < end_index; j++) {
slicedList->_array[i] = list->_array[j];
i++;
}
return slicedList;
}
int List_length(List *list) {
return list->_currentSize + 1;
}
void List_print(List *list) {
printf("[");
for (int i = 0; i < list->_currentSize + 1; i++) {
if (i == list->_currentSize) {
printf("%i", list->_array[i]);
} else {
printf("%i, ", list->_array[i]);
}
}
printf("]");
}
void List_destroy(List **list) {
free((*list)->_array);
(*list)->_array = NULL;
free(*list);
*list = NULL;
}
List *List_createList(int maxSize, int currentSize) {
List *list = malloc(sizeof(List));
if (!list) {
return NULL;
}
list->_array = calloc(maxSize, sizeof(int));
if (!list->_array) {
free(list);
return NULL;
}
list->_maxSize = maxSize;
list->_currentSize = currentSize;
return list;
}

81
src/list.h
Unescape Escape View File

@ -0,0 +1,81 @@
#include "stdlib.h"
#include "stdio.h"
#define INT_MAX 2147483647
#define ERRNO_001 2147483646
#define ERRNO_002 2147483645
#define ERRNO_003 2147483644
#define ERRNO_004 2147483643
#define ERRNO_005 2147483642
#define ERRNO_SIZE 5
typedef struct list List;
List *newList();
/*
* Function: List_get
* ----------------------------
* Retrieve an element from the list at the given index
*
* *list: the list to append onto
* index: the index of the list to retrieve
*
* returns: int
*/
int List_get(List *list, int index);
/*
* Function: List_append
* ----------------------------
* Appends an element onto the end of the list
*
* *list: the list to append onto
* element: the element to insert into the list
*
* returns: int
*/
int List_append(List *list, int element);
/*
* Function: List_insert
* ----------------------------
* Inserts the given element into a valid index of the list
*
* *list: the list to append onto
* index: the index to insert the given value
* element: the element to insert into the list
*
* returns: int
*/
int List_insert(List *list, int index, int element);
/*
* Function: List_remove
* ----------------------------
* Appends an element onto the end of the list
*
* *list: the list to append onto
* element: the element to insert into the list
*
* returns: int
*/
int List_remove(List *list, int element);
// TODO
int List_sort(List *list);
// TODO
List *List_copy(List *list);
// TODO
List *List_slice(List *list, int start_index, int end_index);
// TODO
int List_length(List *list);
// TODO
void List_print(List *list);
// TODO
void List_destroy(List **list);
Write Preview
Loading…
Cancel
Save