MySQL 9.1.0
Source Code Documentation
|
A double-linked list. More...
Go to the source code of this file.
Classes | |
struct | ib_list_t |
struct | ib_list_node_t |
struct | ib_list_helper_t |
Functions | |
ib_list_t * | ib_list_create (void) |
Create a new list using mem_alloc. More... | |
void | ib_list_free (ib_list_t *list) |
Free a list. More... | |
ib_list_node_t * | ib_list_add_last (ib_list_t *list, void *data, mem_heap_t *heap) |
Add the data to the end of the list. More... | |
void | ib_list_remove (ib_list_t *list, ib_list_node_t *node) |
Remove the node from the list. More... | |
static ib_list_node_t * | ib_list_get_first (ib_list_t *list) |
Get the first node in the list. More... | |
static ib_list_node_t * | ib_list_get_last (ib_list_t *list) |
Get the last node in the list. More... | |
static bool | ib_list_is_empty (const ib_list_t *list) |
A double-linked list.
Created 4/26/2006 Osku Salerma
ib_list_node_t * ib_list_add_last | ( | ib_list_t * | list, |
void * | data, | ||
mem_heap_t * | heap | ||
) |
Add the data to the end of the list.
list | in: list |
data | in: data |
heap | in: memory heap to use |
ib_list_t * ib_list_create | ( | void | ) |
Create a new list using mem_alloc.
Lists created with this function must be freed with ib_list_free.
Create a new list using mem_alloc.
void ib_list_free | ( | ib_list_t * | list | ) |
Free a list.
in: list
list | in: list |
|
inlinestatic |
Get the first node in the list.
|
inlinestatic |
Get the last node in the list.
|
inlinestatic |
void ib_list_remove | ( | ib_list_t * | list, |
ib_list_node_t * | node | ||
) |
Remove the node from the list.
[in] | list | List |
[in] | node | Node to remove |