///////////////////////////////////////////////////////////////////////////////
// Date:     Sat Oct 13 19:31:06 CDT 2007
// Author:   John Quigley <jquigley@jquigley.com>
// Revision: $Id$
///////////////////////////////////////////////////////////////////////////////

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

#include "util.h"
#include "list.h"
#include "stdio.h"

int main(int argc, char **argv)
{
    List *l = List_new();

    // Test populating list with append()
    for (int i = 0; i < 10; i++)
    {
        int *num;
        num = (int *)malloc(sizeof(int));
        *num = i;

        List_append(l, num);
    }

    // Test valid index
    printf("lst[5] = %d\n", List_getIndex(l, 5));
    printf("--------------------\n");

    // Test invalid index
    int *data;
    data = List_getIndex(l, 200);

    if (data != NULL)
    {
        printf("!!!ERROR!!! lst[200] unexpectedly returned a non-NULL value\n");
    }

    // Test iteration
    int i = 0;
    List_resetIteration(l);
    while((data = List_iterate(l)) != NULL)
    {
        printf("lst[%d] = %d\n", i, *data);
        fflush(NULL);
        // NOTE: simulateneously cleaning up the list nodes
        free(data);
        data = NULL;
        i++;
    }

    // Test list delete()
    List_delete(l);
    l = NULL;

    return EXIT_SUCCESS;
}

// EOF