From: Gary V. Vaughan <gary@gnu.org>
Date: Tue, 23 Nov 2004 16:05:48 +0000 (+0000)
Subject: * libltdl/slist.h: Forgot to cvs rm this file.
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=9bd26e6c48aee8d8e133b7b2a38fdebb7684e2a9;p=thirdparty%2Flibtool.git

* libltdl/slist.h: Forgot to cvs rm this file.
---

diff --git a/libltdl/slist.h b/libltdl/slist.h
deleted file mode 100644
index 4906145cb..000000000
--- a/libltdl/slist.h
+++ /dev/null
@@ -1,92 +0,0 @@
-/* slist.h -- generalised singly linked lists
-   Copyright (C) 2000, 2004 Free Software Foundation, Inc.
-   Written by Gary V. Vaughan  <gary@gnu.org>
-
-   NOTE: The canonical source of this file is maintained with the
-   GNU Libtool package.  Report bugs to bug-libtool@gnu.org.
-
-This library is free software; you can redistribute it and/or
-modify it under the terms of the GNU Lesser General Public
-License as published by the Free Software Foundation; either
-version 2 of the License, or (at your option) any later version.
-
-As a special exception to the GNU Lesser General Public License,
-if you distribute this file as part of a program or library that
-is built using GNU libtool, you may include it under the same
-distribution terms that you use for the rest of that program.
-
-This library is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-Lesser General Public License for more details.
-
-You should have received a copy of the GNU Lesser General Public
-License along with this library; if not, write to the Free Software
-Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
-02111-1307  USA
-
-*/
-
-/* A generalised list.  This is deliberately transparent so that you
-   can make the NEXT field of all your chained data structures first,
-   and then cast them to `(SList *)' so that they can be manipulated
-   by this API.
-
-   Alternatively, you can generate raw SList elements using slist_new(),
-   and put the element data in the USERDATA field.  Either way you
-   get to manage the memory involved by yourself.
-*/
-
-#if !defined(SLIST_H)
-#define SLIST_H 1
-
-#if defined(LTDL)
-#  include <libltdl/lt_system.h>
-#else
-#  define LT_SCOPE
-#endif
-
-#if defined(_cplusplus)
-extern "C" {
-#endif
-
-typedef struct slist {
-  struct slist *next;		/* chain forward pointer*/
-  const void *userdata;		/* for boxed `SList' item */
-} SList;
-
-typedef void *	SListCallback	(SList *item, void *userdata);
-typedef int	SListCompare	(const SList *item1, const SList *item2,
-				 void *userdata);
-
-LT_SCOPE SList *slist_concat	(SList *head, SList *tail);
-LT_SCOPE SList *slist_cons	(SList *item, SList *slist);
-
-LT_SCOPE SList *slist_delete	(SList *slist, void (*delete) (void *item));
-LT_SCOPE void *	slist_remove	(SList **phead, SListCallback *find,
-				 void *matchdata);
-LT_SCOPE SList *slist_reverse	(SList *slist);
-LT_SCOPE SList *slist_sort	(SList *slist, SListCompare *compare,
-				 void *userdata);
-
-LT_SCOPE SList *slist_tail	(SList *slist);
-LT_SCOPE SList *slist_nth	(SList *slist, size_t n);
-LT_SCOPE void *	slist_find	(SList *slist, SListCallback *find,
-				 void *matchdata);
-LT_SCOPE size_t slist_length	(SList *slist);
-
-LT_SCOPE void *	slist_foreach   (SList *slist, SListCallback *foreach,
-				 void *userdata);
-
-LT_SCOPE SList *slist_box	(const void *userdata);
-LT_SCOPE void *	slist_unbox	(SList *item);
-
-#if defined(_cplusplus)
-}
-#endif
-
-#if !defined(LTDL)
-#  undef LT_SCOPE
-#endif
-
-#endif /*!defined(SLIST_H)*/