/*
 *  =================================================================== 
 *  Declarations for Ordered Oneway Linked Lists           
 *                                                                     
 *  Copyright (C) 1993-96 by Mark Austin and David Mazzoni.
 *                                                                     
 *  This software is provided "as is" without express or implied warranty.
 *  Permission is granted to use this software on any computer system,
 *  and to redistribute it freely, subject to the following restrictions:
 * 
 *  1. The authors are not responsible for the consequences of use of
 *     this software, even if they arise from defects in the software.
 *  2. The origin of this software must not be misrepresented, either
 *     by explicit claim or by omission.
 *  3. Altered versions must be plainly marked as such, and must not
 *     be misrepresented as being the original software.
 *  4. This notice is to remain intact.
 *                                                                    
 *  Written by: M.A. Austin                                 March, 1993
 *  ===================================================================
 */

#ifndef _NUMLIST_H
#define _NUMLIST_H

/* Data Structure for One-Way List */

typedef double ELEMENT;

typedef struct listoneway {
        ELEMENT              item;
        struct listoneway *spNext;
} NUMLIST;

/* External interface to list functions */

NUMLIST   *listAddItem( NUMLIST *, ELEMENT );
NUMLIST   *listDeleteItem( NUMLIST *, ELEMENT );
void       listPrint( char *, NUMLIST * );
void       listFree( NUMLIST *);
int        listEmpty( NUMLIST *);

/* External interface to set operation functions */

NUMLIST   *listIntersection( NUMLIST *, NUMLIST * );

#endif