testlists.java

国外的数据结构与算法分析用书

package simple;

import patronBook.*;
import java.io.*;

/**     This class tests all the lists in the list package */
public class TestLists
{
	static public void useList() throws Exception
	{
		ArrayedSimpleList p = new ArrayedSimpleList(10);
		p.insertFirst(new Integer(17));
		p.insertFirst(new Integer(-9));
		p.insertFirst(new Integer(12));
		p.insertFirst(new Integer(4));
		p.insertFirst(new Integer(25));
		System.out.println(p);
		System.out.println("The first item of the list is " + ((Integer) p.firstItem()).intValue());
		p.deleteFirst();
		p.insertFirst(new Integer(14));
		System.out.println(p);
		p.deleteFirst();
		p.deleteFirst();
		p.deleteFirst();
		System.out.println(p);
		}

	static public void useList2()
	{
		ArrayedSimpleList p = new ArrayedSimpleList(10);
		try
		{
			p.insertFirst(new Integer(17));
			p.insertFirst(new Integer(-9));
			p.insertFirst(new Integer(12));
			p.insertFirst(new Integer(4));
			p.insertFirst(new Integer(25));
		} catch (ContainerFullUosException e) {} // do nothing
		System.out.println(p);
		try
		{
			System.out.println("The first item of the list is " + p.firstItem());
		} catch (ContainerEmptyUosException e) 
		{
			/*	Should not occur: p is not empty, so p.firstItem() should be valid. */
			e.printStackTrace();
			throw new Error("Error: possible fault in isEmpty()");
		}		 
		try
		{
			p.deleteFirst();
			p.insertFirst(new Integer(14));
			System.out.println(p);
			p.deleteFirst();
			p.deleteFirst();
			p.deleteFirst();
			System.out.println(p);
		} catch (ContainerEmptyUosException e) 
		{
			/*	Should not occur: p is not empty, so p.deleteFirst() should be valid. */
			e.printStackTrace();
		} catch (ContainerFullUosException e) 
		{
			/*	Should not occur: capacity is 10 and only 5 items are in p at any time. */
			e.printStackTrace();
		}
	}


