//
// Basic Summary: clasical list 
//
// Include file for list definition
//
// Copyright:
//
// Copyright 1993 Ron Burback
// Copyright 1993 Objects Plus
// All rights reserved
//
// Description:
// clasical list operations
//
//
// Data elemnents: a dynamic array with a few new methods
//
//
// Methods:
//
// The methods are
//	list(); - standard constructor
//	~list(); - standard disctructor
//  first - get the first element, non distructive
//  rest - get the rest of the list, get rid of the first element
//  append - append one list to the other
//	reverse - reverse the order of a list
//
//	static Boolean test(); = quality assurance test
//
// Macro definitions: none
// 
// 
// Class definition:
// 
// list
//

#ifndef _OP_LIST
#define _OP_LIST

#include "circular_buffer.h"
#include "linked_chunk.h"
#include "dynamic_array.h"
#include "pool.h"

class list : dynamic_array {

	public:
	
		static char * version ;
	
		list();
		~list();
		void * first();
		void rest();
		void append( list * l) ;
		void reverse () ;
	
		static Boolean test() ;
	
};

#endif