Data Structures Lerax  v3.0-104-ge031
Opinionated Data Structures & Algorithms
Loading...
Searching...
No Matches
list-circular.h
Go to the documentation of this file.
1
12
13#ifndef LIST_CIRCULAR_H
14#define LIST_CIRCULAR_H
23 int data;
25};
26
34
35#define EMPTY_LIST_CIRCULAR (ListCircular*) 0
36
44
53
63
73
84
93
102
103
111
112/*********/
113/* UTILS */
114/*********/
115
124
125#endif
ListCircular * list_circular_insert(ListCircular *l, int data)
Inserts a new element at the beginning of a circular list.
void list_circular_println(ListCircular *l)
Prints the elements of a circular list to the console, followed by a newline character.
ListCircular * list_circular_search(ListCircular *l, int data)
Searches for an element in a circular list.
void list_circular_free(ListCircular *l)
Frees the memory allocated for a circular list.
ListCircular * list_circular_create(void)
Creates an empty circular list.
ListCircular * list_circular_remove(ListCircular *l, int data)
Removes an element from a circular list.
ListCircular * list_circular__new_node(int data)
Creates a new node for a circular list.
void list_circular_print(ListCircular *l)
Prints the elements of a circular list to the console, followed by a newline character.
int list_circular_empty(ListCircular *l)
Checks if a circular list is empty.
A node in a circular singly linked list.
Definition list-circular.h:22
struct ListCircular * next
Definition list-circular.h:24
int data
Definition list-circular.h:23