linked_list.h

Go to the documentation of this file.

/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
 *
 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *   1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *
 *   2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef UCX_LINKED_LIST_H
#define UCX_LINKED_LIST_H
 
#include "common.h"
#include "list.h"
 
#ifdef __cplusplus
extern "C" {
#endif

typedef struct cx_linked_list_s {
    struct cx_list_s base;
    off_t loc_prev;
    off_t loc_next;
    off_t loc_data;
    size_t extra_data_len;
    void *begin;
    void *end;
} cx_linked_list;

cx_attr_nodiscard cx_attr_malloc cx_attr_dealloc(cxListFree, 1)
CX_EXPORT CxList *cxLinkedListCreate(const CxAllocator *allocator,
        cx_compare_func comparator, size_t elem_size);

#define cxLinkedListCreateSimple(elem_size) \
        cxLinkedListCreate(NULL, NULL, elem_size)

cx_attr_nonnull cx_attr_nodiscard
CX_EXPORT void *cx_linked_list_at(const void *start,size_t start_index,
        ptrdiff_t loc_advance, size_t index);

cx_attr_nonnull_arg(1, 4, 5)
CX_EXPORT void *cx_linked_list_find(const void *start, ptrdiff_t loc_advance,
        ptrdiff_t loc_data, cx_compare_func cmp_func, const void *elem,
        size_t *found_index);

cx_attr_nonnull cx_attr_returns_nonnull
CX_EXPORT void *cx_linked_list_first(const void *node, ptrdiff_t loc_prev);

cx_attr_nonnull cx_attr_returns_nonnull
CX_EXPORT void *cx_linked_list_last(const void *node, ptrdiff_t loc_next);

cx_attr_nonnull
CX_EXPORT void *cx_linked_list_prev(const void *begin, ptrdiff_t loc_next, const void *node);

cx_attr_nonnull_arg(5)
CX_EXPORT void cx_linked_list_add(void **begin, void **end, ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node);

cx_attr_nonnull_arg(5)
CX_EXPORT void cx_linked_list_prepend(void **begin, void **end, ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node);

cx_attr_nonnull
CX_EXPORT void cx_linked_list_link(void *left, void *right, ptrdiff_t loc_prev, ptrdiff_t loc_next);

cx_attr_nonnull
CX_EXPORT void cx_linked_list_unlink(void *left, void *right, ptrdiff_t loc_prev, ptrdiff_t loc_next);

cx_attr_nonnull_arg(6)
CX_EXPORT void cx_linked_list_insert(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *node, void *new_node);

cx_attr_nonnull_arg(6)
CX_EXPORT void cx_linked_list_insert_chain(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *node, void *insert_begin, void *insert_end);

cx_attr_nonnull_arg(1, 5, 6)
CX_EXPORT void cx_linked_list_insert_sorted(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node, cx_compare_func cmp_func);

cx_attr_nonnull_arg(1, 5, 6)
CX_EXPORT void cx_linked_list_insert_sorted_chain(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *insert_begin, cx_compare_func cmp_func);

cx_attr_nonnull_arg(1, 5, 6)
CX_EXPORT int cx_linked_list_insert_unique(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node, cx_compare_func cmp_func);

cx_attr_nonnull_arg(1, 5, 6) cx_attr_nodiscard
CX_EXPORT void *cx_linked_list_insert_unique_chain(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *insert_begin, cx_compare_func cmp_func);

cx_attr_nonnull_arg(5)
CX_EXPORT size_t cx_linked_list_remove_chain(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *node, size_t num);

cx_attr_nonnull_arg(5)
CX_EXPORT void cx_linked_list_remove(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, void *node);

cx_attr_nodiscard
CX_EXPORT size_t cx_linked_list_size(const void *node, ptrdiff_t loc_next);

cx_attr_nonnull_arg(1, 6)
CX_EXPORT void cx_linked_list_sort(void **begin, void **end,
        ptrdiff_t loc_prev, ptrdiff_t loc_next, ptrdiff_t loc_data, cx_compare_func cmp_func);
 

cx_attr_nonnull_arg(5)
CX_EXPORT int cx_linked_list_compare(const void *begin_left, const void *begin_right,
        ptrdiff_t loc_advance, ptrdiff_t loc_data, cx_compare_func cmp_func);

cx_attr_nonnull_arg(1)
CX_EXPORT void cx_linked_list_reverse(void **begin, void **end, ptrdiff_t loc_prev, ptrdiff_t loc_next);
 
#ifdef __cplusplus
} // extern "C"
#endif
 
#endif // UCX_LINKED_LIST_H