Implementation of a dynamically expanding stack data structure.
More...
#include <assert.h>
#include <cgraph/list.h>
#include <stdbool.h>
Go to the source code of this file.
◆ stack_is_empty()
static bool stack_is_empty |
( |
const gv_stack_t * |
stack | ) |
|
|
inlinestatic |
◆ stack_pop()
static void * stack_pop |
( |
gv_stack_t * |
stack | ) |
|
|
inlinestatic |
◆ stack_push()
static void stack_push |
( |
gv_stack_t * |
stack, |
|
|
void * |
item |
|
) |
| |
|
inlinestatic |
◆ stack_reset()
static void stack_reset |
( |
gv_stack_t * |
stack | ) |
|
|
inlinestatic |
◆ stack_size()
static size_t stack_size |
( |
const gv_stack_t * |
stack | ) |
|
|
inlinestatic |
◆ stack_top()
static void * stack_top |
( |
gv_stack_t * |
stack | ) |
|
|
inlinestatic |