1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
|
/*****************************************************************************
*
* Usepackage Environment Manager
* Copyright (C) 1995-2002 Jonathan Hogg <jonathan@onegoodidea.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Name : linked_list.h
* Author : Jonathan Hogg <jonathan@onegoodidea.com>
*
****************************************************************************/
/* linked_list.h */
#ifndef _linked_list_h
#define _linked_list_h
typedef struct list_node_struct {
void *value;
struct list_node_struct *next;
struct list_node_struct *previous;
} list_node;
typedef struct {
list_node *head;
list_node *tail;
} linked_list;
extern linked_list* new_list();
extern void add_to_head(linked_list* l, void* s);
extern void add_to_tail(linked_list* l, void* s);
extern void remove_node(linked_list* l, list_node* n, int k);
extern void free_list(linked_list* l, int k);
extern list_node* next(list_node* n);
extern list_node* previous(list_node* n);
extern list_node* head(linked_list* l);
extern list_node* list_tail(linked_list* l);
extern void* get_value(list_node* n);
extern void set_value(list_node* n, void* s);
#endif
|