// List.H
//
// Defines a LinkedList implementation of the List ADT

#ifndef _LinkedList_H
#define _LinkedList_H

#include <iostream.h>    // For NULL

// List class
//
// CONSTRUCTION: with no initializer
// Access is via ListItr class
//
// ******************PUBLIC OPERATIONS*********************
// boolean isEmpty( )     --> Return true if empty; else false
// void makeEmpty( )      --> Remove all items
// ListItr zeroth( )      --> Return position to prior to first
// ListItr first( )       --> Return first position
// void insert( x, p )    --> Insert x after current iterator position p
// void remove( x )       --> Remove x
// ListItr find( x )      --> Return position that views x
// ListItr findPrevious( x )
//                        --> Return position prior to x
// ******************ERRORS********************************
// No special errors

template <class Object>
class List
{
   public:
      List( );
      List( const List & rhs );
      ~List( );

      bool isEmpty( ) const;
      void makeEmpty( );
      ListItr<Object> zeroth( ) const;
      ListItr<Object> first( ) const;
      void insert( const Object & x, const ListItr<Object> & p );
      ListItr<Object> find( const Object & x ) const;
      ListItr<Object> findPrevious( const Object & x ) const;
      void remove( const Object & x );
      const List & operator=( const List & rhs );

   private:
      ListNode<Object> *header;
};

#endif