#ifndef XPLIST_H
#define XPLIST_H
#include "xp_core.h"
/* generic list structure
*/
struct _XP_List {
void * object;
struct _XP_List * next;
struct _XP_List * prev;
};
XP_BEGIN_PROTOS
extern XP_List * XP_ListNew (void);
extern void XP_ListDestroy (XP_List *list);
extern void XP_ListAddObject (XP_List *list, void *newObject);
extern void XP_ListAddObjectToEnd (XP_List *list, void *newObject);
extern void XP_ListInsertObject (XP_List *list, void *insert_before, void *newObject);
extern void XP_ListInsertObjectAfter (XP_List *list, void *insert_after, void *newObject);
/* returns the list node of the specified object if it was
* in the list
*/
extern XP_List * XP_ListFindObject (XP_List *list, void * obj);
extern Bool XP_ListRemoveObject (XP_List *list, void *oldObject);
extern void * XP_ListRemoveTopObject (XP_List *list);
extern void * XP_ListPeekTopObject (XP_List *list);
extern void * XP_ListRemoveEndObject (XP_List *list);
#define XP_ListIsEmpty(list) (list ? list->next == NULL : TRUE)
extern int XP_ListCount (XP_List *list);
#define XP_ListTopObject(list) (list && list->next ? list->next->object : NULL)
extern void * XP_ListGetEndObject (XP_List *list);
extern void * XP_ListGetObjectNum (XP_List *list, int num);
extern int XP_ListGetNumFromObject (XP_List *list, void * object);
/* move the top object to the bottom of the list
* this function is useful for reordering the list
* so that a round robin ordering can occur
*/
extern void XP_ListMoveTopToBottom (XP_List *list);
XP_END_PROTOS
/* traverse the list in order
*
* make a copy of the list pointer and point it at the list object head.
* the first call the XP_ListNextObject will return the first object
* and increment the copy of the list pointer. Subsequent calls
* will continue to increment the copy of the list pointer and return
* objects
*/
#define XP_ListNextObject(list) \
(list && ((list = list->next)!=0) ? list->object : NULL)
#endif /* XPLIST_H */