   public static void main (String args[]) throws Exception
   {
          useList();
          useList2();
          
          FileWriter outFile = new FileWriter("./simple/OutputTestLists.txt");          
          
          outFile.write("\nTest the arrayed lists\n");
          ArrayedSimpleList s=new ArrayedSimpleList(4);
          if (!s.isEmpty())
                 outFile.write("Error");
          s.insertFirst ("a");
          s.insertFirst ("b");
          s.insertFirst ("c");
          outFile.write(s.capacity()+"\n");
          outFile.write(s+"\n");
          outFile.write("First item:" + s.firstItem()+"\n");
          s.deleteFirst();
          outFile.write("After delete first:"+s+"\n");
          s.insertFirst ("d");
          s.insertFirst ("y");
          outFile.write(s+"\n");
          if (!s.isFull())
                 outFile.write("Error\n");
          outFile.write(s.firstItem()+"\n");
          s.deleteFirst();
          outFile.write(s.toString()+"\n");
          
	  outFile.write("\nTest the linked lists\n");
          LinkedSimpleList l=new LinkedSimpleList();
          if (!l.isEmpty())
                 outFile.write("Error");
          l.insertFirst ("a");
          l.insertFirst ("b");
          l.insertFirst ("c");
          outFile.write(s.capacity()+"\n");
          outFile.write(l+"\n");
          outFile.write("First item:" + l.firstItem()+"\n");
          l.deleteFirst();
          outFile.write("After delete first:"+l+"\n");
          l.insertFirst ("d");
          l.insertFirst ("y");
          outFile.write(l+"\n");
          if (l.isFull())
                 outFile.write("Error\n");
          outFile.write(l.firstItem()+"\n");
          l.deleteFirst();
          outFile.write(l.toString()+"\n");

          outFile.write("\nTest the Ordered lists\n");
          OrderedSimpleList o=new OrderedSimpleList();
          if (!o.isEmpty())
                 outFile.write("Error");
          o.insert("a");
          o.insert("b");
          o.insert ("c");
          outFile.write(o+"\n");
          outFile.write("First item:" + o.firstItem()+"\n");
          o.deleteFirst();
          outFile.write("After delete first:"+o+"\n");
          o.insert("d");
          o.insert("y");
          o.deleteFirst();
          o.search("d");
          outFile.write("item:" + o.item()+"\n");
          o.search("y");
          outFile.write("item:" + o.item()+"\n");
          o.deleteItem();
          o.insert("j");
          outFile.write(o+"\n");
          if (o.isFull())
                 outFile.write("Error\n");
          outFile.write(o.firstItem()+"\n");
          o.deleteFirst();
          outFile.write(o.toString()+"\n");
          outFile.write(o.firstItem()+"\n");

	  outFile.write("\nTest the Bilinked lists\n");
          BilinkedSimpleList b=new BilinkedSimpleList();
          if (!b.isEmpty())
                 outFile.write("Error");
          b.insertFirst("c");
          b.insertFirst("a");
          b.insertFirst("b");
          outFile.write(b+"\n");
          outFile.write("First item:" + b.firstItem()+"\n");
          b.deleteFirst();
          outFile.write("After delete first:"+b+"\n");
          b.insertFirst("d");
          b.insertFirst("y");
          b.deleteFirst();
          b.search("d");
          outFile.write("item:" + b.item()+"\n");
          b.search("m");
          if (b.itemExists())
          outFile.write("item:" + b.item()+"\n");
          b.search("c");
          outFile.write("item:" + b.item()+"\n");
          b.deleteFirst();
          b.insertFirst("j");
          outFile.write(b+"\n");
          if (b.isFull())
                 outFile.write("Error\n");
          outFile.write(b.firstItem()+"\n");
          b.deleteFirst();
          outFile.write(b.toString()+"\n");
          outFile.write(b.firstItem()+"\n");
         
          outFile.write("\nTest the Extended list of ComparableBooks\n");
          SimpleListExtended bklist=new SimpleListExtended();
          ComparableBook cb = new ComparableBook("a", "a", "a");
          bklist.insertFirst(cb);
          cb = new ComparableBook("cc", "cc", "cc");
          bklist.insertFirst(cb);
          cb = new ComparableBook("ff", "ff", "ff");
          bklist.insertFirst(cb);
          cb = new ComparableBook("bb", "bb", "bb");
          bklist.insertFirst(cb);
          outFile.write(bklist.toString()+"\n");
          outFile.write("The max book is " + bklist.max().toString()+"\n");
          outFile.write("The index of cb is " + bklist.findPos(cb)+"\n");
          cb = new ComparableBook("bb", "bb", "ff");
          outFile.write("The index of ff is " + bklist.findPos(cb)+"\n");
          cb = new ComparableBook("bb", "bb", "bb");
          outFile.write("The index of dd is " + bklist.findPos(cb)+"\n");

          outFile.write("\nTest the Extended list of EqualsBooks\n");
          bklist=new SimpleListExtended();
          EqualsBook eb = new EqualsBook("a", "a", "a");
          bklist.insertFirst(eb);
          eb = new EqualsBook("cc", "cc", "cc");
          bklist.insertFirst(eb);
          eb = new EqualsBook("ff", "ff", "ff");
          bklist.insertFirst(eb);
          eb = new EqualsBook("bb", "bb", "bb");
          bklist.insertFirst(eb);
          outFile.write(bklist.toString()+"\n");
          outFile.write("The index of eb is " + bklist.findPos(eb)+"\n");
          eb = new EqualsBook("bb", "bb", "ff");
          outFile.write("The index of ff is " + bklist.findPos(eb)+"\n");
          EqualsBook neb = new EqualsBook("bb", "bb", "bb");
          outFile.write("The index of dd is " + bklist.findPos(neb)+"\n");
          bklist.insertBeforeValue(eb, neb);
          eb = (EqualsBook) bklist.firstItem();
          bklist.insertBeforeValue(eb, neb);
          outFile.write(bklist.toString()+"\n");
          outFile.write(bklist.clone().toString()+"\n");
          outFile.write(bklist.listClone().toString()+"\n");

          outFile.close();
   }
   	
}