src/server/list.h

changeset 14
b8bf95b39952
parent 13
1fdbf4170ef4
child 15
cff9c4101dd7
equal deleted inserted replaced
13:1fdbf4170ef4 14:b8bf95b39952
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2011 Olaf Wintermann. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 */
28
29 #ifndef LIST_H
30 #define LIST_H
31
32 #ifdef __cplusplus
33 extern "C" {
34 #endif
35
36 typedef struct _util_slist sdlist_t;
37
38 struct _util_slist {
39 void *data;
40 sdlist_t *next;
41 };
42
43 typedef int (*sdlist_iterator_func)(sdlist_t*, void*);
44
45
46 /* single linked list */
47
48 /*
49 * sdlist_add/sdllist_addl
50 *
51 * append to the end of the list one element
52 */
53 sdlist_t* sdlist_add(sdlist_t *list, void *data);
54 sdlist_t* sdlist_addl(sdlist_t *list, sdlist_t *l);
55
56 /*
57 * sdlist_remove/sdlist_removei
58 *
59 * remove one element from the list and free the sdlist_t object
60 * returns the first element of the new list
61 */
62 sdlist_t* sdlist_remove(sdlist_t *list, void *data);
63 sdlist_t* sdlist_removei(sdlist_t *list, int index);
64
65 /*
66 * sdlist_removel
67 *
68 * remove element l from the list
69 * returns the first element of the new list
70 */
71 sdlist_t* sdlist_removel(sdlist_t *list, sdlist_t *l);
72
73 /*
74 * removes one element from the list
75 *
76 * list: list
77 * prev: previous to elm
78 * elm: element which should be removed
79 *
80 * returns the first element of the new list
81 */
82 sdlist_t *sdlist_remove_elm(sdlist_t *list, sdlist_t *prev, sdlist_t *elm);
83
84
85 /*
86 * sdlist_insert
87 *
88 * insert one element after the element elm
89 */
90 void sdlist_insert(sdlist_t *elm, void *data);
91 void sdlist_insertl(sdlist_t *elm, sdlist_t *l);
92
93 sdlist_t* sdlist_get(sdlist_t *list, void *data);
94 sdlist_t* sdlist_geti(sdlist_t *list, int index);
95 sdlist_t* sdlist_getlast(sdlist_t *list);
96
97 size_t sdlist_length(sdlist_t *list);
98 void sdlist_free(sdlist_t *elm);
99 void sdlist_foreach(sdlist_t *list, sdlist_iterator_func f, void *data);
100
101 #ifdef __cplusplus
102 }
103 #endif
104
105 #endif /* LIST_H */
106

mercurial