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
|
/*
* Check: a unit test framework for C
* Copyright (C) 2001, 2002 Arien Malec
*
* This library 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.
*
* This library 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 this library; if not, write to the
* Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
* MA 02110-1301, USA.
*/
#ifndef CHECK_LIST_H
#define CHECK_LIST_H
#include <stdbool.h>
typedef struct List List;
/* Create an empty list */
List *check_list_create (void);
/* Is list at end? */
int check_list_at_end (List * lp);
/* Position list at front */
void check_list_front (List * lp);
/* Add a value to the front of the list,
positioning newly added value as current value.
More expensive than list_add_end, as it uses memmove. */
void check_list_add_front (List * lp, void *val);
/* Add a value to the end of the list,
positioning newly added value as current value */
void check_list_add_end (List * lp, void *val);
/* Give the value of the current node */
void *check_list_val (List * lp);
/* Position the list at the next node */
void check_list_advance (List * lp);
/* Free a list, but don't free values */
void check_list_free (List * lp);
void check_list_apply (List * lp, void (*fp) (void *));
/* Return true if the list contains the value, false otherwise */
bool check_list_contains (List * lp, void *val);
#endif /* CHECK_LIST_H */
|
