blob: 30830aae68331e6e6466555a3ee00f8e47340dbe (
plain)
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
|
/*
* list.h
*
* Copyright (c) 2002-2006 by Judd Vinet <jvinet@zeroflux.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
#ifndef _LIST_H
#define _LIST_H
#include <alpm.h>
/* Chained list struct */
typedef struct __list_t {
void *data;
struct __list_t *next;
} list_t;
#define FREELIST(p) do { if(p) { list_free(p); p = NULL; } } while(0)
#define FREELISTPTR(p) do { \
list_t *i; \
for(i = p; i; i = i->next) { \
i->data = NULL; \
} \
FREELIST(p); \
} while(0)
list_t *list_new(void);
void list_free(list_t *list);
list_t *list_add(list_t *list, void *data);
int list_count(list_t *list);
int list_is_strin(const char *needle, list_t *haystack);
void list_display(const char *title, list_t *list);
void pmlist_display(const char *title, pmlist_t *list);
list_t *pmlist_remove_dupes(pmlist_t *list);
#endif /*_LIST_H*/
/* vim: set ts=2 sw=2 noet: */
|
