Data Structures Lerax 1.0.0
Essential Data Structures for C language
Loading...
Searching...
No Matches
list-circular.h File Reference

Go to the source code of this file.

Data Structures

struct  ListCircular
 A List circular data structure. The last *next pointer points to the first. More...

Typedefs

typedef struct ListCircular ListCircular

Functions

ListCircularlist_circular_create (void)
int list_circular_empty (ListCircular *l)
ListCircularlist_circular_insert (ListCircular *l, int data)
ListCircularlist_circular_remove (ListCircular *l, int data)
ListCircularlist_circular_search (ListCircular *l, int data)
void list_circular_print (ListCircular *l)
void list_circular_println (ListCircular *l)
void list_circular_free (ListCircular *l)
ListCircularlist_circular__new_node (int data)

Typedef Documentation

◆ ListCircular

typedef struct ListCircular ListCircular

List circular alias

Function Documentation

◆ list_circular__new_node()

ListCircular * list_circular__new_node ( int data)

◆ list_circular_create()

ListCircular * list_circular_create ( void )

Create a new empty list

◆ list_circular_empty()

int list_circular_empty ( ListCircular * l)

Verify if the list is empty

◆ list_circular_free()

void list_circular_free ( ListCircular * l)

Free the memory allocated by list

◆ list_circular_insert()

ListCircular * list_circular_insert ( ListCircular * l,
int data )

Insert a new element on the begin of the list

◆ list_circular_print()

void list_circular_print ( ListCircular * l)

Print a circular list (without newline)

◆ list_circular_println()

void list_circular_println ( ListCircular * l)

Print a circular list (with newline)

◆ list_circular_remove()

ListCircular * list_circular_remove ( ListCircular * l,
int data )

Remove a element data, if exists, on the list

◆ list_circular_search()

ListCircular * list_circular_search ( ListCircular * l,
int data )

Search for a node which has a data field