ucx: ucx/list.h@540d99722f1f (annotated)

ucx/list.h@540d99722f1f (annotated)

ucx/list.h

Mon, 22 Jul 2013 11:53:39 +0200

author: Mike Becker <universe@uap-core.de>
date: Mon, 22 Jul 2013 11:53:39 +0200
changeset 122: 540d99722f1f
parent 121: ucx/dlist.h@311cac04d079
child 123: 7fb0f74517c5
permissions: -rw-r--r--

removal of single linked list implemenation - step 2: renamed UcxDlist to UcxList (new single implementation)

 /*
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
  *
  * Copyright 2013 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_LIST_H
 #define	UCX_LIST_H
 #include "ucx.h"
 #include <stddef.h>
 #ifdef	__cplusplus
 extern "C" {
 #endif
 /**
  * Loop statement for UCX lists.
  *
  * The first argument is a pointer to the list. In most cases this will be the
  * pointer to the first element of the list, but it may also be an arbitrary
  * element of the list. The iteration will then start with that element.
  *
  * The second argument is the name of the iteration variable. The scope of
  * this variable is limited to the <code>UCX_FOREACH</code> statement.
  *
  * @param list The first element of the list
  * @param elem The variable name of the element
  */
 #define UCX_FOREACH(elem,list) \
         for (UcxList* elem = list ; elem != NULL ; elem = elem->next)
 typedef struct UcxList UcxList;
 struct UcxList {
     void    *data;
     UcxList *next;
     UcxList *prev;
 };
 UcxList *ucx_list_clone(UcxList *l, copy_func fnc, void* data);
 int ucx_list_equals(const UcxList *l1, const UcxList *l2,
         cmp_func fnc, void* data);
 void ucx_list_free(UcxList *l);
 UcxList *ucx_list_append(UcxList *l, void *data);
 UcxList *ucx_list_prepend(UcxList *l, void *data);
 UcxList *ucx_list_concat(UcxList *l1, UcxList *l2);
 UcxList *ucx_list_last(const UcxList *l);
 UcxList *ucx_list_get(const UcxList *l, int index);
 size_t ucx_list_size(const UcxList *l);
 int ucx_list_contains(UcxList *l, void *elem, cmp_func fnc, void *cmpdata);
 UcxList *ucx_list_sort(UcxList *l, cmp_func fnc, void *data);
 UcxList *ucx_list_first(const UcxList *l);
 UcxList *ucx_list_remove(UcxList *l, UcxList *e);
 #ifdef	__cplusplus
 }
 #endif
 #endif	/* UCX_LIST_H */

Mercurial > hg > ucx / annotate

ucx/list.h@540d99722f1f (annotated)

ucx/list.h