list.h

/*
 * Copyright 2003, 2004 Ian Searle. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following
 * conditions are met:  
 *
 * 1: Redistributions of source code must retain the above
 * copyright notice, this list of conditions and the following
 * disclaimer. 
 *
 * 2: Redistributions in binary form must reproduce the above
 * copyright notice, this list of conditions and the following
 * disclaimer in the documentation and/or other materials
 * provided with the distribution. 
 *
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY  EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL IAN SEARLE OR CONTRIBUTORS
 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE. 
 *
 */

#ifndef  LIST_H
#define  LIST_H

#include "listnode.h"
#include <stdio.h>

typedef struct _list List;

struct _list
{
  int numNodes;                 
  ListNode *firstNode;          
  ListNode *lastNode;           
};

void list_Init(void *(*list_allocate)(size_t), void (*list_deallocate)(void *));

extern List *list_Create (void);
extern void list_Destroy (List *);
extern void list_DestroyAllNodes (List *);
extern int list_DestroyNodeByPos (List *, int);
extern int list_DestroyNodeByAddr (List *, ListNode *);
extern List *list_Copy (List *list, void *(*copy)(void *));

extern ListNode *list_InsertNode (List *, ListNode *, int);

extern ListNode *list_EnqueueNode (List *, ListNode *);
extern ListNode *list_DequeueNode (List *);

extern ListNode *list_PushNode (List *, ListNode *);
extern ListNode *list_PopNode (List *);

extern ListNode *list_DetachNodeByPos (List *, int);
extern ListNode *list_DetachNodeByAddr (List *, ListNode *);

extern ListNode *list_GetNodeByPos (List *, int);
extern void *list_GetNodeDataByPos (List *, int);

extern void list_PrintToFile (List *, FILE *);
extern int list_IsPosValid (List *, int);

extern ListNode *list_GetLastNode (List *);
extern ListNode *list_GetFirstNode (List *);

#define list_GetNumNodes(list)  (((List *)(list))->numNodes)

#endif /* LIST_H */

---