libg722_1 0.1.0
slist.h
1/* slist.h -- generalised singly linked lists
2
3 Copyright (C) 2000, 2004, 2009, 2011-2019, 2021-2024 Free Software
4 Foundation, Inc.
5 Written by Gary V. Vaughan, 2000
6
7 NOTE: The canonical source of this file is maintained with the
8 GNU Libtool package. Report bugs to bug-libtool@gnu.org.
9
10GNU Libltdl is free software; you can redistribute it and/or
11modify it under the terms of the GNU Lesser General Public
12License as published by the Free Software Foundation; either
13version 2 of the License, or (at your option) any later version.
14
15As a special exception to the GNU Lesser General Public License,
16if you distribute this file as part of a program or library that
17is built using GNU Libtool, you may include this file under the
18same distribution terms that you use for the rest of that program.
19
20GNU Libltdl is distributed in the hope that it will be useful,
21but WITHOUT ANY WARRANTY; without even the implied warranty of
22MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23GNU Lesser General Public License for more details.
24
25You should have received a copy of the GNU Lesser General Public
26License along with GNU Libltdl. If not, see <https://www.gnu.org/licenses/>.
27*/
28
29/* A generalised list. This is deliberately transparent so that you
30 can make the NEXT field of all your chained data structures first,
31 and then cast them to '(SList *)' so that they can be manipulated
32 by this API.
33
34 Alternatively, you can generate raw SList elements using slist_new(),
35 and put the element data in the USERDATA field. Either way you
36 get to manage the memory involved by yourself.
37*/
38
39#if !defined SLIST_H
40#define SLIST_H 1
41
42#if defined LTDL
43# include <libltdl/lt__glibc.h>
44# include <libltdl/lt_system.h>
45#else
46# define LT_SCOPE
47#endif
48
49#include <stddef.h>
50
51#if defined __cplusplus
52extern "C" {
53#endif
54
55typedef struct slist {
56 struct slist *next; /* chain forward pointer*/
57 const void *userdata; /* for boxed 'SList' item */
58} SList;
59
60typedef void * SListCallback (SList *item, void *userdata);
61typedef int SListCompare (const SList *item1, const SList *item2,
62 void *userdata);
63
64LT_SCOPE SList *slist_concat (SList *head, SList *tail);
65LT_SCOPE SList *slist_cons (SList *item, SList *slist);
66
67LT_SCOPE SList *slist_delete (SList *slist, void (*delete_fct) (void *item));
68LT_SCOPE SList *slist_remove (SList **phead, SListCallback *find,
69 void *matchdata);
70LT_SCOPE SList *slist_reverse (SList *slist);
71LT_SCOPE SList *slist_sort (SList *slist, SListCompare *compare,
72 void *userdata);
73
74LT_SCOPE SList *slist_tail (SList *slist);
75LT_SCOPE SList *slist_nth (SList *slist, size_t n);
76LT_SCOPE void * slist_find (SList *slist, SListCallback *find,
77 void *matchdata);
78LT_SCOPE size_t slist_length (SList *slist);
79
80LT_SCOPE void * slist_foreach (SList *slist, SListCallback *foreach,
81 void *userdata);
82
83LT_SCOPE SList *slist_box (const void *userdata);
84LT_SCOPE void * slist_unbox (SList *item);
85
86#if defined __cplusplus
87}
88#endif
89
90#if !defined LTDL
91# undef LT_SCOPE
92#endif
93
94#endif /*!defined SLIST_H*/
Definition slist.h:55