/**
@file main.cpp
*/


/*! \mainpage Lab Book 3
 *
 * Implementation of a Double Linked List
 */

// Define and includes to show memory leak report
#define _CRTDBG_MAP_ALLOC
#include <stdlib.h>
#include <crtdbg.h>
#include <string>
#include <iostream>

#include "doubleLinkedList.h"

struct node {
        string data;
        node* next;
        node* prev;
};

void PrintForward(node* front);

int main() /** Entry point for the application */
{
    //DoubleLinkedList myList;


    node* front;
    node* back;
    node* pointer;



    pointer = new node;
    pointer->data = "This";
    pointer->prev = nullptr;
    front = pointer;
    back = pointer;

    pointer = new node;
    pointer->data = "is";
    pointer->prev = back;
    back->next = pointer;
    back = pointer;

    pointer = new node;
    pointer->data = "shit";
    pointer->prev = back;
    back->next = pointer;
    back = pointer;

    pointer = new node;
    pointer->data = "code.";
    pointer->prev = back;
    back->next = pointer;
    back = pointer;

    back->next = nullptr;

    PrintForward(front);



    _CrtDumpMemoryLeaks(); // Look in the output window for a report
    system("pause");
}


void PrintForward(node* front)
{
    node* tempFront = front;

    while (tempFront != nullptr)
    {

        cout << tempFront->data << " ";
        tempFront = tempFront->next;
    }
    cout << endl;
}