Super-2024-Swadge-FW/linked__list_8h_source.html

#ifndef _LINKED_LIST_H

#define _LINKED_LIST_H


#include <stdint.h>

#include <stdbool.h>


typedef struct node

{

    void* val;

    struct node* next;

    struct node* prev;

} node_t;


typedef struct

{

    node_t* first;

    node_t* last;

    int length;

} list_t;


void push(list_t* list, void* val);

void* pop(list_t* list);

void unshift(list_t* list, void* val);

void* shift(list_t* list);

bool addIdx(list_t* list, void* val, uint16_t index);

void addBefore(list_t* list, void* val, node_t* entry);

void addAfter(list_t* list, void* val, node_t* entry);

void* removeIdx(list_t* list, uint16_t index);

void* removeEntry(list_t* list, node_t* entry);

void clear(list_t* list);


#ifdef TEST_LIST

// Exercise the linked list functions

void listTester(void);

#endif


#endif

removeEntry
void * removeEntry(list_t *list, node_t *entry)
Definition linked_list.c:375

node::next
struct node * next
The next node in the list.
Definition linked_list.h:79

unshift
void unshift(list_t *list, void *val)
Add to the front of the list.
Definition linked_list.c:110

removeIdx
void * removeIdx(list_t *list, uint16_t index)
Remove at an index in the list.
Definition linked_list.c:311

node::prev
struct node * prev
The previous node in the list.
Definition linked_list.h:80

list_t::last
node_t * last
The last node in the list.
Definition linked_list.h:89

addBefore
void addBefore(list_t *list, void *val, node_t *entry)
Insert a value into the list immediately before the given node.
Definition linked_list.c:235

node_t
struct node node_t
A node in a doubly linked list with pointers to the previous and next values (which may be NULL),...

addAfter
void addAfter(list_t *list, void *val, node_t *entry)
Insert a value into the list immediately after the given node.
Definition linked_list.c:274

clear
void clear(list_t *list)
Remove all items from the list.
Definition linked_list.c:429

shift
void * shift(list_t *list)
Remove from the front of the list.
Definition linked_list.c:138

list_t::length
int length
The number of nodes in the list.
Definition linked_list.h:90

node::val
void * val
A pointer to the data for this node.
Definition linked_list.h:78

addIdx
bool addIdx(list_t *list, void *val, uint16_t index)
Add at an index in the list.
Definition linked_list.c:180

push
void push(list_t *list, void *val)
Add to the end of the list.
Definition linked_list.c:42

list_t::first
node_t * first
The first node in the list.
Definition linked_list.h:88

pop
void * pop(list_t *list)
Remove from the end of the list.
Definition linked_list.c:70

list_t
A doubly linked list with pointers to the first and last nodes.
Definition linked_list.h:87

node
A node in a doubly linked list with pointers to the previous and next values (which may be NULL),...
Definition linked_list.h:77