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: slist.h /main/4 1996/07/18 14:30:30 drk $
26 * Copyright (c) 1993 HAL Computer Systems International, Ltd.
27 * All rights reserved. Unpublished -- rights reserved under
28 * the Copyright Laws of the United States. USE OF A COPYRIGHT
29 * NOTICE IS PRECAUTIONARY ONLY AND DOES NOT IMPLY PUBLICATION
32 * THIS SOFTWARE CONTAINS CONFIDENTIAL INFORMATION AND TRADE
33 * SECRETS OF HAL COMPUTER SYSTEMS INTERNATIONAL, LTD. USE,
34 * DISCLOSURE, OR REPRODUCTION IS PROHIBITED WITHOUT THE
35 * PRIOR EXPRESS WRITTEN PERMISSION OF HAL COMPUTER SYSTEMS
38 * RESTRICTED RIGHTS LEGEND
39 * Use, duplication, or disclosure by the Government is subject
40 * to the restrictions as set forth in subparagraph (c)(l)(ii)
41 * of the Rights in Technical Data and Computer Software clause
42 * at DFARS 252.227-7013.
44 * HAL COMPUTER SYSTEMS INTERNATIONAL, LTD.
56 #include "utility/debug.h"
57 #include "dstr/slist_cell.h"
59 // single-linked list class
64 slist(slist_cell* x = 0);
67 // append a slist. tail_list becomes part of this list. no copy
68 // is performed. tail_list -> head and tail_list -> tail
69 // are set to NULL. Also, tail_list -> ct = 0.
70 void append(slist* tail_list);
72 // generalization of append(). arguments should be of type slist*.
74 slist* concate_with(slist* ...);
78 void insert_as_tail(slist_cell* x) ;
83 // empty the list without free cells
84 void empty_list() { v_head = v_tail = 0; v_ct = 0;} ;
87 int count() { return v_ct; }; // number of cells in the list
88 slist_cell* get_head() { return v_head; };
89 slist_cell* get_tail() { return v_tail; };
91 long first(); // 0 if the list is empty
92 void next(long & index);
93 long last(); // 0 if the list is empty
96 slist_cell *v_head; // head pointer
97 slist_cell *v_tail; // tail pointer
98 int v_ct; // cell in the list
102 typedef slist *slistPtr;