/* 
queue_test4.c 
Tests queue4.c

Jessica Cao
December 5, 2008
*/

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include "queue4.c"

int main ()
{
    queue q = bottom();
    printf("Length of queue is now %d.\n", length(q));

    printf("Printing an empty queue: ");
    print(q);
    printf("Retrieving front node of an empty queue: ");
    front(q);
    printf("Popping an empty queue: ");
    pop(q);

    printf("\n");

    element_rec e1 = {"a", 1};
    printf("Pushed {\"a\", 1} onto the queue.\n");
    push(&e1, q);
    print(q);

    printf("\n");

    element_rec e2 = {"b", 2};
    printf("Pushed {\"b\", 2} onto the queue.\n");
    push(&e2, q);
    print(q);

    printf("\n");
        
    element_rec e3 = {"c", 3};
    printf("Pushed {\"c\", 3} onto the queue.\n");
    push(&e3, q);
    print(q);

    printf("\n");

    printf("Front node is now {\"%s\", %d}.\n", (front(q))->data, (front(q))->id);
    printf("Length of queue is now %d.\n", length(q));

    printf("\n");

    pop(q);
    printf("Popped one node from queue.\n");
    print(q);

    printf("\n");

    pop(q);
    printf("Popped one node from queue.\n");
    print(q);

    printf("\n");

    pop(q);
    printf("Popped one node from queue.\n");
    print(q);

    printf("\n");
    printf("Length of queue is now %d.\n", length(q));

    return 0;
}