2 * CDE - Common Desktop Environment
4 * Copyright (c) 1993-2012, The Open Group. All rights reserved.
6 * These libraries and programs are free software; you can
7 * redistribute them and/or modify them under the terms of the GNU
8 * Lesser General Public License as published by the Free Software
9 * Foundation; either version 2 of the License, or (at your option)
12 * These libraries and programs are distributed in the hope that
13 * they will be useful, but WITHOUT ANY WARRANTY; without even the
14 * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU Lesser General Public License for more
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with these librararies and programs; if not, write
20 * to the Free Software Foundation, Inc., 51 Franklin Street, Fifth
21 * Floor, Boston, MA 02110-1301 USA
24 * $XConsortium: util_ds.c /main/4 1995/11/06 18:53:21 rswiston $
26 * @(#)util_ds.c 1.3 23 Feb 1994 cde_app_builder/src/libAButil
28 * RESTRICTED CONFIDENTIAL INFORMATION:
30 * The information in this document is subject to special
31 * restrictions in a confidential disclosure agreement between
32 * HP, IBM, Sun, USL, SCO and Univel. Do not distribute this
33 * document outside HP, IBM, Sun, USL, SCO, or Univel without
34 * Sun's specific written approval. This document and all copies
35 * and derivative works thereof must be returned or destroyed at
38 * Copyright 1993 Sun Microsystems, Inc. All rights reserved.
43 #include <X11/Intrinsic.h>
44 #include <ab_private/util_ds.h>
46 /***************************************************
47 * Linked List and Active Set ADT implementations
48 ***************************************************/
52 struct _LListStruct *next;
55 static void llist_delete_next(
64 LList tmp = (LList) XtMalloc(sizeof(struct _LListStruct));
85 util_llist_insert_after(
90 LList tmp = util_llist_create();
93 tmp->next = llist->next;
106 for (prev = llist, trav = llist->next; trav != NULL;
107 prev = trav, trav = trav->next)
108 if (trav->value == cl_data)
119 LList tmp = util_llist_find(llist, cl_data);
122 llist_delete_next(tmp);
130 LList tmp = llist->next;
134 llist->next = tmp->next;
145 for (llist = llist->next; llist != NULL; llist = llist->next)
155 if (util_llist_find(aset, cl_data) == NULL)
156 util_llist_insert_after(aset, cl_data);