Eduardo Nava / Mbed 2 deprecated MazeRunner_Fall2017

Important changes to repositories hosted on mbed.com

Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.

To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.

It is also possible to export all your personal repositories from the account settings page.

Dependencies:   4DGL-uLCD-SE mbed wave_player

Fork of MazeRunner_Fall2017-shell by Eduardo Nava

doublely_linked_list.cpp@2:c18c231cb299, 2017-11-08 (annotated)

Committer:
rconnorlawson
Date:
Wed Nov 08 21:01:43 2017 +0000
Revision:
2:c18c231cb299
Parent:
0:cf4396614a79
Child:
1:2c6ae0fe9a2a
Fix delta computation in physics update.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
rconnorlawson 0:cf4396614a79 1 #include <stdlib.h>
rconnorlawson 0:cf4396614a79 2 #include <stdio.h>
rconnorlawson 0:cf4396614a79 3 #include "doublely_linked_list.h"
rconnorlawson 0:cf4396614a79 4
rconnorlawson 0:cf4396614a79 5 DLinkedList* create_dlinkedlist(void) {
rconnorlawson 0:cf4396614a79 6 DLinkedList* newList = (DLinkedList*)malloc(sizeof(DLinkedList));
rconnorlawson 0:cf4396614a79 7 newList->head = NULL;
rconnorlawson 0:cf4396614a79 8 newList->tail = NULL;
rconnorlawson 0:cf4396614a79 9 newList->current = NULL;
rconnorlawson 0:cf4396614a79 10 newList->size = 0;
rconnorlawson 0:cf4396614a79 11 return newList;
rconnorlawson 0:cf4396614a79 12 }
rconnorlawson 0:cf4396614a79 13
rconnorlawson 0:cf4396614a79 14 LLNode* create_llnode(void* data) {
rconnorlawson 0:cf4396614a79 15
rconnorlawson 0:cf4396614a79 16 // Your code here
rconnorlawson 0:cf4396614a79 17 return NULL;
rconnorlawson 0:cf4396614a79 18
rconnorlawson 0:cf4396614a79 19 }
rconnorlawson 0:cf4396614a79 20
rconnorlawson 0:cf4396614a79 21
rconnorlawson 0:cf4396614a79 22 void insertHead(DLinkedList* dLinkedList, void* data){
rconnorlawson 0:cf4396614a79 23 LLNode* newNode = create_llnode(data);
rconnorlawson 0:cf4396614a79 24 if(dLinkedList->head == NULL){
rconnorlawson 0:cf4396614a79 25 dLinkedList->size++;
rconnorlawson 0:cf4396614a79 26 dLinkedList->head = newNode;
rconnorlawson 0:cf4396614a79 27 dLinkedList->tail = newNode;
rconnorlawson 0:cf4396614a79 28 }else{
rconnorlawson 0:cf4396614a79 29 dLinkedList->size++;
rconnorlawson 0:cf4396614a79 30 newNode->next = dLinkedList->head;
rconnorlawson 0:cf4396614a79 31 (dLinkedList->head)->previous = newNode;
rconnorlawson 0:cf4396614a79 32 dLinkedList->head = newNode;
rconnorlawson 0:cf4396614a79 33 }
rconnorlawson 0:cf4396614a79 34 }
rconnorlawson 0:cf4396614a79 35
rconnorlawson 0:cf4396614a79 36
rconnorlawson 0:cf4396614a79 37 void insertTail(DLinkedList* dLinkedList, void* data){
rconnorlawson 0:cf4396614a79 38
rconnorlawson 0:cf4396614a79 39 // Your code here
rconnorlawson 0:cf4396614a79 40
rconnorlawson 0:cf4396614a79 41 }
rconnorlawson 0:cf4396614a79 42
rconnorlawson 0:cf4396614a79 43 int insertAfter(DLinkedList* dLinkedList, void* newData){
rconnorlawson 0:cf4396614a79 44
rconnorlawson 0:cf4396614a79 45 // Your code here
rconnorlawson 0:cf4396614a79 46 return 0;
rconnorlawson 0:cf4396614a79 47
rconnorlawson 0:cf4396614a79 48 }
rconnorlawson 0:cf4396614a79 49
rconnorlawson 0:cf4396614a79 50 int insertBefore(DLinkedList* dLinkedList, void* newData){
rconnorlawson 0:cf4396614a79 51
rconnorlawson 0:cf4396614a79 52 // Your code here
rconnorlawson 0:cf4396614a79 53 return 0;
rconnorlawson 0:cf4396614a79 54
rconnorlawson 0:cf4396614a79 55 }
rconnorlawson 0:cf4396614a79 56
rconnorlawson 0:cf4396614a79 57
rconnorlawson 0:cf4396614a79 58 void* deleteBackward(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 59
rconnorlawson 0:cf4396614a79 60 //Your code here.
rconnorlawson 0:cf4396614a79 61 return NULL;
rconnorlawson 0:cf4396614a79 62
rconnorlawson 0:cf4396614a79 63 }
rconnorlawson 0:cf4396614a79 64
rconnorlawson 0:cf4396614a79 65
rconnorlawson 0:cf4396614a79 66
rconnorlawson 0:cf4396614a79 67 void* deleteForward(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 68
rconnorlawson 0:cf4396614a79 69 //Your code here.
rconnorlawson 0:cf4396614a79 70 return NULL;
rconnorlawson 0:cf4396614a79 71
rconnorlawson 0:cf4396614a79 72 }
rconnorlawson 0:cf4396614a79 73
rconnorlawson 0:cf4396614a79 74
rconnorlawson 0:cf4396614a79 75 void* removeBackward(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 76
rconnorlawson 0:cf4396614a79 77 //Your code here.
rconnorlawson 0:cf4396614a79 78 return NULL;
rconnorlawson 0:cf4396614a79 79
rconnorlawson 0:cf4396614a79 80 }
rconnorlawson 0:cf4396614a79 81
rconnorlawson 0:cf4396614a79 82 void* removeForward(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 83
rconnorlawson 0:cf4396614a79 84 //Your code here.
rconnorlawson 0:cf4396614a79 85 return NULL;
rconnorlawson 0:cf4396614a79 86
rconnorlawson 0:cf4396614a79 87 }
rconnorlawson 0:cf4396614a79 88
rconnorlawson 0:cf4396614a79 89
rconnorlawson 0:cf4396614a79 90 void destroyList(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 91 if(dLinkedList->head != NULL){
rconnorlawson 0:cf4396614a79 92 getHead(dLinkedList);
rconnorlawson 0:cf4396614a79 93 while(deleteForward(dLinkedList)){};
rconnorlawson 0:cf4396614a79 94 }
rconnorlawson 0:cf4396614a79 95 free(dLinkedList);
rconnorlawson 0:cf4396614a79 96 }
rconnorlawson 0:cf4396614a79 97
rconnorlawson 0:cf4396614a79 98
rconnorlawson 0:cf4396614a79 99 void* getHead(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 100
rconnorlawson 0:cf4396614a79 101 //Your code here.
rconnorlawson 0:cf4396614a79 102 return NULL;
rconnorlawson 0:cf4396614a79 103
rconnorlawson 0:cf4396614a79 104 }
rconnorlawson 0:cf4396614a79 105
rconnorlawson 0:cf4396614a79 106
rconnorlawson 0:cf4396614a79 107
rconnorlawson 0:cf4396614a79 108 void* getTail(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 109
rconnorlawson 0:cf4396614a79 110 //Your code here.
rconnorlawson 0:cf4396614a79 111
rconnorlawson 0:cf4396614a79 112 return NULL;
rconnorlawson 0:cf4396614a79 113 }
rconnorlawson 0:cf4396614a79 114
rconnorlawson 0:cf4396614a79 115
rconnorlawson 0:cf4396614a79 116
rconnorlawson 0:cf4396614a79 117 void* getCurrent(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 118
rconnorlawson 0:cf4396614a79 119 //Your code here.
rconnorlawson 0:cf4396614a79 120 return NULL;
rconnorlawson 0:cf4396614a79 121
rconnorlawson 0:cf4396614a79 122 }
rconnorlawson 0:cf4396614a79 123
rconnorlawson 0:cf4396614a79 124
rconnorlawson 0:cf4396614a79 125
rconnorlawson 0:cf4396614a79 126 void* getNext(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 127
rconnorlawson 0:cf4396614a79 128 //Your code here.
rconnorlawson 0:cf4396614a79 129
rconnorlawson 0:cf4396614a79 130 return NULL;
rconnorlawson 0:cf4396614a79 131 }
rconnorlawson 0:cf4396614a79 132
rconnorlawson 0:cf4396614a79 133
rconnorlawson 0:cf4396614a79 134
rconnorlawson 0:cf4396614a79 135 void* getPrevious(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 136
rconnorlawson 0:cf4396614a79 137 //Your code here.
rconnorlawson 0:cf4396614a79 138
rconnorlawson 0:cf4396614a79 139 return NULL;
rconnorlawson 0:cf4396614a79 140 }
rconnorlawson 0:cf4396614a79 141
rconnorlawson 0:cf4396614a79 142
rconnorlawson 0:cf4396614a79 143 int getSize(DLinkedList* dLinkedList){
rconnorlawson 0:cf4396614a79 144
rconnorlawson 0:cf4396614a79 145 //Your code here.
rconnorlawson 0:cf4396614a79 146 return 0;
rconnorlawson 0:cf4396614a79 147
rconnorlawson 0:cf4396614a79 148 }