head	1.3;
access;
symbols
	PETIDOMO_4_0b6:1.3
	PETIDOMO_4_0b5:1.3
	PETIDOMO_4_0b4:1.3
	PETIDOMO_4_0b3:1.3
	BEFORETHL:1.3
	petidomo-2-2:1.1.1.1
	petidomo:1.1.1;
locks; strict;
comment	@ * @;


1.3
date	2000.12.14.15.07.35;	author simons;	state Exp;
branches;
next	1.2;

1.2
date	2000.12.13.15.45.25;	author simons;	state dead;
branches;
next	1.1;

1.1
date	2000.12.13.13.19.07;	author simons;	state Exp;
branches
	1.1.1.1;
next	;

1.1.1.1
date	2000.12.13.13.19.07;	author simons;	state Exp;
branches;
next	;


desc
@@


1.3
log
@ - Removed smake build and autoconf from the libraries.
 - Removed unused files.
@
text
@/*
   $Source: /d1/e/petidomo/cvs/petidomo/source/liblists/lists.h.in,v $
   $Revision: 1.2 $

   Copyright (C) 2000 by CyberSolutions GmbH, Germany.

   This file is part of OpenPetidomo.

   OpenPetidomo 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, or (at your option)
   any later version.

   OpenPetidomo 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 OpenPetidomo; see the file COPYING. If not, write to
   the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.
*/

#ifndef __LIB_LISTS_H__
#define __LIB_LISTS_H__ 1

#include <stdlib.h>
#include <string.h>
#include <assert.h>
#ifdef DEBUG_DMALLOC
#  include <dmalloc.h>
#endif

/********** Useful defines and declarations **********/

#ifndef __cplusplus
#ifndef __HAVE_DEFINED_BOOL__
#  define __HAVE_DEFINED_BOOL__ 1
typedef int bool;
#endif
#ifndef FALSE
#  define FALSE (0==1)
#endif
#ifndef TRUE
#  define TRUE (1==1)
#endif
#endif

/********** Structures **********/

struct ListHead {
    struct ListNode *   lh_FirstNode;
    int                 (*lh_Compare)(const void *, const void *);
};
typedef struct ListHead * List;

struct ListNode {
    struct ListNode *   ln_Next;
    struct ListNode *   ln_Prev;
    struct ListHead *   ln_Head;
    const void *        ln_Key;
    const void *        ln_Data;
};
typedef struct ListNode * Node;

/********** Prototypes **********/

List getListHead(const Node node);
const void * getNodeKey(const Node node);
const void * getNodeData(const Node node);
void setNodeData(const Node node, const void * data);
Node getFirstNode(const List head);
Node getNextNode(const Node node);
Node getPrevNode(const Node node);
bool isListEmpty(const List head);
bool isEndOfList(const Node node);
List InitList(int (*compare)(const void *, const void *));
void FreeList(List head);
Node AppendNode(List head, const void * key, const void * data);
Node InitNode(const List head, const void * key, const void * data);
void FreeNode(Node node);
void RemoveNode(const Node node);
Node InsertNodeBeforeNode(Node node, const void *key, const void *data);
Node InsertNodeAfterNode(Node node, const void *key, const void *data);
Node InsertNodeByKey(List head, const void * key, const void * data);
Node FindNodeByKey(List head, const void * key);
unsigned int CountElements(List);

#endif /* !__LIB_LISTS_H__ */
@


1.2
log
@Imported latest version.
@
text
@d2 22
a23 7
 *      $Source: /d1/e/petidomo/cvs/petidomo/source/liblists/lists.h,v $
 *      $Revision: 1.1 $
 *      $Date: 2000/12/13 13:19:07 $
 *
 *      Copyright (C) 1996,97 by CyberSolutions GmbH.
 *      All rights reserved.
 */
a29 3
#ifdef HAVE_STRINGS_H		/* sunos 4 needs this */
#   include <strings.h>
#endif
d37 1
d47 1
@


1.1
log
@Initial revision
@
text
@d2 3
a4 3
 *      $Source: /usr/local/libdata/cvs/c-lib/liblists/lists.h,v $
 *      $Revision: 1.46 $
 *      $Date: 1998/08/15 21:28:40 $
@


1.1.1.1
log
@Imported Petidomo 2.2 as found on www.petidomo.com.
@
text
@@