Eduardo Nava / Mbed 2 deprecated MazeRunner_Fall2017-shell

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 ECE 2035 TA

doublely_linked_list.cpp

Committer:
rconnorlawson
Date:
2017-11-03
Revision:
0:cf4396614a79
Child:
1:2c6ae0fe9a2a

File content as of revision 0:cf4396614a79:

#include <stdlib.h>
#include <stdio.h>
#include "doublely_linked_list.h"

DLinkedList* create_dlinkedlist(void) {
    DLinkedList* newList = (DLinkedList*)malloc(sizeof(DLinkedList));
    newList->head = NULL;
    newList->tail = NULL;
    newList->current = NULL;
    newList->size = 0;
    return newList;
}

LLNode* create_llnode(void* data) {

    // Your code here
    return NULL;

}


void insertHead(DLinkedList* dLinkedList, void* data){
  LLNode* newNode = create_llnode(data);
  if(dLinkedList->head == NULL){
    dLinkedList->size++;
    dLinkedList->head = newNode;
    dLinkedList->tail = newNode;
  }else{
    dLinkedList->size++;
    newNode->next = dLinkedList->head;
    (dLinkedList->head)->previous = newNode;
    dLinkedList->head = newNode;
  }
}


void insertTail(DLinkedList* dLinkedList, void* data){

    // Your code here

}

int insertAfter(DLinkedList* dLinkedList, void* newData){

    // Your code here
    return 0;

}

int insertBefore(DLinkedList* dLinkedList, void* newData){

    // Your code here
    return 0;

}


void* deleteBackward(DLinkedList* dLinkedList){

    //Your code here.
    return NULL;

}



void* deleteForward(DLinkedList* dLinkedList){

    //Your code here.
    return NULL;

}


void* removeBackward(DLinkedList* dLinkedList){

    //Your code here.
    return NULL;

}

void* removeForward(DLinkedList* dLinkedList){

    //Your code here.
    return NULL;

}


void destroyList(DLinkedList* dLinkedList){
  if(dLinkedList->head != NULL){
    getHead(dLinkedList);
    while(deleteForward(dLinkedList)){};
  }
  free(dLinkedList);
}


void* getHead(DLinkedList* dLinkedList){

    //Your code here.
    return NULL;

}



void* getTail(DLinkedList* dLinkedList){

    //Your code here.

    return NULL;
}



void* getCurrent(DLinkedList* dLinkedList){

    //Your code here.
    return NULL;

}



void* getNext(DLinkedList* dLinkedList){

    //Your code here.

    return NULL;
}



void* getPrevious(DLinkedList* dLinkedList){

    //Your code here.

    return NULL;
}


int getSize(DLinkedList* dLinkedList){

    //Your code here.
    return 0;

}