Data Structures UFC  1.0.0
Essential Data Structures for C language
list-circular.h
Go to the documentation of this file.
1 
13 #ifndef LIST_CIRCULAR_H
14 #define LIST_CIRCULAR_H
15 
19 struct ListCircular {
20  int data;
21  struct ListCircular *next;
22 };
23 
24 
26 typedef struct ListCircular ListCircular;
27 
28 #define EMPTY_LIST_CIRCULAR (ListCircular*) 0
29 
32 
35 
38 
41 
44 
47 
50 
51 
54 
55 /*********/
56 /* UTILS */
57 /*********/
58 
60 
61 #endif
ListCircular * list_circular__new_node(int data)
struct ListCircular * next
Definition: list-circular.h:21
void list_circular_print(ListCircular *l)
ListCircular * list_circular_insert(ListCircular *l, int data)
A List circular data structure. The last *next pointer points to the first.
Definition: list-circular.h:19
int list_circular_empty(ListCircular *l)
int data
Definition: list-circular.h:20
ListCircular * list_circular_create(void)
ListCircular * list_circular_search(ListCircular *l, int data)
void list_circular_free(ListCircular *l)
void list_circular_println(ListCircular *l)
ListCircular * list_circular_remove(ListCircular *l, int data)