#include <list.h>

Collaboration diagram for list_t:

Public Attributes
list_node_t *	head

list_node_t *	tail

size_t	size

size_t	elem_size

Detailed Description

A doubly-linked list data structure. Maintains both head and tail pointers for bidirectional traversal. Stores elements of uniform size specified at list creation.

Definition at line 34 of file list.h.

Member Data Documentation

◆ elem_size

size_t list_t::elem_size

Size in bytes of each element stored in the list.

Definition at line 42 of file list.h.

Referenced by list_index_of(), list_insert(), list_new(), list_push_back(), and list_push_front().

◆ head

list_node_t* list_t::head

Pointer to the first node in the list. NULL if empty.

Definition at line 36 of file list.h.

Referenced by list_clear(), list_get(), list_index_of(), list_insert(), list_new(), list_pop_back(), list_pop_front(), list_push_back(), list_push_front(), and list_remove().

◆ size

size_t list_t::size

Number of elements currently in the list.

Definition at line 40 of file list.h.

Referenced by list_clear(), list_get(), list_insert(), list_new(), list_pop_back(), list_pop_front(), list_push_back(), list_push_front(), list_remove(), and list_size().

◆ tail

list_node_t* list_t::tail

Pointer to the last node in the list. NULL if empty.

Definition at line 38 of file list.h.

Referenced by list_clear(), list_new(), list_pop_back(), list_pop_front(), list_push_back(), list_push_front(), and list_remove().

The documentation for this struct was generated from the following file: