lists.h

Go to the documentation of this file.

 
#pragma once
 
#include <stdlib.h>
#include <stdbool.h>
 
typedef struct flist_node_t {
    struct flist_node_t *next; 
} flist_node_t;
 
typedef struct list_node_t {
    flist_node_t        _list; 
    struct list_node_t *prev;  
} list_node_t;
 
typedef void (*f_list_node_del)(flist_node_t *node);
 
typedef bool (*f_list_node_cmp)(const flist_node_t *a, const flist_node_t *b);
 
typedef bool (*f_list_node_pred)(const flist_node_t *node);
 
typedef bool (*f_list_node_bin_pred)(const flist_node_t *a, const flist_node_t *b);
 
// ============================================================================
// Forward list (singly-linked) functions
// ============================================================================
 
bool flist_push_front(flist_node_t **list, flist_node_t *node);
 
bool flist_pop_front(flist_node_t **list, f_list_node_del del_func);
 
bool flist_push_back(flist_node_t **list, flist_node_t *node);
 
bool flist_pop_back(flist_node_t **list, f_list_node_del del_func);
 
bool flist_insert_after(flist_node_t **list, flist_node_t *ref, flist_node_t *node);
 
bool flist_remove(flist_node_t **list, flist_node_t *node, f_list_node_del del_func);
 
size_t flist_remove_if(flist_node_t **list, f_list_node_pred pred_func, f_list_node_del del_func);
 
bool flist_clear(flist_node_t **list, f_list_node_del del_func);
 
size_t flist_size(flist_node_t *const *list);
 
bool flist_empty(flist_node_t *const *list);
 
bool flist_sort(flist_node_t **list, f_list_node_cmp cmp_func);
 
size_t flist_unique(flist_node_t **list, f_list_node_bin_pred pred_func, f_list_node_del del_func);
 
bool flist_reverse(flist_node_t **list);
 
// ============================================================================
// Doubly-linked list functions
// ============================================================================
 
bool list_push_front(list_node_t **list, list_node_t *node);
 
bool list_pop_front(list_node_t **list, f_list_node_del del_func);
 
bool list_push_back(list_node_t **list, list_node_t *node);
 
bool list_pop_back(list_node_t **list, f_list_node_del del_func);
 
bool list_insert_before(list_node_t **list, list_node_t *ref, list_node_t *node);
 
bool list_insert_after(list_node_t **list, list_node_t *ref, list_node_t *node);
 
bool list_remove(list_node_t **list, list_node_t *node, f_list_node_del del_func);
 
size_t list_remove_if(list_node_t **list, f_list_node_pred pred_func, f_list_node_del del_func);
 
bool list_clear(list_node_t **list, f_list_node_del del_func);
 
size_t list_size(list_node_t *const *list);
 
bool list_empty(list_node_t *const *list);
 
bool list_sort(list_node_t **list, f_list_node_cmp cmp_func);
 
size_t list_unique(list_node_t **list, f_list_node_bin_pred pred_func, f_list_node_del del_func);
 
bool list_reverse(list_node_t **list);