mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2024-11-11 15:51:36 +00:00
66 lines
2.1 KiB
C
66 lines
2.1 KiB
C
|
/*
|
||
|
|
llist.h
|
||
|
|
|
||
|
|
Linked list functions
|
||
|
|
|
||
|
|
Copyright (C) 2003 Brian Koropoff
|
||
|
|
|
||
|
|
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:
|
||
|
|
|
||
|
|
Free Software Foundation, Inc.
|
||
|
|
59 Temple Place - Suite 330
|
||
|
|
Boston, MA 02111-1307, USA
|
||
|
|
|
||
|
|
$Id$
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef _LLIST_H
|
||
|
|
#define _LLIST_H
|
||
|
|
|
||
|
|
#include "QF/qtypes.h"
|
||
|
|
|
||
|
|
typedef struct llist_node_s {
|
||
|
|
struct llist_s *parent;
|
||
|
|
struct llist_node_s *prev, *next;
|
||
|
|
void *data;
|
||
|
|
} llist_node_t;
|
||
|
|
|
||
|
|
typedef struct llist_s {
|
||
|
|
struct llist_node_s *start, *end, *iter;
|
||
|
|
void (*freedata)(void *element, void *userdata);
|
||
|
|
qboolean (*cmpdata)(const void *element, const void *comparison, void *userdata);
|
||
|
|
void *userdata;
|
||
|
|
} llist_t;
|
||
|
|
|
||
|
|
typedef qboolean (*llist_iterator_t)(void *element, llist_node_t *node);
|
||
|
|
|
||
|
|
#define LLIST_ICAST(x) (llist_iterator_t)(x)
|
||
|
|
#define LLIST_DATA(node, type) ((type *)((node)->data))
|
||
|
|
|
||
|
|
llist_t *llist_new (void (*freedata)(void *element, void *userdata), qboolean (*cmpdata)(const void *element, const void *comparison, void *userdata), void *userdata);
|
||
|
|
void llist_flush (llist_t *list);
|
||
|
|
void llist_delete (llist_t *list);
|
||
|
|
llist_node_t *llist_append (llist_t *list, void *element);
|
||
|
|
llist_node_t *llist_prefix (llist_t *list, void *element);
|
||
|
|
llist_node_t *llist_getnode (llist_t *list, void *element);
|
||
|
|
llist_node_t *llist_insertafter (llist_node_t *ref, void *element);
|
||
|
|
llist_node_t *llist_insertbefore (llist_node_t *ref, void *element);
|
||
|
|
void *llist_remove (llist_node_t *ref);
|
||
|
|
void llist_iterate (llist_t *list, llist_iterator_t iterate);
|
||
|
|
void *llist_find (llist_t *list, void *comparison);
|
||
|
|
llist_node_t *llist_findnode (llist_t *list, void *comparison);
|
||
|
|
|
||
|
|
#endif
|