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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
* libEtPan! -- a mail stuff library
*
* clist - Implements simple generic double-linked pointer lists
*
* Copyright (c) 1999-2005, Gaël Roualland <gael.roualland@iname.com>
* interface changes - 2005 - DINH Viet Hoa
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the libEtPan! project nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* $Id$
*/
#ifndef CLIST_H
#define CLIST_H
#ifdef __cplusplus
extern "C" {
#endif
typedef struct clistcell_s {
void * data;
struct clistcell_s * previous;
struct clistcell_s * next;
} clistcell;
struct clist_s {
clistcell * first;
clistcell * last;
int count;
};
typedef struct clist_s clist;
typedef clistcell clistiter;
/* Allocate a new pointer list */
clist * clist_new();
/* Destroys a list. Data pointed by data pointers is NOT freed. */
void clist_free(clist *);
/* Some of the following routines can be implemented as macros to
be faster. If you don't want it, define NO_MACROS */
#ifdef NO_MACROS
/* Returns TRUE if list is empty */
int clist_isempty(clist *);
/* Returns the number of elements in the list */
int clist_count(clist *);
/* Returns an iterator to the first element of the list */
clistiter * clist_begin(clist *);
/* Returns an iterator to the last element of the list */
clistiter * clist_end(clist *);
/* Returns an iterator to the next element of the list */
clistiter * clist_next(clistiter *);
/* Returns an iterator to the previous element of the list */
clistiter * clist_previous(clistiter *);
/* Returns the data pointer of this element of the list */
void* clist_content(clistiter *);
/* Inserts this data pointer at the beginning of the list */
int clist_prepend(clist *, void *);
/* Inserts this data pointer at the end of the list */
int clist_append(clist *, void *);
#else
#define clist_isempty(lst) ((lst->first==lst->last) && (lst->last==NULL))
#define clist_count(lst) (lst->count)
#define clist_begin(lst) (lst->first)
#define clist_end(lst) (lst->last)
#define clist_next(iter) (iter ? iter->next : NULL)
#define clist_previous(iter) (iter ? iter->previous : NULL)
#define clist_content(iter) (iter ? iter->data : NULL)
#define clist_prepend(lst, data) (clist_insert_before(lst, lst->first, data))
#define clist_append(lst, data) (clist_insert_after(lst, lst->last, data))
#endif
/* Inserts this data pointer before the element pointed by the iterator */
int clist_insert_before(clist *, clistiter *, void *);
/* Inserts this data pointer after the element pointed by the iterator */
int clist_insert_after(clist *, clistiter *, void *);
/* Deletes the element pointed by the iterator.
Returns an iterator to the next element. */
clistiter * clist_delete(clist *, clistiter *);
typedef void (* clist_func)(void *, void *);
void clist_foreach(clist * lst, clist_func func, void * data);
void clist_concat(clist * dest, clist * src);
void * clist_nth_data(clist * lst, int index);
clistiter * clist_nth(clist * lst, int index);
#ifdef __cplusplus
}
#endif
#endif
|
