Week 6 : DLL.h

#include <iostream>
#define first(L) L.first
#define last(L) L.last
#define next(P) P->next
#define prev(P) P->prev
#define info(P) P->info

using namespace std;

struct history {
    string title;
    string url;
    string timestamp;
    int visitcount;
};

typedef history infotype;
struct ElmtMsk;
typedef ElmtMsk* address;

struct ElmtMsk {
    infotype info;
    address next;
    address prev;
};

struct List {
    address first;
    address last;
};

void createList(List &L);
address createElemen(infotype dataBaru);
void insertLast(List &L,address P);
void insertAfter(List &L,address &Prec,address &P);
void deleteFirst(List &L, address &P);
void deleteLast(List &L,address &P);
void deleteAfter(List &L,address &Prec,address &P);
void printList(List L);

void insertFirst(List &L,address P);
void insertAscending(List &L,infotype dataBaru);
bool findElemen(List L,string X);
int moreThanOnce(List L);