src/list.c

Tue, 28 Sep 2021 18:33:42 +0200

author
Mike Becker <universe@uap-core.de>
date
Tue, 28 Sep 2021 18:33:42 +0200
changeset 447
87b2cdd668ed
parent 439
9a5adedd6de6
permissions
-rw-r--r--

implement cx_ll_remove()

/*
 * 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.
 */

#include "cx/list.h"

int cxListAdd(CxList list, void *elem) {
    return list->cl->add(list, elem);
}

int cxListInsert(CxList list, size_t index, void *elem) {
    return list->cl->insert(list, index, elem);
}

int cxListRemove(CxList list, size_t index) {
    return list->cl->remove(list, index);
}

void *cxListAt(CxList list, size_t index) {
    return list->cl->at(list, index);
}

size_t cxListFind(CxList list, void *elem) {
    return list->cl->find(list, elem);
}

void *cxListLast(CxList list) {
    return list->cl->last(list);
}

mercurial