blob: a418ca99014427b30b3902df25406c2cbabb0ae3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
#ifndef foorlistfoo
#define foorlistfoo
/* $Id: rlist.h 872 2005-10-26 01:21:30Z lennart $ */
/***
This file is part of avahi.
avahi is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 2.1 of the
License, or (at your option) any later version.
avahi 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 Lesser General
Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with avahi; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA.
***/
/** \file rlist.h A simple linked list implementation */
#include "llist.h"
AVAHI_C_DECL_BEGIN
/** A doubly linked list type */
typedef struct AvahiRList AvahiRList;
/** A doubly linked list type */
struct AvahiRList {
AVAHI_LLIST_FIELDS(AvahiRList, rlist);
void *data;
};
/** Prepend a new item to the beginning of the list and return the new beginning */
AvahiRList* avahi_rlist_prepend(AvahiRList *r, void *data);
/** Remove the first occurence of the specified item from the list and return the new beginning */
AvahiRList* avahi_rlist_remove(AvahiRList *r, void *data);
/** Remove the specified item from the list and return the new beginning */
AvahiRList* avahi_rlist_remove_by_link(AvahiRList *r, AvahiRList *n);
AVAHI_C_DECL_END
#endif
|
