Tue, 23 Jul 2013 12:54:45 +0200
added ssize_t typedef for windows
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2013 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 * Double linked list implementation.
30 *
31 * @file list.h
32 * @author Mike Becker
33 * @author Olaf Wintermann
34 */
36 #ifndef UCX_LIST_H
37 #define UCX_LIST_H
39 #include "ucx.h"
40 #include "allocator.h"
42 #ifdef __cplusplus
43 extern "C" {
44 #endif
46 /**
47 * Loop statement for UCX lists.
48 *
49 * The first argument is a pointer to the list. In most cases this will be the
50 * pointer to the first element of the list, but it may also be an arbitrary
51 * element of the list. The iteration will then start with that element.
52 *
53 * The second argument is the name of the iteration variable. The scope of
54 * this variable is limited to the <code>UCX_FOREACH</code> statement.
55 *
56 * @param list The first element of the list
57 * @param elem The variable name of the element
58 */
59 #define UCX_FOREACH(elem,list) \
60 for (UcxList* elem = list ; elem != NULL ; elem = elem->next)
62 /**
63 * UCX list type
64 * @see UcxList
65 */
66 typedef struct UcxList UcxList;
67 struct UcxList {
68 /**
69 * List element payload.
70 */
71 void *data;
72 /**
73 * Pointer to the next list element or <code>NULL</code>, if this is the
74 * last element.
75 */
76 UcxList *next;
77 /**
78 * Pointer to the previous list element or <code>NULL</code>, if this is
79 * the first element.
80 */
81 UcxList *prev;
82 };
84 UcxList *ucx_list_clone(UcxList *list, copy_func cpyfnc, void* data);
85 UcxList *ucx_list_clone_a(UcxAllocator *allocator, UcxList *list,
86 copy_func cpyfnc, void* data);
88 /**
89 * Compares two UCX lists element-wise by using a compare function.
90 *
91 * Each element of the two specified lists are compared by using the specified
92 * compare function and the additional data. The type and content of this
93 * additional data depends on the cmp_func() used.
94 *
95 * If the list pointers denote elements within a list, the lists are compared
96 * starting with the denoted elements. Thus any previous elements are not taken
97 * into account. This might be useful to check, if certain list tails match
98 * each other.
99 *
100 * @param list1 the first list
101 * @param list2 the second list
102 * @param cmpfnc the compare function
103 * @param data additional data for the compare function
104 * @return 1, if and only if the two lists equal element-wise, 0 otherwise
105 */
106 int ucx_list_equals(const UcxList *list1, const UcxList *list2,
107 cmp_func cmpfnc, void* data);
109 /**
110 * Destroys the entire list.
111 *
112 * The members of the list are not automatically freed, so ensure they are
113 * otherwise referenced or a memory leak will occur.
114 *
115 * <b>Caution:</b> the argument <b>MUST</b> denote an entire list (i.e. a call
116 * to ucx_list_first() on the argument must return the argument itself)
117 *
118 * @param list The list to free.
119 */
120 void ucx_list_free(UcxList *list);
121 void ucx_list_free_a(UcxAllocator *allocator, UcxList *list);
122 UcxList *ucx_list_append(UcxList *list, void *data);
123 UcxList *ucx_list_append_a(UcxAllocator *allocator, UcxList *list, void *data);
124 UcxList *ucx_list_prepend(UcxList *list, void *data);
125 UcxList *ucx_list_prepend_a(UcxAllocator *allocator, UcxList *list, void *data);
126 UcxList *ucx_list_concat(UcxList *list1, UcxList *list2);
127 /**
128 * Returns the first element of a list.
129 *
130 * If the argument is the list pointer, it is directly returned. Otherwise
131 * this function traverses to the first element of the list and returns the
132 * list pointer.
133 *
134 * @param elem one element of the list
135 * @return the first element of the list, the specified element is a member of
136 */
137 UcxList *ucx_list_first(const UcxList *elem);
138 /**
139 * Returns the last element of a list.
140 *
141 * If the argument has no successor, it is the last element and therefore
142 * directly returned. Otherwise this function traverses to the last element of
143 * the list and returns it.
144 *
145 * @param elem one element of the list
146 * @return the last element of the list, the specified element is a member of
147 */
148 UcxList *ucx_list_last(const UcxList *elem);
149 UcxList *ucx_list_get(const UcxList *list, int index);
150 ssize_t ucx_list_indexof(const UcxList *list, const UcxList *elem);
151 size_t ucx_list_size(const UcxList *list);
152 ssize_t ucx_list_find(UcxList *list, void *elem, cmp_func cmpfnc, void *data);
153 int ucx_list_contains(UcxList *list, void *elem, cmp_func cmpfnc, void *data);
155 UcxList *ucx_list_sort(UcxList *list, cmp_func cmpfnc, void *data);
157 /**
158 * Removes an element from the list.
159 *
160 * If the first element is removed, the list pointer changes. So it is
161 * <i>highly recommended</i> to <i>always</i> update the pointer by calling
162 * <code>mylist = ucx_list_remove(mylist, myelem);</code>.
163 *
164 * @param list the list from which the element shall be removed
165 * @param element the element to removed
166 * @return returns the updated list pointer or <code>NULL</code>, if the list
167 * is now empty
168 */
169 UcxList *ucx_list_remove(UcxList *list, UcxList *element);
170 UcxList *ucx_list_remove_a(UcxAllocator *allocator, UcxList *list,
171 UcxList *element);
173 #ifdef __cplusplus
174 }
175 #endif
177 #endif /* UCX_LIST_H */