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
|
/* $Id$ $Revision$ */
/* vim:set shiftwidth=4 ts=8: */
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors: See CVS logs. Details at http://www.graphviz.org/
*************************************************************************/
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
typedef struct SingleLinkedList_struct* SingleLinkedList;
struct SingleLinkedList_struct {
void *data;
SingleLinkedList next;
};
SingleLinkedList SingleLinkedList_new(void *data);
SingleLinkedList SingleLinkedList_new_int(int i);
void SingleLinkedList_delete(SingleLinkedList head, void (*linklist_deallocator)(void*));
SingleLinkedList SingleLinkedList_prepend(SingleLinkedList l, void *data);
SingleLinkedList SingleLinkedList_prepend_int(SingleLinkedList l, int i);
void* SingleLinkedList_get_data(SingleLinkedList l);
SingleLinkedList SingleLinkedList_get_next(SingleLinkedList l);
void SingleLinkedList_print(SingleLinkedList head, void (*linkedlist_print)(void*));
typedef struct DoubleLinkedList_struct* DoubleLinkedList;
struct DoubleLinkedList_struct {
void *data;
DoubleLinkedList next;
DoubleLinkedList prev;
};
DoubleLinkedList DoubleLinkedList_new(void *data);
void DoubleLinkedList_delete(DoubleLinkedList head, void (*linklist_deallocator)(void*));
DoubleLinkedList DoubleLinkedList_prepend(DoubleLinkedList l, void *data);
void* DoubleLinkedList_get_data(DoubleLinkedList l);
DoubleLinkedList DoubleLinkedList_get_next(DoubleLinkedList l);
void DoubleLinkedList_delete_element(DoubleLinkedList l, void (*linklist_deallocator)(void*), DoubleLinkedList *head);
#endif
|
