//-----------------------------------------------------------------------------
// ListTest.cpp
// A test client for List ADT
//-----------------------------------------------------------------------------
#include<iostream>
#include<string>
#include<stdexcept>
#include"List.h"

using namespace std;

List Union(List& P, List& Q){
   List U = P.concat(Q);
   U.cleanup();
   return U;
}

List Intersection(List& P, List& Q){
   ListElement x;
   List I;

   P.moveFront();
   while( P.position()<P.length() ){
      x = P.moveNext();
      Q.moveFront();
      if( Q.findNext(x)>=0 ){
         I.insertBefore(x);
      }
   }
   return I;
}

int main(){

int i;
   int A[] = {1,1,2,1,2,2,3,1,2,3,3}, a=11, k=5;
   int B[] = {1, 2, 3, 4, 5, 6, 7}, b=7;
   int C[] = {4, 5, 6, 7, 8, 9, 10, 11}, c=8;
   List L, P, Q;

   for(i=0; i<a; i++) L.insertBefore(A[i]);
   L.moveFront();
   for(i=0; i<k; i++) L.moveNext();

   for(i=0; i<b; i++) P.insertBefore(B[i]);
   for(i=0; i<c; i++) Q.insertAfter(C[i]);


   cout << endl;
   cout << "L = " << L << "  :  position = " << L.position() << endl;
   L.cleanup();
   cout << "L = " << L << "  :  position = " << L.position() << endl;
   cout << endl;

   cout << endl;
   cout << "P = " << P << "  :  position = " << P.position() << endl;
   cout << "Q = " << Q << "  :  position = " << Q.position() << endl;
   List U = Union(P, Q);
   cout << "U = " << U << "  :  position = " << U.position() << endl;
   cout << endl;

   cout << endl;
   cout << "P = " << P << "  :  position = " << P.position() << endl;
   cout << "Q = " << Q << "  :  position = " << Q.position() << endl;
   List I = Intersection(P, Q);
   cout << "I = " << I << "  :  position = " << I.position() << endl;
   cout << endl;

   return( EXIT_SUCCESS );
}