xlist.h

/*****************************************************************************
 * xlist.h : a simple doubly linked list in C (header file)
 *****************************************************************************
 * Copyright (C) 2003-2004 Commonwealth Scientific and Industrial Research
 *                         Organisation (CSIRO) Australia
 * Copyright (C) 2000-2004 the VideoLAN team
 *
 * $Id: xlist.h 11664 2005-07-09 06:17:09Z courmisch $
 *
 * Authors: Conrad Parker <[email protected]>
 *          Andre Pang <[email protected]>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111, USA.
 *****************************************************************************/


#ifndef __XLIST__
#define __XLIST__

typedef struct _XList XList;

struct _XList {
  XList * prev;
  XList * next;
  void * data;
};

typedef void * (*XCloneFunc) (void * data);

typedef void * (*XFreeFunc) (void * data);

XList * xlist_new (void);

XList * xlist_clone (XList * list);

XList * xlist_clone_with (XList * list, XCloneFunc clone);

XList * xlist_tail (XList * list);

XList * xlist_prepend (XList * list, void * data);

XList * xlist_append (XList * list, void * data);

XList * xlist_add_before (XList * list, void * data, XList * node);

XList * xlist_add_after (XList * list, void * data, XList * node);

XList * xlist_find (XList * list, void * data);

XList * xlist_remove (XList * list, XList * node);

int xlist_length (XList * list);

int xlist_is_empty (XList * list);

int xlist_is_singleton (XList * list);

XList * xlist_free_with (XList * list, XFreeFunc free_func);

XList * xlist_free (XList * list);

#endif /* __XLIST__ */

---